Shortest path tree and minimum-spanning tree, Computer Networking

We studied Dijkstra's link-state routing algorithm for computing the unicast paths that are individually the shortest paths from the source to all destinations. The union of these paths might be thought of as forming a shortest path tree. If each links has an associated cost and the cost of a tree is the sum of the link costs, then a spanning tree whose cost is the minimum of all of the spanning trees is called a minimum spanning tree. Both shortest path tree and minimum-spanning tree can be used for broadcast routing. By constructing a counterexample, show that the least-cost path tree is not always the same as a minimum spanning tree.

 

 

Posted Date: 3/20/2013 5:52:35 AM | Location : United States







Related Discussions:- Shortest path tree and minimum-spanning tree, Assignment Help, Ask Question on Shortest path tree and minimum-spanning tree, Get Answer, Expert's Help, Shortest path tree and minimum-spanning tree Discussions

Write discussion on Shortest path tree and minimum-spanning tree
Your posts are moderated
Related Questions

The are various limitations of employing Wireless LAN technology in any multistory building in middle of Melbourne or any other big city are: • Range: The main problem of Wire


Q. What are the benefits of layered network? Ans: Basic benefits of layered network are given below: -  Complex systems will be broken down into understandable subsystems.

Store-and-forward switch  The layer 2 switch accepts a frame on an input line, buffers it briefly, and then routes it to the appropriate output line. Cut-through switch

What are the responsibilities of Application Layer? The Application Layer enables the user, whether human or software, to access the network. It gives user interfaces and suppo

SONET STS SONET defines a hierarchy of signalling levels called as STSs (Synchronous Transport Signals). Every STS level supports a certain data rate specified in megabits p


Discuss about LAN topologies LAN topologies:   Network topology is a physical schematic that demonstrates interconnection of the many users. There are four fundamental topolog

What is Beaconing? The process that permits a network to self-repair networks problems. The stations on the network notify the other stations on the ring when they are not rece