Interconnection Networks

INTERCONNECTION
NETWORKS
Interconnection networks form the switching fabric part of any switch.

The capabilities and characteristics of the interconnection network have a
direct influence on the resulting performance of the switch.
c Dr. F. Gebali, 2003
Classification of Networks
Interconnection networks can be broadly classified as
1. Time division where a single bus of channel is shared among the
users.
2. Space division where multiple links or channels are shared among the
users.
Time Division Networks

Frame n
1
Frame n+1
1
5
Time
(a)
Frame n
3
Frame n+1
4
4
Time
(b)
Time division switching. (a) Static assignment. (b) Random assignment.
Modeling of Random Assignment Protocol

Assume is the probability that a packet arrives and that we have users
in the system. The probability that requests arrive at a time slot is given
by

The throughput of the random assignment protocol is defined as

The sum in the above equation can be estimated as

packets/time step

For light loads
For very large number of users

, or for very heavy traffic
we get
since there is a packet to transmit at each time step.

, the throughput approaches
At low traffic, the throughput linearly increases with the number of users
and with their level of activity.


is defined as the average number of packets that

The input traffic
arrive at the input per time step

The packet acceptance probability of the random assignment protocol is

defined as
10

, we get
11
For very large number of users

For light loads

being transmitted.
and an arriving packet is almost assured of
12

, we get
For heavy loads
This is the lowest value of the packet acceptance probability or the

network efficiency.
13
The delay of the network is defined as the average time a packet

experiences before it succeeds in accessing the medium.
14

For light traffic we get
which indicates that the arriving packet is accepted immediately on the

first try.
15
For heavy traffic we get
which indicates that the packet has to try on the average

finally going through.
16
times before
(solid line)
(dotted line).
1
Acceptance probability
Throughput
0.8
0.6
0.4
0.2
0
0
0.5
Normalized input traffic
0.5
15
10
Delay

0
0
17
0.8
0.6
0.4
0.2
0
0
0.5
Space-division switching
Space-division switching is the method of choice to implement
high-performance switches since they provide high capacity and low
access time delay.
Space-division switching can be broadly classified as
crossbar networks
multistage interconnection networks (MIN)
18
crossbar network consists of inputs and

An
connect any input to any free output without blocking.
19
Crossbar Network
outputs. It can
Crossbar Network
1
Inputs
2
3
4
5
6
3
4
Outputs
crossbar interconnection network.

20
Crossbar Network
connected in a grid

The network consists of an array of crosspoints

fashion.
21
lies at the intersection of row with column . Each

operates in one of two configurations.
Crossbar Network
T-configuration
X-configuration
States of the crosspoint
in a crossbar network.
22
Crossbar Network Issues

There are several considerations when designing a crossbar network.
1. Contention
2. Arbitration
3. Data broadcast
23
Analysis of Crossbar Network
The analysis of crossbar switch is built on the analysis of random access

TDMA.
In fact, our crossbar can be considered as a collection of

viz. the columns of the crossbar network.
All
columns operate in parallel.
24
shared media
Assume is the packet arrival probability at an input port of an

crossbar switch.
Let us study the activity of a certain output port.

We call this the tagged output.
The probability that an arriving packet is destined to the tagged output is
25
26
The probability that requests arrive at a time slot addressed to the tagged
output is given by

that is destined for the tagged output per time
27

The input traffic

slot is given by
packets/time step

The throughput is equal to the output traffic of the tagged output
The second term on the R.H.S. is simply the probability that no packets
are destined to the tagged output port.
28


we get
In the limit for large networks
packets/time step
, we get
which indicates that almost
For very light loads
all the arriving packets make it through the switch due to the light loading.
29

occurs at very heavy traffic
The maximum throughput
packets/time step
Thus the crossbar network is characterized by very high throughput even

at the highest load and for large networks.
30

we get

For light traffic

efficiency.

The packet acceptance probability is given by
which indicates very high
31

In the limit for large networks we get
32
occurs at very heavy

The minimum acceptance probability

traffic

33

tries is given by the

The probability that the packet succeeds after

geometric distribution

34

The average delay time is

time steps

, we get
which indicates that arriving
For light traffic
and the
packets get through on their first attempt. For heavy traffic
on the average.
maximum number of attempts becomes
35
(solid line)
(dotted line)
1
Throughput
0.8
0.6
0.4
0.2
0
0
0.5
Input traffic
0.5
Input traffic
1
0.8
Delay

Performance
0.6
0.4
0.2
0
0
36
0.8
0.6
0.4
0.2
0
0
0.5
Input traffic
Multistage Interconnection Networks
Switching
Element (SE)
Stage: 0
MIN with 3 stages and 4 switches per stage.

