Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Block 7 Routers > 2A > Flashcards

2A Flashcards

1
Q

Manually Defined by the system administrator as the only path to the destination; they are 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

Are simple to configure and work well in environments where network traffic is relatively predictable and where network design is relatively simple.

A

Static Routes

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

A special static route manually defined by the system administrator as the path to take when no route to destination is known.

A

Default Route

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

A default route is often called what?

A

The Gateway of Last Resort

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

A router to which all non-routable packets are sent?

A

The Gateway of Last Resort

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

A network layer protocol that exchanges information packets with other internetwork routers in order to Build and Maintain a routing table.

A

Dynamically Learned Routes

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

The most dominantly used routing algorithms used today are?

A

RIP, IGRP, OSPF, EIGRP, and BGP

They are popular since the y adjust to changing network circumstances.

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

The most common routing metric is what?

A

Path Length aka Hop Count

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
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
10
Q

Refers to the length of time required to move a packet from source to destination to internetwork.

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

An example would be sending packets over their own lines rather than through the public lines that cost money for usage time.

A

Communication Cost

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

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
15
Q

They provide substantially better throughput, reliability, and shorter convergence times

A

Multi-Path Algorithms

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

The routers are peers for all others.

A

Flat Algorithms

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

Operates in a flat address space, where all routers in a domain must use the same subnet mask, sometimes referred to as Glassful routing.

A

Flat Algorithms

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

This structure is called Classless routing and supports Variable Length Subnet Masks (VLSM)

A

Hierarchical Algorithms

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

Used with Interior Gateway Protocols, they are used to exchange routing information within an Autonomous System or routing domain. Examples are RIP, IGRP, EIGRP, OSPF, and IS-IS

A

Intra-domain algorithms

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

Are used with Exterior Gateway Protocols, and exchange routing information within and between Autonomous systems such as the Internet.

A

Inter-domain algorithms

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

An approach that determines the direction and distance to any link in the internetwork. Also known as Glassful

A

Distance Vector algorithms

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

This form of routing update is often called “routing by rumor” since the routers don’t know where the information originally came from.

A

Distance Vector Algorithms

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

Build a complete topological map of the entire area in memory, which allows them to see the entire path to the destination network ensuring the path is valid and is the best path available.

A

Link State Algorithms

They use multicast link-state advertisements to notify other routers in the routing area

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

What are the three classes of routing protocols?

A

Distance Vector, Link State, and Balanced Hybrid

25
Q

Relatively simple and easy to configure and very reliable

A

Distance Vector Protocols

26
Q

Is considered a pure distance vector routing protocol

A

Routing information protocol (RIP)

Uses a hop count metric to indicate distance and a destination

27
Q

Was developed as a Cisco proprietary protocol and is only available on Cisco devices. Limited by Hop Count and 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)

28
Q

Created in the 1980s as a solution to RIPs inability to handle routing in large, diverse networks. Its a link state routing protocol that only sends information which describes the state of its own links to all the routers within the same hierarchical area.

A

Open Shortest Path First (OSPF)

29
Q

Occurs when the source and destination are in the same area.

A

Intra-area

30
Q

Occurs when the source and destination are in different areas.

A

Inter-area

31
Q

Routers with multiple interfaces can participate in multiple areas.

A

These routers are called Area Border Routers and maintain separate topological databases for each area.

32
Q

In OSPF its responsible for distributing routing information between areas

A

Backbone

33
Q

After a router is powered up and assured that its interfaces are functioning, it uses OSPF Hello Protocol to acquire neighbors, which are routers with interfaces to a common network.

A

OSPF Initialization

34
Q

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

A

Neighborship Database

35
Q

Essentially an overall picture of networks in relationship to routers. Contains the collection of Link State Advertisements received from all routers in the same area.

A

Topological Database

36
Q

The exchange of the Hello Protocol allows the election of a?

A

Designated Router and backup designated router

37
Q

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

A

Designated Router

38
Q

This algorithm uses the information from the topological database to calculate entries for insertion into the routing table.

A

SPF Algorithm

39
Q

It maintains copies of its neighbors routing tables and uses the distance vectors to determine the best paths to destination networks, but resembles link-state protocols in the way it uses topology changes only to trigger link state updates by using multicast messages.

A

EIGRP

40
Q

Each source of routing information, therefore, has an attached measure of its trustworthiness called?

A

Administrative Distance

The lower the distance the more trustworthy

41
Q

The primary function is to exchange routing information between autonomous systems while guaranteeing loop-free path selection.

A

Border Gateway Protocol

42
Q

Advanced distance vector protocol, capable of detecting routing loops and uses many route parameters, called attributes or path vectors, to define routing policies and maintain a stable routing environment.

A

BGP

43
Q

Does not contain any mechanism for automatic neighbor discovery

A

BGP

44
Q

Provide basic traffic management capabilities and can be configured for all routes network protocols.

A

Access Control Lists

45
Q

Filter network traffic by controlling whether routed packets are forwarded or dropped, based on the criteria you specify.

A

Access Control List

46
Q

Provide a basic level of security for access your network.

A

Access Lists

47
Q

What are the two types of Access Lists

A

Standard and Extended

48
Q

Normally permit or deny the entire protocol suite for any packet coming through the router.

A

Standard Access Lists

49
Q

Check both the source and destination addresses as well as specific protocols within the protocol suite and port numbers being used.

A

Extended Access Lists

50
Q

How do you create Access Lists?

A

First step is to create an access list criteria statement or statements, and the second step is to apply the access list to an interface or terminal connection.

51
Q

Access List Standard Number Range?

A

1-99

52
Q

Access List Extended Number Range

A

100-199

53
Q

Due to the implicit ____ _____ as the last access list test every list must have at least on permit statement.

A

“deny any”

54
Q

A wildcard mask bit 0 means?

A

Check the corresponding bit value in the IP address” for an exact match

55
Q

Wildcard mask bit 1 means?

A

Do not check the corresponding bit value in the IP address

56
Q

Inbound access list are processed?

A

Before Routing

57
Q

Outbound access lists are processed?

A

After Routing

58
Q

Places a standard or extended list to a specific router interface to filter traffic through the router interface.

A

Access-Group

59
Q

Places a standard access list on the virtual terminal lines of a router to prevent unauthorized access via telnet?

A

Access-Class

Block 7 Routers (4 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions