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 bandwidth and latency, Define Bandwidth and Latency? Network per...

Define Bandwidth and Latency? Network performance is calculated in Bandwidth (throughput) and Latency (Delay). Bandwidth of a network is given by the number of bits that can be

Root dns servers - application layer , Root DNS Servers A root  server...

Root DNS Servers A root  server is a serve which  consists of the entire  hierarchy  of servers. A root  server  usually  does not  store any  information  about  domains  but

Define IEEE 802.4-token bus, IEEE 802.4-Token bus Physical line or tree...

IEEE 802.4-Token bus Physical line or tree however logical ring. Stations know "left" as well as "right" stations. One token "passed" from station to station. Only station with

Explain in brief -ring topolgy, Explain in brief -Ring Topolgy Comments 1 ...

Explain in brief -Ring Topolgy Comments 1 - A faulty connection amid two stations can cause network failure 2 - It's difficult to add a new station/device as it has to come betwe

Fundamental of network , Fundamental of Network The  concept  of netw...

Fundamental of Network The  concept  of network  is not  new. In simple  it means an interconnected set  of some  objects. For decades we are familiar with the radio,  televi

Configure the physical topology- ccna, Configure the Physical Topology ...

Configure the Physical Topology Step 1: Cable the network. Refer to the figure and table below for the essential cables. Step 2: Physically connect lab devices. C

Which applications of computer network will be categorized, Q. What are the...

Q. What are the main categories based on which applications of computer network will be categorized? Ans: The main areas under which the applications for computer network will

Give the examples of the session layer, Session layer examples  are Netbios...

Session layer examples  are Netbios Names, SQL, NFS, X Windows, and RPC.

Assignment help, Hello there i have an assignment in Data communication an...

Hello there i have an assignment in Data communication and networks. I have done most of the assignment but i am stuck in one part which is designing a network in a university cam

Configure spanning tree- ccna, Configure Spanning Tree Step 1: Ex...

Configure Spanning Tree Step 1: Examine the default configuration of 802.1D STP. On each switch, display the spanning tree table with the show spanning-tree command. R

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