37
Outputs
Inputs
Connection
Links
3
4
5
6
7
Stage
For an
network, the number of stages is
the number of SEs in each stage is
.
38
where
Inputs
Outputs
Generalized-Cube Network (GCN)
and


at stage and position is connected to

is is given by
Switching element
such that

straight connection
row label
Thus when
and
. Note that the
bits for its representation.
where
requires only
cube connection
, the switch row label is composed only of two bits.
39
Cube Function

of the binary number

40

complements the th bit

The cube function
leaving all other bits intact.
is connected to row
such
At the last stage, output stage, switch

that is given by

cube connection
Thus when
. Note that the output row label requires only

where
for its representation.
, the switch row label is composed of three bits.
41

straight connection
The straight connection for

each input
The cube connection for each

input
Straight and cube connections for each input of an SE in a GCN network.
42
Routing Algorithm for GCN Network

The routing vector is used to determine the path of the packet through
the network.

is obtained as follows:
where the -bit routing vector carries the information about the desired
path.
43
straight connection
Bit of that vector specifies the type of connection of the SE at stage
cube connection
44

and the routing vector will

If an incoming packet arrives at row 2 (binary

), then we have
6 (binary
45
GCN network
For an
have three bits.
) and is destined to row
Bit value
Connection type
Bit scanned

Stage
straight
straight
cube
SE settings for path in GCN network from input 2 to output 6.
46

0
1
3
4
5
6
7
Stage
Outputs
Inputs
Path chosen in the GCN network to route a packet from input at row 2 to
output at row 6 based on binary bit pattern of routing vector .
47
48
as the probability that a

as the probability that

SE at stage and define

Consider a
packet appears at one of its two inputs and
a packet appears at one of the two outputs.
Analysis of GCN Network

we can adapt the crossbar

For any SE at the input stage

throughput given by
Now we know the throughput at the output of all SEs at stage 0.
49

for

For the SEs at the other stages we have the recursive expression
50

51
We can write the traffic at the input of the SE at the first stage

as

The output traffic at the tagged output of the network is
52

The throughput of the GCN network is given by
53
The packet acceptance probability of the GCN network is given by
54




55


56

Performance of GCN Network

for the GCN

network (solid line) 1
the similar-sized 0.8
crossbar network 0.6
0.4
(dotted line).
Throughput
0.2
0
0
0.5
Input traffic
0.5
Input traffic
Delay
1.5
1
0.5
0
0
57
0.8
0.6
0.4
0.2
0
0
0.5
Input traffic
An
Stage:
banyan network.
58
Outputs
Inputs
The Banyan Network

The Banyan Network
at stage and row position , is connected to

is is given by
Switching element
such that
cube connection

straight connection

. Thus, at stage 1 we see that

is connected to
where
, the straight connection, and switch
, the
switches
connection.
59
The Banyan Network
The straight connection for

each input
The cube connection for each

input
The straight and cube connections for each input of an SE in a GCN

network.
60
Routing Algorithm for Banyan Network

The routing algorithm for the banyan network is identical to that of the
GCN network.
61
Stage:
Outputs
Inputs
Routing Algorithm for Banyan Network
Path chosen in the banyan network to route a packet from input at row 2
to output at row 6 based on binary bit pattern of routing vector .
62
Analysis of Banyan Network

Because we have 1-to-2 selectors at stage 0, the packet arrival

probabilities at the input and the outputs of each selector are given by
63

the throughput is given by

where

For the SEs at the internal stages
64

At the output stage

we have 2-to-1 concentrators.
Depending on the design, an output concentrator could accept one packet

only per time step.
In other designs the output concentrator could accept two packets coming
on the two input links at the same time step.
65

66

For the output concentrator that accepts only one packet per time step, the
packet arrival and departure probabilities at the output are given by

67

For the output concentrator that accepts all packets arriving at its two
inputs, the packet arrival and departure probabilities are given by
The traffic at the input of the banyan network as
68

69

The throughput of the banyan network is given by
70
The packet acceptance probability for the banyan network is given by
71




72


73

Performance of Banyan Network

for the banyan

network (solid line)
The output concentrator
accepts only one packet.
1
Throughput
0.8
0.6
0.4
0.2
crossbar network
(dotted line).
0
0
0.5
Input traffic
0.5
Input traffic
Delay
0.8
0.6
0.4
0.2
0
0
74
0.8
0.6
0.4
0.2
0
0
0.5
Input traffic
Augmented Data Manipulator Network (ADMN)
Inputs
b f
c
b
f
3
An augmented data manipulator network (ADMN) for

