Answer Posted / vikramsingh11

Link-state algorithms are also known as Dijkstras algorithm
or as SPF (shortest path first) algorithms.

Link-state routing algorithms maintain a complex database of
topology information.

The distance vector algorithm are also known as Bellman-Ford
algorithms. They have nonspecific information about distant
networks and no knowledge of distant routers.

A link-state routing algorithm maintains full knowledge of
distant routers and how they interconnect. Link-state
routing uses:

Link-state advertisements (LSAs)
A link-state advertisement (LSA) is a small packet of
routing information
that is sent between routers.

Topological database
A topological database is a collection of information
gathered from LSAs.

SPF algorithm
The shortest path first (SPF) algorithm is a calculation
performed on the
database resulting in the SPF tree.

Routing tables – A list of the known paths and interfaces

Tell me which protocol comes under hybrid dynamic type?

1095

---

How many valid ip will b in /21 in route summarization?

1177

---

What is the difference between rip and igrp?

1151

---

What are segments?

1188

---

Which table find best path?

1142

---

Define logical topology.

1136

---

What are the steps of conversion for data encapsulation?

1434

---

Which protocol comes under hybrid dynamic type?

1206

---

Explain the term 'unicast'.

1225

---

Hi Jitendera, Wat do u do..?? I mean r u working anywhere???? Basically where r u from??? If u don't hv any problem, u can say..?? Or else mail me mr.shahin07@gmail.com

2580

---

What is the size of hello packets in eigrep protocol?

1240

---

Hi, Can any one please tell me the experience of their CCNA interview,and please tell me all the questions they asked in the interview. Many Thanks...

2223

---

What is the simplest way to remotely configure a router?

1148

---

What is the difference between arp and rarp?

1172

---

Tell us the name of best path in eigrp protocol?

1214

---