Dijkstra algorithms - network layer and routing , Computer Networking

Dijkstra Algorithms

To calculate its  routing  table  each router applies an algorithm  called  the dijkstra algorithm to its  state database. The dijkstra algorithm  calculates the shortest path between two points on a network using a graph using a made up of nodes and arcs. Notes  are of two  types networks and routers. Arcs  are the connection between  a router  and a network ( router to network  and network  to router). Cost is applied  only to the are from router to network.  The cost  of the  from  network  to router is always zero .

 

Costs in the  dijkstra algorithm

 

Posted Date: 3/16/2013 3:21:22 AM | Location : United States







Related Discussions:- Dijkstra algorithms - network layer and routing , Assignment Help, Ask Question on Dijkstra algorithms - network layer and routing , Get Answer, Expert's Help, Dijkstra algorithms - network layer and routing Discussions

Write discussion on Dijkstra algorithms - network layer and routing
Your posts are moderated
Related Questions
The relationship between dotted decimal notation and classes is shown as follows. In class A the three octets managed to a host suffix. In class B the last most two octets ar

I have a larget text file of 1MB, how do i break down into chunks of packets to send over UDP? byte b[]=new byte[1024]; FileInputStream f=new FileInputStream("input.txt

is DVMRP multicast prtocol supports IPV6?

Advantages of LS over DV algorithm There  are a number of advantages to link  state  protocols  especially when  compared to  the distance vector based  routing  protocols. The


At the minimum level most networks sends individual packets of data and the network needs each packet to follow an exact format dictated by the hardware, which is known service par

Categories to access the Intranet Persons who can find access to the Intranet can be put into three categories. 1.  Those who can enter the site 2.  Those who can access


Determine the term - Mobility Mobility refers to the types of physical transitions that can be done by a mobile node within an 802.11 environment (no transition, movement from

Hyper Cube: A Hypercube interconnection network is an expansion of cube network. For n=3, Hypercube interconnection network may be described recursively in this manner:  For n