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

TCP, TCP creates a reliable data transfer service, in addition to IP''s unr...

TCP creates a reliable data transfer service, in addition to IP''s unreliable best-effort service. Study the related sections of the text, and in your own words, summarize how TCP

Computing shortest path in a graph, While calculating shortest path, first ...

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 on

How a token ring networks allows sharing of bandwidth, Question: (a) E...

Question: (a) Explain how a Token Ring networks allows sharing of bandwidth (access control). (b) (i) CSMA/CD is not appropriate for wireless communication. Explain wh

Designing a network for a retail customer, You are designing a network for ...

You are designing a network for a retail customer; they plan to have 5 locations initially with the main store acting as the warehousing depot.  Within the next year they are plann

What is routing region, What is routing region? When hierarchical routi...

What is routing region? When hierarchical routing is used, the routers are separated into what we call regions, with each router knowing all the details about how to route pack

What is segmentation and fragmentation, To split data in pieces is known as...

To split data in pieces is known as segmentation and divide segmentation in pieces called Fragmentation. #question..

TCP, TCP creates a reliable data transfer service, in addition to IP''s unr...

TCP creates a reliable data transfer service, in addition to IP''s unreliable best-effort service. Study the related sections of the text, and in your own words, summarize how TCP

Process communicating - application layer, Process communicating End  ...

Process communicating End   systems  communicate with each  other by the  processes. A process  can be  thought  of a s program  that is  running  within  end systems. Process

How does intranet work, How does Intranet Work? An Intranet can be def...

How does Intranet Work? An Intranet can be defined as a private network which uses Internet tools. The principal tool is the Web browser, but there are other Internet tools su

Independent loops statement, INDEPENDENT Loops HPF gives additional opp...

INDEPENDENT Loops HPF gives additional opportunities for parallel implementation by using the INDEPENDENT directive to assert that the iterations of a do-loop can be done indep

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