Scalable fault-tolerant aggregation in large process groups

Proceedings of the International Conference on Dependable Systems and Networks

Volumn , Issue , 2001, Pages 433-442

  Gupta, Indranil ^a   Van Renesse, Robbert ^a   Birman, Kenneth P ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

UNRELIABLE NETWORKS;

ALGORITHMS; FAULT TOLERANT COMPUTER SYSTEMS; HIERARCHICAL SYSTEMS; PROBLEM SOLVING;

COMPUTER NETWORKS;

EID: 0035789181     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSN.2001.941427     Document Type: Conference Paper

References (16)

1. N. T. J. Bailey. Epidemic Theory of Infectious Diseases and its Applications. Hafner Press, second edition, 1975.
2. Z. Bar-Joseph and M. Ben-Or. A tight lower bound for Randomized Consensus. In Proc. ACM Symp. Principles of Distributed Computing, pages 193-199, 1998.
3. K. P. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky. Bimodal multicast. ACM Trans. Computer Systems, 17(2):41-88, May 1999.
4. R. W. D. Coore, R. Nagpal. Paradigms for structure in an Amorphous Computer. A.I. Memo 1614, Massachusetts Institute of Technology, October 1997.
5. A. Demers, J. Gehrke, and K. Jenkins. Private communication. 2000.
6. D. Estrin, R. Govindan, J. Heidermann, and S. Kumar. Next century challenges: scalable coordination in sensor networks. In Proc. 6th Intnl Conf. Mobile Computing and Networking, pages 263-270, Aug 2000.
7. M.J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed Consensus with one faulty process. Journ. ACM, 32(2):374-382, Apr 1985.
8. V. K. Garg. Methods for observing global properties in distributed systems. IEEE Concurrency, 5(4):69-77, Oct-Dec 1997.
9. W. R. Heinzelman, J. Kulik, and H. Balakrishnan. Adaptive protocols for information dissemination in wireless sensor networks. In Proc. 5th Intnl. Conf. Mobile Computing and Networking, pages 174-185, 1999.
10. J. M. Hellerstein, P. J. Haas, and H. J. Wang. Online aggregation. In Proc. ACM SIGMOD Intnl. Conf. on Management of Data, pages 171-182, May 1997.
11. J. M. Kahn, R. H. Katz, and K. S. J. Pister. Next century challenges: mobile networking for smart dust. In Proc. 5th Intnl. Conf. Mobile Computing and Networking, pages 271-28, Aug 2000.
12. J. Li, J. Jannotti, D. S. J. De Couto, D. R. Karger, and R. Morris. A scalable location service for geographic adhoc routing. In Proc. 6th Intnl. Conf. Mobile Computing and Networking, pages 120-130, Aug 2000.
13. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journ. ACM, 27(2):228-234, Apr 1980.
14. P. F. Tsuchiya. The Landmark hierarchy: a new hierarchy for routing in very large networks. In Proc. Symp. Communications Architectures and Protocols, pages 35-42, Aug 1988.
15. R. van Renesse. Scalable management with Astrolabe. Technical report, Dept. of Computer Science, Cornell University, 2000.
16. R. van Renesse, Y. Minsky, and M. Hayden. A gossip-style failure detection service. In Proc. Middleware '98 (IFIP), pages 55-70, Sep 1998.