DocumentCode :
3059913
Title :
A gossip protocol for subgroup multicast
Author :
Jenkins, Kate ; Hopkinson, Ken ; Birman, Ken
Author_Institution :
Cornell Univ., Ithaca, NY, USA
fYear :
2001
fDate :
36982
Firstpage :
25
Lastpage :
30
Abstract :
Gossip-based multicast can be an effective tool for providing highly reliable and scalable message dissemination. We consider the problem of gossiping within overlapping process groups. If each subgroup independently runs a uniform gossip protocol, then the total gossip overhead could be high for a process that is a member of many subgroups. We present a novel gossip protocol that allows individual subgroup members to trade-off update quality for gossip overhead, enabling processes to belong to several subgroups while maintaining a low total gossip overhead. Our results include a mathematical model for message dissemination under this modified gossip protocol, and an algorithm that computes gossip parameters such that all processes within a subgroup achieve their desired update quality
Keywords :
message passing; multicast communication; protocols; gossip protocol; gossip-based multicast; mathematical model; overlapping process groups; scalable message dissemination; subgroup multicast; update quality; Bandwidth; Contracts; File systems; Maintenance; Mathematical model; Monitoring; Multicast algorithms; Multicast protocols; Power system reliability; Telecommunication network reliability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Distributed Computing Systems Workshop, 2001 International Conference on
Conference_Location :
Mesa, AZ
Print_ISBN :
0-7695-1080-9
Type :
conf
DOI :
10.1109/CDCS.2001.918682
Filename :
918682
Link To Document :
بازگشت