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

Show about alternate mark inversion, Q. Show about Alternate mark inversion...

Q. Show about Alternate mark inversion? Bipolar AMI - Neutral, zero voltage represents binary 0 - Binary 1s symbolized by alternating positive and negative voltages

IP datagram, On a LAN where are IP Datagram transported?

On a LAN where are IP Datagram transported?

Explain the functions and features of the ipmonitor program, Functions and ...

Functions and features of the IPMonitor program are as follows:   a)  This program should be able to list out detail information of IP traffic which includes source IP address an

Explain the transport layer in detail, Explain the transport layer in detai...

Explain the transport layer in detail Transport Layer: Transport layer ensures and controls the end-to-end integrity of data message propagated via the network  amid two devic

Typical functional units of the client/server applications, What are the mo...

What are the most typical functional units of the Client/Server applications? Ans) typical functional units of the Client/Server applications User interface Business Logic

Multicasting, MULTICASTING : The answer to above problem is multicastin...

MULTICASTING : The answer to above problem is multicasting. It is the normal form of broadcasting. It acts like broadcasting however it does not broadcast frames automatically

Client server processes - application layer, Client  Server Processes ...

Client  Server Processes A network  application  consist  of pairs  of process that send message to one  another  over a network. For  example  in a web application a client

Explain peer-to-peer networking model, Explain Peer-to-Peer Networking Mode...

Explain Peer-to-Peer Networking Model. A networking model where every workstation has equivalent capabilities and responsibilities is called as peer-to-peer model. There is no

Network design with configuration, WHAT DOES IT COST..THIS IS OF 700 WORDS ...

WHAT DOES IT COST..THIS IS OF 700 WORDS ASSIGNMENT...

Security control procedures , a) An Introduction/Overview of Network Securi...

a) An Introduction/Overview of Network Security issues. b) A Risk Assessment  analysis- to include:             Assets                                                         T

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