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

Network Topology, What are the different types of network topologies

What are the different types of network topologies

Networking concepts and applications, iLab 2: Office Network Expansion ...

iLab 2: Office Network Expansion Connect to the iLab here. Submit your assignment to the Dropbox located on the silver tab at the top of this page. (See "Due Da

Dynamic process groups in parallel virtual machine , Dynamic Process Groups...

Dynamic Process Groups To generate and manage dynamic groups, a separate library libgpvm3.a must be connected with the user programs that make use of any of the set functions.

Distinguish between udp and tcp, Question: (a) Distinguish between UDP ...

Question: (a) Distinguish between UDP and TCP. (b) You have been asked to design and implement a chat application for a university. Which protocol could you used TCP or UDP

What are the two broad class classifications, What are the two broad class ...

What are the two broad class classifications under which Networks can be divided? All computer networks fit in one of the two dimensions namely: a)      Transmission Technol

Illustrate stop-and-wait automatic repeat request, Q. Illustrate Stop-and-W...

Q. Illustrate Stop-and-Wait Automatic Repeat request? - Simplest flow as well as error control mechanism - The sending device keeps a duplicate copy of the last frame transm

Time out - transport layer, Time  out Timers  are used to protect  aga...

Time  out Timers  are used to protect  against  lost packet. Each  packet  must have its own logical  timers since  only  a single  packet  will be retransmitted  after timeou

Network topology, identify different network topologies.

identify different network topologies.

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

Delivering message through lan, Delivering message through LAN: We hav...

Delivering message through LAN: We have to devise method for delivering message through LAN phase to single, specific destination device. Sending device uses a hardware addres

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