Fat tree, Computer Networking

Assignment Help:

Fat tree

It is a modified version of the tree network. In this group the bandwidth of edge (or the connecting wire among nodes) increases towards the root. It is a more practical simulation of the normal tree where branches get thicker towards root. It is the more well-liked as compared to tree structure, as practically the more traffic arise towards the root as compared to leaves, thus if bandwidth remains the similar the root will be a bottleneck causing more late. In a tree this problem is avoided because of high bandwidth.

                                  2327_Fat tree.png


Related Discussions:- Fat tree

Ku-band earth station, Ku-BAND EARTH STATION This is most recent on-goi...

Ku-BAND EARTH STATION This is most recent on-going project under which 40 remote sites will be installed for CDMA back haul and 60 sites will be installed for GSM back haul. 4

Routing table - network layer and routing , Routing Table A routing  t...

Routing Table A routing  table has columns  for at  three types o information  the network  ID  the cost  and the  ID of the  next  router. The  network  ID is the final  desti

CCNA, What is basic purpose of Routers

What is basic purpose of Routers

Distributed systems, There are two dominant forms of building distributed s...

There are two dominant forms of building distributed systems: client-server systems, i.e. systems in which one machine acts as a server and act as clients; and peer-to-peer systems

Why you require connecting two computers for file sharing, You require conn...

You require connecting two computers for file sharing. Is it possible to do this without using a hub or router? Yes, you can connect two computers together using only one cable

Define interconnection network, Interconnection Network An interconnect...

Interconnection Network An interconnection network is designed for transferring data between two processors in a Multi-stage network. Memory bottleneck is a fundamental limitat

Distributed route computation, In distributed routing computation, every pa...

In distributed routing computation, every packet switch calculates its routing table locally and transmit messages to the neighbors. It also updates information regularly. If a pac

Bens network, Bens Network  Ben's network is a non-blocking network. ...

Bens Network  Ben's network is a non-blocking network.  It is a different  type of Clos network where initial and final stage consists of  2×2 switches (for n input  and m ou

Determine the maximum number of stations, (i)  Suppose N stations are conne...

(i)  Suppose N stations are connected to an extended Ethernet LAN, as shown below shown in Figure operating at the rate of 10 Mbps. Assume that the efficiency of each Ethernet is 8

Determine three features of igrp, GRP uses a composite metric complete up o...

GRP uses a composite metric complete up of bandwidth and delay by default, it updates each 60 Seconds and will trigger an update if the topology changes.

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