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 traffic shaping, Normal 0 false false false EN-...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Calculate the efficiency of stop-and-wait ARQ, Suppose that frames are 1250...

Suppose that frames are 1250 bytes long including 25 bytes of overhead. Also assume that ACK frames are 25 bytes long. Calculate the efficiency of stop-and-wait ARQ (a) Transmits a

Simple mail transfer protocols (smtp), Simple Mail Transfer Protocols (SMTP...

Simple Mail Transfer Protocols (SMTP) The application  layer  protocols  for electronic  mail is SMTP( Simple mail  transfer protocols). Internet  electronic  mail  has man

Briefly describe how the file system is organized in unix, Question: a)...

Question: a) Briefly describe how the file system is organized in Unix. b) What is the importance of the "touch" command. Give one of its disadvantage. c) Name three d

Router share information in distance vector routing, Explain how does route...

Explain how does router share information in Distance Vector routing?

Objectives of param algorithem, After going through this part, you should b...

After going through this part, you should be capable to: Describe the concepts of message passing programming; List out the various communication modes for communication

Bridges, BRIDGES:  A bridge is a hardware device also needed to connec...

BRIDGES:  A bridge is a hardware device also needed to connect two LAN code segments to extend a LAN. A bridge uses two NICs to connect two code segments. It listens to all tr

Give the examples of the session layer, Session layer examples  are Netbios...

Session layer examples  are Netbios Names, SQL, NFS, X Windows, and RPC.

How is computer networks used in teleconferencing, Q. How is computer netwo...

Q. How is computer networks used in teleconferencing? Teleconferencing: Teleconferencing allows conference to happen without the participants being in the same place. Applica

Medium earth orbiting satellite, Medium Earth Orbiting satellite is an orbi...

Medium Earth Orbiting satellite is an orbit which is located just above the few hundred miles to a few thousands above the earth surface. It is of higher advantage than Low orbit s

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