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

Explain router, Router A router is used to route (transfer) data among ...

Router A router is used to route (transfer) data among two or more same networks. It verifies the next network point to which a data packet should be forwarded. The router is l

Discuss your strategy to test wlpc system, Wireless Phone Company (WLPC) is...

Wireless Phone Company (WLPC) is a provider of wireless phone service in the US with 100,000 customers serving mostly small markets. WLPC has just purchased additional airwaves in

Resolution of domain name system, Q. Resolution of domain name system? ...

Q. Resolution of domain name system? - Mapping a name to an address or else an address to a name - Resolver is a DNS client used by an address to provide mapping - In re

Transport layer , Transport Layer In computer networking it the transp...

Transport Layer In computer networking it the transport  layer is where  sessions are  exchanged between  hosts. This layer resides  between  the application layer and  networ

Explain the term- congestion, Explain the term- congestion The average ...

Explain the term- congestion The average queue size over the last cycle and the current cycle is calculated. This value is the threshold. By averaging over two cycles instead o

What are the advantages of star topology, What are the advantages of Star T...

What are the advantages of Star Topology? The advantages of star topology are: a. Relatively easy to configure. b. Simple to troubleshoot c. Media faults are automatic

Stop service advertisements from flooding a network, To stop Service Adver...

To stop Service Advertisements (SAPs) from flooding a network, Cisco routers do not forward them. How are services advertised to other networks? Ans) Every router builds its own

Link-state routing, In link-state routing network topology is filled from...

In link-state routing network topology is filled from route calculation. Switches send link-state information about local joins. Every switch creates own routing tables. It needs

Determine the rate of communication line, Determine the rate of communicati...

Determine the rate of communication line The dog could carry 21 gigabytes or 168 gigabits. A speed of 18 km/hour that is equal to 0.005 km/sec. The time to travel the distance

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