Answer / 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 are two characteristics of the RARP protocol? (Choose two) A. it generates parameter problem messages B. it maps IP addresses to Ethernet addresses C. it maps Ethernet addresses to IP addresses D. it is implemented directly on top of the data link layer

1 Answers  

---

What is the default routing metric used by IGRP? A.) MTU, delay, bandwidth, reliability, and loading B.) Count to infinity C.) Bandwidth and delay D.) Hop count

2 Answers  

---

Define the multicast routing?

0 Answers  

---

in the ospf area network dr and bdr selection procedure occur let there are 4 router in that n/w r1 have the higher priority then r2 and r2 have higher priority then r3 and so on like that r1>r2>r3>r4 now as we know that selection of dr and bdr based upon the router priority so in this case r1 will be dr and r2 will be bdr now my question is that if i am going to implement 5th router which have greater priority then r1 then will it become dr atomically remember that i am not going change my 5 or 1st router property answer that one please

4 Answers  

---

Which layer defines the physical topology? A.) Application B.) Transport C.) Network D.) Data Link E.) Physical F.) Session

1 Answers  

---

---

Which command displays all the commands in the history buffer? A. CTRL H B. show buffer C. show history D. show history buffer

2 Answers  

---

There is a process in Frame-Relay where LMI resolves an IP address from a DLCI number. What is this called? A.) arp B.) inverse arp C.) rarp D.) automap E.) reverse arp F.) arp

2 Answers  

---

The Network layer works with which of the following: A.) Globules B.) Bits C.) Packets D.) Segments E.) Frames

3 Answers  

---

What does the IPX maximum-path command do? A.) Allows you to disable the TTL on an IPX packet B.) This parameter is only used in NLSP routing C.) Sets the maximum metric that can appear in the routing table D.) Configures round robin load sharing over multiple equal metric paths (parallel paths)

1 Answers  

---

Which element is used to define the rate in bits per second that a Frame Relay switch agrees to transfer data? A. clock rate (CP) B. Committed Information Rate (CIR) C. Local Management Interface (LMI) D. data link connection identifier (DICI) E. Committed Rate Measurement Intercal (CRIMI)

2 Answers  

---

mention the funtions about connection oriented and connectionless protocol and how it works ?

7 Answers  

---

Which two of the following are valid ways to have multiple encapsulation types on a single interface? A.) This is not possible B.) subinterfaces C.) additional physical interfaces D.) secondary addresses

1 Answers  

---