6.2
Suggestions for future work
The research described in this thesis opens up several possibilities for further exploration of the potential of asymmetric P2P architectures:
1. The problem of identifying peers with excess capacities and of deciding on which of those peers should be promoted in the architecture, as trivial as it may sound, is in reality a complex and challenging task. Peers that are assigned a superior role in an asymmetric architecture gain more control over the shared resources, which can lead to potential abuses of the system. Therefore, it is important to have a reliable method for estimating the real capacities of a peer and preventing malicious (even high-capacity) nodes from becoming too influential.
2. A complete design of an asymmetric architecture should address the issue of pro- viding clear incentives to peers taking additional responsibilities in the system. In particular, the architectures based on super-peers and resource brokers proposed both in this thesis and in the related work do not compensate high-capacity peers for their extra duties.
3. The role of a super-peer or a resource broker is considered a binary property which is or is not assigned to a given peer. However, one could argue that since the capac- ities vary across (super-)peers, so should their responsibilities. There is no reason why the binary role model could not be replaced by one in which the extent of ad- ditional duties assigned to peers depends on their capacities and possibly also some other qualities such as trustiness. The super nodes in the new role model can be referred to as gradual super-peers since they are structured at multiple levels based on their responsibilities in the system. The flexibility introduced by an architec- ture able to leverage gradual super-peers automatically solves problems of existing super-peer networks such as the promotion and demotion of super-peers and the scaling of their responsibilities.
4. Among the architectures described in this thesis, currently we provide a ready-to- use implementation of ATFT only. It would be interesting to evaluate the poten- tial of SOSPNET and resource brokers in a real environment with real users on a production-quality implementation of these systems.
BIBLIOGRAPHY 113
Bibliography
[1] Anonymizer project page. http://anonymizer.com/. [2] Bittornado project page. http://www.bittornado.com/. [3] End system multicast. http://esm.cs.cmu.edu/.
[4] Fasttrack project page. http://www.fasttrack.nu/. [5] Filelist.org content indexing site. http://filelist.org/. [6] Globule cdn project page. http://www.globule.org/.
[7] Jaccard’s similarity coefficient.http://en.wikipedia.org/wiki/Jaccard\
_similarity\_coefficent.
[8] Merriam-webster online dictionary. http://www.merriam-webster.com/. [9] Morpheus project page. http://morpheus.com/.
[10] Napster project page. http://www.napster.com/. [11] Netcraft project page. http://www.netcraft.com/.
[12] The pirate bay torrent distribution site. http://thepiratebay.org/. [13] Suprnova.org content indexing site. http://suprnova.org/.
[14] Skyscraper broadcasting: a new broadcasting scheme for metropolitan video-on- demand systems. In ACM SIGCOMM, pages 89–100, Cannes, France, September 1997.
[15] M. Abramowitz and I. A. Stegun, editors. Handbook of Mathematical Functions:
with Formulas, Graphs, and Mathematical Tables. Dover Publications, June 1965.
[16] E. Adar and B. A. Huberman. Free riding on gnutella. Technical report, Xerox PARC, August 2000.
[17] A. Adya, W. J. Bolosky, M. Castro, G. Cermak, R. Chaiken, J. R. Douceur, J. How- ell, J. R. Lorch, M. Theimer, and R. P. Wattenhofer. Farsite: Federated, available, and reliable storage for an incompletely trusted environment. In 5th Symposium on
Operating Systems Design and Implementation (OSDI’02), Boston, MA, Decem-
ber 2002.
[18] K. C. Almeroth and M. H. Ammar. The use of multicast delivery to provide a scalable and interactive video-on-demand service. IEEE Journal on Selected Areas
in Communications, 14(6):1110–1122, August 1996.
[19] K. G. Anagnostakis and M. B. Greenwald. Exchange-based incentive mechanisms for peer-to-peer file sharing. In 24th International Conference on Distributed Com-
puting Systems (ICDCS’04), Tokyo, Japan, March 2004.
[20] S. Androutsellis-Theotokis and D. Spinellis. A survey of peer-to-peer content dis- tribution technologies. ACM Comput. Surv., 36(4):335–371, December 2004. [21] S. Annapureddy, S. Guha, Ch. Gkantsidis, D. Gunawardena, and P. R. Rodriguez.
Is high-quality vod feasible using p2p swarming? In 16th International World
Wide Web Conference (WWW2007), Banff, Canada, May 2007.
[22] J. G. Apostolopoulos, W. T. Tan, and S. J. Wee. Video streaming: Concepts, algo- rithms, and systems. Technical Report 2002-260, HP Labs, September 2002. [23] R. Axelrod. The Evolution of Cooperation. Basic Books, August 1985.
[24] H. Bal and et. al. The distributed asci supercomputer project. ACM SIGOPS Op-
erating Systems Review, 34(4):76–96, October 2000.
[25] S. Banerjee, T. G. Griffin, and M. Pias. The interdomain connectivity of planetlab nodes. In Passive and Active Measurement Workshop (PAM2004), Antibes Juan- les-Pins, France, April 2004.
[26] A. R. Bharambe, C. Herley, and V. N. Padmanabhan. Analyzing and improving a bittorrent network’s performance mechanisms. In IEEE Infocom 2006, Barcelona, Spain, April 2006.
[27] E. Bortnikov, M. Gurevich, I. Keidar, G. Kliot, and A. Shraer. Brahms: Byzantine resilient random membership sampling. In 27th Annual Symposium on Principles
BIBLIOGRAPHY 115
[28] P. Bose, P. Morin, A. Brodnik, S. Carlsson, E. D. Demaine, R. Fleischer, J. I. Munro, and A. L´opez-Ortiz. Online routing in convex subdivisions. In 11th Inter-
national Conference on Algorithms and Computation (ISAAC’00), Taipei, Taiwan,
December 2000.
[29] Y. Breitbart, R. Vingralek, and G. Weikum. Load control in scalable distributed file structures. Distributed and Parallel Databases, 4(4):319–354, September 1996. [30] L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker. Web caching and zipf-like
distributions: Evidence and implications. In IEEE Infocom, New York, NY, March 1999.
[31] Y. Busnel and A.-M. Kermarrec. Proxsem: Interest-based proximity measure to improve search efficiency in p2p systems. In 4th European Conference on Univer-
sal Multiservice Networks (ECUMN’2007), Toulouse, France, February 2007.
[32] M. Castro, P. Druschel, A.-M. Kermarrec, A. Nandi, A. Rowstron, and A. Singh. Splitstream: high-bandwidth multicast in cooperative environments. In 19th ACM
Symposium on Operating Systems Principles (SOSP’03), pages 298–313, New
York, NY, October 2003.
[33] S. Cen, C. Pu, R. Staehli, C. Cowan, and J. Walpole. A distributed real-time mpeg video audio player. In 5th International Workshop on Network and Operating Sys-
tem Support for Digital Audio and Video (NOSSDAV’95), pages 142–153, Durham,
NH, April 1995.
[34] C. Chatfield, A. Koehler, J. Ord, and R. Snyder. A new look at models for expo- nential smoothing. The Statistician, 50(2):147–159, July 2001.
[35] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker. Making gnutella-like p2p systems scalable. In ACM SIGCOMM, Karlsruhe, Germany, Au- gust 2003.
[36] Y. Chen, R. H. Katz, and J. Kubiatowicz. Scan: A dynamic, scalable, and efficient content distribution network. In International Conference on Pervasive Computing
(Pervasive 2002), Zurich, Switzerland, August 2002.
[37] V. Cholvi, P. Felber, and E. Biersack. Efficient search in unstructured peer-to- peer networks. In 16th Annual ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA’04), Barcelona, Spain, June 2004.
[38] Y-H Chu, A. Ganjam, T. S. E. Ng, S. G. Rao, K. Sripanidkulchai, J. Zhan, and H. Zhang. Early experience with an internet broadcast system based on overlay
multicast. In USENIX Annual Technical Conference, USENIX ’04, Boston, MA, June 2004.
[39] I. Clarke, O. Sandberg, B. Wiley, and T. Hong. Freenet: A distributed anonymous information storage and retrieval system. In International Workshop on Design
Issues in Anonymity and Unobservability, Berkeley, CA, July 2000.
[40] B. Cohen. Incentives build robustness in bittorrent. In Workshop on Economics of
Peer-to-Peer Systems, Berkeley, USA, May 2003. http://bittorrent.com/.
[41] L. Comtet. Advanced Combinatorics: The Art of Finite and Infinite Expansions. Reidel, Dordrecht, Netherlands, May 1974.
[42] R. Cox, A. Muthitacharoen, and R. Morris. Serving dns using a peer-to-peer lookup service. In 1st International Workshop on Peer-to-Peer Systems (IPTPS’02), Cam- bridge, MA, March 2002.
[43] A. Crespo and H. Garcia-Molina. Semantic overlay networks for p2p systems. Technical report, Stanford University, Stanford, CA, September 2002.
[44] S. A. Crosby and D. S. Wallach. An analysis of bittorrent’s two kademlia-based dhts. Technical Report TR-07-04, Rice University, June 2007.
[45] F. Dabek, R. Cox, F. Kaashoek, and R. Morris. Vivaldi: a decentralized network coordinate system. In ACM SIGCOMM, Portland, OR, September 2004.
[46] F. Dabek, F. Kaashoek, D. Karger, R. Morris, and I. Stoica. Wide-area coopera- tive storage with cfs. In 18th ACM Symposium on Operating Systems Principles
(SOSP’01), Banff, Canada, October 2001.
[47] C. Dana, D. Li, D. Harrison, and C-N Chuah. Bass: Bittorrent assisted stream- ing system for video-on-demand. In IEEE International Workshop on Multimedia
Signal Processing (MMSP), Shanghai, China, October 2005.
[48] T. Decker, R. Luling, and S. Tschoke. A distributed load balancing algorithm for heterogeneous parallel computing system. In International Conference on Paral-
lel and Distributed Processing Techniques and Applications (PDPTA 2000), Las
Vegas, NV, June 2000.
[49] M. J. Freedman, E. Freudenthal, and D. Mazi`eres. Democratizing content publi- cation with coral. In 1st USENIX/ACM Symposium on Networked Systems Design
BIBLIOGRAPHY 117
[50] A. Ganesh, A. M. Kermarrec, and L. Massoulie. Peer-to-peer membership man- agement for gossip-based protocols. IEEE Transactions on Computers, 52(2):139– 149, February 2003.
[51] P. Garbacki, D. H. J. Epema, J. Pouwelse, and M. van Steen. Offloading servers with collaborative video on demand. In 7th International Workshop on Peer-to-
Peer Systems (IPTPS’08), Tampa Bay, FL, February 2008.
[52] P. Garbacki, D. H. J. Epema, and M. van Steen. Two-level semantic caching scheme for super-peer networks. In 10th IEEE Int’l Workshop on Web Caching and Content
Distribution (WCW2005), Sophia Antipolis, France, September 2005.
[53] P. Garbacki, D. H. J. Epema, and M. van Steen. An amortized tit-for-tat protocol for exchanging bandwidth instead of content in p2p networks. In 1st IEEE Inter-
national Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007),
Boston, MA, July 2007.
[54] P. Garbacki, D. H. J. Epema, and M. van Steen. Optimizing peer relationships in a super-peer network. In 27th International Conference on Distributed Computing
Systems (ICDCS’07), Toronto, Canada, June 2007.
[55] P. Garbacki, D. H. J. Epema, and M. van Steen. Broker placement in latency-aware peer-to-peer networks. Computer Networks, 52(8):1617–1633, June 2008.
[56] P. Garbacki, A. Iosup, D. H. J. Epema, and M. van Steen. 2fast: Collaborative downloads in p2p networks. In 6th IEEE Int’l Conference on Peer-to-Peer Com-
puting (P2P2006), Cambridge, UK, September 2006.
[57] L. Garces-Erice, E. Biersack, K. Ross, P. Felber, and G. Urvoy-Keller. Hierarchical p2p systems. In Euro-Par 2003, Klagenfurt, Austria, August 2003.
[58] Christos Gkantsidis and Pablo Rodriguez. Network coding for large scale content distribution. In IEEE Infocom, Miami, March 2005.
[59] K. Gummadi, R. Dunn, S. Saroiu, S. Gribble, H. Levy, and J. Zahorjan. Mea- surement, modeling, and analysis of a peer-to-peer file-sharing workload. In 19th
ACM Symposium on Operating Systems Principles (SOSP’03), Bolton Landing,
NY, October 2003.
[60] M. Ham and G. Agha. Ara: A robust audit to prevent free-riding in p2p networks. In 5th IEEE International Conference on Peer-to-Peer Computing (P2P2005), Konstanz, Germany, June 2005.
[61] S. Handurukande, A. M. Kermarrec, F. Le Fessant, and L. Massoulie. Exploiting semantic clustering in the edonkey p2p network. In 11th ACM SIGOPS European
Workshop, Leuven, Belgium, September 2004.
[62] S. Handurukande, A. M. Kermarrec, F. Le Fessant, L. Massoulie, and S. Patarin. Peer sharing behavior in the edonkey network, and implications for the design of server-less file sharing systems. In EuroSys2006, Leuven, Belgium, April 2006. [63] G. Hardin. The tragedy of the commons. The Science, 162:1243–1248, December
1968.
[64] M. Hefeeda, A. Habib, B. Botev, D. Xu, and B. Bhargava. Promise: peer-to-peer media streaming using collectcast. In ACM MULTIMEDIA 2003, pages 45–54, Berkeley, CA, November 2003.
[65] A. Hu. Video-on-demand broadcasting protocols: a comprehensive study. In IEEE
Infocom, pages 508–517, Anchorage, AK, April 2001.
[66] M. Hutter. Self-optimizing and pareto-optimal policies in general environments based on bayes-mixtures. In 15th Annual Conference on Computational Learning
Theory (COLT 2002), Sydney, Australia, July 2002.
[67] A. Iamnitchi, M. Ripeanu, and I. Foster. Small-world file-sharing communities. In
IEEE Infocom, Hong Kong, China, March 2004.
[68] A. Iosup, P. Garbacki, J. Pouwelse, and D. H. J. Epema. Correlating topology and path characteristics of overlay networks and the internet. In 6th Int’l Work-
shop on Global and Peer-to-Peer Computing (GP2PC’06), in conjunction with the
IEEE/ACM CCGrid’06, Singapore, May 2006.
[69] M. Jelasity, R. Guerraoui, and A. M. Kermarrec. The peer sampling service: Exper- imental evaluation of unstructured gossip-based implementations. In Middleware, Toronto, Canada, October 2004.
[70] M. Jelasity, A. Montresor, and O. Babaoglu. A modular paradigm for building self-organizing peer-to-peer applications. Engineering Self-Organising Systems, 2977:265–282, April 2004.
[71] D. Karger and M. Ruhl. Simple efficient load balancing algorithms for peer-to- peer systems. In 16th Annual ACM Symposium on Parallelism in Algorithms and
BIBLIOGRAPHY 119
[72] B. J. Ko and D. Rubenstein. A greedy approach to replicated content placement using graph coloring. In SPIE ITCom Conference on Scalability and Traffic Control
in IP Networks II, Boston, MA, July 2002.
[73] V. P. Kompella, J. C. Pasquale, and G. C. Polyzos. Multicasting for multimedia applications. In IEEE Infocom, pages 2078–2085, Florence, Italy, May 1992. [74] E. Kranakis, H. Singh, and J. Urrutia. Compass routing on geometric networks.
In 11th Canadian Conference on Computational Geometry, Vancouver, Canada, August 1999.
[75] J. B. Kruskal and M. Wish. Multidimensional Scaling. Sage Publications, Beverly Hills, CA, 1977.
[76] J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gum- madi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. Oceanstore: An architecture for global-scale persistent storage. In 9th International Conference
on Architectural Support for Programming Languages and Operating Systems (AS-
PLOS 2000), Cambridge, MA, November 2000.
[77] F. Kuhn, R. Wattenhofer, Y. Zhang, and A. Zollinger. Geometric ad-hoc routing: of theory and practice. In 22nd Annual Symposium on Principles of Distributed
Computing (PODC 2003), Boston, MA, July 2003.
[78] N. Laoutaris, S. Syntila, and I. Stavrakakis. Meta algorithms for hierarchical web caches. In 23rd IEEE International Performance Computing and Communications
Conference (IPCCC 2004), Phoenix, Arizona, April 2004.
[79] S. Le-Blond, J. L. Guillaume, and M. Latapy. Clustering in p2p exchanges and consequences on performances. In 4th International workshop on Peer-to-Peer
Systems (IPTPS’05), Ithaka, NY, February 2005.
[80] F. Le Fessant, S. Handurukande, A. M. Kermarrec, and L. Massoulie. Clustering in peer-to-peer file sharing workloads. In 3rd International Workshop on Peer-to-Peer
Systems (IPTPS’04), San Diego, CA, February 2004.
[81] N. Leibowitz, M. Ripeanu, and A. Wierzbicki. Deconstructing the kazaa network. In 3rd IEEE Workshop on Internet Applications (WIAPP’03), San Jose, CA, USA, June 2003.
[82] H. Li, D. Hestenes, and A. Rockwood. Spherical conformal geometry with geomet- ric algebra. Geometric computing with Clifford algebras: theoretical foundations
[83] J. Liang, R. Kumar, and K. W. Ross. The kazaa overlay: A measurement study.
Computer Networks, Special Issue on Overlays, 49(6), October 2005.
[84] H. Lim, J. C. Hou, and Chong-Ho. Constructing internet coordinate system based on delay measurement. IEEE/ACM Transactions on Networking, 13(3):513–525, June 2005.
[85] N. Liogkas, R. Nelson, E. Kohler, and L. Zhang. Exploiting bittorrent for fun (but not profit). In 5th International Workshop on Peer-to-Peer Systems (IPTPS), Santa Barbara, CA, February 2006.
[86] J. Liu, B. Li, and Y. Q. Zhang. Adaptive video multicast over the internet. IEEE
Multimedia, 10(1):22–33, January 2003.
[87] A. Loser, M. Wolpers, W. Siberski, and W. Nejdl. Semantic overlay clusters within super-peer networks. In International Workshop On Databases, Information Sys-
tems and Peer-to-Peer Computing, Berlin, Germany, September 2003.
[88] E. K. Lua, T. Griffin, M. Pias, H. Zheng, and J. Crowcroft. On the accuracy of embeddings for internet coordinate systems. In Internet Measurement Conference
(IMC’05), Berkeley, CA, October 2005.
[89] K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim. A survey and compari- son of peer-to-peer overlay network schemes. IEEE Communications Surveys and
Tutorials, 7(2):72–93, May 2005.
[90] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstruc- tured peer-to-peer networks. In International Conference on Supercomputing (ICS
2002), New York, NY, June 2002.
[91] J. Macqueen. Some methods for classification and analysis of multivariate obser- vations. In 5th Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, CA, January 1967.
[92] N. Magharei, A. Rasti, D. Stutzbach, and R. Rejaie. Peer-to-peer receiver-driven mesh-based streaming. In ACM SIGCOMM, Philadelphia, PA, August 2005. [93] P. Maymounkov and D. Mazieres. Kademlia: A peer-to-peer information system
based on the xor metric. In 1st International Workshop on Peer-to-Peer Systems
(IPTPS’02), Cambridge, MA, March 2002.
[94] D. Milojicic, V. Kalogeraki, R. Lukose, K. Nagaraja, J. Pruyne, B. Richard, S. Rollins, and Z. Xu. Peer-to-peer computing. Technical Report HPL-2002-57, HP Labs, March 2002.
BIBLIOGRAPHY 121
[95] J. J. D. Mol, J. A. Pouwelse, M. Meulpolder, D. H. J. Epema, and H. J. Sips. Give-to-get: Free-riding-resilient video-on-demand in p2p systems. In 15th Annual
Multimedia Computing and Networking (MMCN’08), San Jose, CA, January 2008.
[96] A. Montresor. A robust protocol for building superpeer overlay topologies. In 4th
International Conference on Peer-to-Peer Computing (P2P2004), Zurich, Switzer-
land, August 2004.
[97] A. Myzrak, Y. Cheng, V. Kumar, and S. Savage. Structured superpeers: Leveraging heterogeneity to provide constant-time lookup. In 3rd IEEE Workshop on Internet
Applications (WIAPP ’03), San Jose, CA, June 2003.
[98] A. Nandi, T.-W. Ngan, A. Singh, P. Druschel, and D. S. Wallach. Scrivener: Provid- ing incentives in cooperative content distribution systems. In ACM/IFIP/USENIX
6th International Middleware Conference (Middleware 2005), Grenoble, France,
November 2005.
[99] J. F. Nash. Equilibrium points in n-person games. National Academy of Sciences
of the United States of America, 36(1), January 1950.
[100] W. Nejdl, B. Wolf, C. Qu, S. Decker, M. Sintek, A. Naeve, M. Nilsson, M. Palmer, and T. Risch. Edutella: A p2p networking infrastructure based on rdf. In 11th
International World Wide Web Conference (WWW2002), Honolulu, HI, May 2002.
[101] W. Nejdl, M. Wolpers, W. Siberski, Ch Schmitz, M. Schlosser, I. Brunkhorst, and A. L¨oser. Super-peer-based routing strategies for rdf-based peer-to-peer networks.
Web Semantics, 1(2), February 2004.
[102] T. E. Ng and H. Zhang. Predicting internet network distance with coordinates- based approaches. In IEEE Infocom, New York, NY, June 2002.
[103] N. Ntarmos and P. Triantafillou. Seal: managing accesses and data in peer-to- peer sharing networks. In Fourth IEEE International Conference on Peer-to-Peer
Computing, August 2004.
[104] A. Okabe, B. Boots, K. Sugihara, and S. N. Chi. Spatial Tessellations: Concepts
and Applications of Voronoi Diagrams. Wiley, Chichester, UK, second edition,
2000.
[105] J. C. Pasquale, G. C. Polyzos, and G. Xylomenos. The multimedia multicasting problem. Multimedia Systems, 6(1):43–59, January 1998.
[106] L. Peterson, A. Bavier, M. Fiuczynski, and S. Muir. Experiences building planetlab. In 7th Symposium on Operating System Design and Implementation (OSDI’06), Seatle, WA, November 2006.
[107] M. Pias, J. Crowcroft, S. R. Wilbur, T. Harris, and S. N. Bhatti. Lighthouses for scalable distributed location. In 2nd International Workshop on Peer-to-Peer Sys-
tems (IPTPS’03), Berkeley, CA, February 2003.
[108] M. Piatek, T. Isdal, T. Anderson, A. Krishnamurthy, and A. Venkataramani. Do incentives build robustness in bittorrent? In NSDI’07, Cambridge, MA, April 2007.
[109] G. Pierre and M. van Steen. Design and implementation of a user-centered content delivery network. In 3rd IEEE Workshop on Internet Applications, San Jose, CA, June 2003.
[110] G. Pierre and M. van Steen. Globule: a collaborative content delivery network.
IEEE Communications Magazine, 44(8), August 2006. 2006.
[111] J. Pouwelse, P. Garbacki, D. Epema, and H. Sips. A measurement study of the bittorrent peer-to-peer file-sharing system. In 4th International Workshop on Peer-
to-Peer Systems (IPTPS’05), Ithaca, NY, February 2005.
[112] J. Pouwelse, P. Garbacki, J. Wang, A. Bakker, J. Yang, A. Iosup, D. H. J. Epema, M. Reinders, M. van Steen, and H. Sips. Tribler: A social-based peer-to-peer system. Concurrency and Computation: Practice and Experience, 20(2):127–138, February 2008.
[113] D. Qiu and R. Srikant. Modeling and performance analysis of bittorrent-like peer- to-peer networks. In ACM SIGCOMM, Portland, OR, August 2004.
[114] A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica. Load balancing in dynamic structured p2p systems. In IEEE Infocom, Hong Kong, China, March 2004.
[115] Sylvia Ratnasamy, Paul Francis, Mark Handley, and Richard Karp. A scalable content-addressable network. In ACM SIGCOMM, San Diego, CA, August 2001. [116] M. Ripeanu. Peer-to-peer architecture case study: Gnutella network. In 1st Inter-
national Conference on Peer-to-Peer Computing (P2P2001), Link¨oping, Sweden,
August 2001.
[117] J. Risson and T. Moors. Survey of research towards robust peer-to-peer networks: Search methods. Computer Networks, 50(17):3485–3521, December 2006.
BIBLIOGRAPHY 123
[118] A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Middleware 2001, Heidelberg, Ger- many, November 2001.
[119] S. Saroiu, K. P. Gummadi, and S. D. Gribble. A measurement study of peer-to-peer file sharing systems. In Multimedia Computing and Networking (MMCN’02), San Jose, CA, January 2002.
[120] M. Schlosser, T. Condie, and S. Kamvar. Simulating a file-sharing p2p network. In
1st Workshop on Semantics in P2P and Grid Computing, Budapest, Hungary, May
2003.
[121] R. Sherwood, R. Braud, and B. Bhattacharjee. Slurpie: A cooperative bulk data transfer protocol. In IEEE Infocom, Honk Kong, China, March 2004.
[122] J. Shneidman and D. Parkes. Rationality and self-interest in peer to peer net- works. In 2nd International Workshop on Peer-to-Peer Systems (IPTPS’03), Febru- ary 2003.
[123] A. Singla and Ch Rohrs. Ultrapeers: Another step towards gnutella scalability, November 2002. http://www.limewire.com/developer/Ultrapeers.
html.
[124] S. Sivasubramanian, M. Szymaniak, G. Pierre, and M. van Steen. Replication for web hosting systems. ACM Computing Surveys, 36(3):291–334, September 2004. [125] N. Spring, D. Wetherall, and T. Anderson. Scriptroute: a public internet measure-
ment facility. In 4th conference on USENIX Symposium on Internet Technologies
and Systems (USITS’03), Seatle, WA, March 2003.
[126] K. Sripanidkulchai, B. Maggs, and H. Zhang. Efficient content location using interest-based locality in peer-to-peer systems. In IEEE Infocom, San Francisco, CA, March 2003.
[127] T. Stading, P. Maniatis, and M. Baker. Peer-to-peer caching schemes to address flash crowds. In 1st International Workshop on Peer-to-Peer Systems (IPTPS ’02), Cambridge, MA, March 2002.
[128] A. Stavrou, D. Rubenstein, and S. Sahu. A lightweight, robust p2p system to handle flash crowds. In 10th IEEE International Conference on Network Protocols, Paris, France, November 2002.
[129] I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, F. Kaashoek, F. Dabek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup protocol for internet ap- plications. IEEE/ACM Transactions on Networking, 11(1):17–32, February 2003.