Brainscape's Knowledge GenomeTM

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


See full index

ESAT (Data Comms and Networking (3rd Ed.) by Berhouz A. Forouzan) > ESAT Forouzan - Chapter 21: Unicast and Multicast Routing (Routing Protocols) > Flashcards

ESAT Forouzan - Chapter 21: Unicast and Multicast Routing (Routing Protocols) Flashcards

1
Q

RIP is based on
a. Link state routing
b. Distance vector routing
c. Dijkstra’s algorithm
d. Path vector routing

A

b. Distance vector routing

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

In distance vector routing each router receives information directly from _______.
a. Every router on the network
b. Every router less than two units away
c. A table stored by the network hosts
d. Its neighbors only

A

d. Its neighbors only

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

In distance vector routing a router sends out information
a. At regularly scheduled intervals
b. Only when there is a change in its table
c. Only when a new host is added
d. Only when a new network is added

A

a. At regularly scheduled intervals

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

A routing table contains
a. The destination network ID
b. The hop count to reach the network
c. The router ID of the next hop
d. All of the above

A

d. All of the above

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

Router B receives an update from router A that indicates Net1 is two hops away. The next update from A says Net1 is five hops away. What value is entered in B’s routing table for Net1? Assume the basic RIP is being used.
a. 2
b. 3
c. 6
d. 7

A

c. 6

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

If the routing table contains four new entries, how many updates messages must the router send to its neighbour router?
a. 1
b. 2
c. 3
d. 4

A

a. 1

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

The cost field of a router’s first table form itself always has a value of
a. 0
b. 1
c. Infinity
d. Some positive integer

A

a. 0

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

Dijkstra’s algorithm is used to
a. Create LSAs
b. Flood an internet with information
c. Calculate the routing tables
d. Create a link state database

A

c. Calculate the routing tables

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

An area is _______
a. Part of an AS
b. Composed of at least two Ass
c. Another term for an internet
d. A collection of stub areas

A

a. Part of an AS

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

In an autonomous system with n areas, how many areas are connected to the backbone?
a. 1
b. n – 1
c. n
d. n + 1

A

b. n – 1

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

An area border router can be connected to
a. Only another router
b. Another router or another network
c. Anly another network
d. Only another area border router

A

b. Another router or another network

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

Which of the following usually has the least number of connections to other areas?
a. An area
b. An autonomous system
c. A transient link
d. A stub link

A

d. A stub link

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

Which type of network using the OSPF protocol always consists of just two connected routers?
a. Point-to-point
b. Transient
c. Stub
d. Virtual

A

a. Point-to-point

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

Which type of network using the OSPF protocol is the result of a break in a link between the two routers?
a. Point-to-point
b. Transient
c. Stub
d. Virtual

A

d. Virtual

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

Which type of network using the OSPF protocol can have five routers attached to it?
a. Point-to-point
b. Transient
c. Stub
d. All of the above

A

b. Transient

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

A WAN using the OSPF protocol that connects two routers is an example of a _________ type of OSPF network.
a. Point-to-point
b. Transient
c. Stub
d. Virtual

A

a. Point-to-point

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

An Ethernet LAN using the OSPF protocol with five attached routers can be called a ________ network.
a. Point-to-point
b. Transient
c. Stub
d. Virtual

A

b. Transient

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

Which layer produces the OSPF message?
a. Data link
b. Network
c. Transport
d. Application

A

b. Network

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

Which of the following is an exterior routing protocol?
a. RIP
b. OSPF
c. BGP
d. a and b

A

c. BGP

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

Which of the following is an interior routing protocol?
a. RIP
b. OSPF
c. BGP
d. a and b

A

d. a and b

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

OSPF is based on ____________.
a. Distance vector routing
b. Link state routing
c. Path vector routing
d. a and b

A

b. Link state routing

22
Q

BGP is based on ___________.
a. Distance vector routing
b. Link state routing
c. Path vector routing
d. a and b

A

c. Path vector routing

23
Q

Which type of BGP message creates a relationship between two routers?
a. Open
b. Update
c. Keep-alive
d. Notification

A

a. Open

24
Q

Which type of BGP message announces a route to a new destination?
a. Open
b. Update
c. Keep-alive
d. Notification

A

b. Update

25
Q

Which type of BGP message is sent by a system to notify another router of the sender’s existence?
a. Open
b. Update
c. Keep-alive
d. Notification

A

c. Keep-alive

26
Q

