Handout 6 Flashcards

1
Q

These routes are manually configured by network administrators, have low system requirements, and apply to simple, stable, and small networks. The disadvantage of static routes is that they cannot automatically adapt to network topology changes and so require manual intervention

A

static routes

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

are used only when packets to be forwarded do not match any routing entry in an IP routing table.

A

default routes

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

On the Internet, routers need to exchange routing information in the interconnection of networks called

A

autonomous systems (AS or domains)

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

The autonomous systems are connected together in the form of a network called

A

core network (backbone)

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

meant to dynamically route data across a network that you fully control and maintain. Basically, interior protocols are meant to dynamically route data across a network that you fully control and maintain

A

interior gateway protocol (IGP)

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

used to exchange routes between distinctly separate networks that you have no administrative control over. BGP is the routing protocol used on the Internet; therefore, the most common enterprise use is to run BGP on your internet edge when connecting to your ISP

A

exterior gateway protocol (EGP)

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

determine good paths (routes) from senders to receivers through the network of routers

A

routing algorithms

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

finds a path between the source and destination with the least cost

A

least-cost path

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

path with the smallest number of links between the source and the destination

A

shortest path

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

In this type of routing, all the routers send their neighboring routers

A

distance-vector routing protocol

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

a commonly used distance vector routing that uses its routing metric to determine the best route or shortest path a packet has to traverse from the source to a destination over a network. RIP is a distance-vector IGP and has a preference of 100

A

routing information protocol (RIP)

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

number of routers through which a packet passes to reach its destination

A

hop count

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

In this type of routing, each of the routers sends the state of its own interfaces to all other routers only when there is a change to report. Each router uses the received information to recalculate the best path to each network and then saves this information in its routing table

A

link-state routing protocol

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

description of the router interface

A

link-state (LS)

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

the cost of sending data packets on the interface, expressed in the link state metric.

A

output cost

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

these are other routers that are attached through the link-state

A

list of neighboring routers

17
Q

an OSPF data packet containing link-state and routing information that is shared with the other routers

A

link-state advertisement (LSA)

18
Q

a unit of data describing the local state of router’s interfaces and adjacencies. The collected LS advertisements of all routers and networks form the LSDB

A

link-state PDU

19
Q

a collection of all LS PDUs originated from the area’s routers. Each router advertises directly connected networks via LS POU.

A

link-state datebase (LSDB)

20
Q

a link-state routing protocol develope by the IETF in 1988 that is capable of quickly detecting topological changes within the autonomous system and establishing loop-free routes in a short period of time, with minimum additional communication overhead for negotiating topology changes between peering routers

A

open shortest path first (OSPF)

21
Q

a special data packet (message) that is sent out periodically from a router to establish and confirm network adjacency relationships to other routers in the OSPF

A

HELLO packet

22
Q

contains information, such as the destination IP address, cost, and next-hop IP address, which guides packet forwarding

A

OSPF routing table

23
Q

is the ISO name for a router, it is the communication between intermediate systems or routers

A

intermediate system (IS)

24
Q

a device on the network, such as a server or workstation (hosts)

A

end system (ES)

25
Q

a network service in the OSI stack

A

connection-less network service (CLNS)

26
Q

a layer-3 address for CLNS packets, this is like an IP address in the TCP/IP stack. IS-IS uses this to address for communication not IP addresses

A

network service access point (NSAP)

27
Q

a router in a normal area that does not connect to another area (red)

A

level 1

28
Q

a backbone router that does not connect to other areas (green)

A

level 2

29
Q

a router in a normal or backbone area that connects different areas (blue)

A

level 1-2