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

IPV6, is DVMRP multicast prtocol supports IPV6?

is DVMRP multicast prtocol supports IPV6?

Perfect shuffle permutation-concept of permutation network, Perfect Shuffle...

Perfect Shuffle Permutation This was advised by Harold Stone (1971). Consider N objects each characterized by n bit number say  X n-1, X n-2, X 0    (N is chosen such that N

Firewall architectures-dual homed host architecture, Dual Homed Host Archit...

Dual Homed Host Architecture This setup consists of a host machine with two or more IP addresses for each of its physical port. One port is connected to intranet and other to the

Frequency division multiplexing, Frequency Division Multiplexing Frequ...

Frequency Division Multiplexing Frequency  division  multiplexing (FDM) is an analogy technique that can be applied when the bandwidth of a link is greater than the combined b

Transition phases - point to point , Transition Phases A PPP connectio...

Transition Phases A PPP connection goes through phases  which can be  shown in a transition phase . Dead: In  the dead phase  the link is not  being used. There is  no ac

Higher bandwidth - computer network, Higher bandwidth Fibre  optic  ...

Higher bandwidth Fibre  optic  cable an  support  dramatically higher bandwidths than  either   twisted pair or  coaxial  cable currently data rates  and bandwidth utilizatio

Sonet sdh , SONET SDH To satisfy the  requirements  of ever inc...

SONET SDH To satisfy the  requirements  of ever increasing data rate  for diverse applications, ANS developed  a standard known as synchronous optical  network by utili

Telnet protocols - transport layer, TELNET Protocols The TCP/ IP proto...

TELNET Protocols The TCP/ IP protocol  suite  includes a simple textual  remote terminal protocols called  TELNET  that allow  a user to log into  a computer across an interne

User datagram protocol, A UDP header does not have Sequence number and Ackn...

A UDP header does not have Sequence number and Acknowledgement number fields. Is it an advantage or a disadvantage? Explain your answer in detail. User Datagram Protocol Th

Explain any three most important gsm identifiers, Question 1 A) Explain br...

Question 1 A) Explain briefly the advantages wireless communication systems                   B) What is a cellular network? Question 2 Explain fundamental architecture of

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