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
Fixed version of rdt 2.0 rdt 2.1 The  rdt 2.1 sender and receiver  FSM each now  have  twice  as many  states  as before. This is because  the protocols  state must  now refle

Q. Show the Congestion control in TCP? Congestion control in TCP TCP assumes that the cause of lost segment is due to congestion in the network Retransmission of

WAN interface card(WIC) slots Two fixed WIC slots are present in  2600 series router except 2691. It has contained 3 WIC slots. Network Module Expansion Slot( NM) slot

CONNECTION-ORIENTED: Accounting is simpler. Application can learn of network causes immediately. CONNECTIONLESS: It has fewer load. It is easier to cre

What are Diagrams and Trigrams? The most ordinary two letter combinations are known as diagrams. e.g. th, in, er, re and an. The most common three letter combinations are known

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

Layered Architecture The best  way to  understand  any complex system is to break  it into  pieces  and then analyze what they  do and  how they interact. The most logical app

Question 1: (a) In networking, there are different possible topologies. Explain the Linear bus, Ring and Star topology along with their advantages and disadvantages. (b) W

Computer Networks 1. Differentiate WAN and LAN. 2. Describe the TCP/IP Reference Model with diagram. 3. Explain Circuit switching and message switching. 4. List the fu

Network Layer The  internet  network  layer is  responsible  for moving  network  layer  packets  known data grams  from one host to another. The internet transport  layer pro