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 are the ethernet frame fields, Ethernet Frame Fields Preamble ...

Ethernet Frame Fields Preamble - seven bytes of alternating 0s also 1s to notify receiver of incoming frame and to provide synchronization SFD (Start frame delimiter)

Describe the term disaster management as security threats, Describe the ter...

Describe the term Disaster Management as security threats Making and testing backups regularly could be the simplest and easiest of all the security measures. But a new questio

Write the purpose of split horizon, Split Horizon - If you attain a protoc...

Split Horizon - If you attain a protocol's route on an interface, do not send information about that route back out that interface.

Subletting, Ask Design private subnetworks (using Class A range for CIDR) f...

Ask Design private subnetworks (using Class A range for CIDR) for each domain as in the table below, and complete the table. Hints: Consider how many network bits are required to a

Base 64 encoding, Base 64 Encoding The Simple Mail Transfer Protocol (...

Base 64 Encoding The Simple Mail Transfer Protocol (SMTP) is a protocol used on the Internet for sending email. When you send an email, your mail client establishes an SMTP co

Improvements for the wireline lan infrastructure, 5. CSMA/CD based Ethernet...

5. CSMA/CD based Ethernet LANs in various sites and Frame Relay (FR) service to connect them together. You want to make a difference in the organization by upgrading the LANs to be

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

Explain transparent bridges and learning bridges, Transparent Bridges & Lea...

Transparent Bridges & Learning Bridges - Builds table by examining destination as well as source address of each packet it receives - Learning bridges - If address is not

Explain FDDI media access control, FDDI Media Access Control Unlike CSM...

FDDI Media Access Control Unlike CSMA/CD networks such like Ethernet token-passing networks are deterministic--you are able to calculate the maximum time that will pass before

What does jade stands for, QUESTION (a) Briefly describe the dire...

QUESTION (a) Briefly describe the direct coordination model and the meeting oriented coordination model (b) What does JADE stands for? (c) Name the three spec

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