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

State about the cell sectoring, State about the Cell sectoring With cel...

State about the Cell sectoring With cell sectoring, a cell is separated into a number of wedge-shaped sectors, each with its own set of channels, typically 3 or 6 sectors per c

Which layer is responsible for coordinating communication , Which layer is ...

Which layer is responsible for coordinating communication between systems Ans) The Session layer performs the following: Responsible for establishing and maintaining connections

Routing in a wan, As there will be more devices there will be more traffic ...

As there will be more devices there will be more traffic of information. We can include capacity to WAN by adding more links and packet switches. Packet switches use not have compu

Will the client send a tcp or udp packet, Question: (a) Explain the usa...

Question: (a) Explain the usage of the following parts of the IPv4 datagram format. i. VERS ii. HLEN iii. TOTAL LENGTH iv. SERVICE TYPE v. HEADER CHECKSUM (b) Na

Maximum hop count for link-state protocols, Normal 0 false fa...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Functions of the information security steering committee, Question: (a)...

Question: (a) Do you agree with the following statements (specify your reasons to support your answer for each):- i) Policies are the foundation for the development of sta

Architecture of cisco ios software, Architecture of Cisco IOS software ...

Architecture of Cisco IOS software Cisco IOS might not  applications like ms word,multimedia softwares. It is mainly for switching data packet and concentrated on switching p

Primary function - computer network, Primary Function Core network ty...

Primary Function Core network typically providing  the followings functionality 1.Aggregation : the  highest  level  of aggregation  in a service  provider  networks. The

Explain how a cdma system works, (a) Explain how a CDMA system works? (b...

(a) Explain how a CDMA system works? (b) Explain howWelsh-Hadamard codes are generated. Explain why orthogonality between different spreading codes is important. (c) Consider

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