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

Cpe is an acronym for, Customer Premise Equipment (CPE) are devices physica...

Customer Premise Equipment (CPE) are devices physically located at the subscriber's premises. Includes both owned and leased equipment.

Tunnelling - point to point, Tunnelling To guarantee privacy for the  o...

Tunnelling To guarantee privacy for the  organization, VPN specifies that each IP datagram destined for private  use of the  organization, must  first be  encrypted and then en

What is the importance of encryption on a network, What is the importance o...

What is the importance of Encryption on a network? Encryption is the process of translating information into a code that is unreadable by the user. It is then translated back o

Explain the concept of router-root path, Explain the concept of router-root...

Explain the concept of router-root path The mean router-router path is double the mean router-root path. Number levels of tree with root as 1 and the deepest level as n. The pa

Connection-oriented protocol, TCP is connection-oriented. Connection-orient...

TCP is connection-oriented. Connection-oriented is a kind of connection established between the source & destination machines before any data is sent that means a connection is est

Write a descriptive note on rmonv2, Question 1 What does the SNMP access p...

Question 1 What does the SNMP access policy represent? Question 2 Does there exist any formal functional specification for SNMPv1 management? Question 3 In the con

Design a logical lan topology- ccna, Design a Logical LAN Topology Step...

Design a Logical LAN Topology Step: Design an IP addressing scheme. Given the IP address block of 192.168.7.0 /24, design an IP addressing scheme that states the following r

Components of the vpn - point to point , Components of the VPN When  us...

Components of the VPN When  using  VPN we incorporate many pieces of a jigsaw puzzle each piece services its own  function to private  the interoperation and the  security  nec

What is sap, What is SAP? Series of interface points that permit other ...

What is SAP? Series of interface points that permit other computers to interact with the other layers of network protocol stack is known as SAP.

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