.
75
Stage:
Outputs
and

is connected to
such that
up connection

Switching element
given by

Augmented Data Manipulator Network (ADMN)

where
76

straight connection
down connection
is
Routing Algorithms for ADMN Network

We discuss here three routing algorithms for the ADMN network:
1. Using decimal representation for routing vector
2. Using 2s compliment representation for routing vector
3. Using RSD representation for routing vector
77
First ADMN Routing Algorithm
where
To establish a path from a source address at an input port location to a

destination address at an output port location , we initialize the routing
vector as
is the routing vector at the input of the SE at stage 0.
78
A packet that has been routed as far as stage will have a routing vector
.
79

is updated

Upon exiting stage , the routing vector

Our objective is to reduce
where
to zero.
80

determined, the packet will move to row

where
is given by

With the values of and

at stage
location
81

As an example, assume a packet arrives at input port 6 and is destined to
output port 1.
82
In that case we have
NA
+1
+1
NA
-5
-1
-1
-1
-1

Output routing vector

Input routing vector

Stage
Exit row location of packet

Entry row location of packet
83
Inputs
b f
c
b
Stage:
Outputs
f
3
Path chosen in the ADMN network to route a packet from input at row 6 to output
at row 1 based on decimal value of routing vector .
84
Finding the Alternative Route
mod

To find an alternative route for the incoming packet, we calculate the

routing vector, as in the previous section, then we find the new routing
vector obtained from the operation
85

mod
For our case the new routing vector will be
NA
-1
-1
NA

Output routing vector

Input routing vector

Stage
mod
Exit row location of packet

Entry row location of packet
86
Inputs
b f
c
b
Stage:
Outputs
f
3
87
at row 1 based on modulo operation on routing vector
.
Second ADMN Routing Algorithm

where is represented in
We calculate as
-bit 2s complement notation.
88
An SE at stage 1 scans the sign bit and bit

scans the sign bit and bit .
at stage
Therefore, an SE at stage 0 scans the sign bit and bit
A switching element at stage scans two bits of the routing vector: the
sign bit (which is bit ) and bit
.
.
, and so on. Finally an SE

SE settings for path establishment in ADMN network based on 2s
complement number format.
Sign bit value
Bit value
Connection type
Straight
Up
Straight
Down
89

and
. In that case is given as

90
-bit 2s complement notation will be
The routing vector in
As an example, assume

down
down
NA
straight
Row location
SE connection

NA
Bit scanned

Stage
SE settings for path in ADMN network from input

to output
based on the 2s complement representation of the routing vector . The
.
sign bit for routing vector is
91
Inputs
b
Stage:
b f
Outputs
f
3
Path chosen in the ADMN network to route a packet from input at row 7
to output at row 2 based on 2s complement representation of routing
vector.
92

To find an alternative route for the incoming packet, we calculate the
routing vector, as in the previous section, then we find the 2s complement
of the routing vector.
93

For our case the original routing vector is

94
The 2s complement of this vector is

NA
straight
up
NA
up
Row location
SE connection

Bit scanned

Stage
SE settings for path in ADMN network from input

to output
based on the 2s complement representation of the routing vector . The
.
sign bit for routing vector is
95
Inputs
b
Stage:
b f
Outputs
f
3
at row 2 based on of routing vector .
96
Analysis of ADMN Network

Because we have 1-to-3 selectors at stage 0, the packet arrival and

departure probabilities at each selector are given by
97

we have

98


At the output stage

we have 3-to-1 concentrators.

For an ADMN network whose output concentrator accepts packets

, we can write the arrival probability at the output as
99

The departure probability is

100

where
is the maximum number of packets that could be
is the probability that
accepted at the output in one time step and
packets arrived
The traffic at the input of the ADMN network as
101

102

The throughput of the ADMN network is given by
103
The packet acceptance probability for the ADMN network is given by
104
The delay of the ADMN network is defined as the average number of

attempts to access the desired output.



105


106

Performance of ADMN
Network
for the ADMN

network (solid line).
The output concentrator
accepts only one packet.
crossbar network
(dotted line).
1
Throughput
0.8
0.6
0.4
0.2
0
0
0.5
Input traffic
0.5
Input traffic
Delay
0.8
0.6
0.4
0.2
0
0
107
0.8
0.6
0.4
0.2
0
0
0.5
Input traffic
An improved logical neighborhood network (ILN) for

.
108
Stage:
Outputs
Inputs
Improved Logical Neighborhood (ILN)
and
For the
The ILN network provides

