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

Determine the switch in a physical ring, Switch In a physical ring ...

Switch In a physical ring configuration any disabled or else disconnected node can disable the entire network Use of a switch can permit the ring to bypass an inactive

Tcp, how tcp is redefined for wireless network

how tcp is redefined for wireless network

Which applications of computer network will be categorized, Q. What are the...

Q. What are the main categories based on which applications of computer network will be categorized? Ans: The main areas under which the applications for computer network will

Difference between routable and non- routable protocols, What is the differ...

What is the difference between routable and non- routable protocols? Routable protocols can work with a router and can be used to make huge networks. Non-Routable protocols

#titlenetwork, importance of mail server ,proxy server ,modem ,intranet and...

importance of mail server ,proxy server ,modem ,intranet and web site

Define the term - handoff and dynamic configuration, Define the term - Hand...

Define the term - Handoff and Dynamic configuration Handoff/roaming  The MAC protocol used in the wireless LAN should enable mobile stations to move from one cell to anoth

Frequency division multiplexing, Frequency Division Multiplexing Frequ...

Frequency Division Multiplexing Frequency  division  multiplexing (FDM) is an analogy technique that can be applied when the bandwidth of a link is greater than the combined b

Discuss the interdependence of networking hardware, Discuss the interdepend...

Discuss the interdependence of networking hardware and software. Is it possible to have one without the other? Explain

Define the term pipelined processor, Pipelined Processor A pipeline pro...

Pipelined Processor A pipeline processor can be described as a processor which comprises of a series of processing circuits known as segments and a stream of operands (data) is

Asynchronous transfer mode (atm), Telephone companies (Telco's) stated ATM ...

Telephone companies (Telco's) stated ATM to meet various goals. It gives universal service for all support and subscribers for all users for video, voice and data. It has a single

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