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

Interconnection networks and sorting, As in PRAM, there was no direct commu...

As in PRAM, there was no direct communication medium among the processors, therefore another model called as interconnection networks have been designed. In the interconnection net

Explain radio wave, Explain Radio Wave. Although Radio waves are common...

Explain Radio Wave. Although Radio waves are common and well understood, we are just starting to realize their enormous potential as a networking medium. Radio waves can operat

How receiver detects error, How receiver detects error The frame is 100...

How receiver detects error The frame is 10011101. The generator is 1001. The message after appending the three zeros is 10011101000. The reminder on dividing 10011101000 by 100

Show vpns security and the internet model, Q. Show VPNs Security and the In...

Q. Show VPNs Security and the Internet Model? - VPN's Security and the Internet Model - Application layer - provide for each application protocol (other layers may be left v

Show example on check sum, Q. Show Example on Check Sum? Data: 10...

Q. Show Example on Check Sum? Data: 10101001 00111001 Computing Checksum: 10101001 00111001 --------------- Sum 11100010 Receiver Side: 10101

Determine in detail about the world wide web, Determine in detail about the...

Determine in detail about the world wide web The latest has been Web commerce that is currently making big news, and many businesses are setting up electronic shops on the Inte

What is multistation access unit, Multistation Access Unit (MAU) C...

Multistation Access Unit (MAU) Combines individual automatic switches May perhaps daisy chain to support more stations

WAN, what is a WAN

what is a WAN

Data parallel programming with parallel virtual machine, Data Parallel Prog...

Data Parallel Programming In the data parallel programming model, main focus is on performing simultaneous operations on a data set. The data set is typically prepared into a c

Use of coaxial cable, Has a central core conductor covered in an insulating...

Has a central core conductor covered in an insulating sheath encased in an outer conductor of metal foil  RG numbers indicate physical specs such as thickness and type of insula

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