On the complexity of asynchronous gossip
暂无分享,去创建一个
Rachid Guerraoui | Chryssis Georgiou | Dariusz R. Kowalski | Seth Gilbert | R. Guerraoui | Seth Gilbert | Chryssis Georgiou | D. Kowalski
[1] Wei Tsang Ooi,et al. Controlling Gossip Protocol Infection Pattern Using Adaptive Fanout , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).
[2] Richard M. Karp,et al. Randomized rumor spreading , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[3] Dariusz R. Kowalski,et al. Time and Communication Efficient Consensus for Crash Failures , 2006, DISC.
[4] Andrzej Pelc,et al. Dissemination of Information in Communication Networks - Broadcasting, Gossiping, Leader Election, and Fault-Tolerance , 2005, Texts in Theoretical Computer Science. An EATCS Series.
[5] Hagit Attiya,et al. Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .
[6] Ran Canetti,et al. Fast asynchronous Byzantine agreement with optimal resilience , 1993, STOC.
[7] Anne-Marie Kermarrec,et al. Efficient epidemic-style protocols for reliable and scalable multicast , 2002, 21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings..
[8] Jon M. Kleinberg,et al. Spatial gossip and resource location protocols , 2001, JACM.
[9] Doug Terry,et al. Epidemic algorithms for replicated database maintenance , 1988, OPSR.
[10] Andrzej Pelc. Fault-tolerant broadcasting and gossiping in communication networks , 1996, Networks.
[11] Chryssis Georgiou,et al. Efficient Gossip and Robust Distributed Computation , 2003, DISC.
[12] Stephen P. Boyd,et al. Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.
[13] Marcin Paprzycki,et al. Distributed Computing: Fundamentals, Simulations and Advanced Topics , 2001, Scalable Comput. Pract. Exp..
[14] Anne-Marie Kermarrec,et al. Lightweight probabilistic broadcast , 2003, TOCS.
[15] Nancy A. Lynch,et al. Consensus in the presence of partial synchrony , 1988, JACM.
[16] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.
[17] Anne-Marie Kermarrec,et al. Probabilistic Reliable Dissemination in Large-Scale Systems , 2003, IEEE Trans. Parallel Distributed Syst..
[18] James Aspnes,et al. Randomized protocols for asynchronous consensus , 2002, Distributed Computing.
[19] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1985, JACM.
[20] M. Mitzenmacher,et al. Probability and Computing: Chernoff Bounds , 2005 .
[21] Kenneth P. Birman,et al. Bimodal multicast , 1999, TOCS.
[22] Nancy A. Lynch,et al. Impossibility of distributed consensus with one faulty process , 1983, PODS '83.
[23] Robbert van Renesse,et al. A Gossip-Style Failure Detection Service , 2009 .
[24] Michael Ben-Or,et al. Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.
[25] Dariusz R. Kowalski,et al. Bounding Work and Communication in Robust Cooperative Computation , 2002, DISC.
[26] Cynthia Dwork,et al. Randomization in Byzantine Agreement , 1989, Adv. Comput. Res..
[27] Patrick Th. Eugster,et al. Route driven gossip: probabilistic reliable multicast in ad hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[28] Dariusz R. Kowalski,et al. Robust gossiping with an application to consensus , 2006, J. Comput. Syst. Sci..
[29] Patrick Th. Eugster,et al. Probabilistic reliable multicast in ad hoc networks , 2004, Ad Hoc Networks.