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 are the disadvantages of microwaves, What are the Disadvantages of Mic...

What are the Disadvantages of Microwaves?  a. Attenuation by solid objects: birds, snow, rain, and fog. b. Reflected from flat surfaces such as water and metal. c. Diffra

What is the meaning of p-persistent, What is the meaning of P-persistent ...

What is the meaning of P-persistent If the medium is idle, transmit with probability p, and delay one time unit with probability (1 - p); if the medium is busy, continue to lis

Which layer are called upper layer, Three layers are called upper layers ...

Three layers are called upper layers a) Application Layer - 7 b) Presentation Layer - 6 c) Session Layer - 5

Give examples of the application layer, Pretty much any end-user program is...

Pretty much any end-user program is an best example of the Application Layer.

State the disadvantages of adaptive routing process, State the Disadvantage...

State the Disadvantages of adaptive routing process  (1) The routing decision is more difficult; thus, the processing burden on network nodes enhances. (2) In most cases, ad

How to configure the ethernet interfaces on the host pc, How to Configure t...

How to Configure the Ethernet Interfaces on the Host PCs Configure the Ethernet interfaces of PC1, PC2, PC3, PC4, PC5, and PC6 with the IP addresses and default gateways indica

Describe the sequence of events occur in host attempt, The following inform...

The following information was obtained from a host: IP address...............205.133.127.8/24 Default Gateway...... 205.133.127.1 DNS Server.............139.100.110.10

Define router. explain its type, Question 1 Define Router. Explain its typ...

Question 1 Define Router. Explain its type Question 2 List and discuss the different concepts of EIGRP Question 3 Explain the concept of autonomous system Autonomo

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