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
What are proxy servers and how do they protect computer networks? Proxy servers primarily stop external users who identifying the IP addresses of an internal network. Without i

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Determine the term- Web Server and Webmaster Web Server: A host computer that stores Web pages and responds to requests for viewing. Web servers communicate with Web browse

DLCI- Data Link Connection Identifier. A frame-relay service provider usually assigns DLCI values that are used by frame-relay to distinguish among different virtual circuits on th

Question: a) Explain briefly three typical network topologies giving one advantage and one disadvantage of each topology. Explain the three topologies with appropriate diagrams

can i get a sample networking project for 20 computer with all network components?

Large data packets result in fewer load because a smaller part of the packet is used for header information. Optimum networks use 4kB data packets or larger. Large data packets

A.) JPEG and PICT B.) MPEG and MIDI C.) ASCII and EBCDIC For example, the Presentation layer would be liable for changing from EDCDIC to ASCII. Data compression, decompres

CONNECTION MULTIPLEXING:  In various circumstances transceiver can be in convenient e.g. workstations in a LAN. Connection multiplexer acts multiple computers to a single tran

Question: a) In relation to network design, give two reasons why the building-block approach is favoured to the traditional approach. b) Explain the following steps in rela