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

Problem with broadcasting, PROBLEM WITH BROADCASTING: There are some i...

PROBLEM WITH BROADCASTING: There are some issues with the broadcast. For each broadcast frame on the network every computer uses computational sources and places the data into

Horizontal scaling and vertical scaling, What is meant by horizontal scalin...

What is meant by horizontal scaling and vertical scaling? Ans) Horizontal scaling means adding or removing client workstations with only a small performance impact. Vertical

Tools for digital sound, Tools for Digital Sound Sound is the oscillat...

Tools for Digital Sound Sound is the oscillation of pressure that propagates in the form of a wave. Sound waves are transmitted through some medium (solid, liquid, or gas); th

Distinguish among client process and server process, QUESTION (a) Expla...

QUESTION (a) Explain briefly what is meant Client-server Computing? (b) Distinguish among client process and server process (c) What are the four basic characteristics of

What is redirector in networking, What is redirector in Networking? Red...

What is redirector in Networking? Redirector is software that intercepts file or prints I/O requests and changes them into network requests. This comes under presentation layer

Transport layer protocols , TCP (Transmission Control Protocol) and UDP are...

TCP (Transmission Control Protocol) and UDP are used by TCP/IP. SPX (Sequenced Packet Exchange) is used with IPX. NBP (Name Binding Protocol) is used with Appletalk.

What is difference among arp and rarp, What is difference among ARP and RAR...

What is difference among ARP and RARP? The address resolution protocol (ARP) is used to associate the 32 bit IP address with the 48 bit physical address, used by a host or a ro

Encoding the data type, ENCODING THE DATA TYPE: The figure explain a f...

ENCODING THE DATA TYPE: The figure explain a frame in which the data kind is specified by using the data area. To ensure interoperability format of encoding location m

What is a dedicated server, What is a dedicated server? A network serve...

What is a dedicated server? A network server designated to provide one particular service is known as dedicated server. For example if a computer is assigned for database servi

Describe networking, Describe networking. Networking refers to the inte...

Describe networking. Networking refers to the inter connection among computers and peripherals for data communication. Networking can be done using wired cabling or by wireless

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