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

Performance - application layer, Performance Running on  inexpensive  ...

Performance Running on  inexpensive  hardware oracle web cache  increase the  throughput of  website  by several  orders of magnitude. In  addition  oracle web cache  signific

What is a java package, What is a Java package and how is it used? A J...

What is a Java package and how is it used? A Java package is a naming context for classes and interfaces. A package is used to make a separate name space for groups of classes

What is project 802, What is Project 802? It is a project begins by IEE...

What is Project 802? It is a project begins by IEEE to set standards that enable intercommunication among equipment from a variety of manufacturers. It is a way for specifying

When it comes to networking what are rights, When it comes to networking, w...

When it comes to networking, what are rights? Rights refer to the authorized permission to perform exact actions on the network. Every user on the network can be assigned indiv

What are the functions of the typical server program, What are the function...

What are the functions of the typical server program? It waits for client-initiated requests. Executes many requests at the same time. Takes care of VIP clients first. Initiate

Describe the static routing process, Describe the static routing process ...

Describe the static routing process A static routing method does not adapt to changing conditions on the network but uses a fixed method developed ahead of time. With alternat

Security control procedures , a) An Introduction/Overview of Network Securi...

a) An Introduction/Overview of Network Security issues. b) A Risk Assessment  analysis- to include:             Assets                                                         T

Telecoms, What is a Multiplexor

What is a Multiplexor

What do you understand by osi, Q. What do you understand by OSI? Ans: T...

Q. What do you understand by OSI? Ans: The Open System Interconnection (OSI) reference model illustrates how information from a software application in one computer goes throug

Unix for multiprocessor system, UNIX For Multiprocessor System:- The UN...

UNIX For Multiprocessor System:- The UNIX operating system for a multiprocessor system has a number of additional features as compared to the normal UNIX operating system.  Let

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