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
Token Bus Sublayer Protocol Send for some time then pass token If no data after that pass token right away Traffic classes 0, 2, 4 and 6 (highest) Internal s

Demarcation is the point in which responsibility changes hands.

One of the most popular models for designing parallel algorithms is PRAM (Parallel Random Access Machine). A PRAM consists of unbounded number of processors interrelating with each

What is mesh topology Mesh topology is a setup wherein every device is linked directly to each other device on the network. Consequently, it needs that each device has at least

Name the OSI layer which performs code conversion, code formatting and encryption Ans) Presentation layer performs code conversion, code formatting and encryption

These two command show the cisco IOS filename a) show ver b) show flash

Algorithm:  Odd-Even Transposition //Input: N numbers that are in the unsorted form //Assume that element bi is assigned to pi for I=1 to N { If (I%2 != 0) //i.e Odd


Pipeline Processing Pipelining is a scheme to realize, overlapped parallelism in the proposed way out of a problem on a digital computer in an economical way. To understand the

iLab 2: Office Network Expansion Connect to the iLab here. Submit your assignment to the Dropbox located on the silver tab at the top of this page. (See "Due Da