Permutation representation through matrix, Computer Networking

Assignment Help:

Q. Permutation representation through Matrix?

949_Permutation representation through Matrix.png

2417_Permutation representation through Matrix1.png

Figure: Clos Network

The functioning of this above permutation is displayed in Figure. This permutation is able to be represented by subsequent matrix too,

700_Permutation representation through Matrix2.png

Figure: Permutation representation through Matrix

The upper input of all first stage switches will be connected with respective inputs of 1st middle stage switch and lower input of every first stage switches will be connected with respective inputs of 2nd switch. Likewise, all outputs of 1st switch of middle stage will be connected as upper input of switches at third stage. In Benz network to reduce the complexity the middle stage switches can recursively be broken into N/4 × N/4 (then N/8 × M/8), till switch size becomes 2×2.

The connection in a 2×2 switch will either be straight, exchange, lower broadcast or upper broadcast as shown in the below Figure.

2114_Permutation representation through Matrix3.png

The 8×8 Benz network with all switches replaced by a 2×2 is shown in below Figure:

1134_Permutation representation through Matrix4.png

Figure: Benz Network

1427_Permutation representation through Matrix5.png

The Bens network connection for permutation

would be in this manner:-

1901_Permutation representation through Matrix6.png

Figure: 8X8 BENZ NETWORK OF 4 STAGES

The permutation for P = 480_Permutation representation through Matrix7.png  would be following manner:

94_Permutation representation through Matrix8.png

Figure: Line number for n


Related Discussions:- Permutation representation through matrix

Compare Intranet with Internet and LAN, Intranet vs Internet vs LAN It...

Intranet vs Internet vs LAN It is certainly possible that both Intranets and the Internet can coexist. As spelt theoretically, the entire Intranet could be located at a remote

Dijkstra algorithms - network layer and routing , Dijkstra Algorithms T...

Dijkstra Algorithms To calculate its  routing  table  each router applies an algorithm  called  the dijkstra algorithm to its  state database. The dijkstra algorithm  calculate

Path overhead - sonet sdh , Path  Overhead It is part  of SPE  and con...

Path  Overhead It is part  of SPE  and contain followings  information: Performance monitor of synchronous transport , signal , path , track ,parity ,checks,  and path  status.

Clock-driven scheme , Assume that the clock-driven scheme for generating st...

Assume that the clock-driven scheme for generating starting sequence numbers is used with a 16-bit wide clock counter (that is, sequence numbers range from 0 to 2^16).  The clock t

What is meant by symmentric multiprocessing (smp), It treats all processors...

It treats all processors as equivalent. Any processor can do the work of any other processor. Applications are separated into threads that can run simultaneously on any available p

Point to point architecture - application layer, Point to Point Architectur...

Point to Point Architecture The term  peer means equal which can  be informally  interpreted as a process with  capability similar to the other processes with process communic

Explain about traffic shaping, Q. Explain about Traffic shaping ? Traf...

Q. Explain about Traffic shaping ? Traffic shaping -Method to control the amount and the rate of the traffic sent to the network.? Leaky bucket Token bucket -

Disk encryption and block cipher, Suppose AES (or any block cipher) is used...

Suppose AES (or any block cipher) is used to encrypt data. Which mode of encryption covered in class is best suited for each of the following two scenarios and why? If more than on

Reliable data transfer over a perfectly reliable channel r, Reliable  dat...

Reliable  data transfer  over a perfectly reliable channel rdt 1.0 First  all consider  the simplest  care in  which  the underlying  channel  perfectly reliable.  The protoco

Distance-vector routing, Local information is immediate hop routing table a...

Local information is immediate hop routing table and distance from every switch. The switches regularly broadcast topology information i.e. distance, destination. Other switches mo

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd