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

Name the protocol which is networking middleware, Name the protocol which i...

Name the protocol which is networking middleware SOCKS is a networking middleware: a circuit-level gateway, acting as a proxy and is placed at the session layer to mediate clie

Ipv6 - network layer and routing , IPv6 The  internet  engineering task...

IPv6 The  internet  engineering task force begin  the effort to develop a successor  protocols  to IPv4 in the early  1990 is an internet  layer protocols  for packet  switched

State the characteristics of thinnet, Thinnet Characteristics Short...

Thinnet Characteristics Shorter range (185 meters) as well as smaller capacity Bus topology LAN Connectors and cables include: thin coaxial cable, NICs and BNC-T

Which layer is responsible for negotiating data transfer , Which layer is r...

Which layer is responsible for negotiating data transfer syntax? Ans) The Presentation layer does the following: Manages data representation conversions, or data transfer syntax

Optimizing stp, Optimizing STP  Because there is a separate instance of ...

Optimizing STP  Because there is a separate instance of the spanning tree for every active VLAN, a separate root election is conducted for each instance. If the default switch p

Explain the functions and features of the ipmonitor program, Functions and ...

Functions and features of the IPMonitor program are as follows:   a)  This program should be able to list out detail information of IP traffic which includes source IP address an

Mail access protocols - application layer, Mail Access Protocols The e...

Mail Access Protocols The e mail  message  are usually  sent to  an email  server that stores received message  in the  recipient   e mail  mailbox.  The user  retrieves messa

Describe various mail protocols, Question 1 Describe the following a. Inte...

Question 1 Describe the following a. Internet Technologies b. Networks c. Media Access Control Question 2 Explain the various classes of networks Question 3 Describe various m

Layered concept of computer networks, Q1.  What  advantages  do  you  see  ...

Q1.  What  advantages  do  you  see  in  having  a  layered  concept  of  computer  networks?  Which layers or OSI structure deals with identification of a host? Explain the proces

Define routing, Define Routing? The process of determining systematical...

Define Routing? The process of determining systematically hoe to forward messages toward the destination nodes based on its address is known as routing.

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