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 cross over cable, Q. What is Cross over cable? - Cross the crit...

Q. What is Cross over cable? - Cross the critical pair to properly transmit, align and receive signals on devices with like connections. - Pin 1 connected to pin 3 as well a

State the characteristics of thinnet, Thinnet Characteristics Short...

Thinnet Characteristics Shorter range (185 meters) as well as smaller capacity Bus topology LAN Connectors and cables include: thin coaxial cable, NICs and BNC-T

What is manchester, Q. What is Manchester? - Utilizes an inversion at t...

Q. What is Manchester? - Utilizes an inversion at the middle of each bit interval for both synchronization and bit representation - Negative-to-positive represents binary 1

Difference between the communication and transmission, Communication is the...

Communication is the process of sending and receiving data by means of a data cable that is associated externally. Transmission means the transmitting of data from the source to

Illustrate the term- search engine and surfing, Illustrate the term- Search...

Illustrate the term- Search Engine and Surfing Search Engine: Software used to find information on the Web. Examples are Google, Lycos and Yahoo. Server: A computer with

Challenge handshake authentication protocols (chap), Challenge Handshake Au...

Challenge Handshake Authentication Protocols (CHAP) CHAP as its an implies implements  a form of authentication that  requires a challenge  and a response. A CHAP authenticator

Encrypted with a symmetric key, Alice sends a message to Bob, encrypted wit...

Alice sends a message to Bob, encrypted with a symmetric key. Bob decrypts the message and finds it is a purchase order for an expensive workstation. When the time comes to deliver

Describe osi routing architecture, Q. Describe OSI Routing Architecture? ...

Q. Describe OSI Routing Architecture? End systems (ESs) as well as intermediate systems (ISs) use routing protocols to distribute (-advertise?) some or all of the informati

The forall statement, The FORALL Statement The FORALL statement allows ...

The FORALL Statement The FORALL statement allows for more common assignments to sections of an array. A FORALL statement has the general form.               FORALL ( triplet

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