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

Define the term socks- network security, Define the term Socks- Network sec...

Define the term Socks- Network security As it is well known, each type of network security protects data at a different layer of the OSI model. Built-in at each layer lies the

State the steps to provide more computing power, State the Steps to provide...

State the Steps to provide more computing power In order to provide more computing power, the following steps may be taken: Add more processing power by addition of more

Explain about line coding, Q. Explain about line coding? Line Coding ...

Q. Explain about line coding? Line Coding  Procedure of converting binary data to a digital signal DC Components  Residual dc (direct-current) components or

Well known internet applications that uses tcp connection, a)  Which of the...

a)  Which of the well-known Internet applications uses a separate TCP connection for control?   b)  The separate control connection as in (a) above is an example of control (sig

Broadcast and multicast , Broadcast and Multicast : Broadcast and Mult...

Broadcast and Multicast : Broadcast and Multicast :In the broadcast interconnection network, at one time one node transfer the data and all other nodes get that data.  Broadca

Define rs232 interface, Q. Define RS232 Interface? - Indicates the inte...

Q. Define RS232 Interface? - Indicates the interface between DTE and DCE: V.28 mechanical as well as electrical characteristics V.24: functional as well as procedur

Determine the definition of hdlc, Determine the definition of HDLC HDLC...

Determine the definition of HDLC HDLC has only one address field. In a LAN, any station may transmit to any other station. The receiving station needs to see its own address in

Synchronous tdm and statistical tdm, Difference between synchronous tdm and...

Difference between synchronous tdm and statistical tdm

Quality of service, Networks are more frequently being prepared to allow sp...

Networks are more frequently being prepared to allow specification of the quality of service needed by users. For example: - a typical voice telephone call may give a QoS para

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