Computing shortest path in a graph, Computer Networking

Assignment Help:

While calculating shortest path, first we assume graph presentation of network at every node then we use Djikstra's algorithm to calculate shortest path from every node to other one. Then extract next hop information from giving path information and add next hop information into routing tables.

WEIGHTED GRAPH

Djikstra's algorithm will add weights on edges in graph. The shortest path is then the path with minimum total weight. It could be noticed that the shortest path is not necessarily with fewest edges. For example as given in the figure below:

2244_weighted graph.png

The minimum path in the diagram from node 2 to node 6 is 2 to 3 and 3 to 6 as this way has the minimum weight so it is the shortest path.

DISTANCE MATRICS

Weights on graph nodes denote cost of traversing edge. This cost can be in time, hop or dollars counting (weight == 1). The resulting shortest path can not have fewest hops.


Related Discussions:- Computing shortest path in a graph

Show v.32 standard, Q. Show V.32 standard? - ITU-T's V.32 standard was ...

Q. Show V.32 standard? - ITU-T's V.32 standard was issued in 1991 for asynchronous and full-duplex operation at 14.4 Kbps. V.32bis - Is an extension of the V.32 technology?

What are reasons behind using layered protocols, What are reasons behind us...

What are reasons behind using layered protocols  Reasons for using layered protocols, using them leads to breaking up design problem into smaller more manageable pieces and lay

State control frame - solicit successor, Control Frame: solicit_successor ...

Control Frame: solicit_successor Periodically ask for any station to link by sending solicit_successor Token with sender's addr and successor's addr wait 2 (as in

Explain the term - carrier sense multiple access, What is use of Carrier se...

What is use of Carrier sense multiple access Carrier sense multiple access with collision detection (CSMA/CD) is a form of medium access control in which a station listens to

Concept of connection between the pc and the cable modem, Concept of connec...

Concept of connection between the PC and the cable modem Even if downstream channel works at 27 Mbps, user interface is nearly always 10-Mbps Ethernet. There is no way to get b

Name the protocol responsible for finding the mac address , a)  What does t...

a)  What does the "CD" mean in the CSMA/CD? How is it implemented in the Ethernet?   b)  Consider an Ethernet hub with 8 ports and an Ethernet switch with 8 ports. In both cases

Explain the transport layer and network layer, Question: (a) Describe ...

Question: (a) Describe briefly the difference between flow control and congestion control in relation to a connection-oriented protocol such as TCP. (b) What is the initia

What is the beaconing, An FDDI frame or Token Ring frames those points to s...

An FDDI frame or Token Ring frames those points to serious problem with the ring, like a broken cable. The beacon frame carries the address of the station thought to be down.

Troubleshooting vtp configuration -ccna, Prepare the Network Step 1: Ca...

Prepare the Network Step 1: Cable a network that is similar to the one in the topology diagram.  You can use any current switch in your lab as long as it has the needed inte

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