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

Describe differential manchester, Q. Describe Differential Manchester? ...

Q. Describe Differential Manchester? - Inversion at middle of bit interval is utilized for synchronization - Presence or else absence of additional transition at beginning o

Network management assignment, One of the key roles of a System/Network Adm...

One of the key roles of a System/Network Administrator is to monitor log files. This usually requires helper scripts (i.e. Perl programs) so a summary of large log files can be qui

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

Logged into a router, You are logged into a router, what command would repr...

You are logged into a router, what command would represent you the IP addresses of routers linked to you? Ans)show cdp neighbors detail

Packet, a transperent switch is inserted between two local area networks AB...

a transperent switch is inserted between two local area networks ABC and XYZ.network ABC has workstation 1,2,and 3 and Network XYZ has workstation 4,5, and 6. show the contents of

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

Discuss about the jpeg and ldap, Discuss  about the JPEG and LDAP J...

Discuss  about the JPEG and LDAP JPEG: Stands for Joint Photographic Experts Group.  A standard format of storing digitized, colour, or black-and-white photographs. JPEG fi

Connection multiplexing, CONNECTION MULTIPLEXING:  In various circumst...

CONNECTION MULTIPLEXING:  In various circumstances transceiver can be in convenient e.g. workstations in a LAN. Connection multiplexer acts multiple computers to a single tran

Difference between routable and non- routable protocols, What is the differ...

What is the difference between routable and non- routable protocols? Routable protocols can work with a router and can be used to make huge networks. Non-Routable protocols

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