Efficient quorumcast routing algorithms
- 17 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We study the quorumcasting problem which is a generalizationof multicasting. While multicasting consistsof sending a message to a select group of m nodes in asystem of n nodes, quorumcasting sends a message toany q out of these m nodes. The need to communicatewith an arbitrary q-subset of a predefined set arises inmany distributed applications, such as distributed synchronizationand updating a replicated resource. Twostraightforward solutions are to send the message to individual...Keywords
This publication has 17 references indexed in Scilit:
- Probabilistic Multicast: Generalizing the Multicast Paradigm to Improve ScalabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Performance analysis of a hierarchical quorum consensus algorithm for replicated objectsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Multicasting for multimedia applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- The grid protocol: a high performance scheme for maintaining replicated dataIEEE Transactions on Knowledge and Data Engineering, 1992
- A high availability √N hierarchical grid algorithm for replicated dataInformation Processing Letters, 1991
- Multidimensional votingACM Transactions on Computer Systems, 1991
- Dynamic voting algorithms for maintaining the consistency of a replicated databaseACM Transactions on Database Systems, 1990
- Steiner problem in networks: A surveyNetworks, 1987
- Reverse path forwarding of broadcast packetsCommunications of the ACM, 1978
- On the Shortest Spanning Subtree of a Graph and the Traveling Salesman ProblemProceedings of the American Mathematical Society, 1956