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

Service paradigm, At the minimum level most networks sends individual packe...

At the minimum level most networks sends individual packets of data and the network needs each packet to follow an exact format dictated by the hardware, which is known service par

What is OSPF, What is OSPF? It is an Internet routing protocol that scal...

What is OSPF? It is an Internet routing protocol that scales well, can route traffic with multiple paths, and uses knowledge of an Internet's topology to make precise routing de

Determine 10base-fl- fiber link ethernet, 10Base-FL: Fiber Link Ethernet ...

10Base-FL: Fiber Link Ethernet Utilizes star topology to connect stations to a hub External transceiver entitle as a fiber-optic MAU connects processing device to fib

Enumerate the concept of ip address, Enumerate the concept of IP address ...

Enumerate the concept of IP address The router must have an IP address of the same network (194.62.15.x in this case) for the convenience of the entire network to use the servi

Illustrate data-link layer in osi layers model, Q. Illustrate Data-Link Lay...

Q. Illustrate Data-Link Layer in osi layers model? Data-Link Layer: This layer takes the data messages or frames from the Network Layer and gives for their actual transmissio

Root, Originally Linux/UNIX systems had one all-powerful user called root t...

Originally Linux/UNIX systems had one all-powerful user called root that managed systems. Discuss the risks of having a single root user and how more limited management abilities c

Show the steps used at sender end by check sum, Q. Show the steps used at s...

Q. Show the steps used at sender end by check sum? The sender follows these steps: The data unit is divided into "k" sections, each off "n" bits All sections ar

Explain the hubs and repeaters, Hubs/Repeaters Hubs/Repeaters are used ...

Hubs/Repeaters Hubs/Repeaters are used to connect together two or more network segments of any media type. In larger design, signal quality starts to deteriorate as segment exc

Illustrate the drawbacks of stop and wait, Q. Illustrate the Drawbacks of s...

Q. Illustrate the Drawbacks of stop and wait? Drawbacks of stop and wait - Only one frame is able to be in transit at a time - After every frame sent the host must wai

Improvements for the wireline lan infrastructure, 5. CSMA/CD based Ethernet...

5. CSMA/CD based Ethernet LANs in various sites and Frame Relay (FR) service to connect them together. You want to make a difference in the organization by upgrading the LANs to be

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