Last updated March 8, 04M. Veeraraghavan1 TSI (Time Slot Interchange) Let the contents of time slots 1 through 24 be as shown on the incoming line. The.

Slides:



Advertisements
Similar presentations
Matrix.
Advertisements

Chapter 14 Switching Circuit Switching Packet Switching Message Switching WCB/McGraw-Hill  The McGraw-Hill Companies, Inc., 1998.
Lecture 4. Topics covered in last lecture Multistage Switching (Clos Network) Architecture of Clos Network Routing in Clos Network Blocking Rearranging.
1 IEX8175 RF Electronics Avo Ots telekommunikatsiooni õppetool, TTÜ raadio- ja sidetehnika inst.
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
Chapter 14 Switching Circuit Switching Packet Switching Message Switching WCB/McGraw-Hill  The McGraw-Hill Companies, Inc., 1998.
Algorithm3. (3-dim) Assumptions Points are ordered in a sequence increasingly with respect to the x coordinate. Points having the same x coordinate are.
Lecture 07 Prof. Dr. M. Junaid Mughal
Multiplying matrices An animated example. (3 x 3)x (3 x 2)= (3 x 2) These must be the same, otherwise multiplication cannot be done Is multiplication.
New AS-i Profinet Gateway AC1401 and AC1402. Date: October 2010© VNC sr/rk Main features of the Gateway  WEB server for remote configuration and diagnosis.
Combinations & Permutations. Essentials: Permutations & Combinations (So that’s how we determine the number of possible samples!) Definitions: Permutation;
1 Algorithms CSCI 235, Fall 2012 Lecture 9 Probability.
Circuit Switching and Telephone Network
Chapter 7 Section 1.  Students will write ratios and solve proportions.
1 Kyung Hee University Prof. Choong Seon HONG Switching.
ECE 466 Switching Networks. ECE 466 A communication network provides a scalable solution to connect a large number of end systems Communication Networks.
Switching Fourth Meeting. Switching Modes Circuit Switching Continuous link Exclusive Packet Switching No continuous link Data is divided into packets.
Two way tables and tree diagrams
CS 4396 Computer Networks Lab Router Architectures.
M. Veeraraghavan (originals by J. Liebeherr) 1 Need for Routing in Ethernet switched networks What do bridges do if some LANs are reachable only in multiple.
Circuit Switching Circuit switching networks,
(2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition.
Identify basic switching concepts and the operation of Cisco switches.
Keep in Your Notes!! list the first 15 perfect squares 1² = 2² = 3² =
1 Kyung Hee University Chapter 8 Switching. 2 Kyung Hee University Switching  Switching  Switches are devices capable of creating temporary connections.
by D. Fisher (2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition 1.
(2 + 1) + 4 = 2 + (1 + 4) Associative Property of Addition.
Conservation of Energy Energy and its Conservation
Structure of a switch We use switches in circuit-switched and packet- switched networks. In this section, we discuss the structures of the switches used.
Tuesday, March 19 The Network Simplex Method for Solving the Minimum Cost Flow Problem Handouts: Lecture Notes Warning: there is a lot to the network.
Activity diagrams Practice 7. Task 1  The first action in the activity is the adding the item to the order. If the order if formed (“ready”), then it.
Slide 1 Insert your own content.. Slide 2 Insert your own content.
Презентацию подготовила Хайруллина Ч.А. Муслюмовская гимназия Подготовка к части С ЕГЭ.
Chapter 14 Switching Circuit Switching Packet Switching Message Switching WCB/McGraw-Hill  The McGraw-Hill Companies, Inc., 1998.
Ethernet switches and IP routers
PW MUX PWE – 71st IETF 10 March 2008 Yaakov (J) Stein.
Section 8.3 PROBABILITY.
URL: Chapter 8 Switching Tel: (03) Ext: URL:
Properties of Real Numbers
Combinations & Permutations
تصنيف التفاعلات الكيميائية
3-stage switch; see need for k=2n-1 for it to be non-blocking
Jaringan Telekomunikasi, Sukiswo Sukiswo
Properties of Real Numbers
Arranging and Choosing
Properties of Real Numbers
Slide 1 Insert your own content.. Slide 1 Insert your own content.
Slide 1 Insert your own content.. Slide 1 Insert your own content.
Slide 1 Insert your own content.. Slide 1 Insert your own content.
Circuit Switching Packet Switching Message Switching
Combinations & Permutations
Chapter 8 Circuit Switching and Telephone Network
Chapter 8 Circuit Switching and Telephone Network
5 × 7 = × 7 = 70 9 × 7 = CONNECTIONS IN 7 × TABLE
5 × 8 = 40 4 × 8 = 32 9 × 8 = CONNECTIONS IN 8 × TABLE
4 × 6 = 24 8 × 6 = 48 7 × 6 = CONNECTIONS IN 6 × TABLE
5 × 6 = 30 2 × 6 = 12 7 × 6 = CONNECTIONS IN 6 × TABLE
Written methods [N4.1 Extension Starter]
FIELD.
10 × 8 = 80 5 × 8 = 40 6 × 8 = CONNECTIONS IN 8 × TABLE MULTIPLICATION.
3 × 12 = 36 6 × 12 = 72 7 × 12 = CONNECTIONS IN 12 × TABLE
Vectors (2).
If AD = 10, DC =6, and ED = 15, find DB.
Independence and Counting
5 × 12 = × 12 = × 12 = CONNECTIONS IN 12 × TABLE MULTIPLICATION.
Independence and Counting
Objectives Apply SSS to construct triangles and solve problems.
5 × 9 = 45 6 × 9 = 54 7 × 9 = CONNECTIONS IN 9 × TABLE
3 × 7 = 21 6 × 7 = 42 7 × 7 = CONNECTIONS IN 7 × TABLE
Presentation transcript:

last updated March 8, 04M. Veeraraghavan1 TSI (Time Slot Interchange) Let the contents of time slots 1 through 24 be as shown on the incoming line. The switch configuration requires data in slot 1 to be read into slot 24 and vice versa, and data in slot 2 to be read into slot 23 and vice versa 1224 abc 12 cda d b 23 a b c d writes in order of arrival permutes as per switch configuration and reads out

last updated March 8, 04M. Veeraraghavan2 From space switch to T-S-T switch The intermediate stage switch is a single switch of size: n n12 n12 k12 k12 k12 k12 k12 k12 n12 n12 n12 TSI 1 TSI 2 TSI N/n TSI 2 TSI 1 The intermediate stage switch is reprogrammed for each of the k time slots. Replace each first-stage and every last-stage switch by a TSI. Replace multiple intermediate-stage switch with a single time-shared space switch.

last updated March 8, 04M. Veeraraghavan3 B VIEW WITH ANIMATION AC D Program the two sets of TSI stages and the intermediate space stage accordingly A->C, B->A, C->D, D->B The time to send three slots between 1 st stage and 2 nd stage is the same as the time to receive two slots into the 1 st stage. D1 could have been sent in the first slot on L2 because it could have been sent out on L4 in time slot 1 and then switched around by TSI 4 to the appropriate slot going to D 2 x 3 (TSI 1) B1A1 Connected to A and B B1A1 L1 2 x 3 (TSI 2) D1C1 Connected to C and D D1C1 L2 t=1 A1 L3 L4 3 x 2 (TSI 3) 3 x 2 (TSI 4) Connected to C and D Connected to A and B A1 B1 C1 B1 t=2 D1 t=3

last updated March 8, 04M. Veeraraghavan4 Programming the switch Means setting the operational behavior of all the TSIs and the time-shared space switch Previous slide example: –TSI1: TS1->TS1; TS2->TS2; blank->TS3 –TSI2: blank->TS1; TS1->TS2; TS2->TS3 –TSI3: TS1->unmapped; TS2->TS1; TS3->TS2 –TSI4: TS1>TS1; TS2->TS2; TS3->unmapped –time-shared switch at time = 1, cross-over at time=2, direct at time=3, cross-over