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

Ask an Expert

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

Write your message here..

Related Questions

Additional bandwidth does each scheme require, Recalling two FEC schemes fo... Recalling two FEC schemes for internet phone described. Suppose the first scheme generates a redundant chunk for every four original chunks. Suppose the second scheme uses a low-ra

What are the advantages of star topology, What are the advantages of Star T... What are the advantages of Star Topology? The advantages of star topology are: a. Relatively easy to configure. b. Simple to troubleshoot c. Media faults are automatic

What is a protocol, What is a protocol? The term protocol refers to a s... What is a protocol? The term protocol refers to a set of rules and process that govern the transmission of messages over a physical networking medium. The most common network p

What is a management information base, What is a Management Information Bas... What is a Management Information Base (MIB)? A Management Information Base is part of each SNMP-managed device. Every SNMP agent has the MIB database that having information ab

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

What are the data link protocols, What are the Data link protocols? Dat... What are the Data link protocols? Data link protocols are sets of specifications used to implement the data link layer. The categories of Data Link protocols are 1. Asynchro

Nfs, what is this ? what is this ?

Hierarchical addressing and routing, The steps of forwarding the packets of... The steps of forwarding the packets of information is known routing. The information about receivers is saved in routing tables. Note that several entries have same next hop. It is

Explain the acknowledged connectionless service, Explain the Acknowledged c... Explain the Acknowledged connectionless service This is a cross between the previous two services. It provides that datagrams are to be acknowledged, but no prior logical conne

Asynchronous transfer mode (atm), Telephone companies (Telco's) stated ATM ... Telephone companies (Telco's) stated ATM to meet various goals. It gives universal service for all support and subscribers for all users for video, voice and data. It has a single