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

What is poe (power over ethernet)?

757

---

Can you explain VPN tunneled packet in detail?

1710

---

What is a switch and why we are using switches?

721

---

How many hop counts are by default and how much you can increase in eigrp protocol?

739

---

What is the key advantage of using a switches?

728

---

---

Which ipsec rule is used for the olympia branch and what does it define? (Choose two)

701

---

What are the different memories used in a CISCO router?

794

---

When ospf protocol advertise its routing table?

739

---

Which protocol works only on cisco routers?

713

---

What are the possible ways of data exchange in ccna?

734

---

What is the Difference Between Windows 2003 And Windows 2008 Server?

1619

---

After how long keep alive messages exchange in eigrp?

730

---

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...

1777

---

What is the meaning of synchronization?

799

---

What are the advantages of layered model in networking industry?

790

---