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

Maths, the equation x3-6x+9x-5=0

the equation x3-6x+9x-5=0

What is boundary level masking, Q. What is Boundary Level Masking? ...

Q. What is Boundary Level Masking? If mask numbers are either 255 or 0: Bytes in the IP address that correspond to 255 in the mask will be repeated in the subnet ma

What is meant by transparency, Transparency really means adumbrating the ne...

Transparency really means adumbrating the network and its servers from the users and even the application programmers.

Define encoder, Define Encoder? A device or program that uses predefine...

Define Encoder? A device or program that uses predefined algorithms to encode, or compress audio or video data for storage or transmission use. A circuit that is used to change

What are the trends in network security, Q. What are the trends in Network ...

Q. What are the trends in Network Security ? Trends in Network Security Improved vigilance for virus infections Continual maturation of firewall technologies

What is frequency borrowing, What is Frequency borrowing In the simples...

What is Frequency borrowing In the simplest case, frequencies are taken from adjacent cells by congested cells. The frequencies can also be assigned to cells dynamically.

Openmp in shared memory programming, OpenMP is a compiler directive based s...

OpenMP is a compiler directive based standard developed in the late 1990s jointly by a group of main computer hardware and software vendors. It is portable across a lot of popular

Internet transport service proposal, will you have this done to day? And ho...

will you have this done to day? And how long will this take?

Explain inference, What is inference? Ans) The principle of "inference"...

What is inference? Ans) The principle of "inference" is fairly a simple one: being capable to derive new data from data that you already know. In a mathematical sense, querying

Define pptp (point-to-point tunneling protocol), Can you define PPTP (Point...

Can you define PPTP (Point-to-Point Tunneling Protocol)?

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