A multicast router may receive thousands of multicast (6) every day for different groups. If a router has no knowledge about the membership status of the (7) , it must broadcast all of these packets. This creates a lot of traffic and consumes (8) . A better solution is to keep a list of groups in the network for which there is at least one loyal member. (9) helps the multicast router create and update this list. For each group, there is one router that has the duty of distributing the (10) packets destined for that group. This means that if there are three multicast routers connected to a network, their lists of groupids are mutually exclusive. A host or multicast router can have membership in a group.

（7）是（）

A:routers B:network C:packets D:hosts

A multicast router may receive thousands of multicast（）every day for different groups. If a router has no knowledge about the membership status of the（）, it must broadcast all of these packets. This creates a lot of traffic and consumes（）. A better solution is to keep a list of groups in the network for which there is at least one loyal member.（）helps the multicast router create and update this list. For each group, there is one router that has the duty of distributing the（）packets destined for that group. This means that if there are three multicast routers connected to a network, their lists of groupids are mutually exclusive. A host or multicast router can have membership in a group.

If a router has no knowledge about the membership status of the（）, it must broadcast all of these packets.

A:routers B:network C:packets D:hosts

One of the most widely used routing protocols in IP networks is the Routing Information Protocol (RIP). RIP is the canonical example of a routing protocol built on the ___25___ algorithm. Routing protocols in intemetworks differ slightly from the idealized graph model. In an internetwork, the goal of the routers to forward packets to various ___26___.
Routers running RIP send their advertisement about cost every ___27___ seconds. A router also sends an update message whenever an update from another router causes it to change its routing table.
It is possible to use a range of different metrics or costs for the links in a routing protocol. RIP takes the simplest approach, with all link costs being equal ___28___. Thus it always tries to fend the minimum hop route. Valid distances are 1 through ___29___. This also limits RIP to running on fairly small networks.

26（）

A:computers B:Routers C:switches D:Networks

One of the most widely used routing protocols in IP networks is the Routing Information Protocol(RIP)．RIP is the canonical example of a routing protocol built on the (71) algorithm．Routing protocols in internetworks differ slightly from the idealized graph model．In aninternetwork，the goal of the routers to forward packets to various (72) ．
Routers running RIP send their advertisement about cost every (73) seconds．A router also sends an update message whenever an update from another router causes it to change itsrouting table．
It is possible to use a range of different metrics or costs for the links in a routing protocol．RIP takes the simplest approach，with all link costs being equal (74) Thus it always tries tofind the minimum hop route．Valid distances are 1 through (75) ．This also limits RIP torunning on fairly small networks．

A:computers B:routers C:switches D:networks

One of the most widely used routing protocols in IP networks is the Routing Information Protocol(RIP)．RIP is the canonical example of a routing protocol built on the (71) algorithm．Routing protocols in internetworks differ slightly from the idealized graph model．In aninternetwork，the goal of the routers to forward packets to various (72) ．
Routers running RIP send their advertisement about cost every (73) seconds．A router also sends an update message whenever an update from another router causes it to change itsrouting table．
It is possible to use a range of different metrics or costs for the links in a routing protocol．RIP takes the simplest approach，with all link costs being equal (74) Thus it always tries tofind the minimum hop route．Valid distances are 1 through (75) ．This also limits RIP torunning on fairly small networks．

（72）处应填（）。

A:computers B:routers C:switches D:networks

A multicast router may receive thousands of multicast (6) every day for different groups. If a router has no knowledge about the membership status of the (7) , it must broadcast all of these packets. This creates a lot of traffic and consumes (8) . A better solution is to keep a list of groups in the network for which there is at least one loyal member. (9) helps the multicast router create and update this list. For each group, there is one router that has the duty of distributing the (10) packets destined for that group. This means that if there are three multicast routers connected to a network, their lists of groupids are mutually exclusive. A host or multicast router can have membership in a group.

A:routers B:network C:packets D:hosts

A multicast router may receive thousands of multicast（）every day for different groups. If a router has no knowledge about the membership status of the（）, it must broadcast all of these packets. This creates a lot of traffic and consumes（）. A better solution is to keep a list of groups in the network for which there is at least one loyal member.（）helps the multicast router create and update this list. For each group, there is one router that has the duty of distributing the（）packets destined for that group. This means that if there are three multicast routers connected to a network, their lists of groupids are mutually exclusive. A host or multicast router can have membership in a group.

If a router has no knowledge about the membership status of the（）, it must broadcast all of these packets.

A:routers B:network C:packets D:hosts

A multicast router may receive thousands of multicast （） every day for different groups. If a router has no knowledge about the membership status of the （） , it must broadcast all of these packets. This creates a lot of traffic and consumes （）. A better solution is to keep a list of groups in the network for which there is at least one loyal member. （） helps the multicast router create and update this list. For each group, there is one router that has the duty of distributing the （） packets destined for that group. This means that if there are three multicast routers connected to a network, their lists of groupids are mutually exclusive. A host or multicast router can have membership in a group.

If a router has no knowledge about the membership status of the （）, it must broadcast all of these packets.

A:routers B:network C:packets D:hosts