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

Explain about error detection, Q. Explain about Error Detection? Data c...

Q. Explain about Error Detection? Data can be corrupted during transmission because of accidents, Storms, sudden increase in electricity and voltage / decrease in signal power

Advantage of ip sec tunnelling mode, Advantage of IP sec  Tunnelling Mode ...

Advantage of IP sec  Tunnelling Mode IP Sec  tunnelling mode  has the  following  advantages: a.Security : Ts IP sec tunnelling mode  secure somewhat but  not the best. In a

Explain fat tree interconnection network, Fat tree: It is a customized ver...

Fat tree: It is a customized version of tree network. In this network bandwidth of edge (or connecting wire between nodes) increases in the direction of root. It's a more realisti

What is domains in active directory, In Windows 2000, a domain describes bo...

In Windows 2000, a domain describes both an administrative boundary and a security boundary for a collection of objects that are relevant to a particular group of users on a networ

Explain the term data routing functions, Data Routing Functions The dat...

Data Routing Functions The data routing functions are functions that when executed set the path between source and destination. In dynamic interconnection networks there may be

Long term evolution and network requirements-ethernet , You are a network c...

You are a network consultant working for a large European networVservice provider and have been given the task of reviewing the future network requirements of the company for its f

Multicast routing protocols, Multicast Routing Protocols Multicast gr...

Multicast Routing Protocols Multicast group addresses are assigned by IANA [Internet Assigned Numbers Authority for well known services and protocols. Information is exchang

What are the fundamentals of intranet, Fundamentals of intranet Introd...

Fundamentals of intranet Introduction The history of the Intranet starts right from the days when computer networks came in. However, it could find a name and place for it

Explain in brief about router, Router Routing achieved commercially pop...

Router Routing achieved commercially popularity in the mid - 1980s - at a time when large-scale Internetworking began to change the fairly simple, homogeneous environments. Rou

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