Hardware difficulty of benz network, Computer Networking

Assignment Help:

Hardware difficulty of Benz Network:-

Benz network uses smaller switches and it gives excellent connectivity.  To find hardware difficulty of Benz network let us presume that

                                                     N = 2n     =>  n = log2 N

Number of phases in N input Benz network = 2n-1 = 2  log 2  N 

Number of 2Χ2 switches in each phase = N/2.

Overall number of cells in network = (N/2) (2 log2 N-1) = N log2  N- N / 2

Number of switches in different networks for a variety of inputs is given in the following table:

2          4          9          4

8          64        69        80

64        4096    1536    1408

256      65536  12888  7680

 

Therefore, we can examine from this above table that for higher inputs the Benz Network is the excellent as it has the smallest number of switches.

Shuffle Exchange Network:- These networks are based on the exchange operations and shuffle discussed previous.

 


Related Discussions:- Hardware difficulty of benz network

Advantages - point to point , Advantages There are  times when  using ...

Advantages There are  times when  using  packet filters makes  sense. If the  connections require high  throughput  or the protocols  has proprietary technology that makes  it

Whitney houston, contribution to afican American history

contribution to afican American history

., Given a five station token bus LAN with station addresses of 3000, 500, ...

Given a five station token bus LAN with station addresses of 3000, 500, 100, 70, and 50. Stations with addresses of 5000, 4000, 400, 90, and 60 are waiting to enter the ring. Assum

Case study, #questi Scenario: Your Case Study must be based on the informat...

#questi Scenario: Your Case Study must be based on the information provided. There will be no additional information. This must be submitted in a .doc, or .pdf format. If you sen

Wifi and 3g, what is similarity of wifi and 3g

what is similarity of wifi and 3g

use dijkstras shortest-path algorithm compute short path, Consider the fol...

Consider the following network example. With the indicated link costs along each link in the figure, use Dijkstra's shortest-path algorithm to compute the shortest path from x to a

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