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

Show concept of permutation network, Q. Show Concept Of Permutation Network...

Q. Show Concept Of Permutation Network? In permutation interconnection networks the information transfer necessitates data transfer from input set of nodes to output set of nod

Difference among the communication and transmission, Difference among the c...

Difference among the communication and transmission? Transmission is a physical movement of information and concern issues as bit polarity, synchronization, clock etc. Commu

Receive window - transport layer, Receive Window This  field  defin...

Receive Window This  field  defines the size  of the  window in bytes  that the  other party  must  maintain. Note  that the  length  of this  field 16 bits  which  means

Show the tcp/ip and osi similarities, Q. Show the TCP/IP and OSI Similariti...

Q. Show the TCP/IP and OSI Similarities? TCP/IP and OSI Similarities - Both have Layers - Both have Application Layers - Have Comparable Transport and Network Layer

Hierarchical routing strategy, i want a program of hierarchical programming...

i want a program of hierarchical programming in c language with its output. please help me .

Determine the objectives of computer security, Determine the Objectives of ...

Determine the Objectives of computer security Though computerisation helps a lot in proper organisation of experience, it also opens a Pandora's Box simultaneously. On one

Persistent and no persistent connections, Persistent and No persistent Conn...

Persistent and No persistent Connections HTTP can use  both  persistent  and non persistent connection. By defaults  uses persistent  connections. Persistent Connections

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

Features of transmission control protocol, The major features of TCP are fo...

The major features of TCP are following: Reliability : TCP ensures that any data sent by a sender arrives at the destination as it was sent. There cannot be any data loss or mo

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