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 do you use the aux port for, The auxiliary port is used to link a mode...

The auxiliary port is used to link a modem to for dial backups.

Concept of internetwork and intranetwork routing protocols, Describe the co...

Describe the concept of internetwork and intranetwork routing protocols?

Explain file transfer protocol, Q. Explain File Transfer Protocol? - Fi...

Q. Explain File Transfer Protocol? - File Transfer Protocol (FTP) is a TCP/IP client-server application for copying files from one host to another -- Establishes two connect

Explain the concept of token passing, Token Passing S...

Token Passing Station is able to send only when it receives a special frame called a token Token circulates around the ring If station wishes to sen

Ospf - open shortest path first , OSPF ( open Shortest Path First) Open...

OSPF ( open Shortest Path First) Open shortest  path first  is a routing  protocols  developed for internet protocols networks by the  interior  gateway protocols working group

What is piggybacked ack, What is piggybacked ACK The protocol will be i...

What is piggybacked ACK The protocol will be incorrect. Suppose that 3-bit sequence numbers we are using. Consider following situation: A just send frame 7. B gets frame

Subnet layer of the tcp-ip model, Q. Subnet layer of the TCP-IP model? ...

Q. Subnet layer of the TCP-IP model? These two layers of the OSI correspond straight to the subnet layer of the TCP/IP model. Majority of the time the lower layers under the

CLIENT SERVER BLACKJACK, So for this project, we’re going to make a game. ...

So for this project, we’re going to make a game. This game will make use of a server to join two clients together for a modified game of Blackjack.

Physical addressing in a wan, PHYSICAL ADDRESSING IN A WAN:  The physi...

PHYSICAL ADDRESSING IN A WAN:  The physical addressing in a WAN is same as in LAN in the following way: The data is send in packets equivalent to frames. Every pack

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