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 is unbound transmission media, Unbound Transmission Media Unbound ...

Unbound Transmission Media Unbound transmission media extend beyond the limiting confines of cabling. They give a good communication alternative for WANS. The lack of physical

What are triggers and rules, What are Triggers and Rules? Triggers are...

What are Triggers and Rules? Triggers are special user defined actions generally in the form of stored processes that are automatically invoked by the server based on data rel

Dns - server attacks, DNS - Server Attacks It’s not so easy to list al...

DNS - Server Attacks It’s not so easy to list all the associated attacks as they are evolving way so fast. As any error of flaw is identified, a patch is released in response

Client server architecture - application layer, Client  Server Architectur...

Client  Server Architecture There is an  always  on host  called  server  which  provides  service requests to many other hosts  called  clients. In other words  client progra

What is remote procedure call, What is Remote Procedure Call (RPC)? RPC...

What is Remote Procedure Call (RPC)? RPC hides the intricacies of the network by using the ordinary process call mechanism familiar to every programmer. A client process calls

Bootrom and memory layout, Memory Memory Layout   BOOT...

Memory Memory Layout   BOOTROM This device stores the information of  the startup diagnostic  code in permanently. It performs diagnostics of  hardware  wh

Determine how many bits are used for the page number, 1.  A virtual memory ...

1.  A virtual memory system has a virtual address space of 4 Gigabytes and a page size of 8 Kilobytes.  Each page table entry occupies 4 bytes.   a)  How many bits remain unchanged

Internet client control task, Internet Client Control Task A distribut...

Internet Client Control Task A distributed system is to be implemented using networked PCs. The role of the system in this task is to implement an environmental control sys

Show the congestion control in TCP, Q. Show the Congestion control in TCP? ...

Q. Show the Congestion control in TCP? Congestion control in TCP TCP assumes that the cause of lost segment is due to congestion in the network Retransmission of

Illustrate TCP – bytes and segments, Q. Illustrate TCP – bytes and segments...

Q. Illustrate TCP – bytes and segments? TCP - bytes & segments TCP at the sending site collects bytes into a packet called a segment TCP adds a header to each se

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