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

Connection-oriented service, The connection-oriented service process for ne...

The connection-oriented service process for networking is same to the manner in which telephones are used. This is shown as follows: A caller dials a number of the receiver. The

List some most useful advantages of token ring, List some most useful advan...

List some most useful advantages of Token Ring. Here are Token ring's most useful advantages: a. It depends excellent throughput under high-load conditions. b. Token Ring

Error detection-redundancy, Q. Error Detection-Redundancy? In its p...

Q. Error Detection-Redundancy? In its place of repeating the entire data stream a shorter group of bits may be appended to the end of each unit. Called as -redundancy?

Describe peer-to-peer networking, You are requested to design a secure home...

You are requested to design a secure home or small scale network (Fig. 1) to satisfy the key concepts underlying computer and network security: confidentiality, integrity, availabi

Challenge handshake authentication protocols (chap), Challenge Handshake Au...

Challenge Handshake Authentication Protocols (CHAP) CHAP as its an implies implements  a form of authentication that  requires a challenge  and a response. A CHAP authenticator

Inductor, #clasification of inductor

#clasification of inductor

Name the layers of osi, List the layers of OSI There are seven layers i...

List the layers of OSI There are seven layers in OSI model a. Physical Layer b. Data Link Layer c. Network Layer d. Transport Layer e. Session Layer f. Presen

What is bookmark, What is Bookmark A list of pages a user likes to f...

What is Bookmark A list of pages a user likes to frequently visit. Netscape® Navigator and Explorer® have a "bookmark" menu item which allows users to add favourite sites vi

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