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 workstation, What is workstation? A workstation is a node in ne...

What is workstation? A workstation is a node in network that is more useful and can occur local information processing or graphics processing. A workstation generally has an in

Explain short term and medium-term scheduling, What are short, long and med...

What are short, long and medium-term scheduling? Long term scheduler verifies which programs are admitted to the system for processing. It controls the degree of multiprogrammi

Interconnection networks and sorting, As in PRAM, there was no direct commu...

As in PRAM, there was no direct communication medium among the processors, therefore another model called as interconnection networks have been designed. In the interconnection net

Illustrate about rsa encryption, Q. Illustrate about RSA Encryption? R...

Q. Illustrate about RSA Encryption? RSA Encryption - Public key encryption technique - Encryption steps: - Encode data to be encrypted as a number to create the pla

Explain the acknowledged connectionless service, Explain the Acknowledged c...

Explain the Acknowledged connectionless service This is a cross between the previous two services. It provides that datagrams are to be acknowledged, but no prior logical conne

What is the networking control unit, The Network Control Unit (NCU) is a fi...

The Network Control Unit (NCU) is a field panel housing electronic modules, terminal blocks, and signal conditioners (pneumatic, linevoltageand electronic) all inside a one enclosu

Explain data communications, The distance over which data moves within a co...

The distance over which data moves within a computer may differ from a few thousandths of an inch, as is the case within a one IC chip, to as much as lot of feet along the backplan

Explain about bridges, Bridges The bridge function is to attach separat...

Bridges The bridge function is to attach separate homogeneous networks. Bridges map the Ethernet address of the nodes residing on each network segment and allow only essential

Security control procedures , a) An Introduction/Overview of Network Securi...

a) An Introduction/Overview of Network Security issues. b) A Risk Assessment  analysis- to include:             Assets                                                         T

Determine the specification of fddi, FDDI has four specifications: 1. M...

FDDI has four specifications: 1. Media Access Control it defines how the medium is accessed 2. Physical Layer Protocol it defines data encoding/decoding procedures 3. Phy

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