Robbert van Renesse
Dan Dumitriu
ABSTRACT
The paper shows that anti-entropy protocols can process only a limited rate of updates, and proposes and evaluates a new state reconciliation mechanism as well as a flow control scheme for anti-entropy protocols.
- J. Byers, J. Considine, and M. Mitzenmacher. Fast approximate reconciliation of set differences. Technical Report 2002--019, CS Dept., Boston University, July 2002.Google Scholar
- P. Danzig. Flow control for limited buffer multicast. IEEE Trans. on Software Engineering, 20(1), Jan. 1994. Google ScholarDigital Library
- A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database maintenance. In Proc. of the 6th ACM Symp. on Principles of Distributed Computing, pages 1--12, Vancouver, BC, Aug. 1987. Google ScholarDigital Library
- V. Jacobson. Congestion avoidance and control. In ACM SIGCOMM'88, Stanford, CA, Aug. 1988. Google ScholarDigital Library
- A.-M. Kermarrec, L. Massoulié, and A. Ganesh. Probabilistic reliable dissemination in large-scale systems. IEEE Trans. on Par. and Distr. Systems, 14(3), Mar. 2003. Google ScholarDigital Library
- B. Koldehofe. Buffer management in probabilistic peer-to-peer communication protocols. In Proc. of the 22nd Symp. on Reliable Distributed Systems (SRDS '03), Oct. 2003.Google ScholarCross Ref
- P. Kouznetsov, R. Guerraoui, S. Handurukande, and A.-M. Kermarrec. Reducing noise in gossip-based reliable broadcast. In Proc. of the 20th IEEE Symp. on Reliable Distributed Systems (SRDS '01). IEEE, Oct. 2001.Google ScholarCross Ref
- Y. Minsky, A. Trachtenberg, and R. Zippel. Set reconciliation with nearly optimal communication complexity. IEEE Trans. on Information Theory, 49(9), Sept. 2003. Google ScholarDigital Library
- O. Ozkasap, R. van Renesse, K. Birman, and Z. Xiao. Efficient buffering in reliable multicast protocols. In Proceedings of the First International Workshop on Networked Group Communication (NGC), Pisa, Italy, Nov. 1999. Google ScholarDigital Library
- J. Pereira, L. Rodrigues, M. Monteiro, R. Oliveira, and A.-M. Kermarrec. NEEM: Network-friendly epidemic multicast. In Proc. of the 22nd Symp. on Reliable Distributed Systems (SRDS '03), Oct. 2003.Google ScholarCross Ref
- J. Pereira, L. Rodrigues, A. Pinto, and R. Oliveira. Low latency probabilistic broadcast in wide area networks. In Proc. of the 23rd Int. Symp. on Reliable Distributed Systems, Florianópolis, Brazil, Oct. 2004. Google ScholarDigital Library
- L. Rodrigues, S. Handurukande, J. Pereira, R. Guerraoui, and A.-M. Kermarrec. Adaptive gossip-based broadcast. In Proc. of the International Conference on Distributed Systems and Networks (DSN), San Francisco, CA, June 2003. IEEE.Google ScholarCross Ref
- R. van Renesse, K. Birman, and W. Vogels. Astrolabe: A robust and scalable technology for distributed systems monitoring, management, and data mining. ACM Transactions on Computer Systems, 21(3), May 2003. Google ScholarDigital Library
Index Terms
- Efficient reconciliation and flow control for anti-entropy protocols
Recommendations
Topology Dissemination for Reliable One-Hop Distributed Hash Tables
Many distributed hash tables (DHTs) resolve lookups in O(\log n) hops, where n is the number of nodes. One-hop DHTs give lower lookup latencies and lower lookup failure rates. However, it is hard to maintain large, wide-area one-hop topologies. We ...
Efficient and Adaptive Epidemic-Style Protocols for Reliable and Scalable Multicast
Epidemic-style (gossip-based) techniques have recently emerged as a class of scalable and reliable protocols for peer-to-peer multicast dissemination in large process groups. However, popular implementations of epidemic-style dissemination suffer from ...
An analytical framework for self-organizing peer-to-peer anti-entropy algorithms
An analytical framework is developed for establishing exact performance measures for peer-to-peer (P2P) anti-entropy paradigms used in biologically inspired epidemic data dissemination. Major benefits of these paradigms are that they are fully ...
Comments