Gossiping With Multiple Messages
暂无分享,去创建一个
[1] Muriel Médard,et al. Algebraic gossip: a network coding approach to optimal multiple rumor mongering , 2006, IEEE Transactions on Information Theory.
[2] Scott Shenker,et al. Epidemic algorithms for replicated database maintenance , 1988, OPSR.
[3] B. Pittel. On spreading a rumor , 1987 .
[4] Gideon Weiss,et al. Optimal scheduling of peer-to-peer file dissemination , 2006, J. Sched..
[5] Richard M. Karp,et al. Randomized rumor spreading , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[6] Gustavo de Veciana,et al. Performance of peer-to-peer networks: Service capacity and role of resource sharing policies , 2006, Perform. Evaluation.
[7] Miguel Castro,et al. SplitStream: high-bandwidth multicast in cooperative environments , 2003, SOSP '03.
[8] Gustavo de Veciana,et al. Service capacity of peer to peer networks , 2004, IEEE INFOCOM 2004.
[9] Michael Luby,et al. LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[10] N. Ling. The Mathematical Theory of Infectious Diseases and its applications , 1978 .
[11] B. Cohen,et al. Incentives Build Robustness in Bit-Torrent , 2003 .
[12] Leonard Kleinrock,et al. Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.
[13] Mark Handley,et al. Application-Level Multicast Using Content-Addressable Networks , 2001, Networked Group Communication.
[14] Alexander Grey,et al. The Mathematical Theory of Infectious Diseases and Its Applications , 1977 .
[15] Amotz Bar-Noy,et al. Broadcasting multiple messages in simultaneous send/receive systems , 1993, Proceedings of 1993 5th IEEE Symposium on Parallel and Distributed Processing.
[16] R. Srikant,et al. Modeling and performance analysis of BitTorrent-like peer-to-peer networks , 2004, SIGCOMM '04.
[17] Miguel Castro,et al. Scribe: a large-scale and decentralized application-level multicast infrastructure , 2002, IEEE J. Sel. Areas Commun..
[18] A. Farley. Broadcast Time in Communication Networks , 1980 .
[19] Alan M. Frieze,et al. The shortest-path problem for graphs with random arc-lengths , 1985, Discret. Appl. Math..