 |
1 | |
In _______ delivery, both the deliverer of the IP packet and the destination are on the same network. |
|
| | A) | a connectionless |
| | B) | a direct |
| | C) | an indirect |
| | D) | none of the above |
|
2 | |
In _______ delivery, the deliverer of the IP packet and the destination are on different networks. |
|
| | A) | a connection-oriented |
| | B) | a direct |
| | C) | an indirect |
| | D) | none of the above |
|
3 | |
In _______ forwarding, the full IP address of a destination is given in the routing table. |
|
| | A) | next-hop |
| | B) | network-specific |
| | C) | host-specific |
| | D) | default |
|
4 | |
In _______ forwarding, the mask and destination addresses are both 0.0.0.0 in the routing table. |
|
| | A) | next-hop |
| | B) | network-specific |
| | C) | host-specific |
| | D) | default |
|
5 | |
In _______ forwarding, the destination address is a network address in the routing table. |
|
| | A) | next-hop |
| | B) | network-specific |
| | C) | host-specific |
| | D) | default |
|
6 | |
In _______ forwarding, the routing table holds the address of just the next hop instead of complete route information. |
|
| | A) | next-hop |
| | B) | network-specific |
| | C) | host-specific |
| | D) | default |
|
7 | |
The idea of address aggregation was designed to alleviate the increase in routing table entries when using ________. |
|
| | A) | classful addressing |
| | B) | classless addressing |
| | C) | both a and b |
| | D) | none of the above |
|
8 | |
The principle of ________ states that the routing table is sorted from the longest mask to the shortest mask. |
|
| | A) | first mask matching |
| | B) | shortest mask matching |
| | C) | longest mask matching |
| | D) | none of the above |
|
9 | |
The use of hierarchy in routing tables can ________ the size of the routing tables. |
|
| | A) | reduce |
| | B) | increase |
| | C) | both a and b |
| | D) | none of the above |
|
10 | |
_______ deals with the issues of creating and maintaining routing tables. |
|
| | A) | Forwarding |
| | B) | Routing |
| | C) | Directing |
| | D) | None of the above |
|
11 | |
A _______ routing table contains information entered manually. |
|
| | A) | static |
| | B) | dynamic |
| | C) | hierarchical |
| | D) | none of the above |
|
12 | |
A _______ routing table is updated periodically using one of the dynamic routing protocols. |
|
| | A) | static |
| | B) | dynamic |
| | C) | hierarchical |
| | D) | none of the above |
|
13 | |
The input and output ports of a router perform the ________ layer functions of the router. |
|
| | A) | physical and data link |
| | B) | network |
| | C) | transport |
| | D) | none of the above |
|
14 | |
The routing processor of a router performs the ________ layer functions of the router. |
|
| | A) | physical and data link |
| | B) | network |
| | C) | transport |
| | D) | none of the above |
|
15 | |
The task of moving the packet from the input queue to the output queue in a router is done by _________. |
|
| | A) | input and output ports |
| | B) | routing processor |
| | C) | switching fabrics |
| | D) | none of the above |
|
16 | |
A static table is one _______. |
|
| | A) | with manual entries |
| | B) | which is updated automatically |
| | C) | either a or b |
| | D) | none of the above |
|
17 | |
A dynamic table is one _______. |
|
| | A) | with manual entries |
| | B) | which is updated automatically |
| | C) | either a or b |
| | D) | none of the above |
|
18 | |
For purposes of routing, the Internet is divided into ___________. |
|
| | A) | wide area networks |
| | B) | autonomous networks |
| | C) | autonomous systems |
| | D) | none of the above |
|
19 | |
____________ is a group of networks and routers under the authority of a single administration. |
|
| | A) | An autonomous system |
| | B) | An area |
| | C) | a and b |
| | D) | none of the above |
|
20 | |
Routing inside an autonomous system is referred to as _______________. |
|
| | A) | interdomain routing |
| | B) | intradomain routing |
| | C) | both a and b |
| | D) | none of the above |
|
21 | |
Routing between autonomous systems is referred to as ____________. |
|
| | A) | interdomain routing |
| | B) | intradomain routing |
| | C) | both a and b |
| | D) | none of the above |
|
22 | |
In _______ routing, the least cost route between any two nodes is the route with the minimum distance. |
|
| | A) | path vector |
| | B) | distance vector |
| | C) | link state |
| | D) | none of the above |
|
23 | |
In ________, each node maintains a vector (table) of minimum distances to every node. |
|
| | A) | path vector |
| | B) | distance vector |
| | C) | link state |
| | D) | none of the above |
|
24 | |
In distance vector routing, each node periodically shares its routing table with _________ and whenever there is a change. |
|
| | A) | every other node |
| | B) | its immediate neighbors |
| | C) | one neighbor |
| | D) | none of the above |
|
25 | |
The Routing Information Protocol (RIP) is an intradomain routing based on _________ routing. |
|
| | A) | distance vector |
| | B) | link state |
| | C) | path vector |
| | D) | none of the above |
|
26 | |
The metric used by _______ is the hop count. |
|
| | A) | OSPF |
| | B) | RIP |
| | C) | BGP |
| | D) | none of the above |
|
27 | |
The _________ routing uses the Dijkstra algorithm to build a routing table. |
|
| | A) | distance vector |
| | B) | link state |
| | C) | path vector |
| | D) | none of the above |
|
28 | |
The Open Shortest Path First (OSPF) protocol is an intradomain routing protocol based on _______ routing. |
|
| | A) | distance vector |
| | B) | link state |
| | C) | path vector |
| | D) | none of the above |
|
29 | |
The _______ protocol allows the administrator to assign a cost, called the metric, to each route. |
|
| | A) | OSPF |
| | B) | RIP |
| | C) | BGP |
| | D) | none of the above |
|
30 | |
In OSPF, a ________ link connects two routers without any other host or router in between. |
|
| | A) | point-to-point |
| | B) | transient |
| | C) | stub |
| | D) | none of the above |
|
31 | |
In OSPF, a _______ link is a network with several routers attached to it. |
|
| | A) | point-to-point |
| | B) | transient |
| | C) | stub |
| | D) | none of the above |
|
32 | |
In OSPF, a ________ link is a network is connected to only one router. |
|
| | A) | point-to-point |
| | B) | transient |
| | C) | stub |
| | D) | none of the above |
|
33 | |
In OSPF, when the link between two routers is broken, the administration may create a _________ link between them using a longer path that probably goes through several routers. |
|
| | A) | point-to-point |
| | B) | transient |
| | C) | stub |
| | D) | none of the above |
|
34 | |
In ________ routing, we assume that there is one node (or more) in each autonomous system that acts on behalf of the entire autonomous system. |
|
| | A) | distant vector |
| | B) | path vector |
| | C) | link state |
| | D) | none of the above |
|
35 | |
___________ is an interdomain routing protocol using path vector routing. |
|
| | A) | BGP |
| | B) | RIP |
| | C) | OSPF |
| | D) | none of the above |
|
36 | |
To create a neighborhood relationship, a router running BGP sends an ________ message. |
|
| | A) | open |
| | B) | update |
| | C) | keepalive |
| | D) | none of the above |
|
37 | |
An area is _______. |
|
| | A) | part of an AS |
| | B) | composed of at least two ASs |
| | C) | another term for an AS |
| | D) | none of the above |
|
38 | |
A one-to-all communication between one source and all hosts on a network is classified as a _______ communication. |
|
| | A) | unicast |
| | B) | multicast |
| | C) | broadcast |
| | D) | none of the above |
|
39 | |
A one-to-many communication between one source and a specific group of hosts is classified as a _______ communication. |
|
| | A) | unicast |
| | B) | multicast |
| | C) | broadcast |
| | D) | none of the above |
|
40 | |
A one-to-one communication between one source and one destination is classified as a _______ communication. |
|
| | A) | unicast |
| | B) | multicast |
| | C) | broadcast |
| | D) | none of the above |
|
41 | |
In ______, the router forwards the received packet through only one of its interfaces. |
|
| | A) | unicasting |
| | B) | multicasting |
| | C) | broadcasting |
| | D) | none of the above |
|
42 | |
In _______, the router may forward the received packet through several of its interfaces. |
|
| | A) | unicasting |
| | B) | multicasting |
| | C) | broadcasting |
| | D) | none of the above |
|
43 | |
Emulation of ________ through ___________ is not efficient and may create long delays. |
|
| | A) | unicasting; multiple unicasting |
| | B) | multicasting; multiple unicasting |
| | C) | broadcasting; multicasting |
| | D) | none of the above |
|
44 | |
In unicast routing, each router in the domain has a table that defines a ______ path tree to possible destinations. |
|
| | A) | average |
| | B) | longest |
| | C) | shortest |
| | D) | none of the above |
|
45 | |
In multicast routing, each involved router needs to construct a ________ path tree for each group. |
|
| | A) | average |
| | B) | longest |
| | C) | shortest |
| | D) | none of the above |
|
46 | |
In the _______ tree approach, each router needs to have one shortest path tree for each group. |
|
| | A) | group-shared |
| | B) | source-based |
| | C) | a or b |
| | D) | none of the above |
|
47 | |
In the group-shared tree approach, _________ involved in multicasting. |
|
| | A) | only the core router is |
| | B) | all routers are |
| | C) | only some routers are |
| | D) | none of the above |
|
48 | |
Multicast link state routing uses the _______ tree approach. |
|
| | A) | source-based |
| | B) | group-shared |
| | C) | a or b |
| | D) | none of the above |
|
49 | |
The Multicast Open Shortest Path First (MOSPF) protocol is an extension of the OSPF protocol that uses multicast routing to create source-based trees. The protocol is based on _______ routing. |
|
| | A) | distance vector |
| | B) | link state |
| | C) | path vector |
| | D) | none of the above |
|
50 | |
MOSPF is a _______ protocol. |
|
| | A) | data-driven |
| | B) | command-driven |
| | C) | both a and b |
| | D) | none of the above |
|
51 | |
_________ broadcasts packets, but creates loops in the systems. |
|
| | A) | Forwarding |
| | B) | Flooding |
| | C) | Backwarding |
| | D) | none of the above |
|
52 | |
In RPF, a router forwards only the copy that has traveled the _______ path from the source to the router. |
|
| | A) | shortest |
| | B) | longest |
| | C) | average |
| | D) | none of the above |
|
53 | |
RPF eliminates the ________ in the flooding process. |
|
| | A) | forwarding |
| | B) | backwarding |
| | C) | flooding |
| | D) | none of the above |
|
54 | |
RPF guarantees that each network receives only ____ of the multicast packet. |
|
| | A) | one copy |
| | B) | two copies |
| | C) | a or b |
| | D) | none of the above |
|
55 | |
RPB creates a shortest path _______ tree from the source to each destination. |
|
| | A) | unicast |
| | B) | multicast |
| | C) | broadcast |
| | D) | none of the above |
|
56 | |
RPB guarantees that each destination receives _________ of the packet. |
|
| | A) | one copy |
| | B) | no copies |
| | C) | multiple copies |
| | D) | none of the above |
|
57 | |
In ________, the multicast packet must reach only those networks that have active members for that particular group. |
|
| | A) | RPF |
| | B) | RPB |
| | C) | RPM |
| | D) | none of the above |
|
58 | |
_______ adds pruning and grafting to _______ to create a multicast shortest path tree that supports dynamic membership changes. |
|
| | A) | RPM; RPB |
| | B) | RPB; RPM |
| | C) | RPF: RPM |
| | D) | none of the above |
|
59 | |
__________ is an implementation of multicast distance vector routing. It is a source-based routing protocol, based on RIP. |
|
| | A) | MOSPF |
| | B) | DVMRP |
| | C) | CBT |
| | D) | none of the above |
|
60 | |
DVMRP is a ________routing protocol, based on RIP. |
|
| | A) | source-based |
| | B) | group-shared |
| | C) | both a and b |
| | D) | none of the above |
|
61 | |
Pruning and grafting are strategies used in _______. |
|
| | A) | RPF |
| | B) | RPB |
| | C) | RPM |
| | D) | none of the above |
|
62 | |
A _______ message tells an upstream router to stop sending multicast messages for a specific group through a specific router. |
|
| | A) | weed |
| | B) | graft |
| | C) | prune |
| | D) | none of the above |
|
63 | |
A _______ message tells an upstream router to start sending multicast messages for a specific group through a specific router. |
|
| | A) | weed |
| | B) | graft |
| | C) | prune |
| | D) | none of the above |
|
64 | |
CBT is a ________ protocol that uses a core as the root of the tree. |
|
| | A) | source-based |
| | B) | group-shared |
| | C) | a or b |
| | D) | none of the above |
|
65 | |
PIM-DM is used in a _______ multicast environment, such as a LAN. |
|
| | A) | dense |
| | B) | sparse |
| | C) | a or b |
| | D) | none of the above |
|
66 | |
PIM-SM is used in a _______multicast environment such as a WAN. |
|
| | A) | dense |
| | B) | sparse |
| | C) | a or b |
| | D) | none of the above |
|
67 | |
In _______, a logical tunnel is established by encapsulating the multicast packet inside a unicast packet. |
|
| | A) | UNIBONE |
| | B) | MULTBONE |
| | C) | MBONE |
| | D) | none of the above |