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 a web server in client server environment, This new model of Client...

This new model of Client/Server having of thin, portable, "universal" clients that talks to superfast servers. In the simple form, a web server returns documents when clients ask f

Application layer - computer network, Application Layer The  applicati...

Application Layer The  application layer is where  network  applications and their  application layer protocols  reside. The internet application layer includes many protocols

Internet client control task, Internet Client Control Task A distribut...

Internet Client Control Task A distributed system is to be implemented using networked PCs. The role of the system in this task is to implement an environmental control sys

Initialization - network layer and routing , Initialization  Imagine t...

Initialization  Imagine that  all routers in our  sample internetwork  comes up  at the  same time. Each router sends a greeting packet to its  neighbours to find  out the  sta

Domains and sub domains, Hosts are generally, individual machines at a spec...

Hosts are generally, individual machines at a specific location. Normally Resources of host machine are shared and can be used by any user on Internet. Hosts & local networks are g

What does a metric of 16 hops showwhen using RIP , Destination unreachable ...

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

Explain different architectures for ieee802.11, Question: (a) Explain a...

Question: (a) Explain and illustrate different architectures for IEEE802.11 (WiFi). (b) The MAC management of IEEE802.11 handles transmitter activity for power management.

How firewall configuration makes all the difference, How Firewall configura...

How Firewall configuration makes all the difference The greatest blunder that any company make is to just install a firewall and think that they have ensured perfect securit

Define rs232 interface, Q. Define RS232 Interface? - Indicates the inte...

Q. Define RS232 Interface? - Indicates the interface between DTE and DCE: V.28 mechanical as well as electrical characteristics V.24: functional as well as procedur

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