Computing shortest path in a graph, Computer Networking

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.

Posted Date: 7/31/2012 7:00:00 AM | Location : United States







Related Discussions:- Computing shortest path in a graph, Assignment Help, Ask Question on Computing shortest path in a graph, Get Answer, Expert's Help, Computing shortest path in a graph Discussions

Write discussion on Computing shortest path in a graph
Your posts are moderated
Related Questions
What is a LAN? LAN stands for Local Area Network. It refers to the connection among computers and other network devices that are located within a small physical location.

Token Passing - Token Ring (IEEE 802.5) Needs that station take turns sending data Token passing coordinates process Token is a especially formatted three-byte fr

What is ipconfig? Ipconfig is a utility program that is commonly used to recognize the addresses information of a computer on a network. It can show the physical address as wel

Q. Explain Dynamic Domain Name System? DDNS - Dynamic Domain Name System automatically updates the DNS master file - Sent by DHCP to a primary DNS server; secondary se

Question : a) Explain why pervasive computing can be termed as a "technology that disappears". b) List and briefly explain four main components of a MOTE used in Wireless

Advantages and Disadvantage of Computer Networking Most of the benefits  of networking  can be  divided into  two  generic categories Connectivity and  sharing. Networks


Question : (a) Describe, with the aid of a diagram, a hybrid topology of a network of your choice. (b) Briefly explain the similarity and differences between a switch and

Message Passing Programme Development Environment In a multicomputer system, the computational load among various processors must be balanced. To pass information among variou

What is a Web server? This new model of Client/Server having of thin, portable, "universal" clients that talk to super fat servers. In the easiest form, a web server returns do