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

database server in client server environment, Normal 0 false ...

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

Define remote procedure call (rpc), RPC adumbrates the intricacies of the ...

RPC adumbrates the intricacies of the network by using the ordinary procedure call mechanism familiar to each programmer. A client process calls a function on a remote server and

Determine the definition of hdlc, Determine the definition of HDLC HDLC...

Determine the definition of HDLC HDLC has only one address field. In a LAN, any station may transmit to any other station. The receiving station needs to see its own address in

Sockets, When programming a server or a client, we have to deal with port n...

When programming a server or a client, we have to deal with port numbers and IP addresses, but we usually do this through an abstraction called a socket. Sockets are the standard A

Explain the term data routing functions, Data Routing Functions The dat...

Data Routing Functions The data routing functions are functions that when executed set the path between source and destination. In dynamic interconnection networks there may be

What is the virtual channel, A logical circuit that is created by Virtual c...

A logical circuit that is created by Virtual channel links. It carries data among two endpoints in a network. The one more name for Virtual Channel is Virtual Circuit.

Process management in pvm, Process Management int pvm_mytid( void ...

Process Management int pvm_mytid( void ) Returns the tid of the calling process.  tid values less than zero indicate an fault. int pvm_exit( void ) T

What is the client side of applications, What is the client side of applica...

What is the client side of applications To build the client side of applications, developers use various tools. Some of the popular software development environments include Vi

Flow control in TCP, Q. Flow control in TCP? The amount of data a s...

Q. Flow control in TCP? The amount of data a source is able to send before receiving an ACK from the destination Whether to send 1 byte of data as well as wait for ACK

Switch - network layer and routing , Switch Generally called  as two ...

Switch Generally called  as two  layer switch . it  performs  on physical  and data  link  layers. It  is  a bridge it has many  ports  that allow  better  performance. Since

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