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

What is a hypertext link, A hypertext link is a special tag that links sing...

A hypertext link is a special tag that links single page to another page or resource. If you click the link, the browser goes to the link's destination.

Merits of message passage-shared memory, Gives excellent low-level control ...

Gives excellent low-level control of parallelism; Portable; Minimal overhead in data distribution and parallel synchronisation; and It is less error prone. Drawb

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

Determine the major advantages of ring topology, Point out the major advant...

Point out the major advantages of Ring Topology. The benefits of ring topologies are: a. They are very simple to troubleshoot because every device incorporates a repeater.

Differentiate between ipv4 and ipv6, Question 1 Write short notes on Re...

Question 1 Write short notes on Reserved IP addresses and Special use IP addresses 2 Explain about the packet switching mechanism based on Virtual Circuit 3 Explain about

Distributed enrollment protocol dep, Introduction: This is a specialized p...

Introduction: This is a specialized protocol designed for CS5244. It provides a distributed means to access a BasicEnrollmentManager implementation through client-server communica

What is the difference between trigger and rule, What is the difference bet...

What is the difference between trigger and rule? The triggers are known as implicitly by database generated events, whereas stored procedures are known as explicitly by client

Show the need for network layer, Q. Show the Need for Network Layer? N...

Q. Show the Need for Network Layer? Need for Network Layer - To solve the problem of delivery of data through several links. - Accountable for Host to Host delivery

ICT, state the advantages of the ICT

state the advantages of the ICT

Why it is necessary to have layering in a network, Why it is necessary to h...

Why it is necessary to have layering in a network? A computer network is a very complex system. It becomes very difficult to execute as a single entity. The layered approach di

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