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

What do you understand by osi, Q. What do you understand by OSI? Ans: T...

Q. What do you understand by OSI? Ans: The Open System Interconnection (OSI) reference model illustrates how information from a software application in one computer goes throug

Domains and sub domains, Hosts are generally, individual machines at a spec...

Hosts are generally, individual machines at a specific location. Normally Resources of host machine are shared and can be used by any user on Internet. Hosts & local networks are g

Create a wireless can, You are the network administrator for the City of Jo...

You are the network administrator for the City of Joshua Texas. The city government offices are located in five buildings separated by a State Highway controlled by the State of Te

Advantages and disadvantages of public and private network, The disadvantag...

The disadvantages and advantages of Private and Public networks are shown in the table below:

Layer, what is end to end and host to host?

what is end to end and host to host?

What is full-duplex ethernet, Full-Duplex Ethernet 10Base5 as well ...

Full-Duplex Ethernet 10Base5 as well as 10Base2 are half-duplex Full-duplex raises capacity of each domain No require for CSMA/CD

Three main functions at layer three of the osi model, Identify the 3 major ...

Identify the 3 major functions at layer 3 of the OSI model Ans) Layer three explains the path, forwards the packet and executes software / logical addressing.

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