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

Work-sharing constructs in openmp, Work-Sharing Constructs A work-shari...

Work-Sharing Constructs A work-sharing construct distributes the implementation of the associated region between the members of the team that encounters it. A work-sharing cons

Data transfer - tcp connection management , Data Transfer After  conne...

Data Transfer After  connection  is established  bidirectional  data transfer  can take  place. The client  and  server  can both  send data  and acknowledgments. Figure  show

Selective repeat ARQ, Selective Repeat ARQ - Processing at the receive...

Selective Repeat ARQ - Processing at the receiver additionally complex - The window size is reduced to 2(m-1) (2m/2 at most) - Both the transmitter as well as the receiv

Explain about gigabit ethernet, Gigabit Ethernet Data rate of 1000 ...

Gigabit Ethernet Data rate of 1000 Mbps or else 1 Gbps Typically implemented as full-duplex with no CSMA/CD 1000Base-X utilizes long-wave optical fiber (1000Base-

Key components of inter-vlan routing , As configuring of VLANs helps in con...

As configuring of VLANs helps in controlling the size of broadcast domains. There are some key components of inter-VLAN routing such as VLAN capable switch Router Ro

What are the access methods used in lan, What are the Access methods used i...

What are the Access methods used in LAN: i. Switched access: It is used in LANs which are assigned around CBXs. Electronic switching is techniques are used to provide access

Responses - application layer, Responses Responses  are sent  from the...

Responses Responses  are sent  from the  server to the client. A responses is a three  digit code that  may be followed by additional textual information.

Advantages of fiber optics, Q. Advantages of Fiber Optics? - Higher ban...

Q. Advantages of Fiber Optics? - Higher bandwidth in comparison to twisted-pair and coaxial cable is not limited by medium but by equipment used to generate and receive signals

Round trip time and time out - transport layer, Round Trip Time (RTT) and T...

Round Trip Time (RTT) and Time Out The  size and  the complexity  of computer  networks  have grown  in past years. To achieve  an efficient  and reliable transmission  some

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