Dijkstra algorithms - network layer and routing , Computer Networking

Assignment Help:

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

 


Related Discussions:- Dijkstra algorithms - network layer and routing

Describe in details about applications of computer networks, Describe in de...

Describe in details about applications of Computer Networks ?

Fiber optic extension, FIBER OPTIC EXTENSION:  The LAN extension using f...

FIBER OPTIC EXTENSION:  The LAN extension using fiber optic is given in the figure below:   Figure The fiber-modem translates digital data into pulses of light the

Explain fddi media, FDDI Media FDDI signifies a 100 Mbps token-passing ...

FDDI Media FDDI signifies a 100 Mbps token-passing dual-ring LAN that uses a fiber-optic transmission medium. Even though it operates at faster speeds FDDI is similar to Tok

Determine the term- web server and webmaster, Determine the term- Web Serve...

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

Mesh, Mesh It is of two dimensional network.  In this every processi...

Mesh It is of two dimensional network.  In this every processing elements are arranged in a two dimensional grid. The processor are in rows i and column j are denoted by PEi

Describe network infrastructure design, Question : a) Explain why perv...

Question : a) Explain why pervasive computing can be termed as a "technology that disappears". b) List and briefly explain four main components of a MOTE used in Wireless

Explain fat tree interconnection network, Fat tree: It is a customized ver...

Fat tree: It is a customized version of tree network. In this network bandwidth of edge (or connecting wire between nodes) increases in the direction of root. It's a more realisti

Define character stuffing, Define Character Stuffing? In byte stuffing ...

Define Character Stuffing? In byte stuffing (or character stuffing), a particular byte is added to the data section of the frame when there is a character with the same pattern

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