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

A default route is analogous to a, A default route is analogous to a defaul...

A default route is analogous to a default gateway. It is used to decrease the length of routing tables and to give complete routing capabilities when a router may not know the rout

Explain 10base-T- twisted pair ethernet, 10Base-T: Twisted Pair Ethernet ...

10Base-T: Twisted Pair Ethernet Most popular standard simplest to install and reconfigure Star topology LAN utilize UTP cable no need for AUI It supports data rag

Transmission robustness and security, Transmission robustness and security ...

Transmission robustness and security Unless properly designed, a wireless LAN might be interference prone and simply eavesdropped. The design of a wireless LAN must allow relia

What are the rules for writing on the web? explain, Question 1 How can one...

Question 1 How can one set up internet on a PC and test it?? Explain Setting up a new connection Testing internet connection Question 2 What are the rules for wri

Karnaugh map, Qustions: Simplify the following expression using a Karna...

Qustions: Simplify the following expression using a Karnaugh map: F = XY‾Z + X‾Y‾Z + XY Z +X‾ Y Z

Ospf - open shortest path first , OSPF ( open Shortest Path First) Open...

OSPF ( open Shortest Path First) Open shortest  path first  is a routing  protocols  developed for internet protocols networks by the  interior  gateway protocols working group

Describe asynchronous vs. synchronous transmission, Serialized data is not ...

Serialized data is not generally sent at a uniform rate by a channel. Instead, there is usually a burst of regularly spaced binary data bits followed by a pause, after which the da

Describe in brief about tree topology, Tree topology Comments 1 -...

Tree topology Comments 1 - This features star nodes on a bus network 2 - All the disadvantages and advantages of both types of networks described above apply to this s

Explain the multipath resistance, Explain the Multipath resistance The ...

Explain the Multipath resistance The chipping codes used for CDMA not only exhibit low cross-correlation but also low autocorrelation. Thus, a version of the signal that is del

Illustrate the working of networking bus topology, Illustrate the working o...

Illustrate the working of networking Bus Topology All stations attach, by appropriate hardware interfacing called as a tap, directly to a linear transmission medium, or bus. F

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