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
Token Ring Implementation Sequence of 150-ohm shielded twisted-pairs sections Output port on every station connected to input port on the next Frame is passed to


Mesh : This is two dimensional networks.  In this all processing elements are organised in a two dimensional grid. The processor in the row i and column j are indicated by PE i .

Q. Difficulties in Internetwork Communication? - Data arrive at interface f1 of s1 - How does s1 know that they must be sent out from interface f3? - There is no provisio

A stored procedure is a named collection of SQL statements and procedural logic that is compiled, verified and kept in a server database. It is typically treated like any other dat

Why Does metric translation takes place in redistributing routes?

What is the suggestion of increasing and decreasing subnet Bits?

What is piggybacked ACK The protocol will be incorrect. Suppose that 3-bit sequence numbers we are using. Consider following situation: A just send frame 7. B gets frame

Q. Show Infrared Applications? - Wide bandwidth accessible for data transmission - Communication between mice, PCs, keyboards, and printers Media selection - Every

What is meant by Symmentric Multiprocessing (SMP)? It treats all processors as equal. Any processor can do the work of any other processor. Applications are divided into thread