Which type of BGP message is sent by a router to close a connection?
a. Open
b. Update
c. Keep-alive
d. Notification

A

d. Notification

27
Q

The ________ is an IGMP message.
a. Query message
b. Membership report
c. Leave report
d. All of the above

A

d. All of the above

28
Q

An IGMP query is sent from a _________ to a _________.
a. Host; host
b. Host; router
c. Router; router
d. Router; host or router

A

d. Router; host or router

29
Q

The ________ is used by a router in response to a received-leave report.
a. General query message
b. Special query message
c. Membership report
d. Leave report

A

b. Special query message

30
Q

The ________ field of the IGMP message is all zeros in a query message.
a. Version
b. Type
c. Checksum
d. Group address

A

d. Group address

31
Q

The _________ field of the IGMP message is 0x11 for a query message.
a. Version
b. Type
c. Checksum
d. a and b

A

d. a and b

32
Q

If four hosts on a network belong to the same group, a total of _________ sent in response to a general query message.
a. One membership report is
b. Two membership reports are
c. Three membership reports are
d. Four membership reports are

A

b. Two membership reports are

33
Q

A one-to-all communication between a source and all hosts on a network is classified as a _________ communication.
a. Unicast
b. Multicast
c. Broadcast
d. a and b

A

c. Broadcast

34
Q

A one-to-many communication between a source and a specific group of hosts is classified as a ________ communication.
a. Unicast
b. Multicast
c. Broadcast
d. a and b

A

b. Multicast

35
Q
  1. A one-to-one communication between a source and one destination is classified as a _________ communication.
    a. Unicast
    b. Multicast
    c. Broadcast
    d. a and b
A

a. Unicast

36
Q

___________ is a multicasting application.
a. Teleconferencing
b. Distance learning
c. Information dissemination
d. All of the above

A

d. All of the above

37
Q

A __________ is a data structure with nodes and edges and a hierarchical structure.
a. Tree
b. Graph
c. Leaf
d. Root

A

a. Tree

38
Q

A system uses source-based trees for multicasting. If there are 100 sources and 5 groups, there is a maximum of _________ different trees.
a. 5
b. 20
c. 100
d. 500

A

d. 500

39
Q

In a _________ tree approach to multicasting, the combination of source and group determines the tree.
a. Spanning-source
b. Shortest-group
c. Source-based
d. Group-shared

A

c. Source-based

40
Q

In a _________ tree approach to multicasting, the group determines the tree.
a. Spanning-source
b. Shortest-group
c. Source-based
d. Group-shared

A

d. Group-shared

41
Q

A system uses group-shared trees for multicasting. If there are 100 sources and 5 groups, there is a maximum of ____________ different trees.
a. 5
b. 20
c. 100
d. 500

A

a. 5

42
Q

___________ is a multicast routing protocol using source-based trees.
a. DVRMP
b. MOSPF
c. CBT
d. a and b

A

d. a and b

43
Q

___________ is a multicast routing protocol using group-shared trees.
a. DVRMP
b. MOSPF
c. CBT
d. a and b

A

c. CBT

44
Q

In _________ a network can receive a multicast packet from a particular source only through a designated parent router.
a. RPF
b. RPB
c. RPM
d. All of the above

A

b. RPB

45
Q

Pruning and grafting are strategies used in
a. RPF
b. RPB
c. RPM
d. All of the above

A

c. RPM

46
Q

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. Plum

A

c. Prune

47
Q

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. Plum

A

b. Graft

48
Q

__________ uses multicast link state routing concepts to create source-based trees.
a. DVMRP
b. MOSPF
c. CBT
d. BVD

A

b. MOSPF

49
Q

In the __________ protocol, a multicast packet is encapsulated inside a unicast packet with the core router as the destination.
a. DVMRP
b. MOSPF
c. CBT
d. BVD

A

c. CBT

50
Q

____________ is used in a dense multicast environment while __________ is used in a sparse multicast environment.
a. PIM-DM; PIM-SM
b. PIM-SM; PIM-DM
c. PIM; PIM-DM
d. PIM; PIM-SM

A

a. PIM-DM; PIM-SM

51
Q

When a multicast router is not directly connected to another multicast router, a _________ can be formed to connect the two.
a. Physical tunnel
b. Logical tunnel
c. Logical core
d. Spanning tree

A

b. Logical tunnel

ESAT (Data Comms and Networking (3rd Ed.) by Berhouz A. Forouzan) (31 decks)

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