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

Define the network security, Q. Define the Network Security? The Intern...

Q. Define the Network Security? The Internet and Web technology presents enormous promise for e-commerce. Web now is used to handle important business assets that became the

Introduction to operating system for parallel computer, INTRODUCTION T...

INTRODUCTION This part discusses the additional requirements at software levels and operating system which will create the parallel programs run on parallel hardware. Collecti

Define the term pipelined processor, Pipelined Processor A pipeline pro...

Pipelined Processor A pipeline processor can be described as a processor which comprises of a series of processing circuits known as segments and a stream of operands (data) is

LAN, what is man LAN wan

what is man LAN wan

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

Error and flow control in dll, differntiate between error control and flow...

differntiate between error control and flow control in data link layer

What is difference among flsm and vlsm, In FLSM subnet mask of all subnets ...

In FLSM subnet mask of all subnets will b same. But in FLSM it changes.

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

What do you mean by protocol, What do you mean by Protocol? In the cont...

What do you mean by Protocol? In the context of data networking, a protocol is a formal set of rules and conventions that governs how computers exchange information over a netw

Single program multiple date in parallel virtual machine, Single Program Mu...

Single Program Multiple Date A common style of writing data parallel programs for MIMD computers is SPMD (single program, multiple data): all the processors implement the same

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