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
Recognize the command that configures serial0 for PPP encapsulation Ans) Router(config-if)# encapsulation ppp

Determine about the proxy servers There are proxy servers that act as good firewall protection for the entire Intranet system. In some cases, firewall comes as a separate serv

Cell splitting  In practice, the distribution of traffic and topographic features is not uniform, and this shows opportunities of capacity enhance. Cells in areas of high usage

In the transaction server, the client component usually consists of GUI and the server components usually having of SQL transactions against a database. These applications are know

Q. Use of Two-Layer Switch? - Performs at the physical as well as data link layer - A bridge with many ports designed for faster performance - Allocates unique port to ea

Which type of Ethernet framing is used for TCP/IP and AppleTalk Ans)Ethernet SNAP

Distributed systems are composed of a number of physically separate machines connected by one or more communication links. Unlike parallel systems, there's no shared clock or memor

Full form of HTTPd It stands for HTTP daemon. HTTPd is the program run on a UNIX platform to establish a Web server. On other platforms, such as Microsoft Windows NT, the We

The FORALL Statement The FORALL statement allows for more common assignments to sections of an array. A FORALL statement has the general form.               FORALL ( triplet

Routing Principle The principle  criterion of  successful routing is of course correctness but it not only criterion. You might  prefer to take the most direct route ( the  one