Transcript Coree EMS - Computer Engineering

Chapter 5
Banyan-Based Switches
7/7/2015
H. Jonathan Chao
Page 1
Four Different Banyan Networks
7/7/2015
H. Jonathan Chao
Page 2
Four Different Banyan Networks




(a) Shuffle-Exchange (Omega) Network
(b) Reverse Shuffle-Exchange Network
(c) Banyan Network
(d) Baseline Network
We can see that (a) and (b) are isomorphic by
interchanging two shaded nodes in the figures
7/7/2015
H. Jonathan Chao
Page 3
An 8x8 Banyan Network
7/7/2015
H. Jonathan Chao
Page 4
Internal Blocking in an 8x8 Banyan Network
7/7/2015
H. Jonathan Chao
Page 5
A Nonblocking Banyan Network with Sorted Inputs
Conditions for Internal nonblocking for the bayan network:
1. There is no idle input between any two active inputs.
2. The output address of the cells are in either ascending or descending order.
7/7/2015
H. Jonathan Chao
Page 6
Basic Structure of A Batcher-Sorting Network
7/7/2015
H. Jonathan Chao
Page 7
A 64x64 Batcher-Banyan Switch Network
7/7/2015
H. Jonathan Chao
Page 8
The Three-Phase Algorithm
7/7/2015
H. Jonathan Chao
Page 9
A Batcher-Banyan Switch with Ring Reservation
7/7/2015
H. Jonathan Chao
Page 10
The Implementation of the Ring Reservation Scheme
7/7/2015
H. Jonathan Chao
Page 11
Block Diagram of the Sunshine Switch
7/7/2015
H. Jonathan Chao
Page 12
The Header Format in the Sunshine Switch
7/7/2015
H. Jonathan Chao
Page 13
Tandem Banyan Switching Fabric
7/7/2015
H. Jonathan Chao
Page 14
An 8x8 Shuffle-Exchange Network with 3 Stages
7/7/2015
H. Jonathan Chao
Page 15
(a) State-Transition Diagram of A Cell in the Shuffle-Exchange Network;
(b) One-Step Penalty State Transition Diagram
7/7/2015
H. Jonathan Chao
Page 16
An 8x8 Unshuffle-Exchange Network with 5 Stages
7/7/2015
H. Jonathan Chao
Page 17
A Deflection Error in SN is Corrected with USN
7/7/2015
H. Jonathan Chao
Page 18
An 8x8 Dual-Shuffle Exchange Network
7/7/2015
H. Jonathan Chao
Page 19
The Error-Correcting Routing Algorithm
7/7/2015
H. Jonathan Chao
Page 20
An Example of Error-Correcting Routing in DSN
7/7/2015
H. Jonathan Chao
Page 21
Finite-State Machine Representation of the ErrorCorrecting Routing Algorithm When ck = 1
7/7/2015
H. Jonathan Chao
Page 22
A Multicast Cell Switch Consists of A Copy Network and A
Point-to-Point Switch
7/7/2015
H. Jonathan Chao
Page 23
An Input-Output Tree Generated by Generalized
Self-Routing Algorithm
7/7/2015
H. Jonathan Chao
Page 24
The Boolean Interval Splitting Algorithm Generates the Tree
While Replicating A Cell According to the Address Intervals
7/7/2015
H. Jonathan Chao
Page 25
The Switch Node Logic at Stage k of a
Broadcast Banyan Network
7/7/2015
H. Jonathan Chao
Page 26
An Example to Demonstrate the Nonblocking Condition of
Broadcast Banyan Network
Nonblocking conditions:
- Concentration at the inputs
- Monotonicity at the outputs
7/7/2015
H. Jonathan Chao
Page 27
Header Translations in the Copy Network
BCN: broadcast channel number
CN: copy number
7/7/2015
H. Jonathan Chao
IR: index reference
CI: copy index = output address - IR
Page 28
A Running Adder Network and Dummy Address
Encoders
7/7/2015
H. Jonathan Chao
Page 29
An Input Concentrator Consists of A Running
Adder Network and A Reverse Banyan Network
7/7/2015
H. Jonathan Chao
Page 30
Computation of Copy Indexes
CI: copy index = output address – Index reference (IR)
7/7/2015
H. Jonathan Chao
Page 31
Trunk Number Translation by Table Lookup
7/7/2015
H. Jonathan Chao
Page 32
An 8x8 Nonblocking Copy Network without Call-Splitting: Only
Five Instead of Eight Cell Copies are Allowed in this Time Slot
7/7/2015
H. Jonathan Chao
Page 33
A CRAN In An 8X8 Copy Network
7/7/2015
H. Jonathan Chao
Page 34
An 8x8 Cyclic Running Adder Network (CRAN)
7/7/2015
H. Jonathan Chao
Page 35
The Operation of a Node in CRAN
7/7/2015
H. Jonathan Chao
Page 36
Cyclic Monotone Address Give Rise to Cell Collisions in
Reserve Banyan Network. Port 2 and Port 6 are Idle.
7/7/2015
H. Jonathan Chao
Page 37
An Additional RAN is Used to Concentrate Active Cells. The
Starting Point is Marked by Encircling Its Copy Request
7/7/2015
H. Jonathan Chao
Page 38