output.
alternate paths between any input and any
case we have six alternate paths.
As such the network is very fault tolerant and the blocking probability is
much smaller than other MIN networks.
109

such that
is given by
is connected to


0-cube connection

where
2-cube connection

1-cube connection
straight connection
110

SE(i,j)
Co connection
C1 connection
C2 connection
S (straight) connection

Inputs
Each output of an ILN switching element

function on .
111
performs a different
Routing Algorithm for ILN Network

The routing vector is given by
where the routing vector carries the information about the desired path.
The path selected corrects the routing vector such that all its bits are
zeros to indicate that the packet has reached the destination row address.
112

is able to correct a 1 bit located at any position in .
Each
is also able to destroy an already-existing 0 in by

In addition, any
changing it to a 1.
This action might be necessary in order to select an alternative route in
case of contention.
113
Possible SE outputs based on the routing vector .

Binary value of
x

114
x
x
Outputs
Inputs
Stage:
Paths chosen in the ILN network to route a packet from input at row 6 to
output at row 0.
115
Stage:
Outputs
Inputs
All possible paths chosen in the ILN network to route a packet from input
at row 6 to output at row 0 based on routing vector .
116
Analysis of ILN Network

selectors at stage 0, the packet arrival and

Because we have 1-todeparture probabilities at the input and the outputs of each selector are
given by
117

we have

118
-to-1 concentrators.

we have

At the output stage
119

packets

For an ILN network whose output concentrator accepts

, we have

120

is maximum number of packets accepted at the output in

is probability that packets arrived
one time step and
The traffic at the input of the banyan network as
121

the output traffic at the tagged output of the network is
122

The throughput of the ILN network is given by
123
The packet acceptance probability for the ADMN network is given by
124




125


126

Performance of ILN Network

for the ILN

network (solid line)
and the similar-sized
crossbar network
(dotted line).
1
Throughput
0.8
0.6
0.4
0.2
0
0
0.5
Input traffic
0.5
Input traffic
0.8
Delay
0.6
0.4
0.2
0
0
127
0.8
0.6
0.4
0.2
0
0
0.5
Input traffic

Interconnection Networks

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Interconnection Networks

Uploaded by

Copyright:

Available Formats

INTERCONNECTION

Interconnection networks form the switching fabric part of any switch.

c Dr. F. Gebali, 2003

c Dr. F. Gebali, 2003

Time Division Networks

Time division switching. (a) Static assignment. (b) Random assignment.

c Dr. F. Gebali, 2003

Modeling of Random Assignment Protocol

c Dr. F. Gebali, 2003

Modeling of Random Assignment Protocol

The throughput of the random assignment protocol is defined as

c Dr. F. Gebali, 2003

Modeling of Random Assignment Protocol

The sum in the above equation can be estimated as

c Dr. F. Gebali, 2003

For light loads

For very large number of users

Modeling of Random Assignment Protocol

, the throughput approaches

c Dr. F. Gebali, 2003

Modeling of Random Assignment Protocol

is defined as the average number of packets that

c Dr. F. Gebali, 2003

Modeling of Random Assignment Protocol

The packet acceptance probability of the random assignment protocol is

c Dr. F. Gebali, 2003

Modeling of Random Assignment Protocol

c Dr. F. Gebali, 2003

For very large number of users

For light loads

Modeling of Random Assignment Protocol

and an arriving packet is almost assured of

c Dr. F. Gebali, 2003

For heavy loads

Modeling of Random Assignment Protocol

This is the lowest value of the packet acceptance probability or the

c Dr. F. Gebali, 2003

Modeling of Random Assignment Protocol

The delay of the network is defined as the average time a packet

c Dr. F. Gebali, 2003

Modeling of Random Assignment Protocol

For light traffic we get

which indicates that the arriving packet is accepted immediately on the

c Dr. F. Gebali, 2003

Modeling of Random Assignment Protocol

For heavy traffic we get

which indicates that the packet has to try on the average

c Dr. F. Gebali, 2003

Modeling of Random Assignment Protocol

c Dr. F. Gebali, 2003

c Dr. F. Gebali, 2003

crossbar network consists of inputs and

c Dr. F. Gebali, 2003

crossbar interconnection network.

The network consists of an array of crosspoints

c Dr. F. Gebali, 2003

lies at the intersection of row with column . Each

c Dr. F. Gebali, 2003

Crossbar Network Issues

c Dr. F. Gebali, 2003

Analysis of Crossbar Network

The analysis of crossbar switch is built on the analysis of random access

In fact, our crossbar can be considered as a collection of

columns operate in parallel.