Broadcasting in unstructured peer-to-peer overlay networks
暂无分享,去创建一个
[1] G. Nemhauser,et al. Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms* , 1981 .
[2] Ion Stoica,et al. The Case for a Hybrid P2P Search Infrastructure , 2004, IPTPS.
[3] Tracy Camp,et al. Comparison of broadcasting techniques for mobile ad hoc networks , 2002, MobiHoc '02.
[4] Dorit S. Hochbaum,et al. Approximation Algorithms for NP-Hard Problems , 1996 .
[5] Andrei Z. Broder,et al. Graph structure in the Web , 2000, Comput. Networks.
[6] Jon M. Kleinberg,et al. The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.
[7] Edith Cohen,et al. Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.
[8] Scott Shenker,et al. Making gnutella-like P2P systems scalable , 2003, SIGCOMM '03.
[9] Aruna Seneviratne,et al. The cost of peer discovery and searching in the Gnutella peer-to-peer file sharing protocol , 2001, Proceedings. Ninth IEEE International Conference on Networks, ICON 2001..
[10] Miguel Castro,et al. Should we build Gnutella on a structured overlay? , 2004, Comput. Commun. Rev..
[11] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[12] Dimitri P. Bertsekas,et al. Data Networks , 1986 .
[13] J. Lipman,et al. Reliable optimised flooding in ad hoc networks , 2004, Proceedings of the IEEE 6th Circuits and Systems Symposium on Emerging Technologies: Frontiers of Mobile and Wireless Communication (IEEE Cat. No.04EX710).