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

Buffering - transport layer, Buffering This  protocols  provides  t...

Buffering This  protocols  provides  the advantage of buffering to the  receiver can buffer any out of order  packets after being received by  sending  acknowledgment  when

What are the five major network services, What are the five major network s...

What are the five major network services? Major Network Services are: a. File Services b. Message Services c.  Print Services  d.  Application Services e.  Datab

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

Advantage of ip sec tunnelling mode, Advantage of IP sec  Tunnelling Mode ...

Advantage of IP sec  Tunnelling Mode IP Sec  tunnelling mode  has the  following  advantages: a.Security : Ts IP sec tunnelling mode  secure somewhat but  not the best. In a

Linked list for parallel algorithms, Linked List A linked list is a dat...

Linked List A linked list is a data structure composed of zero or extra nodes linked by pointers. Each node consists of two parts, as shown in Figure: info field having specifi

Building and running mpi programs, MPI parallel programs are written with c...

MPI parallel programs are written with conventional languages like, C and Fortran  .One or more header files such as "mpi.h" may be needed to give the necessary definitions and dec

Common syntax of openmp, Q. Common syntax of OpenMP? Every OpenMP direc...

Q. Common syntax of OpenMP? Every OpenMP directive begins with #pragma omp. The common syntax is   #pragma omp directive-name [Set of clauses]  where omp is an OpenMP key

Determine the maximum output current, A logic gate drives a load, which has...

A logic gate drives a load, which has a resistance of 1 kÙ and a capacitance of 20 pF. The printed circuit track connecting the gate to its load has an 40 pF capacitance to ground.

What is an arp and how does it work, ARP(ADDRESS RESOLUTION PROTOCOL) is a ...

ARP(ADDRESS RESOLUTION PROTOCOL) is a network layer protocol which associates the physical hardware address of a network node(commonly called as a MAC ADDRESS) to its ip address. n

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