Block 6/ 2A Flashcards

0
Q

Special static ROUTE manually defined by the system administrator as the path to take when no ROUTE to the destination is known.

A

Default ROUTES

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
1
Q

Manually defined by the system administrator as the only path to the destination.

Useful for controlling security and reducing traffic

A

Static Routes

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

__________ is another name for a default route. Router to which all non-routable packets are sent

A

Gateway of Last Resort

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

__________ is defined as a network that is NOT listed in a router’s routing table.

A

Non-Routable

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

A ___________ is a NETWORK LAYER protocol that exchanges information packets with otter inter work routers in order to build and maintain a routing table.

A

Dynamically learned routes (Routing Protocol)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

List some common metrics:

A
Path length
Reliability
Delay
Bandwidth
Load
Communication cost
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

______ is the MOST COMMON routing metric.

Sum of the costs associated with each link traversed.

A

Path length

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Metric that specifies the number of passes through internetworking devices, such as routers.

A

Hop Count

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

_______ refers to the dependability of each network link.

A

Reliability

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

_____ refers to the length of time required to move a packet from source to destination through the internetwork.

A

Delay

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

_____ is a conglomeration of several important variables. Common and useful metric.

A

Delay

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Refers to the available traffic capacity of a link.

A

Bandwidth

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

____ refers to the degree to which a network resource, such as a router, is busy

A

Load

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Metric that is set by the Network Administrator

A

Communication Cost

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

_______ __________ initialize and maintain routing tables.

A

Routing Algorithms

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

What are the classification of algorithms?

A

Single-Path or Multi-Path
Flat or Hierarchical
Intra-domain or Inter-domain
Distance vector or Link state

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

_____ ____ algorithms send packets to a destination using the same or SINGLE PATH unless there is a topology change that affects the available route.

A

Single-Path algorithms

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

_____ ____ algorithms support multiple paths to the same destination by LOAD BALANCING or load sharing.

A

Multi-Path algorithms

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

____ algorithms in a flat routing system, the routers are peers of all others.

Sometimes referred to as “Classful” routing

A

Flat algorithms

19
Q

____________ algorithms is called “Classless” routing and supports Variable Length Subnet Masks (VLSM).

A

Hierarchical algorithms

20
Q

____________ ______ Routing system that often designates logical groups of nodes, called domains, autonomous systems, or areas.

A

Hierarchical System

21
Q

Work only within a routing domain and are used with Interior Gateway Protocols.

A

Intra-domain algorithms

22
Q

______-_______ algorithms are used with EXTERIOR Gateway Protocols (EGP).

A

Inter-Domain Algorithms

23
Q

_____-______ algorithms exchange routing information within and between Autonomous System such as on the internet

A

INTER-domain algorithms

24
Q

________ ______ algorithms use an approach that determines the direction and distance to any link in the internetwork.

Known as Classful routing

A

Distance Vector algorithms

25
Q

An advantage of ______ ______ is that they are simple to understand and configure as well as not requiring much from the routers processor to maintain the routing table.

A

Distance Vector algorithm

26
Q

Limited hop count and being update by broadcast are disadvantages of _______ ______

A

Distance Vector

27
Q

____ _____ algorithms are also known as shortest path first algorithms.

A

Link State Algorithms

28
Q

____ _____ algorithms send small updates everywhere.
Less prone to routing loops
and move expensive to implement and support.

A

Link State algorithms

29
Q

Distance Vector, Link State and Balanced Hybrid are examples of:

A

Classes of Protocols

30
Q

Which protocols are examples of the distance vector protocol?

A

Router information protocol (RIP) and

Interior gateway routing protocol (IGRP)

31
Q

This protocol is considered a pure distance vector routing protocol and periodically sends complete routing table updates to it’s neighbor.

Max allowable hop out is 15

A

Routing information protocol (RIP)

32
Q

This distance vector protocol is only available on Cisco devices.

A

Interior gateway routing protocol (IGRP)

33
Q

Uses an autonomous system number to only share routing information with other routers that are configured with the same number.

A

Interior gateway routing protocol (IGRP)

34
Q

Max hop count is 255 with a normal spanning about 100 hops.

A

Interior gateway routing protocol (IGRP)

35
Q

This system is NOT Cysco specific and only sends information which describes the state of it’s own links to all the routers within the SAME hierarchical area

A

Open shortest path first (OSPF)

36
Q

What is the largest entity within the hierarchy of open shortest path first (OSPF)?

A

Autonomous System (AS)

37
Q

INTRA-area & INTER-areas are two different types of____?

A

Open shortest path first (OSPF)

38
Q

_____ ____ routing occurs when the source and destination are in the same area.

A

INTRA-Area

39
Q

_____ ____ routing occurs when they are in different areas.

A

INTER-area routing

40
Q

Responsible for distributing routing information between areas.

A

Backbone

41
Q

____ ______________ uses the open shortest path first (OSPF) HELLO protocol

A

OSPF Initialization

42
Q

When a router discovers a new neighbor, it records the neighbors address and interface as an entry in ____________ _________

A

Neighborship Database

43
Q

______ ______ is an overall picture of networks in relationship to routers.

A

Topological Database

44
Q

_____ ______ Responsible for generating Link State Advertisements for the entire area so only one router is responsible for sending multicast updates.

A

Designated Router

45
Q

_______ algorithm that uses the information from the topological database to calculate entries for insertion into the routing table

A

(SPF) algorithm