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

Show the routing table, Q. Show the Routing Table? Routing Table ...

Q. Show the Routing Table? Routing Table Every router remains a routing table that has one entry for every destination network of which the router is aware Proces

Higher bandwidth - computer network, Higher bandwidth Fibre  optic  ...

Higher bandwidth Fibre  optic  cable an  support  dramatically higher bandwidths than  either   twisted pair or  coaxial  cable currently data rates  and bandwidth utilizatio

Random effects, Random effects are the effects attributable to an infinite...

Random effects are the effects attributable to an infinite set of levels of the factor, of which only the random sample occur in the data. For example, the investigator may want t

State the network environment of intranets and internet, State the Network ...

State the Network environment of Intranets and Internet Intranets as well as the Internet are based purely on networks, the company intending to install Intranet must consider

Shared variable programme structures, Shared variable programme structures ...

Shared variable programme structures  In this section, we talk about some more concepts related to the shared programme. Concept of Lock Locks are used for protected a

Which layers are user support layers, Which layers are user support layers?...

Which layers are user support layers? Three layers are come under user support layer:- a. Session Layer b. Presentation Layer and c. Application Layer

Unguided media - wireless, Unguided Media: Wireless - A Wireless commu...

Unguided Media: Wireless - A Wireless communication transporting electromagnetic waves without a physical conductor Wireless Propagation Methods - Ground - radio

What are the internal threats - security, What are the Internal Threats ...

What are the Internal Threats Internal security problems are probably the most common. One never knows what someone is going to do. Even the most loyal employees or workers can

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