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 is parabolic dish antenna, Q. What is Parabolic Dish Antenna? - In...

Q. What is Parabolic Dish Antenna? - Incoming signals means that the Signal bounces off of dish and is directed to focus - Outgoing signals signifies transmission is broadca

Assigment, what the domain name of 128.252.160.2000

what the domain name of 128.252.160.2000

Require class and how many different types of class exists, Why do we requi...

Why do we require class and how many different parts of class exists?

What is man, What is MAN? MAN - Metropolitan Area Networks. MAN is b...

What is MAN? MAN - Metropolitan Area Networks. MAN is bigger than a LAN and as its name implies, covers the area of a single city. MANs rarely extend beyond 100 KM and frequ

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

Key features of spontaneous networking, QUESTION a) Give a detailed exp...

QUESTION a) Give a detailed explanation of the following: Some dynamics systems can be built as variations on the client server model. b) Give one main drawback of the "Thin

What is the internal ip address, What is the internal IP address There ...

What is the internal IP address There is a separate set of IP address for a company's internal use, more popularly known as "internal IP address" or subnet IP address. This IP

Describe unbound transmission media, Describe unbound transmission media. ...

Describe unbound transmission media. Unbound transmission media are the media of transmitting data without using any cables. These are not bounded by any physical geography. Ex

Network interface hardware, NETWORK INTERFACE HARDWARE:  CPU can't ope...

NETWORK INTERFACE HARDWARE:  CPU can't operate data at network speeds. So in order to connect to the network device systems use special purpose hardware for network connection

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