Comparison of distance-vector and link-state algorithm, Computer Networking

DISTANCE-VECTOR ROUTING:

  • It is easy to implement.
  • Packet switch modifies its own routing table first.
  • It is used in RIP.

LINK-STATE ALGORITHM:

  • It is very complex.
  • Switches operates independent computations.
  • It is used in OSPF.
Posted Date: 7/31/2012 7:10:45 AM | Location : United States







Related Discussions:- Comparison of distance-vector and link-state algorithm, Assignment Help, Ask Question on Comparison of distance-vector and link-state algorithm, Get Answer, Expert's Help, Comparison of distance-vector and link-state algorithm Discussions

Write discussion on Comparison of distance-vector and link-state algorithm
Your posts are moderated
Related Questions
Determine about the Tree Topology A generalization of the bus topology. The transmission medium is a branching cable with no closed loops. The tree layout begins at a point kno

802.11 FHSS Frequency-hopping spread spectrum in a 2.4 GHz band Carrier sends on one frequency for short duration then hops to another frequency for same duration, hops agai

Station Types No-transition mobility moreover stationary or moving only inside a BSS BSS-transition mobility is able to move from one BSS to another, but confined inside one

Recognize the mode reflected by the following prompt 'Router '? Ans) RXBoot

Dimensionality of Interconnection Network Dimensionality refers the arrangement of processing elements or nodes in an interconnection network. In linear network or single dimen


Problem 1 Describe the architecture of the TCP/IP protocol suite Problem 2 Describe the principle of operation of REXEC protocol Problem 3 Describe the concept

Parallel Computer Architecture The two key parametric concerns in designing parallel computer architecture are: 1) executing many numbers of instructions concurrently, and

network diagram which must include at least 2router,2bridge and 4 switches and must have different protocols and different cable...?

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