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

Role of software in intranet, Role of Software in Intranet For an Intr...

Role of Software in Intranet For an Intranet to be successful, it must have strong software support. In this section, a brief description of the operating system, groupware an

Explain the power of semantic web languages, What is the Power Of Semantic ...

What is the Power Of Semantic Web Languages? Ans) The major power of Semantic Web languages is that anyone can create one, simply by publishing some RDF that defines a set of

Define directed path, QUESTION (a) Define what you understand by the fo...

QUESTION (a) Define what you understand by the following terms in Network Flows: i) UnDirected Path ii) Directed Path iii) Directed Cycle. iv) Tree In each of th

Combine subtitution and transposition, how to own cipher to encrypt and dec...

how to own cipher to encrypt and decrypt message by combine both substitution ans transposition algorithm using c program

Which type of switching is considered to be ''wire speed'', Cut-Through is ...

Cut-Through is the best mode of switching. Store and Forward reads in the whole frame, confirms the frame is valid, and then forwards the frame onto the wire. Cut-Through only chec

Show the vulnerability of the internet, Q. Show the Vulnerability of the In...

Q. Show the Vulnerability of the Internet? More vulnerable than private network. Wide inter-network connection. Easy access by mass public world-wide. Lack of build in

Ring token, what is logical ring maintenance and how does it work>?

what is logical ring maintenance and how does it work>?

Illustrate transport layer responsibilities, Q. Illustrate Transport Layer ...

Q. Illustrate Transport Layer Responsibilities ? - Process-to-process delivery of whole message - Port addressing - Segmentation and reassembly - Connection control co

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