Gossip: Multicast Problem at 09:44

Which of the following is FALSE about a NAK in a

tree-based multicast protocol?
1. It is used to send negative acknowledgments to
a sender or designated receiver.
2. It may result in some of the multicast messages
being retransmitted.
3. NAKs may cause message implosion.
4. NAKs cannot be used if IP multicast in the
underlying network is used.
ANSWER: 4.

Gossip: The Gossip Protocol at 03:28

The gossip-based protocol described so far (select all
correct answers):
1. Is executed periodically at each node
2. Receives only one copy of each multicast message
at each node
3. Can turn an infected node into an uninfected node
4. Can turn an uninfected node into an infected node

ANSWERS: 1, 4.

Gossip: Gossip Analysis at 12:41

Which of the following is faster in the second half
of gossip spread?
1. Push gossip
2. Pull gossip
ANSWER: 2.

Gossip: Gossip Analysis at 14:58

In a datacenter topology with top of the rack switches talking to one core switch, there
are 2 racks, each with N/2 nodes from the multicast group. The nodes execute push
gossip. If each node picks a gossip target outside its rack with probability (1/N), and
gossip targets are selected uniformly at random from the target subgroup, the time to
disseminate a gossip is:
1. O(log(N))
2. O(N)
3. O(log(log(N))
ANSWER: 1.

Gossip: Gossip Implementations at 03:24

Which of the following uses gossip (select all
correct answers):
1. Cassandra
2. NNTP
3. Some sensor network protocols
4. Clearinghouse project developed by Xerox
ANSWER: 1, 2, 3, 4.