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

Discuss about the software in detail, Discuss about the Software in detail ...

Discuss about the Software in detail Software contain a number of components such as SQL Server for database connectivity, Systems Management Server for easy Web management,

Differentiate between adsl and dsl, ENTERPRISE NETWORKING 1. Explain th...

ENTERPRISE NETWORKING 1. Explain that what is a cable? Classify different types of cables. 2. Elaborate switch? Write down the functionalities of switch. 3. Describe rout

How an ethernet worked, How an Ethernet Worked? The operation of Ethern...

How an Ethernet Worked? The operation of Ethernet can be explained in simple terms as follows: Each computer on the Ethernet Network, also called as a node, operates indepen

Command to show the hardware platform information, Recognize the command to...

Recognize the command to show the hardware platform information Ans) Show version is the command to show the hardware platform information

Illustrate nonboundary-level masking with example, Q. Illustrate Nonboundar...

Q. Illustrate Nonboundary-Level Masking with example? Nonboundary-Level Masking Example IP address 45 123 21 8 Mask 255 192 0 0 Subnet 45 64 0 0 123 0

Two routers running igrp to communicate their routes, What must be true for...

What must be true for two Routers running IGRP to communicate their routes? Ans) Similar autonomous system number

What advantages does fiber optics have over other media, What advantages do...

What advantages does fiber optics have over other media? One main advantage of fiber optics is that is it less susceptible to electrical interference. It also supports higher ba

Routing through an internetwork, Which layer is responsible for routing by ...

Which layer is responsible for routing by an internetwork Ans) The Network layer is responsible for routing. This is the primary job of routers, which handle at the Network laye

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