A well -defined groups that are numerically large in size but small compared to the network as a whole are used in .......
1.Unicast routing
2.Multicast routing
3.Broadcast routing
4.Telecast routing
A _______ message tells an upstream router to start sending multicast messages for a specific group through a specific router.
1.weed
2.graft
3.prune
4.none of the above
A _______ message tells an upstream router to stop sending multicast messages for a specific group through a specific router.
1.weed
2.graft
3. prune
4.none of the above
CBT is a ________ protocol that uses a core as the root of the tree.
1.source-based
2.group-shared
3.a or b
4.none of the above
Count-to-Infinity problem occurs in .............
1.distance vector routing
2.short path first
3.link state routing
4.hierarchical routing
Distance vector protocols are
1. RIP
2. IGRP(Interior Gateway Routing Protocol )
3.Both a & b
4.None of these
Distance vector routing algorithm is implemented in Internet as ............
1.OSPF
2.RIP
3.ARP
4.APR
DVMRP is a ________routing protocol, based on RIP.
1. source-based
2.group-shared
3.both a and b
4.none of the above
Emulation of ________ through _______ is not efficient and may create long delays.
1.unicasting; multiple unicasting
2.multicasting; multiple unicasting
3.broadcasting; multicasting
4. none of the above
If routing information is automatically updated by routers when changes are made to the network configuration are called
1.Fixed routing
2.Dynamic routing
3.Both a & b
4.Distributed routing
If two or more routers are available in distributed routing, which route should be selected
1.High possible cost
2.Least possible cost
3.Link cost
4.Both B & C
In ........ to send a multicast message a host sends it to the core, which then does the multicast along the spanning tree.
1.Core based Trees
2. AVL trees
3.Binary trees
4.Sparse trees
In adaptive tree walk protocol we use .............. and ............ searching.
1.Graph and Breadth First
2. Tree and Breadth First
3.Graph and Depth First
4. Tree and Depth First
In AODV routing algorithm for MANETs, the route is discovered at time
1. only when the network is established
2.in middle of the transmission
3.when there is a need for route by the host
4.when there is no need for route by the host
In distance vector routing algorithm, each router maintains a separate routing table with the following entries.
1.preferred input line , estimated time
2.preferred input line, estimated distance
3. preferred output line, estimated time
4.preferred output line, router
In distance vector routing algorithm, the routing tables are updated ............
1.by exchanging information with the neighbours
2.automatically
3.using the backup database
4.by the server
In distance vector routing the delay metric is ........
1.number of hops
2. geographical distance
3.number of neighbours
4. queue length
In link state routing, after the construction of link state packets new routes are computed using .......
1.Bellman Ford algorithm
2.DES algorithm
3.Dijkstra's algorithm
4.Leaky bucket algorithm
In multicast routing with spanning tree method, a network with n groups, each with an average of m members, for each group we require .........
1.n pruned spanning trees must be stored for a total of mn trees
2. m pruned spanning trees must be stored for a total of m trees
3.n pruned spanning trees must be stored for a total of n trees
4.m pruned spanning trees must be stored for a total of mn trees
In multicast routing, each involved router needs to construct a ________ path tree for each group.
1.average
2.longest
3.shortest
4.none of the above
In RPF, a router forwards only the copy that has traveled the _______ path from the source to the router.
1. shortest
2.longest
3.average
4.none of the above
In source routing bridges each LAN has a unique ................. bit number.
1. 10
2. 8
3. 16
4.12
In the group-shared tree approach, _________ involved in multicasting.
1.only the core router is
2.all routers are
3.only some routers are
4.none of the above
In the _______ tree approach, each router needs to have one shortest path tree for each group.
1.group-shared
2.source-based
3.a or b
4.none of the above
In unicast routing, each router in the domain has a table that defines a ______ path tree to possible destinations.
1. average
2. longest
3. shortest
4.none of the above
In which routing method do all the routers have a common database?
1.Distance Vector
2.Link Vector
3.Shortest path
4.Link State
In ______, the router forwards the received packet through only one of its interfaces.
1.unicasting
2.multicasting
3.broadcasting
4.none of the above
In _______, a logical tunnel is established by encapsulating the multicast packet inside a unicast packet.
1. UNIBONE
2.MULTBONE
3.MBONE
4.none of the above
In _______, the router may forward the received packet through several of its interfaces.
1.unicasting
2.multicasting
3.broadcasting
4.none of the above
In ________, the multicast packet must reach only those networks that have active members for that particular group.
1.RPF
2.RPB
3.RPM
4.None of the mentioned
Link state packets are built in ........
1.short path first
2.distance vector routing
3.link state routing
4.hierarchical routing
MOSPF is a _______ protocol.
1.data-driven
2.command-driven
3.both a and b
4.none of the above
Multi-path routing can be achieved in
1.Distance-vector type
2.Link-state type
3.Both a & b
4.None of these
Multicast link state routing uses the _______ tree approach.
1. source-based
2.group-shared
3.a or b
4.none of the above
PIM-DM is used in a _______ multicast environment, such as a LAN.
1.dense
2.sparse
3.a or b
4.none of the above
PIM-SM is used in a _______multicast environment such as a WAN.
1. dense
2.sparse
3.a or b
4.none of the above
Pruning and grafting are strategies used in _______.
1.RPF
2.RPB
3.RPM
4.none of the above
RPB creates a shortest path _______ tree from the source to each destination.
1. unicast
2.multicast
3.broadcast
4.none of the above
RPB guarantees that each destination receives _________ of the packet.
1.one copy
2.no copies
3.multiple copies
4.none of the above
RPF eliminates the ________ in the flooding process.
1.forwarding
2.backwarding
3. flooding
4.none of the above
RPF guarantees that each network receives only ____ of the multicast packet.
1.one copy
2.two copies
3.a or b
4.None of the above.
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.
1.distance vector
2.link state
3.path vector
4.none of the above
The processes that keep track of hosts whose home is in the area, but who currently visiting another area is ........
1. Home agent
2.Mobile agent
3.Foreign agent
4.User agent
The routing algorithm within each network is .........
1.Routing information protocol
2.Exterior gateway protocol
3.Interior gateway protocol
4.Middle gateway protocol
To do multicast routing, each router computes a ..........
1.Binary tree
2.AVL tree
3.Spanning tree
4.None of these
Which function allows dumping of invalid packets for a specific network instead of forwarding ?
1.Forwarding function
2.Filtering function
3.Both a & b
4.None of these
Which of the following routing algorithm takes into account the current network load.
1.broadcast
2. shortest path
3.flooding
4. distance vector routing
____ adds pruning and grafting to _______ to create a multicast shortest path tree that supports dynamic membership changes.
1.RPM; RPB
2.RPB; RPM
3.RPF: RPM
4.none of the above
______ broadcasts packets, but creates loops in the systems.
1.Forwarding
2.Flooding
3. Backwarding
4.none of the above
______ is an implementation of multicast distance vector routing. It is a source-based routing protocol, based on RIP.
1.MOSPF
2. DVMRP
3.CBT
4.none of the above