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

Drawback of repeaters, Drawback of  Repeaters. Repeater  has no filte...

Drawback of  Repeaters. Repeater  has no filtering capability as it forwards  every frame. Repeater shell  be placed  at accurate distance  before  actual  signal becomes

When the router runs out of buffer space, Source quench is the process wher...

Source quench is the process where the destination router, or end internetworking device will "quench" the date from the "source", or the source router. This usually occurs when th

Name three agent development toolkits, QUESTION (a) Name two properties...

QUESTION (a) Name two properties of an agent (b) List the three characteristics used to classify agents according to the Nwana Taxonomy (c) Agent environments can be clas

What is groupware, What is Groupware Groupware are a collection of sof...

What is Groupware Groupware are a collection of software tools that encompass a broad range of applications. Even though groupware broadly consists of applications like calend

Discuss network designs, This assignment will assess parts of objectives 2-...

This assignment will assess parts of objectives 2-6 from the subject outline: 1 Explain the principles of logical design 2 Discuss the strengths and weaknesses of various net

Define encoder, Define Encoder? A device or program that uses predefine...

Define Encoder? A device or program that uses predefined algorithms to encode, or compress audio or video data for storage or transmission use. A circuit that is used to change

Define layered network model, Q. Define layered network model? - The OS...

Q. Define layered network model? - The OSI Reference Model is collection of seven layers every specifying particular network functions. - The process of breaking up the func

Ftp and ftp application layer protocols, What is the difference between TFT...

What is the difference between TFTP and FTP application layer protocols? Ans) TFTP - Trivial File Transfer Protocol A stripped down version of FTP, easy to use and fast. TFTP

Illustrate the advantages of VLANs, Q. Illustrate the Advantages of VLANs? ...

Q. Illustrate the Advantages of VLANs? - Cost and time reduction in moving stations from one group to another - Creation of virtual workgroups - Security Position of

Show v.32 standard, Q. Show V.32 standard? - ITU-T's V.32 standard was ...

Q. Show V.32 standard? - ITU-T's V.32 standard was issued in 1991 for asynchronous and full-duplex operation at 14.4 Kbps. V.32bis - Is an extension of the V.32 technology?

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