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 the ip address representation, Q. Show the IP Address Representation? ...

Q. Show the IP Address Representation? IP Addressing IP Address Representation Binary notation - IP address is displayed as 32 bits Dotted-decimal notation -

Explain tree interconnection network, Tree interconnection network:   In tr...

Tree interconnection network:   In tree interconnection network, processors are organised in a complete binary tree pattern. Figure: Tree interconnection network

Describe circuit switching, Circuit switching is a term used in communicati...

Circuit switching is a term used in communication where the communicating nodes will be connected through a dedicated channel before any communication may take place. The methodolo

Explain about domain name system, Q. Explain about Domain Name System? ...

Q. Explain about Domain Name System? -In the past, mapping of IP addresses was static using a host file -Impossible in today's dynamic environment -Domain Name System (DN

What is vrc, What is VRC? It is the most common and least costly mechan...

What is VRC? It is the most common and least costly mechanism for Error Detection. In VRC, a parity bit is added to each data unit so that the total number of 1s becomes even f

What is the virtual channel, A logical circuit that is created by Virtual c...

A logical circuit that is created by Virtual channel links. It carries data among two endpoints in a network. The one more name for Virtual Channel is Virtual Circuit.

Cisco express forwarding and interface controllers , Cisco Express Forwardi...

Cisco Express Forwarding CEF is a new method of switching that available in IOS, its overcome the drawbacks of fast switching method In IOS packet switching, There are thre

Show the masking process, Q. Show the Masking process? Masking ...

Q. Show the Masking process? Masking Take out the address of the physical network from an IP address Used by routers inside the organization

Network, What are the main features of TCP connections? Why is it said that...

What are the main features of TCP connections? Why is it said that TCP provides full-duplex service?

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