References

References from:

John Buford, Heather Yu, Eng K. Lua. P2P Networking and Applications. Morgan Kaufmann, 2009.

© 2009 Morgan Kaufmann.


Chapter 1


[1] D. Clark, B. Lehr, S. Bauer, P. Faratin, R. Sami, and J. Wroclawski, Overlay networks and the future of the Internet, Communications & Strategies 63, 3Q2006.
[2] D. Clark, B. Lehr, S. Bauer, P. Faratin, R. Sami, and J. Wroclawski, The growth of Internet overlay networks: implications for architecture, industry structure and policy, 33rd Telecommunications Policy Research Conference, Sept. 2005, available at http://web.si.umich.edu/tprc/papers/2005/466/TPRC_Overlays_9_8_05.pdf.
[3] L. Peterson, T. Anderson, S. Shenker, and J. Turner, Overcoming the Internet impasse through virtualization, IEEE Computer, Apr. 2005, 62.69.
[4] J. Li, B. T. Loo, J. Hellerstein, F. Kaashoek, D. Karger, and R. Morris, On the feasibility of peer-to-peer Web indexing and search, 2nd International Workshop on Peer-to-Peer Systems (IPTPS 2003), Berkeley, CA, 2003.
[5] T. Suel, C. Mathur, J. Wu, J. Zhang, A. Delis, M. Kharrazi, X. Long, and K. Shanmugasundaram, ODISSEA: A peer-to-peer architecture for scalable Web search and information retrieval, 6th International Workshop on the Web and Databases (WebDB), June 2003.
[6] J. Buford and M. Rahman, Instant Messaging and Presence Service (IMPS), in: Wireless Multimedia: Technologies and Applications, A. Salkintzis, and N. Passas, (eds.), 2005.
[7] UPnP Forum, www.upnp.org.
[8] Peer-to-Peer Universal Computing Consortium, www.pucc.jp/en/index.html.
[9] DCIA, www.dcia.info.
[10] Sandvine Corp. Analysis of Traffic Demographics in Broadband Networks, IETF Workshop on Peer-to-Peer Infrastructure (P2Pi), May 2008.

Chapter 2

[11] S. Narayanan, D. Braun, J. Buford, et al., Peer-to-peer streaming for networked consumer electronics, IEEE Communications Magazine, June 2007.
[12] M. Jeronimo and J. Weast, UPnP Design by Example, Intel Press, 2003.
[13] Bluetooth Special Interest Group (2001a), Specification of the Bluetooth System.Core, Version 1.1.
[14] Bluetooth Special Interest Group (2001b), Specification of the Bluetooth System.Core, Version 1.1, SDP specification, vol. 1, part E.
[15] J. Buford, R. Kumar, and G. Perkins, Composition trust bindings in pervasive computing service composition, IEEE Workshop on Pervasive Computing and Communication Security (PerSec), Mar. 2006.
[16] D. Braun, J. Buford, et al., UP2P: a peer-to-peer, overlay architecture for ubiquitous communications and networking, IEEE Communications Magazine, Dec. 2008. 367
[17] Ru¡§diger Schollmeier, A definition of peer-to-peer networking for the classification of peerto- peer architectures and applications, Peer-to-Peer Computing 2001.
[18] D. Stutzbach and R. Rejaie, Understanding churn in peer-to-peer networks, Proceedings of the 6th ACM SIGCOMM on Internet Measurement, Rio de Janeiro, Oct. 25.27, 2006, IMC ¡¯06, ACM Press, New York, 189.202.
[19] S. Krishnamurthy, S. El-Ansary, E. Aurell, and S. Haridi, A statistical theory of Chord under churn, in: 4th Annual International Workshop on Peer-to-Peer Systems (IPTPS¡¯05), Feb. 2005, Ithaca, NY.
[20] K. Aberer, L. O. Alima, A. Ghodsi, S. Girdzijauskas, S. Haridi, and M. Hauswirth, The essence of P2P: a reference architecture for overlay networks, Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing (P2P ¡¯05), Volume 00, Aug. 31.Sept. 2, 2005, IEEE Computer Society, Washington, DC, 11.20.
[21] M. Castro, M. Costa, and A. Rowstron, Debunking some myths about structured and unstructured overlays, Proceedings of the 2nd Conference on Symposium on Networked Systems Design & Implementation, Volume 2 (May 2.4, 2005), USENIX Association, Berkeley, 7.7.
[22] S. Wang, D. Xuan, and W. Zhao, Analyzing and enhancing the resilience of structured peer-to-peer systems. J. Parallel Distrib. Comput., 65(2):207.219, 2005.
[23] K. Gummadi, S. Gribble, S. Ratnasamy, S. Shenker, and I. Stoica, The impact of DHT routing geometry on resilience and proximity, Proc. of ACM SIGCOMM 2003, ACM Press, 2003.
[24] J. S. Kong, J. S. A. Bridgewater, and V. P. Roychowdhury. A general framework for scalability and performance analysis of DHT routing systems, Proc. of the International Conference on Dependable Systems and Networks (DSN ¡¯06), 2006.
[25] D. Loguinov, A. Kumar, V. Rai, and S. Ganesh, Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience, Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols For Computer Communications, Karlsruhe, Germany, Aug. 25.29, 2003, SIGCOMM ¡¯03, ACM Press, 395.406.
[26] J. Aspnes, Z. Diamadi, G. Shah, Fault-tolerant routing in peer-to-peer systems, Proceedings of the 21st Annual Symposium on Principles of Distributed Computing, July 21.24, 2002, Monterey, CA.
[27] X. Zhang, Q. Zhang, Z. Zhang, G. Song, and W. Zhu, A construction of locality-aware overlay network: mOverlay and its performance, IEEE Journal on Selected Areas in Communications, Vol. 22, No. 1, Jan. 2004.
[28] J. Xu, A. Kumar, and X. Yu, On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks, IEEE Journal on Selected Areas in Communications, November 2003.
[29] S. Guha, N. Daswani, and R. Jain, An experimental study of the Skype peer-to-peer VoIP system, in: 5th Annual International Workshop on Peer-to-Peer Systems (IPTPS¡¯06), 2006.
[30] K. Shudo, Y. Tanaka, and S. Sekiguchi, OverlayWeaver: an overlay construction toolkit, Computer Communications Review, Vol. 31, No. 2, 402.412, Feb. 2008.
[31] F. Dabek, B. Zhao, P. Druschel, J. Kubiatowicz, and I. Stoica, Towards a common API for structured peer-to-peer overlays, in: Proc. 2nd Annual International Workshop on Peer-to- Peer Systems (IPTPS¡¯03), 2003. 368 References
[32] B. Biskupski, J. Dowling, and J. Sacha, Properties and mechanisms of self-organizing MANET and P2P systems, ACM Trans. Auton. Adapt. Syst. 2, 1 (March 2007), 34 pp.
[33] L. Alima, A. Ghodsi, and S. Haridi, A framework for structured peer-to-peer overlay networks, in: LNCS volume 3267 of the Post-proceedings of Global Computing 2004, Springer-Verlag, 2004, 223-250.

Chapter 3

[34] S. Bornholdt and H. G. Schuster (eds.), Handbook of Graphs and Networks, Wiley-VCH, 2003.
[35] B. Bolloba¢¥s andO. Riordan,Mathematical results on scale-free randomgraphs, in: S. Bornholdt, H. G. Schuster (eds.), Handbook of Graphs and Networks, Wiley-VCH, 2003, 1.34.
[36] A.-L. Baraba¢¥si and R. Albert, Emergence of scaling in random networks, Science 286, 1999, 509.512.
[37] A.-L. Baraba¢¥si, R. Albert, and H. Jeong, Scale-free characteristics of random networks: the topology of the World Wide Web, Physica A 281, 2000.
[38] Jon Kleinberg, The small-world phenomenon: an algorithm perspective, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, May 21.23, 2000, Portland, Oregon, 163.170.
[39] D. J. Watts and S. H. Strogatz, Collective dynamics of ¡°small-World¡± networks, Nature 393, 1998, 440.442.
[40] S. Milgram, The small world problem, Psychology Today 2, 1967, 60.67.
[41] L. A. Adamic, B. Humberman, R. Lukose, and A. Puniyani, Search in power-law networks, Phys. Rev. E, Vol. 64, 2001, 46135.46143.
[42] L. Li, D. Alderson, R. Tanaka, J. C. Doyle, W. Willinger, Towards a theory of scale-free graphs: definition, properties, and implications (extended version), Internet Mathematica, 2005.
[43] I. Clarke, A distributed decentralized information storage and retrieval system (unpublished report), Division of Informatics, University of Edinburgh, 1999, www. freenetproject.org.
[44] I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong, Freenet: A distributed anonymous information storage and retrieval system, in: Proc. ICSI Workshop Design Issues in Anonymity and Unobservability, Berkeley, CA, June 2000.
[45] H.-E. Skogh, J. Haeggstrom, A. Ghodsi, and R. Ayani, FastFreenet: improving Freenet performance by preferential partition routing and file mesh propagation, in: Proceedings of the 6th International Workshop on Global and Peer-to-Peer Computing on Large-Scale Distributed Systems (CCGRID ¡¯06), IEEE Computer Society, 2006, 9.
[46] H. Zhang, A. Goel, and R. Govindan, Using the small-world model to improve Freenet performance, Comput. Networks 46, 4 (Nov. 2004), 555.574.
[47] I. Clarke, Freenet¡¯s Next Generation Routing Protocol, 2003.
[48] Y. Chawathe, S. Ratnasamy, L. Breslau, S. Shenker, and N. Lanham, GIA: Making Gnutellalike P2P systems scalable, ACM SIGCOMM 2003.
[49] Y. Qiao and F. E. Bustamante, Structured and unstructured overlays under the microscope: a measurement-based view of two P2P systems that people use, in: Proceedings of the References 369 Annual Technical Conference on Usenix ¡¯06 Annual Technical Conference (Boston, MA, May 30.June 3, 2006), USENIX Association, Berkeley, CA, 2006, 31.31.
[50] M. Castro, M. Costa, and A. Rowstron, Debunking some myths about structured and unstructured overlays, Proc. of the 2nd Symposium on Networked Sys. Design and Impl. (NSDI) 2005.
[51] C. Xie, S. Guo, R. Rejaie, and Y. Pan, Examining Graph properties of unstructured peer-topeer overlay topology, Global Internet Symposium, 2007.
[52] Gnutella2 Developer Network, http://g2.trillinux.org/index.php?title=Main_Page, retrieved Nov. 2007.
[53] J. Liang, R. Kumar, and K. Ross, The FastTrack overlay: a measurement study, Computer Networks, 50, 842.858, 2006.
[54] Krishna P. N. Puttaswamy and Ben Y. Zhao, A case for unstructured distributed hash tables, Proceedings of IEEE Global Internet Symposium, Anchorage, AK, May 2007.
[55] R. Morselli, B. Bhattacharjee, A. Srinivasan, and M. Marsh, Efficient lookup on unstructured topologies, in: Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing, Las Vegas (July 17.20, 2005), PODC ¡¯05, ACM Press, New York, 77.86.
[56] A. Lo¡§ser, S. Staab, and C. Tempich, Semantic social overlay networks, IEEE J. Sel. Areas. Communications 25 (1), 2007, 5.14.
[57] C.-J. Lin, Y.-T. Chang, S.-C. Tsai, and C.-F. Chou, Distributed social-based overlay adaptation for unstructured P2P networks, 10th IEEE Global Internet Symposium, 2007.
[58] J. Pouwelse, et al., Tribler: A social-based peer-to-peer system, Proc. of the 5th International Workshop on Peer-to-Peer Systems (IPTPS ¡¯06).
[59] K. Sripanidkulchai, B. Maggs, and H. Zhang, Efficient content location using interest-based locality in peer-to-peer systems, 2nd Intl. Conf. of the IEEE Computer and Communications Societies (INFOCOM), 2003.
[60] G. Mangioni, V. Carchiolo, M. Malgeri, and V. Nicosia, Evaluating the dynamic behaviour of PROSA P2P network, International Symposium on Parallel and Distributed Processing and Applications, ISPA¡¯06, 2006.
[61] G. Mangioni, V. Carchiolo, M. Malgeri, and V. Nicosia, Self-organisation of resources in PROSA P2P network, in: Self-Managed Networks, Systems, and Services, Proceedings of Second IEEE International Workshop, SelfMan 2006, Dublin, No. 3996 in LNCS, 2006, 172.174.
[62] O. Landsiedel, A. Pimenidis, and K. Wehrle, Dynamic multipath onion routing in anonymous peer-to-peer overlay networks, IEEE Globecom 2007.
[63] F. Dabek, B. Zhao, P. Druschel, J. Kubiatowicz, and I. Stoica, Towards a common API for structured peer-to-peer overlays, Proc. Intl. Workshop on Peer-to-Peer Systems (IPTPS ¡¯03), 2003.
[64] Albert-La¢¥szlo¢¥ Baraba¢¥si, The Physics of the Web, July 1, 2001, 33.38, http://physicsworld. com/cws/article/print/100;jsessionid=393E49109C5C7789A248362FF597D16E.
[65] B. Carlsson and R. Gustavsson, The rise and fall of Napster: an evolutionary approach, in: Proceedings of the 6th International Computer Science Conference on Active Media Technology, (Dec. 18.20, 2001) J. Liu, P. C. Yuen, C. H. Li, J. K. Ng, and T. Ishida (eds.), Lecture Notes in Computer Science, Vol. 2252, Springer-Verlag, 347.354. 370 References

Chapter 4

[66] D. Milojicic, V. Kalogeraki, R. Lukose, K. Nagaraja, J. Pruyne, B. Richard, S. Rollins, Z. Xu. Peer-to-peer computing, HP Labs Technical Report, HPL-2002-57R1, July 14, 2003.
[67] S. Androutsellis-Theotokis and D. Spinellis, A survey of content distribution technologies, ACM Computing Surveys, Vol. 36, No. 4, Dec. 2004.
[68] E. K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim, A survey and comparison of peer-to-peer overlay network schemes, IEEE Communications Surveys and Tutorials, Vol. 7, No. 2, 2Q2005.
[69] L. Alima, A. Ghodsi, and S. Haridi, A framework for structured peer-to-peer overlay networks, in: LNCS, Vol. 3267 of the Post-proceedings of Global Computing 2004, Springer-Verlag, 223.250.
[70] K. Aberer, L. Alima, A. Ghodsi, S. Girdzijauskas, M. Hauswirth, and S. Haridi, The essence of P2P: A reference architecture for overlay networks, Fifth IEEE International Conference on Peer-to-Peer Computing, Konstanz, Aug. 31.Sept 2, 2005.
[71] J. Risson, T. Moors, Survey of research towards robust peer-to-peer networks: search methods, Computer Networks 50, 17 (Dec. 2006), 3485.3521.
[72] S. El-Ansary, S. Haridi, An overview of structured P2P overlay networks, in J. Wu (ed.), Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks, Auerbach Publications, 2006, 665.683.
[73] C. Qu, W. Nejdl, M. Kriesell, Cayley DHTs: a group-theoretic framework for analyzing DHTs based on Cayley graphs, ISPA 2004, 914.925.
[74] A. Tannenbaum, Computer Networks, 4th ed., Prentice Hall, 2002.
[75] W. Litwin, M.-A. Neimat, and D. A. Schneider, LH: linear hashing for distributed files, ACM SIGMOD Record, Vol. 22, No. 2, June 1, 1993, 327.336.
[76] W. Litwin, M.-A. Neimat, and D. A. Schneider, LH: a scalable, distributed data structure, ACM Transactions on Database Systems (TODS), Vol. 21, No. 4, Dec. 1996, 480.525.
[77] R. Devine, Design and implementation of DDH: a distributed dynamic hashing algorithm, Proceedings of the 4th international Conference on Foundations of Data Organization and Algorithms, Oct. 13.15, 1993, D. B. Lomet (ed.), Lecture Notes in Computer Science, Vol. 730, Springer-Verlag, 101.114.
[78] D. Karger, E. Lehman, T. Leighton, R. Panigrahy, M. Levine, and D. Lewin, Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web, Proceedings of the 29th Annual ACM Symposium on theory of Computing, El Paso, Texas, May 4.6, 1997, STOC ¡¯97, ACM Press, 654.663.
[79] C. G. Plaxton, R. Rajaraman, and A. W. Richa, Accessing nearby copies of replicated objects in a distributed environment, Proceedings of the 9th annual ACM symposium on parallel algorithms and architectures, Newport, RI, June 23.25, 1997, 311.320.
[80] X. Li and C. G. Plaxton, On name resolution in peer-to-peer networks, in: Proceedings of the Second ACM international Workshop on Principles of Mobile Computing, Toulouse, France, Oct 30.31, 2002, POMC ¡¯02, ACM Press, 82.89.
[81] I. Stoica, R. Morris, D. Karger, M. Kaashoek, and H. Balakrishnan, Chord: A scalable peerto- peer lookup service for Internet applications, in: ACM SIGCOMM 2001, San Diego, CA, 2001, 149.160. References 371
[82] I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan, Chord: a scalable peer-to-peer lookup protocol for internet applications, IEEE/ACM Trans. Netw. 11, 1 (Feb. 2003), 17.32.
[83] L. O. Alima, S. El-Ansary, P. Brand, and S. Haridi, DKS(N,k,f): A family of low communication, scalable and fault-tolerant infrastructures for P2P applications, Proc. 3rd IEEE/ACM Int¡¯l. Symp. Cluster Comp. and the Grid, Monterey, CA, 2003, 344. 50.
[84] L. O. Alima, S. El-Ansary, P. Brand, and S. Haridi, DKS(N, k, f): A family of low communication, scalable and fault-tolerant infrastructures for P2P applications, The 3rd International workshop on Global and P2P Computing on Large Scale Distributed Systems (CCGRID 2003), Tokyo, May 2003.
[85] B. Carton, V. Mesaros, and P. Van Roy, Improving the scalability of logarithmic-degree DHT-based peer-to-peer networks, in: Proc. of Euro-Par, Aug..Sept. 2004.
[86] T. Schu¡§tt, F. Schintke, and A. Reinefeld, Structured overlay without consistent hashing: Empirical results, in: Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid (Ccgrid¡¯06), Vol. 00, CCGRID, IEEE Computer Society, Washington, DC, May 16.19, 2006, 8.
[87] T. Schu¡§tt, F. Schintke, and A. Reinefeld, Range queries on structured overlay networks, in: Computer Communications, Vol. 31, No. 2, 280.291, Feb. 2008.
[88] Antony I. T. Rowstron and Peter Druschel, Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems, Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms, Heidelberg, Nov 12.16, 2001, 329.350.
[89] K. Hildrum, J. Kubiatowicz, S. Rao, and B. Y. Zhao, Distributed object location in a dynamic network (expanded journal version of SPAA 2002 paper), Theory of Computing Systems, Mar. 2004, No. 37, 405.440.
[90] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, A scalable contentaddressable network, Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications, San Diego, CA, Aug. 2001, 161.172.
[91] S. Ratnasamy, M. Hanley, R. Karp, and S. Shenker, Topologically aware overlay construction and server selection, in: Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), June 2002.
[92] K. Aberer, A. Datta, and M. Hauswirth, Efficient, self-contained handling of identity in peer-to-peer systems, IEEE Transactions on Knowledge and Data Engineering 16(7), July 2004.
[93] K. Aberer, P. Cudre¢¥-Mauroux, A. Datta, Z. Despotovic, M. Hauswirth, M. Punceva, and R. Schmidt, P-Grid: A self-organizing structured P2P system, SIGMOD Record, 32(2), Sept. 2003.
[94] S. Rhea, B. Godfrey, B. Karp, J. Kubiatowicz, S. Ratnasamy, S. Shenker, I. Stoica, and H. Yu, OpenDHT: A public DHT service and its uses, Proceedings of ACM SIGCOMM 2005, Aug. 2005.
[95] P. Maymounkov and D. Mazieres, Kademlia: A peer-to-peer information system based on the xor metric, in: Proc of IPTPS02, Cambridge, MA, Mar. 2002.
[96] F. Kaashoek and D. R. Karger, Koorde: A simple degree-optimal hash table, IPTPS, Feb. 2003. 372 References
[97] A.-T. Gai and L. Viennot, Broose: a practical distributed hash table based on the de Bruijn topology, in: Fourth International Conference on Peer-to-Peer Computing, 2004, Aug. 2004, 167.174.
[98] A. Kumar, S. Merugu, J. Xu, and X. Yu, Ulysses: A robust, low-diameter, low-latency peer-topeer network, in Proc. of IEEE ICNP 2003.
[99] J. Xu, A. Kumar, and X. Yu, On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks, IEEE Journal on Selected Areas in Communications, Vol. 22, No. 1, Jan. 2004, 151.163.
[100] D. Malkhi, M. Naor, and D. Ratajczak, Viceroy: a scalable and dynamic emulation of the butterfly, in: Proceedings of the 21st Annual Symposium on Principles of Distributed Computing, Monterey, CA, July 21.24 183.192, 2002, PODC ¡¯02, ACM Press, 2002, 183.192.
[101] H. Shen, C.-Z. Xu, and G. Chen, Cycloid: A constant-degree and lookup-efficient P2P overlay network, in: Proc. of the 18th IEEE International Parallel and Distributed Processing Symposium (IPDPS), New Mexico, Apr. 2004.
[102] H. Shen, C.-Z. Xu, and G. Chen, Cycloid: A scalable constant-degree lookup-efficient P2P overlay network, Journal of Performance Evaluation¡¯s Special Issue on Peer-to-Peer Networks (6/29), 2005.
[103] G. Manku, M. Bawa, and P. Raghavan, Symphony: Distributed hashing in a small world, in: 4th USENIX Symposium on Internet Technologies and Systems, 2003, 127.140.
[104] Q. Lian, Z. Zhang, S. Wu, and B. Y. Zhao,. Z-Ring: Fast prefix routing via a low maintenance membership protocol, in: Proceedings of the 13TH IEEE international Conference on Network Protocols (Icnp¡¯05) – Volume 00 (Nov. 6.9, 2005), ICNP, IEEE Computer Society, Washington, DC, 2005, 132.146.
[105] R. Rodrigues and C. Blake, When multi-hop peer-to-peer routing matters, Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS04), San Diego, CA, Feb. 2004.
[106] I. Gupta, K. Birman, P. Linga, A. Demers, and R. van Renesse, Kelips: building an efficient and stable P2P DHT through increased memory and background overhead, Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS ¡¯03), 2003.
[107] K. P. Birman, et al., Bimodalmulticast, ACMTrans. Computing Systems, 17:2, May 1999, 41.88.
[108] B. Leong, B. Liskov, and E. D. Demaine. EpiChord: Parallelizing the Chord lookup algorithm with reactive routing state management, Computer Communications, Vol. 29, 1243.1259
[109] A. Gupta, B. Liskov, and R. Rodrigues, Efficient routing for peer-to-peer overlays, Proceedings of the 1st Symposium on Networked Systems Design and Implementation (NSDI 2004), 2004, 113.116.
[110] L. Monnerat and C. Amorim, D1HT: A distributed one hop hash table, in: Proc of the 20th IEEE Intl Parallel & Distributed Processing Symposium (IPDPS), Apr. 2006.
[111] J. Buford, A. Brown, and M. Kolberg. Analysis of an active maintenance algorithm for an O (1)-hop overlay, IEEE Globecom 2007, Nov. 2007.
[112] J. Buford, A. Brown, and M. Kolberg, Exploiting parallelism in the design of peer-to-peer overlays, Journal of Computer Communications, Special Issue on Foundations of Peer-to-Peer Computing, Vol. 31, No. 3, 452.463, Feb. 2008.
[113] J. Li, J. Stribling, T. M. Gil, R. Morris, and F. Kaashoek, Comparing the performance of distributed hash tables under churn, Proc. of the 3rd Intl. Workshop on Peer-to-Peer Systems (IPTPS¡¯04), 2004. References 373
[114] J. Li, J. Stribling, R. Morris, M. F. Kaashoek, and T. M. Gil, A performance vs. cost framework for evaluating DHT design tradeoffs under churn, Infocom 2005.
[115] C. Shui, H. Wang, P. Zhou, and Y. Jia: Cactus: A new constant-degree and fault tolerant P2P overlay, PRIMA 2006: 386.397.
[116] P. Fraigniaud and P. Gauron, D2B: a de Bruijn based content-addressable network, Theor. Comput. Sci. 355, 1 (Apr. 2006), 65.79.
[117] D. Li, X. Lu, and J. Wu, FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs, Proc. IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2005), Mar. 13.17, 2005, Vol. 3, 1677.1688.
[118] G. Wepiwe¢¥ and P. L. Simeonov, HiPeer: A highly reliable P2P system, IEICE – Trans. Inf. Syst. E89-D, 2 (Feb. 2006), 570.580.
[119] H. Rostami, J. Habibi, and A. Rahnama, Semantic HyperCup, in: Proceedings of the 39th Annual Hawaii international Conference on System Sciences, Vol. 9 (Jan. 4.7, 2006), HICSS. IEEE Computer Society, Washington, DC, 223.
[120] I. Abraham, A. Badola, D. Bickson, D. Malkhi, S. Maloo, and S. Ron, Practical locality awareness for large-scale information sharing, The 4th Annual International Workshop on Peer-to-Peer Systems (IPTPS ¡¯05), 2005.

Chapter 5

[121] P. Maymounkov and D. Mazieres, Kademlia: A peer-to-peer information system based on the xor metric, in: Proceedings of the IPTPS02, Cambridge, MA, Mar. 2002.
[122] D. Liben-Nowell, H. Balakrishnan, and D. Karger, Analysis of the evolution of peer-to-peer systems, in: Proceedings of the ACM PODC, Jul. 2002.
[123] S. Rhea, D. Geels, T. Roscoe, and J. Kubiatowicz, Handling churn in a DHT, in: Proceedings of the Annual Conference on USENIX Annual Technical Conference, Boston, Jun. 27.Jul. 2, 2004.
[124] J. Li, J. Stribling, T. M. Gil, R. Morris, and F. Kaashoek, Comparing the performance of distributed hash tables under churn, in: Proceedings of the IPTPS, 2004.
[125] B. Y. Zhao, et al., Tapestry: A resilient global-scale overlay for service deployment, IEEE JSAC, 22(1):41.53, Jan. 2004.
[126] K. Hildrum, J. D. Kubiatowicz, S. Rao, and B. Y. Zhao, Distributed object location in a dynamic network, in: Proceedings of the SPAA, 2002.
[127] M. Castro, M. Costa, and A. Rowstron, Performance and dependability of structured peerto- peer overlays. Technical Report MSRTR- 2003-94, Microsoft, 2003.
[128] M. F. Kaashoek and D. R. Karger, Koorde: A simple degree-optimal distributed hash table, in: Proceedings of the 2nd IPTPS, Berkeley, CA, Feb. 2003.
[129] N. De Bruijn, A combinatorial problem, in: Proc. Koninklijke Nederlandse Akademie van Wetenschappen, Vol. 49, 1946, 758.764.
[130] A. Kumar, S. Merugu, Jun Xu, and Xingxing Yu, Ulysses: a robust, low-diameter, low-latency peer-to-peer, in: Proceedings of the 11th IEEE International Conference on Network Protocols 2003, Nov. 4.7, 2003, 258.267.
[131] H. Shen, C. Xu, and G. Chen, Cycloid: a constant-degree and lookup-efficient P2P overlay network, Perform. Eval., Vol. 63, Issue 3, Mar. 2006, 195.216. 374 References
[132] M. Kolberg, F. Kolberg, A. Brown, and J. Buford, A Markov model for the Epichord peer-topeer overlay in an XCAST enabled network, in: Proceedings of the IEEE International Conference on Communications (ICC), 2007.
[133] J. Buford, A. Brown, M. Kolberg, Analysis of an active maintenance algorithm for an O(1)-hop overlay, in: Proceedings of the IEEE Global Telecommunications Conference, (IEEE GLOBECOM 2007), Nov. 26.30, 2007, 81.86.
[134] L. R. Monnerat and C. L. Amorim, D1HT: a distributed one-hop hash table, in: Proceedings of the 20th International Parallel and Distributed Processing Symposium 2006 (IPDPS 2006), Apr. 25.29, 2006.
[135] P. Kersch, R. Szabo, L. Cheng, K. Jean, and A. Galis, Stochastic maintenance of overlays in structured P2P systems, Elsevier Journal in Computer Communications, Special Issue: Foundation of Peer-to-Peer Computing, Volume 31, Issue 3, Feb. 2008, 603.619.
[136] K. Aberer, et al., The essence of P2P: a reference architecture for overlay networks, in: Proceedings of the 5th IEEE International Conference on Peer-to-Peer Computing, 2005.
[137] A. Shaker and D. S. Reeves, Self-stabilizing structured ring topology P2P systems, in: Proceedings of the 5th IEEE International Conference on Peer-to-Peer Computing, Konstanz, Germany, Aug. 2005, 39.46.
[138] M. Castro, P. Druschel, A. Kermarrec, and A. Rowstron, One ring to rule them all: service discovery and binding in structured peer-to-peer overlay networks, in: Proceedings of the 10th Workshop on ACM SIGOPS European Workshop, 2002.
[139] L. Garc es-Erice, et al., Hierarchical peer-to-peer systems, in: Proceedings of the International Conference on Parallel and Distributed Computing (Euro-Par 2003), 2003.
[140] G. Wepiwe, and P. L. Simeonov, A concentric multi-ring overlay for highly reliable P2P networks, in: Proceedings of the 4th IEEE International Symposium on Network Computing and Applications, July 27.29, 2005.
[141] M. Kleis, E. K. Lua, and X. Zhou, Hierarchical peer-to-peer networks using lightweight superpeer topologies, in: Proceedings of the 10th IEEE Symposium on Computers and Communications, 2005 (ISCC 2005), June 27.30, 2005, 143.148.
[142] E. K. Lua and X. Zhou, Network-aware superpeers-peers geometric overlay network, in: Proceedings of 16th International Conference on Computer Communications and Networks, 2007 (ICCCN 2007), Aug. 13.16, 2007, 141.148.
[143] K. W. Ross, Hash-routing for collections of shared Web caches, IEEE Network Magazine, Vol. 11, 7, Nov..Dec. 1997, 37.44.
[144] D. Karger, et al., Web caching with consistent hashing, in: Proceedings of the Eighth International World Wide Web Conference, May 1999.
[145] P. L. Simeonov. Waraan: A higher-order adaptive routing algorithm for wireless multimedia in wandering networks, in: Proceedings of the WPMC, 1385.1389, 2002.
[146] D. Stutzbach and R. Rejaie, Understanding churn in peer-to-peer networks, in: Proceedings of the 6th ACM SIGCOMM Conference on Internet Measurement Conference 2006 (IMC 2006), Oct. 25.27, 2006.

Chapter 6

[147] G. Giaccio, Stoica, A pretty flexible API for generic peer-to-peer programming, IEEE International Parallel and Distributed Processing Symposium, IPDPS 2007, Mar. 26.30, 2007, 1.8. References 375
[148] F. Dabek, B. Zhao, P. Druschel, J. Kubiatowicz, and I. Stoica, Towards a common API for structured peer-to-peer overlays, in Proc. of the 2nd International Workshop on Peer-to- Peer Systems (IPTPS03), Berkeley, CA, 2003.
[149] Gnutella Protocol Specification, available at http://wiki.limewire.org/index.php? title=GDF.
[150] T. Klingberg and B. Manfredi, Gnutella Protocol 0.6. June 2002. Available at http://rfc-gnutella.sourceforge.net/src/rfc-0_6-draft.html.
[151] R. Fielding, et al., Hypertext Transfer Protocol: HTTP/1.1. IETF RFC 2616, June 1999.
[152] B. Cohen, The BitTorrent protocol specification, www.bittorrent.org/beps/bep_0003. html, Feb 2008.
[153] A. Loewenstern, DHT protocol, available at www.bittorrent.org, Jan. 2008.
[154] B. Cohen, Incentives build robustness in BitTorrent, in: Proc. of IPTPS, 2003.
[155] M. Izal, et al., Dissecting BitTorrent: Five months in a torrent¡¯s lifetime, in: 5th Annual Passive & Active Measurement Workshop, Apr. 2004.
[156] D. Qiu and R. Srikant, Modeling and performance analysis of BitTorrent-like peer-to-peer networks, in Proc. of SIGCOMM, 2004.
[157] A. Bharambe, C. Herley, and V. Padmanabhan, Analyzing and improving a BitTorrent network¡¯s performance mechanisms, in Proc. of INFOCOM, 2006.
[158] A. Legout, G. Urvoy-Keller, and P. Michiardi, Rarest first and choke algorithms are enough, in Proc. of IMC, 2006.
[159] M. Piatek, et al., Do incentives build robustness in BitTorrent? 4th USENIX Symposium on Networked Systems Design & Implementation (NSDI 07), Apr. 2007, 1.14.
[160] A. Klemkin. Unofficial eDonkey protocol specification, unpublished manuscript, 2004; available at http://internap.dl.sourceforge.net/sourceforge/pdonkey/eDonkey-protocol- 0.6.2.
[161] Y. Kulbak and D. Bickson, The eMule protocol specification, unpublished manuscript, Jan. 2005.
[162] K. Shudo, Y. Tanaka, and S. Sekiguchi, Overlay Weaver: An overlay construction toolkit, Computer Communications Review, to appear.
[163] Overlay Weaver project Website, http://overlayweaver.sourceforge.net/.
[164] I. Baumgart, B. Heep, and S. Krause, OverSim: A flexible overlay network simulation framework, Proceedings of 10th IEEE Global Internet Symposium (GI ¡¯07) in conjunction with IEEE INFOCOM 2007, Anchorage, AK, May 2007.
[165] OverSim project Website: www.ovesim.org.
[166] S. Baset, H. Schulzrinne, and M. Matuszewski, Peer-to-Peer Protocol (P2PP), IETF draft-baset-p2psip-p2pp-01, work in progress, Nov. 2007.
[167] US National Institute of Standards, Federal Information Processing Standards (FIPS) 180-2 Secure Hash Standard (SHS), Feb. 2004.
[168] S. Rhea, B. Godfrey, B. Karp, J. Kubiatowicz, S. Ratnasamy, S. Shenker, I. Stoica, and H. Yu, OpenDHT: A public DHT service and its uses. Proceedings of ACM SIGCOMM 2005, Aug. 2005.
[169] S. Rhea, B. G. Chun, J. Kubiatowicz, and S. Shenker, Fixing the embarrassing slowness of OpenDHT on PlanetLab, Proceedings of USENIX WORLDS 2005, Dec. 2005. 376 References
[170] B. Ford, P. Srisuresh, and D. Kegel, Peer-to-peer communication across network address translators, Proceedings of the 2005 USENIX Annual Technical Conference, Anaheim, CA, Apr. 2005.
[171] H. Khlifi, J.-C. Gregoire, and J. Phillips, VoIP and NAT/firewalls: issues, traversal techniques, and a real-world solution, IEEE Communications Magazine, 44(7). July 2006, 93.99.
[172] Illuminati, http://illuminati.coralcdn.org/, accessed Sept. 2007.
[173] B. Carpenter, and S. Brim: Middleboxes: Taxonomy and issues, IETF RFC 3234, Feb 2002.
[174] P. Srisuresh, et al., Middlebox communication architecture and framework, RFC 3303, Aug. 2002.
[175] M. Stiemerling, J. Quittek, and C. Cadar, NEC¡¯s simple Midbox Control Protocol, IETF RFC 4540, May 2006.
[176] UPnP Forum, Internet Gateway Device (IGD) Standardized Device Control Protocol v. 1.0, Nov. 2001.
[177] J. Rosenberg, J. Weinberger, C. Huitema, and R. Mahy, STUN: Simple Traversal of User Datagram Protocol (UDP), IETF RFC 3489, Mar. 2003.
[178] J. Rosenberg, Interactive Connectivity Establishment (ICE): A protocol for Network Address Translator (NAT) traversal for offer/answer protocols, IETF MMUSIC WG. draftietf- mmusic-ice-17, work in progress, July 2007.
[179] J. Rosenberg, Session traversal utilities for (NAT) (STUN), draft-ietf-behave-rfc3489bis-06, work in progress, Mar. 2007.
[180] J. Rosenberg, Obtaining relay addresses from Simple Traversal Underneath NAT (STUN), draft-ietf-behave-turn-03, work in progress, Mar. 2007.
[181] Microsoft Corporation, Peer Name Resolution Protocol, Sept 2006, accessed July 2008 at http://technet.microsoft.com/en-us/library/bb726971.aspx.
[182] Microsoft Corporation, Introduction to Windows peer-to-peer networking, Sept 2006., accessed July 2008 at http://technet.microsoft.com/en-us/library/bb457079.aspx.
[183] M. Castro, P. Druschel, A-M. Kermarrec, and A. Rowstron, One ring to rule them all: Service discover and binding in structured peer-to-peer overlay networks, SIGOPS European Workshop, France, Sept. 2002.
[184] M. Jelasity, A. Montresor, and O. Babaoglu, The bootstrapping service, Proceedings of International ICDCS Workshop on Dynamic Distributed Systems (ICDCS-IWDDS¡¯06), Lisbon, Portugal, IEEE Computer Society, July 2006.
[185] J. Strauss, D. Katabi, and F. Kaashoek, A measurement study of available bandwidth estimation tools, The Internet Measurements Conference, Florida, 2003.
[186] F. Templin, T. Gleeson, M. Talwar, D. Thaler, Intra-Site Automatic Tunnel Addressing Protocol (ISATAP), IETF RTC 4214, Oct. 2005.
[187] B. Carpenter and R. Moore, Connection of IPv6 domains via IPv4 clouds, IETF RFC 3056, Feb. 2001.
[188] C. Huitema, Teredo: Tunneling IPv6 over UDP through Network Address Translations (NATs), IETF RFC 4380, Feb 2006.

Chapter 7

[189] Merriam-Webster¡¯s Online Dictionary, available at www.m-w.com/dictionary/search.
[190] http://en.wikipedia.org/wiki/Napster References 377
[191] iMesh Professional 5.0. 2005, iMesh Inc., available at www.imesh.com.
[192] The Gnutella Protocol Specification v0.4. 2001, Gnutella, available at www9.limewire. com/developer/gnutella_protocol_0.4.pdf.
[193] BearShare, available at www.bearshare.com.
[194] Shareaza, available at www.shareaza.com.
[195] LimeWire, available at www.limewire.com/english/content/home.shtml.
[196] I. Clarke, O. Sandberg, B. Wiley, and T. Hong, Freenet: a distributed anonymous information storage and retrieval system, in: Proceedings International Workshop on Design Issues in Anonymity and Unobservability, Springer, 2001.
[197] J. Mache, et al., Request algorithms in Freenet-style peer-to-peer systems, in: Proceedings of the Second IEEE International Conference on Peer to Peer Computing, Sept. 5.7, 2002, Linkoping, Sweden.
[198] A. Z. Kronfol, FASK: a fault-tolerant adaptive scalable distributed search engine, Master¡¯s Thesis, Princeton University, available at www.cs.princeton.edu/akronfol/fasd/.
[199] G. Salton, A. Wong, and C. S. Yang, A vector space model for automatic indexing, Communications of the ACM Archive, 18(11) Nov. 1975, 613.620.
[200] G. Salton and M. McGill, Introduction to Modern Information Retrieval, McGraw Hill, 1983.
[201] H. Cai and J. Wang, Exploiting Geographical and Temporal Locality to Boost Search Efficiency in Peer-to-Peer Systems, IEEE Transactions on Parallel and Distributed Systems, 2006, 17(10): 1189.1203.
[202] X. Li and J. Wu, Searching techniques in peer-to-peer networks, Handbook of Theoretical and Algorithmic Aspects of Ad Hoc, Sensor, and Peer-to-Peer Networks, J. Wu (ed.), Auerbach Publications, 2006, 617.642.
[203] J. Eberspacher, R. Schollmeier, S. Zols, and G. Kunzmann, Structured P2P networks in mobile and fixed environments, in: Proceedings 2nd International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks, 2004, West Yorkshire, UK.
[204] F. Dabek, E. Brunskill, F. Kaashoek, and D. Karger, Building peer-to-peer systems with Chord, a distributed lookup service, in: Proceedings of the 8th Workshop on Hot Topics in Operating Systems, 2001, Germany: IEEE Computer Society, 81.86.
[205] S. Ratnasamy, P. Fancis, M. Handley, and R. Karp, A scalable content-addressable network, in: Proceedings ACM SIGCOMM annual conference of the Special Interest Group on Data Communications, 2001, San Diego, CA, ACM Press, 161.172.
[206] A. Rowstron and P. Druschel, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, in: Proceedings IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), 2001, Heidelberg, ACM Press, 329.350.
[207] B. Zhao, L. Huang, J. Stribling, S. Rhea, A. Joseph, and J. Kubiatowicz, Tapestry: a resilient global-scale overlay for service deployment, IEEE Journal on Selected Areas in Communications, 22(1), 2004, 41.53.
[208] D. Loguinov, A. Kumar, and S. Ganesh, Graph theoretica analysis of structured peer-topeer systems: routing distances and fault resilience, in: Proceedings the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Karlsruhe, Germany, Aug. 25.29, 2003, 395.406. 378 References
[209] N. D. de Bruijin, A combinatorial problem, Koninklijke Netherlands: Academe Van Wetenschappen, Vol. 49, 1946, 758.764.
[210] KaZaA, available at www.kazaa.com.
[211] L. Gong, JXTA: A network programming environment, IEEE Internet Computing, 2001, 5(3): 88.95.
[212] M. A. Traversat and E. Pouyoul, Project JXTA: A loosely-consistent DHT rendezvous walker, 2003.
[213] S. Li, JXTA 2: A high-performance, massively scalable P2P network, available at www.ibm. com/developerworks/java/library/j-jxta2/#2.0.
[214] B. Yang and H. Garcia-Molina, Efficient search in peer-to-peer networks, in: Proceedings the 22nd International Conference on Distributed Computing, 2002.
[215] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, Search and replication in unstructured peerto- peer networks, in Proceedings the Sixteenth ACM International Conference on Supercomputing, 2002.
[216] A. Crespo and H. Garcia-Molina, Routing indices for peer-to-peer systems, in Proceedings of the 22nd IEEE International Conference on Distributed Computing Systems, Vienna, July 2002, 23.32.
[217] V. Kalogeraki, D. Gunopulos, and D. Zeinalipour-yazti, A local search mechanism for peerto- peer networks, in Proceedings of the 11th ACM Conference on Information and Knowledge Management, 2002.
[218] D. Tsoumakos and N. Roussopoulos, Adaptive probabilistic search in peer-to-peer networks, in: Proceedings the 2nd International Workshop on Peer-to-Peer Systems, 2003.
[219] C. Yang and J. Wu, A dominating set based routing in peer-to-peer networks, in Proceedings the 2nd International Workshop on Grid and Cooperative Computing, 2003.
[220] R. Ahmed and R. Boutaba, Distributed Pattern Matching: A Key to Flexible and Efficient P2P Search, IEEE Journal on Selected Areas in Communications, 2007, 25(1): 73.83.
[221] J. Risson and T. Moorsa, Survey of research towards robust peer-to-peer networks: Search methods, Computer Networks, Vol. 50, No. 17, Dec. 2006, 3485.3521.
[222] Y. Zhu and Y. Hu, Semantic Search in Peer-to-Peer Systems, Handbook of Theoretical and Algorithmic Aspects of Ad Hoc, Sensor, and Peer-to-Peer Networks, J. Wu (ed.), Auerbach Publications, 2006, 643.664.
[223] A. Bharambe, M. Agrawal, and S. Seshan, Mercury: supporting scalable multi-attribute range queries, in Proceedings ACM SIGCOMM2004, Aug. 30.Sept. 3, 2004, Portland, USA.
[224] A. Y. Levy, A. O. Mendelzon, Y. Sagiv, and D. Srivastava, Answering queries using views (extended abstract), in Proceedings of the 14th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, ACM Press, 1995, 95.104.
[225] G. Gupta, D. Agrawal, and A. E. Abbadi, Approximate range selection queries in peer-topeer systems, in: Proceedings of the First Biennial Conference on Innovative Data Systems Research, Asilomar, CA, 2003.
[226] A. Andrzejak and Z. Xu, Scalable, efficient range queries for grid information services, in: Proceedings of the Second IEEE International Conference on Peer to Peer Computing, Linkoping University, Sweden, Sept. 2002. References 379
[227] C. Zhang, A. Krishnamurthy, and R. Y. Wang, SkipIndex: Towards a scalable peer-to-peer index service for high dimensional data, available at www.cs.princeton.edu/chizhang/ skipindex.pdf.
[228] M. W. Berry, A. Drmac, and E. R. Jessup, Matrices, vector spaces, and information retrieval, SIAM Review, 41(2), 1999, 335.362.
[229] C. Tang, Z. Xu, and S. Dwarkadas, Peer-to-peer information retrieval using self-organizing semantic overlay networks, in Proceedings of ACM SIGCOMM, Karlsruhe, Germany, Aug. 2003, 175.186.
[230] Y. Zhu and Y. Hu, ESS: Efficient Semantic Search on Gnutella-like P2P systems, technical report, Department of ECECS, University of Cincinnati, Mar. 2004.
[231] Y. Zhu, H. Wang, and Y. Hu, Integrating semantics-based access mechanisms with P2P file systems, in: Proceedings of the 3rd International Conference on Peer-to-Peer Computing, Linkping, Sweden, Sept. 2003, 118.125.
[232] K. Yang and J. Ho, Proof: A DHT-based peer-to-peer search engine, in: Proceedings the IEEE International Conference on Web Intelligence, 2006, Hong Kong: IEEE Computer Society, 702.708.
[233] R. Ahmed and R. Boutaba, Distributed pattern matching: A key to flexible and efficient P2P search, IEEE Journal on Selected Areas in Communications, Vol. 25, No. 1, 2007, 73.83.
[234] W. Wang and L. Xiao, An effective P2P search scheme to exploit file sharing heterogeneity, IEEE Transactions on Parallel and Distrubuted Systems, 2007, 18(2): 145.157.
[235] M. Castro, M. Costa, and A. Rowstron, Should we build Gnutella on a structured overlay?, ACM SIGCOMM Computer Communication Review, 34(1), 2004, 1331.1336.
[236] B. T. Loo, R. Huebsch, I. Stoica and J. M. Hellerstein, The case for a hybrid P2P search infrastructure, in: Proceedings the 3rd International Workshop on Peer-to-Peer Systems, San Diego, CA, Feb. 26.27, 2004.
[237] D. Kundur, M. Merabti, Z. Liu, and H. Yu, Advances in peer-to-peer content search, in: Proceedings IEEE International Conference on Multimedia and Expo 2007, July 2007, Beijing.
[238] D. Gibbon, Z. Liu, and B. Shahraray, The MIRACLE Video Search Engine, CCNC 2006, Las Vegas, Jan. 8.10, 2006.
[239] M. Christel and R. Conescu, Addressing the challenge of visual information access from digital image and video libraries, JCDL¡¯05, Denver, June 7.11, 2005.
[240] C. Tang, Z. Xu, and M. Mahalingam, PeerSearch: Efficient information retrieval in peerpeer networks, Hewlett-Packard Labs: Palo Alto, 2002.
[241] J. Lu and J. Callan, Content-based retrieval in hybrid peer-to-peer networks, Proceedings of ACM CIKM¡¯03, New Orleans, Nov. 2003.
[242] C. Yang, Peer-to-peer architecture for content-based music retrieval on acoustic data, WWW 2003, Budapest, May 20.24, 2003.

Chapter 8

[243] Gnutella, available at www.gnutella.com.
[244] KaZaa, available at www.kazaa.com.
[245] BitTorrent, available at www.bittorrent.com. 380 References
[246] O. Heckmann and A. Bock, The eDonkey 2000 Protocol, KOM Technical Report 08/2002, Ver. 0.8, Dec. 2002, available at ftp://ftp.kom.e-technik.tu-darmstadt.de/pub/papers/ HB02-1-paper.pdf.
[247] V. N. Padmanabhan, H. J. Wang, P. A. Chou, and K. Sripanidkulchai, Distributing streaming media content using cooperative networking, in: Proceedings, the 12th international Workshop on Network and Operating System Support for Digital Audio and Video, Miami Beach, FL, May 2002.
[248] X. Hei, C. Liang, J. Liang, Y. Liu, and K. W. Ross, Insights into PPLive: A measurement study of a large-scale P2P IPTV system, in: Proceedings, Workshop on Internet Protocol TV (IPTV) services over World Wide Web in conjunction with WWW2006, Edinburgh, May 2006.
[249] PPLive, available at www.pplive.com.
[250] UUSee, available at www.uusee.com.
[251] M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron, SCRIBE: A large-scale and decentralized application-level multicast infrastructure, IEEE Journal on Selected Areas in Communications (JSAC), Special Issue on Network Support for Group Communication, Vol. 20, No. 8, Oct. 2002, 1489.1499.
[252] M. Castro, et al., Splitstream: Highbandwidth multicast in cooperative environments, in: Proceedings, the 20th ACM Symp. on Operating Sys. Principles (SOSP 2003), Oct. 2003.
[253] M. Castro, M. Costa, and A. Rowstron, Peer-to-peer overlays: structured, unstructured, or both?, Technical Report MSR-TR-2004-73, Microsoft Research, 2004, available at http://research.microsoft.com/antr/MS/Structella-tr.pdf.
[254] F. Dabek, E. Brunskill, F. Kaashoek, and D. Karger, Building peer-to-peer systems with Chord, a distributed lookup service, in: Proceedings the Eighth Workshop on Hot Topics in Operating Systems, Germany: IEEE Computer Society, 2001, 81.86.
[255] S. Ratnasamy, P. Fancis, M. Handley, and R. Karp, A scalable content-addressable network, in: Proceedings ACM SIGCOMM annual conference of the Special Interest Group on Data Communications, San Diego, CA, ACM Press, 2001, 161.172.
[256] A. Rowstron and P. Druschel, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, in: Proceedings IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, ACM Press, 2001, 329.350.
[257] B. Zhao, et al., Tapestry: a resilient global-scale overlay for service deployment, IEEE Journal on Selected Areas in Communications, 22(1), 2004, 41.53.
[258] J. Lan, X. Liu, P. Shenoy, and K. Ramamritham, Consistency maintenance in peer-to-peer file sharing networks, in: Proceedings, the 3rd IEEE Workshop on Internet Applications, June 2003, 90.94.
[259] S. Podlipnig and L. Bo¡§szo¡§rmenyi, A survey of Web cache replacement strategies, ACM Computing Surveys (CSUR), Vol. 35, No. 4, Dec. 2003, 374.398.
[260] P. Cao and S. Irani, Cost-aware WWW proxy caching algorithms, in: Proceedings, the USENIX Symposium on Internet Technologies and Systems, 1997, 193.206.
[261] C. C. Aggarwal, J. L. Wolf, and P. S. Yu, Caching on the World Wide Web, IEEE Transactions on Knowledge and Data Eng., Vol. 11, No. 1, Jan. 1999, 94.107.
[262] C.-Y. Chang, T. Mcgregor, and G. Holmes, The LRU* WWW proxy cache document replacement algorithm, in: Proceedings, the Asia Pacific Web Conference, 1999. References 381
[263] B. Krishnamurthy and C. E. Wills, Proxy cache coherency and replacement.towards a more complete picture, in: Proceedings, the 19th International Conference on Distributed Computing Systems. IEEE Computer Society, Piscataway, NJ, 1999, 332.339.
[264] J. Wang, A survey of Web caching schemes for the Internet, ACM Comput. Commun. Rev., Vol. 29, No. 5, Oct. 1999, 36.46.
[265] H. Bahn, K. Koh, S. L. Min, and S. H. Noh, Efficient replacement of nonuniform objects in Web caches, IEEE Comput., Vol. 35, No. 6, June 2002, 65.73.
[266] M. Rabinovich and O. Spatscheck, Web caching and replication, Addison-Wesley, 2002.
[267] P. Kalnis, et al., An adaptive peer-to-peer network for distributed caching of OLAP results, in: Proceedings, the 2002 ACM SIGMOD international conference on management of data, Hong Kong, 2002, 25.36.
[268] J. Liang, R. Kumar, and K. W. Ross, The FastTrack overlay: A measurement study, Computer Networks, Vol. 50, No. 6, Apr. 2006, 842.858.
[269] A. Wierzbicki, N. Leibowitz, M. Ripeanu, and R. Wozniak, Cache replacement policies for P2P file sharing protocols, European Transactions on Telecommunications, Vol. 15, No. 6, Nov. 2004, 559.569.
[270] A. Wierzbicki, N. Leibowitz, M. Ripeanu, and R. Wozniak, Cache replacement policies revisited: the case of P2P traffic, in: Proceedings, IEEE International Symposium on Cluster Computing and the Grid, Apr. 2004, 182.189.
[271] M. Zhang, J.-G. Luo, L. Zhao, and S.-Q. Yang, A peer-to-peer network for live media streaming using a push-pull approach, in: Proceedings of the 13th Annual ACM International Conference on Multimedia, Singapore, 2005, 287.290.
[272] M. Khambatti, K. Ryu, and P. DasGupta, Push-pull gossiping for information sharing in peer-to-peer communities, in: Proceedings, International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), Las Vegas, June 2003, 1393.1399.
[273] K. Aberer, et al., Advanced peer-to-peer networking: The P-Grid system and its applications, PIK – Praxis der Informationsverarbeitung und Kommunikation, Special Issue on P2P Systems, Vol. 26, No. 3, 2003.
[274] X. Zhang, J. Liu, B. Li, and T. P. Yum, Coolstreaming/donet: A data-driven overlay network for peer-to-peer live media streaming, in: Proceedings, 24th Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM, Miami, FL, 2005.
[275] K.-A. Skevik, V. Goebel, and T. Plagemann, Design of a hybrid CDN, Lecture Notes in Computer Science, Vol. 3311/2004, Interactive Multimedia and Next Generation Networks, Springer, Oct. 2004, 206.217.
[276] K.-A. Skevik, V. Goebel, and T. Plagemann, Analysis of BitTorrent and its use for the design of a P2P based streaming protocol for a hybrid CDN, Technical Report, Universitetet I Oslo, June 2004, available at www.ifi.uio.no/forskning/grupper/dmms/ papers/129.pdf.
[277] D. Xu, S. Kulkarni, C. Rosenberg, and H.-K. Chai, A CDN-P2P hybrid architecture for costeffective streaming media distribution, available at www.cs.purdue.edu/homes/dxu/ pubs/MMCN03-enhanced.pdf.
[278] D. Xu, S. Kulkarni, C. Rosenberg, and H.-K. Chai, Analysis of a hybrid architecture for costeffective streaming media distribution, in: Proceedings, SPIE/ACM Conference on Multimedia Computing and Networking (MMCN 2003), Santa Clara, CA, Jan. 2003. 382 References
[279] D. Xu, S. Kulkarni, C. Rosenberg, and H.-K. Chai, Analysis of a CDN-P2P hybrid architecture for cost-effective streaming distribution, ACM/Springer Multimedia Systems Journal, 11(4), 2006.
[280] A. Choonhwa Lee Helal, N. Desai, V. Verma, and B. Arslan, Konark: A system and protocols for device independent, peer-to-peer discovery and delivery of mobile services, IEEE Transactions on Systems, Man and Cybernetics, Part A, Vol. 33, No. 6, Nov. 2003, 682.696.
[281] R. Buyya, M. Pathan, and A. Vakali, Content delivery network, Springer, Apr. 2008.
[282] G. Held, A practical guide to content delivery networks, Auerbach, Sept. 2005.
[283] S. Hull, Content delivery networks: Web switching for security, availability, and speed, McGraw-Hill, Feb. 2002.
[284] D. C. Verma, Content distribution Nnetworks: An engineering approach, John Wiley & Sons, Dec. 2001.
[285] P. Venkatesh, S. D. Sivanandam, and R. Venkatesan, A review of consistency mechanisms for QoS aware content distribution networks, Academic Open Internet Journal, Vol. 14, June 2005, 8, available at www.acadjournal.com/2005/v14/part6/p8/.
[286] S. Saroiu, et al., An analysis of Internet content delivery systems, in: Proceedings, 5th Symposium on Operating Systems Design and Implementation, Boston, Dec. 2002, 315.328.
[287] J. Dilley, et al., Globally distributed content delivery, IEEE Internet Computing, Vol. 6, No. 5, Sept. 2002, 50.58.
[288] A. Vakali and G. Pallis, Content delivery networks: status and trends, IEEE Internet Computing, Vol. 7, No. 6, Nov. 2003, 68.74.
[289] J. Li, On peer-to-peer (P2P) content delivery, Peer-to-Peer Networks and Applications, an International Journal, Vol. 1, No. 1, Feb. 2008.
[290] S. Androutsellis-Theotokis and D. Spinellis, A survey of peer-to-peer content distribution technologies, ACM Computing Surveys (CSUR) archive, Vol. 36, No. 4, Dec. 2004, 335.371.
[291] D. Stolarz, Mastering Internet video: A guide to streaming and on-demand video, Addison- Wesley Professional, Aug. 2004.
[292] W. Simpson, Video Over IP: A practical guide to technology and applications, Focal Press, Sept. 2005.

Chapter 9

[293] PPLive, available at www.pplive.com.
[294] UUSee, available at www.uusee.com.
[295] SopCast, available at www.sopcast.com.
[296] QQLive, available at http://tv.qq.com.
[297] PPStream, available at www.ppstream.com.
[298] Feidian, available at www.feidian.com.
[299] TVAnts, available at www.tvants.com.
[300] J. Liebeherr, and M. El Zarki, Mastering Networks: an Internet lab manual, Addison-Wesley, Aug. 2003. References 383
[301] J. Liebeherr, Overlay networks lecture notes, available at www.cs.virginia.edu/cs757/ slidespdf/757-09-overlay.pdf.
[302] S. Fahmy, and M. Kwon, Characterizing overlay multicast networks and their costs, IEEE/ ACM Transactions on Networking, in: Proceedings, 11th IEEE International Conference on Network Protocols, 2003.
[303] H. Yu, and J. Buford, Peer-to-peer overlay multicast, in: Encyclopedia of Wireless and Mobile Communications, Auerbach Publications, January 2008.
[304] J. Chuang and M. Sirbu, Pricing multicast communications: A cost-based approach, Journal of Telecommunication Systems, Vol. 17, No. 3, July 2001, 281.297.
[305] Y.-H. Chu, S. G. Rao, S. Seshan, and H. Zhang, A case for end system multicast, IEEE Journal on Selected Areas in Communications (JSAC), Special Issue on Network Support for Group Communication, Vol. 20, No. 8, Oct. 2002, 1456.1471.
[306] X. Hei, C. Liang, J. Liang, Y. Liu, and K. W. Ross, Insights into PPLive: A measurement study of a large-scale P2P IPTV system, in: Proceedings, Workshop on Internet Protocol TV (IPTV) services over World Wide Web in conjunction with WWW2006, Edinburgh, May 2006.
[307] B. Zhang, et al., Universal IP multicast delivery, Computer Networks, Vol. 50, No. 6, Apr. 2006, 781.806.
[308] Q. He and M. Ammar, Dynamic host-group/multi-destination routing for multicast sessions, Journal of Telecommunication Systems, Vol. 28, 2005, 409.433.
[309] Y. Chawathe, S. Maccanne, and E. A. Brewer, RMX: Rliable multicast for heterogeneous networks, in: Proceedings, IEEE Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM, Mar. 2000.
[310] S. Q. Zhuang, et al., Bayeux: An Architecture for scalable and fault-tolerant wide-area data dissemination, in: Proceedings, the 11th International Workshop on Network and Operating System Support for Digital Audio and Video, June 2001.
[311] J. Jannotti, et al., Overcast: reliable multicasting with an overlay network, in: Proceedings, the Symposium on Operating Systems Design and Implementation, Oct. 2000.
[312] D. Anderson, H. Balakrishnan, F. Kaashoek, and R. Morris, Resilient overlay networks, in: Proceedings, IEEE Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM, Mar. 2000.
[313] Z. Li, Y. Shin, and P. Mohapatra, A survey of overlay multicasting technologies, course project, available at http://networks.cs.ucdavis.edu/lizhi.
[314] M. Castro, P. Druschel, A.-M. Kermarrec, and A. Rowstron, SCRIBE: A large-scale and decentralized application-level multicast infrastructure, IEEE Journal on Selected Areas in Communications (JSAC), Special Issue on Network Support for Group Communication, Vol. 20, No. 8, Oct. 2002, 1489.1499.
[315] A. Rowstron and P. Druschel, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, in: Proceedings, the ACM/IFIP/USENIX International Middleware Conference, Nov. 2001.
[316] I. Stoica, R. Morris, et al., Chord: A scalable peer-to-peer lookup protocol for Internet applications, IEEE/ACM Transaction on Networking, Vol. 11, No. 1, 2003, 17.32.
[317] S. Ratnasamy et al., A scalable content-addressable network, in: Proceedings, ACM SIGCOMM, 2001, 161.72.
[318] B. Y. Zhao et al., Tapestry: A resilient global-scale overlay for service deployment, IEEE Journal on Selected Areas in Communications, Vol. 22, No. 1, Jan. 2004, 41.53. 384 References
[319] P. Maymounkov and D. Mazieres, Kademlia: A peer-to-peer information system based on the XOR metric, Springer Lecture Notes in Computer Science, Peer-to-Peer Systems, Vol. 2429, Feb. 2002, 53.65.
[320] F. Kaashoek and D. Karger, Koorde: A simple degree-optimal hash table, in: Proceedings, 2nd International Workshop on Peer-to- Peer Systems (IPTPS¡¯03), Berkeley, CA, Feb. 2003.
[321] Overview of OverlayWeaver, available at http://overlayweaver.sourceforge.net/, Apr. 8, 2007.
[322] D. Moen, Overview of overlay multicast protocols, available at http://netlab.gmu.edu.
[323] V. N. Padmanabhan, H. J. Wang, P. A. Chou, and K. Sripanidkulchai, Distributing streaming media content using cooperative networking, in: Proceedings, the 12th International Workshop on Network and Operating System Support for Digital Audio and Video, Miami Beach, FL, May 2002.
[324] M. Castro, et al., Splitstream: Highbandwidth multicast in cooperative environments, in: Proceedings, the 20th ACM Symp. on Operating Sys. Principles (SOSP 2003), Oct. 2003.
[325] J. Li, P. A. Chou, and C. Zhang, Mutualcast: an efficient mechanism for content distribution in a P2P network, in: Proceedings, Acm Sigcomm Asia Workshop, Beijing, Apr. 2005.
[326] V. K. Goyal, Multiple description coding: compression meets the network, IEEE Signal Processing Magazine, Vol. 18, No. 5, Sept. 2001, 74.93.
[327] M. Zhang, L. Zhao, J. G. Luo, and S. Q. Yang, A peer-to-peer network for live media streaming using a push-pull approach, in Proceedings, ACM Multimedia 2005, Singapore, Sept. 2005, 287.290.
[328] S. Banerjee, B. Bhattacharjee, and C. Kommareddy, Scalable application layer multicast, in: Proceedings, ACM SIGCOMM2002, Sept. 2002.
[329] S. Shi and J. Turner, Routing in overlay multicast networks, in: Proceedings, IEEE Twenty- First Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM, June 2002.
[330] S. Banerjee, C. Kommareddy, K. Kar, B. Bhattacharjee, and S. Khuller, Construction of an efficient overlay multicast infrastructure for real-time applications, in: Proceedings, IEEE Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM, Apr. 2003.
[331] Y. Chawathe, Scattercast: an architecture for Internet broadcast distribution as an infrastructure service, Ph.D. thesis, University of California, Berkeley, Dec. 2000.
[332] L. Lao, J.-H. Cui, M. Gerla, and D. Maggiorini, A comparative study of multicast protocols: Top, bottom, or in the middle? in: Proceedings, 8th IEEE Global Internet Symposium (GI¡¯05) in conjunction with IEEE INFOCOM¡¯05, Miami, FL, Mar. 2005.
[333] M. Castro, et al., An evaluation of scalable application-level multicast built using peer-topeer overlays, in: Proceedings, IEEE Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies INFOCOM, Apr. 2003.
[334] Y. K. Dalal and R. Metcalfe, Reverse path forwarding of broadcast packets, Communications of the ACM, Vol. 21, No. 12, Dec. 1978, 1040.1048.
[335] A. El-Sayed, V. Roca, and L. Mathy, A survey of proposals for an alternative group communication service, IEEE Network, Vol. 17, No. 1, Jan./Feb. 2003, 46.51.
[336] C. Abad, W. Yurcik, and R. H. Campbell, A survey and comparison of end-system overlay multicast solutions suitable for network centric warfare, in: Proceedings, SPIE, Vol. 5441, 215, April 2004. References 385
[337] Z. Anwar, W. Yurcik, R. H. Campbell, A survey and comparison of peer-to-peer group communication systems suitable for network-centric warfare, in: Proceedings, SPIE, Vol. 5820, 2005, 33.44.

Chapter 10

[338] T. Henderson, Observations on game server discovery mechanisms, in: Proceedings of the ACM SIGMULTIMEDIA NetGames 2002: First Workshop on Network and System Support for Games, Apr. 2002.
[339] H. Zheng, E. K. Lua, M. Pias, and T. G. Griffin, Internet routing policies and round-trip times, in: Proceedings of the Passive Active Measurement Workshop 2005 (PAM 2005), Mar. 30.Apr. 1, 2000.
[340] E. K. Lua, J. Crowcroft, and M. Pias, Highways: Proximity clustering for scalable peer-topeer networks, in: Proceedings of the 4th IEEE International Conference on Peer-to-Peer Computing (IEEE P2P 2004), Aug. 25.27, 2004, 266.267.
[341] T. S. Eugene Ng and H. Zhang, Predicting Internet network distance with coordinatesbased approaches, in: Proceedings of the IEEE INFOCOM 2002, New York, June 2002.
[342] Marcelo Pias, et al., Lighthouses for scalable distributed location, in: Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS 2003), Feb. 2003.
[343] L. Tang and M. Crovella, Virtual landmarks for the Internet, in: Proceedings of the ACM SIGCOMM Internet Measurement Conference (IMC 2003), Miami, FL, Oct. 2003.
[344] H. Lim, J. Hou, and C. Choi, Constructing Internet coordinate system based on delay measurement, in: Proceedings of the ACM SIGCOMM Internet Measurement Conference (IMC 2003), Miami, FL, Oct. 2003.
[345] Y. Mao and L. K. Saul, Modeling distances in large-scale networks by matrix factorization, in: Proceedings of the 4th ACMSIGCOMMconference on Internet Measurement, 2004, 278.287.
[346] M. Costa, M. Castro, A. Rowstron, and P. Key, PIC: Practical Internet Coordinates for distance estimation, in: Proceedings of the 24th IEEE International Conference on Distributed Computing Systems (ICDCS¡¯ 04), Tokyo, Mar. 2004.
[347] F. Dabek, R. Cox, F. Kaashoek, and R. Morris, Vivaldi: A decentralized network coordinate system, in: Proceedings of the ACM SIGCOMM 2004, Portland, OR, Aug. 2004.
[348] Y. Shavitt and T. Tankel, Big-bang simulation for embedding network distances in Euclidean space, in: Proceedings of the IEEE INFOCOM 2003, San Francisco, Apr. 2003.
[349] Y. Shavitt and T. Tankel, On the curvature of the Internet and its usage for overlay construction and distance estimation, in: Proceedings of the IEEE INFOCOM 2004, Hong Kong, Mar. 7.11 2004.
[350] Y. Shavitt and T. Tankel, Hyperbolic embedding of internet graph for distance estimation and overlay construction, IEEE/ACM Transactions on Networking (TON), Volume 16, Issue 1, Feb. 2008, 25.36.
[351] P. Pietzuch, J. Ledlie, and M. Seltzer, Supporting network coordinates on PlanetLab, in: Proceedings of the 2nd Workshop on Real, Large Distributed Systems (WORLDS 2005), Dec. 2005.
[352] P. Druschel and A. Rowstron, Pastry: Scalable distributed object location and routing for large-scale peer-to-peer systems, in: Proceedings of the 18th IFIP/ACM Middleware 2001, Nov. 2001. 386 References
[353] I. Stoica, et al., Chord: A scalable peer-to-peer lookup service for Internet applications, in: Proceedings of the ACM SIGCOMM Technical Conference 2001, San Diego, Aug. 2001.
[354] F. Dabek, M. F. Kaashoek, D. Karger, R. Morris, and I. Stoica, Wide area cooperative storage with CFS, in: Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP 2001), Chateau Lake Louise, Banff, Canada, Oct. 21.24, 2001.
[355] M. Kleis, E. K. Lua, and X. Zhou, Hierarchical peer-to-peer networks using lightweight superpeer topologies, in: Proceedings of the IEEE Symposium on Computers and Communications (ISCC 2005), La Manga del Mar Menor, Cartagena, Spain, June 27.30, 2005, 143.148.
[356] E. K. Lua, X. Zhou, J. Crowcroft, and P. V. Miegham, Hierarchical geometric overlay multicast network, in: Proceedings of the 25th IEEE INFOCOM Conference 2006 Posters and Demo, Barcelona, Apr. 25.27, 2006.
[357] E. K. Lua, X. Zhou, J. Crowcroft, and P. V. Mieghem, Scalable multicasting with network-aware geometric overlay, Elsevier Journal of Computer Communications, Special Issue of Disruptive Networking with Peer-to-Peer (P2P) Systems, Vol. 31, Issue 3, Feb. 25, 2008, 464-488.
[358] P. Pietzuch, et al., Network-aware operator placement for stream-processing systems, in: Proceedings of the 22nd International Conference onData Engineering (ICDE 2006), Apr. 2006.
[359] J. Ledlie, P. Pietzuch, and M. Seltzer, Stable and Accurate Network Coordinates, in: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), July 04.07, 2006.
[360] J. Bourgain, On Lipschitz embedding of finite metric spaces in Hilbert space, Israel J. Math, 52(1-2):46.52, 1985.
[361] W. B. Johnson and J. Lindenstrauss, Extensions of Lipschitz mappings into a Hilbert space, Amer. Math. Soc., 1984, 46.52.
[362] J. A. Nelder and R. Mead, A simplex method for function minimization, The Computer Journal, 7(4):308.313, 1965.
[363] S. Floyd, V. Jacobson, C.-G. Liu, S. McCanne, and L. Zhang, A reliable multicast framework for light-weight sessions and application level framing, IEEE/ACM Trans. Netw., 5(6):784.803, 1997.
[364] D. R. Karger and M. Ruhl, Finding nearest neighbors in growth-restricted metrics, in: Proceedings of the 34th Annual ACM symposium on Theory of Computing, 2002, 741.750.
[365] M. Castro, P. Druschel, Y. C. Hu, and A. Rowstron, Exploiting network proximity in peer-topeer overlay networks, Microsoft Research Technical Report, MSR-TR-2002-82, May 2002.
[366] S. Halabi and D. McPherson, Internet routing architectures, 2nd ed., Cisco Press, 2000.
[367] J. B. Kruskal and M. Wish, Multidimensional scaling, technical report, Sage University Series, 1978.
[368] J. W. Cannon, W. J. Floyd, R. Kenyon, and W. R. Parry, Hyperbolic geometry, Flavors of geometry, Cambridge University Press, 1997.
[369] W. P. Thurston, Three-dimensional geometry and topology, Princeton Mathematical Series 35, Princeton University Press, 1997.
[370] J. W. Anderson, Hyperbolic geometry, Springer, 2001.
[371] B. Wong, A. Slivkins, and E. G. Sirer, Meridian: a lightweight network location service without virtual coordinates, SIGCOMM Comput. Commun. Rev. 35, 4, Oct. 2005, 85.96. http://doi.acm.org/10.1145/1080091.1080103 References 387
[372] E. K. Lua, et al., On the accuracy of embeddings for internet coordinate systems, in: Proceedings of the ACM SIGCOMM-Usenix Internet Measurement Conference 2005 (IMC 2005), Oct. 19.21, 2005.
[373] H. Zheng, E. K. Lua, M. Pias, and T. G. Griffin, Internet routing policies and round-triptimes, in Proceedings of the Passive Active Measurement Workshop 2005 (PAM 2005), Mar. 30.Apr. 1, 2005.
[374] P. Pietzuch, J. Ledlie, M. Mitzenmacher, and M. Seltzer, Network-aware overlays with network coordinates, in: Proceedings of IWDDS 2006, Lisbon, Portugal, July 2006.
[375] S.-J. Lee, et al., Measuring bandwidth between PlanetLab nodes, in: PAM, Boston, Mar. 2005.
[376] D. Oppenheimer, D. A. Patterson, and A. Vahdat, A case for informed service placement on PlanetLab, Technical Report 04-025, PlanetLab, 2004.
[377] M. Szymaniaka, D. Presottob, G. Pierrea, and M. V. Steen, Practical large-scale latency estimation, Elsevier Journal of Computer Networks, Vol. 52, Issue 7,May 15, 2008, 1343.1364.

Chapter 11

[378] J. Pang, et al., Availability, usage, and deployment characteristics of the domain name system, in: Proceedings of the 4th ACM SIGCOMM Conference on internet Measurement, Taormina, Italy, Oct. 25.27, 2004, IMC ¡¯04, ACM, 1.14.
[379] R. Cox, A. Muthitacharoen, and R. Morris, Serving DNS using a peer-to-peer lookup service, in Revised Papers From the First international Workshop on Peer-to-Peer Systems, Mar. 7.8, 2002, P. Druschel, M. F. Kaashoek, and A. I. Rowstron (eds.), Lecture Notes in Computer Science, Vol. 2429, Springer-Verlag, 2002, 155.165.
[380] J. Jung, E. Sit, H. Balakrishnan, and R. Morris, DNS performance and the effectiveness of caching, in: Proceedings of the ACM SIGCOMM Internet Measurement Workshop ¡¯01, San Francisco, Nov. 2001.
[381] V. Pappas, D. Massey, A. Terzis, L. Zhang, A comparative study of current DNS with DHTbased alternatives, IEEE INFOCOM 2006, Apr. 2006.
[382] V. Ramasubramanian and E. Sirer, The design and implementation of a next generation name service for the Internet, in: Proceedings of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, Portland, OR, Aug. 30.Sept. 3, 2004, SIGCOMM ¡¯04, ACM, 331.342.
[383] D. G. Andersen, H. Balakrishnan, M. F. Kaashoek, and R. Morris, Resilient overlay networks, Proc. 18th ACM Symposium on Operating Systems Principles (SOSP), Banff, Canada, Oct. 2001, 131.145.
[384] D. Andersen, A. Snoeren, and H. Balakrishnan, Best-path vs. multipath overlay routing, Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement (IMC¡¯03), 2003.
[385] S. Qazi and T. Moors, Scalable resilient overlay networks using destination-guided detouring, Proc. IEEE International Conference on Communications (ICC), June 2007.
[386] Y. Zhu, C. Dovrolis, and M. Ammar, Proactive and reactive bandwidth driven overlay routing: A simulation study, Computer Networks, 50(6):742.762, Apr. 2006.
[387] Sung-Ju Lee, S. Banerjee, P. Sharma, P. Yalagandula, and S. Basu, Bandwidth-aware routing in overlay networks, IEEE INFOCOM 2008, 27th Conference on Computer Communications, Apr. 13.18, 2008, 1732.1740. 388 References
[388] R. Braden, D. Clark, and S. Shenker, Integrated services in the Internet architecture: An overview, IETF RFC 1633, June 1994.
[389] S. Blake, et al., An architecture for differentiated services. IETF RFC 2475.
[390] L. Subramanian, I. Stoica, H. Balakrishnan, and R. H. Katz, OverQos: an overlay based architecture for enhancing internet Qos, in: Proceedings of the 1st Conference on Symposium on Networked Systems Design and Implementation, Vol. 1, San Francisco, Mar. 29.31, 2004, USENIX Association, Berkeley, CA, 2004, 6.6.
[391] Z. Li and P. Mohapatra, QRON: QoS-Aware routing in overlay networks, IEEE J. Selected Areas in Comm., Vol. 22, No. 1, 2004, 29.40.
[392] Z. Duan, Z. Zhang and Y. Hou, Service overlay networks: SLAs, QoS, and bandwidth provisioning, IEEE/ACM Transactions in Networking 11(6), 2003, 870.883.
[393] Institute for Electrical and Electronics Engineers, IEEE P1903 Standard for Next Generation Service Overlay Networks, http://grouper.ieee.org/groups/ngson/.
[394] M. Balazinska, H. Balakrishnan, and D. Karger, INS/Twine: A scalable peer-to-peer architecture for intentional resource discovery, Proceedings of Pervasive 2002.
[395] C. Bettstetter and C. Renner, A comparison of service discovery protocols and implementation of the service location protocol, Proceedings EUNICE 2000, Sept 2000.
[396] W. B. Bradley and David P. Maher, The NEMO P2P service orchestration framework, Proceedings of the 37th Hawaii International Conference on System Sciences, 2004.
[397] J. Buford, A. Brown, and M. Kolberg, Meta service discovery, 4th IEEE International Conference on Pervasive Computing and Communications (PerCom), 3rd IEEE International Workshop on Mobile Peer-to-Peer Computing (MP2P¡¯06), Pisa, Italy, 2006, 124.129.
[398] C. Lee and S. Helal, Protocols for service discovery in dynamic and mobile networks, Intl. J. of Computer Research, Vol. 11, No. 1, 2002, 1.12.
[399] G. G. Richard III, Service advertisement and discovery: Enabling universal device cooperation, IEEE Internet Computing, Vol. 4(5), Sept./Oct. 2000.
[400] G. G. Richard III, Service and device discovery: Protocols and programming, McGraw-Hill, 2002.
[401] C. Schmidt and M. Parashar, A peer-to-peer approach to Web service discovery, World Wide Web Journal, Vol. 7, Issue 2, June 2004.
[402] F. Zhu, M. Mutka, L. Ni, Classification of service discovery in pervasive computing environments, MSU-CSE-02-24, Michigan State University, 2002.
[403] Todd D. Hodes, et al., An architecture for secure wide-area service discovery, Wireless Networks, 8(2/3):213.230, 2002.
[404] V. Ramasubramanian and E. Sirer, Beehive: O(1) lookup performance for power-law query distributions in peer-to-peer overlays, in: Proc. of Networked System Design and Implementation (NSDI), Mar. 2004.
[405] X. Gu, K. Nahrstedt, and B. Yu, SpiderNet: An integrated peer-to-peer service composition framework, in: Proceedings of the 13th IEEE international Symposium on High Performance Distributed Computing (Hpdc¡¯04), Vol. 00, June 4.6, 2004,Washington, DC, 2004, 110.119.
[406] D. Clark, et al., Overlay networks and the future of the Internet. Communications & Strategies, No. 63, 3rd quarter 2006.
[407] R. Bless, O. P. Waldhorst, and C. P. Mayer, The spontaneous virtual networks architecture for supporting future internet services and applications, June 2008. References 389
[408] Ambient Networks Deliverable, System Design of SATO & ASI, www.ambientnetworks. org/Files/deliverables/D12-F.1_PU.pdf, Sept. 2007.
[409] J. Buford, A. Wang, X. Hei, Y. Liu, and K. Ross, Discovery of in-band streaming services in peer-to-peer overlays. IEEE Globecom 2007, Nov. 2007.
[410] I. Stoica, et al., Chord: a scalable peer-to-peer lookup protocol for internet applications, IEEE/ACM Trans. Netw. 11, 1, Feb. 2003, 17.32.
[411] J. Byers, J. Considine, and M. Mitzenmacher, Simple load balancing for distributed hash tables, in Proceedings of IPTPS, Berkeley, CA, Feb. 2003.
[412] A. Rao, et al., Load balancing in structured P2P systems, in: Proceedings of IPTPS, Berkeley, CA, Feb. 2003.
[413] S. Surana, et al., Load balancing in dynamic structured peer-to-peer systems, Perform. Eval. 63, 3, Mar. 2006, 217.240.

Chapter 12

[414] J. Rosenberg, et al., SIP: Session Initiation Protcol, IETF RFC 3261, June 2002.
[415] H. Sinnreich and A. B. Johnston, Internet communications using SIP: Delivering VoIP and multimedia services with Session Initiation Protocol, 2nd ed., Wiley, 2006.
[416] ITU-T, Packet-based multimedia communications systems, Rec. H.323 v6, May 2006.
[417] 3GPP, Technical Specification Group Services and System Aspects, IP Multimedia Subsystem (IMS), Stage 2, V5.15.0, TS 23.228, 3rd Generation Partnership Project, 2006.
[418] Gonzalo Camarillo and Miguel-Angel Garc©¥¢¥a-Mart©¥¢¥n, The 3G IP Multimedia Subsystem (IMS): Merging the Internet and the cellular worlds, John Wiley & Sons, 2006.
[419] J. Buford, A. Wang, X. Hei, Y. Liu, and K. Ross, Discovery of in-band streaming services in peer-to-peer overlays. IEEE Globecom 2007, General Symposium track on P2P Networking, Nov. 2007.
[420] Y. Liu, et al., Application level relay for high-bandwidth data transport, First Workshop on Networks for Grid Applications (GridNets), San Jose, Oct. 2004.
[421] TeleGeography Report and Database, International carriers¡¯ traffic grows despite Skype popularity, Retrieved on Sept. 20, 2007, www.telegeography.com/cu/article.php? article_id=15656&email;=html.
[422] H. Max and T. Ray, Skype: The definitive guide, Que, 2006.
[423] S. Ren, L. Guo, and X. Zhang, ASAP: An AS-aware Peer-relay protocol for high quality VoIP with low overhead, in: Proceedings of 26th International Conference on Distributed Computing Systems (ICDCS¡¯06), Lisbon, Portugal, July 4.7, 2006.
[424] J. Zhou, J. Buford, K. Dhara, M. Kolberg, V. Krishnaswamy, and X. Wu, Discovery and composition of communication services in peer-to-peer overlays, IEEE Workshop on Service Discovery and Composition in Ubiquitous and Pervasive Environments (SUPE¡¯07), Nov. 2007.
[425] A. Johnston, et al., Session Initiation Protocol Service Examples, IETF Internet draft, draft-ietf-sipping-service-examples-12 (work in progress), Jan 2007.
[426] S. Baset and H. Schulzrinne, An analysis of the Skype peer-to-peer Internet telephony protocol, Columbia University, Department of Computer Science, Technical Report cucs-039-04, 2004. 390 References
[427] S. Guha, N. Daswani, and R. Jain, An experimental study of the Skype peer-to-peer VoIP system, in: IPTPS, 2006.
[428] T. Ho©¬feld, Measurement and analysis of Skype VoIP traffic in 3G UMTS systems, 4th International Workshop on Internet Performance, Simulation, Monitoring and Measurement, IPS-MoMe 2006, Salzburg, Feb. 2006.
[429] K. Suh, D. R. Figueiredo, J. Kurose, and D. Towsley, Characterizing and detecting Skype-relayed traffic, in: Proceedings of IEEE Infocom (Infocom 2006), Barcelona, Apr. 2006.
[430] H. Xie, Y. Yang, A measurement-based study of the Skype peer-to-peer VoIP performance, The 6th International Workshop on Peer-to-Peer Systems. IPTPS 2007, Feb 2007.
[431] E. Cooper, A. Johnston, and P. Matthews, A distributed transport function in P2PSIP using HIP for multi-hop overlay routing, draft-matthews-p2psip-hip-hop-00, IETF P2P-SIP WG, work in progress, June 2007.
[432] R. Moskowitz and P. Nikander, Host Identity Protocol (HIP) architecture, IETF RFC 4423, May 2006.
[433] R. Moskowitz, P. Nikander, P. Jokela, and T. Henderson, Host Identity Protocol, IETF HIP WG, work in progress, draft-ietf-hip-base-08, June 2007.
[434] F. Al-Shraideh, Host Identity Protocol, International Conference on Networking, ICN/ ICONS/MCL 2006, Apr. 2006, 203.
[435] C. Jennings, J. Rosenberg, and E. Rescorla, ASP: Address Settlement by Peer-to-Peer, draftjennings- p2psip-asp-00. IETF P2P-SIP WG, work in progress, July 2007.
[436] International Engineering Consortium, Voice over Internet Protocol, www.iec.org/online/ tutorials/int_tele.
[437] B. Ford, P. Srisuresh, and D. Kegel, Peer-to-peer communication across network address translators, Proceedings of the 2005 USENIX Annual Technical Conference, Anaheim, CA, Apr. 2005.
[438] H. Khlifi, J.-C. Gregoire, and J. Phillips, VoIP and NAT/firewalls: issues, traversal techniques, and a real-world solution, IEEE Communications Magazine, 44 (7), July 2006, 93.99.
[439] V. Kumar, M. Korpi, and S. Sengodan, IP telephony with H.323: Architectures for unified networks and integrated services, Wiley, 2006.
[440] A. Liotta and L. Lin, IP Multimedia Subsystem: The operator¡¯s response to P2P service demand, IEEE Communications Magazine 45 (7), July 2007, 76.83.
[441] P2P-SIP, www.p2psip.org.
[442] B. Karacali, M. J. Karol, A. S. Krishnakumar, P. Krishnan, and J. Meloche. Simple On- Demand Overlays for Reliable Real-Time Traffic in Enterprise Networks. International Conference on Internet Computing 2006: 224.229.
[443] C. Jennings, B. Lowekamp, E. Rescorla, S. Baset, and H. Schulzrinne. IETF. REsource LOcation And Discovery (RELOAD).Work in progress. draft-ietf-p2psip-reload-00. July 2008.
[444] R. Barbosa, et al., Performance evaluation of P2P VoIP applications, NOSSDAV 2007.

Chapter 13

[445] S. Gurun, P. Nagpurkar, and B. Y. Zhao, Energy consumption and conservation in mobile peer-to-peer systems, in: Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking, Los Angeles, Jul. 25.25, 2006. References 391
[446] K. Christensen, B. Nordman, and R. Brown, Power management in networked devices, IEEE Computer, Aug. 2004, 91.93.
[447] H. Hsiao, and C. King, Mobility churn in DHTs, in: Proceedings of the 1st international Workshop on Mobility in Peer-teer Systems (MPPS), Volume 08, ICDCSW, IEEE Computer Society, Washington, DC, 2005, 799.805.
[448] J. Li, et al., A performance vs. cost framework for evaluating DHT design tradeoffs under churn, in: Proceedings of the 24th IEEE Infocom, Mar. 2005.
[449] H. Pucha, S. M. Das, and Y. C. Hu, How to implement DHTs in mobile ad hoc networks, in: Proceedings of the 10th ACM International Conference on Mobile Computing and Network (MobiCom 2004), Sept. 2004.
[450] A. MacQuire, A. Brampton, I. Rai, and L. Mathy, Performance analysis of stealth DHT with mobile nodes, in: Proceedings of the 4th IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW 2006), Mar. 2006.
[451] C. Perkins, IP Mobility Support for IPv4, RFC 3344 (Proposed Standard), Aug. 2002.
[452] H.-C. Hsiao and C.-T. King, Bristle: A mobile structured peer-to-peer architecture, in: Proceedings of the Parallel and Distributed Processing Symposium (IPDPS¡¯03), 2003.
[453] H.-C. Hsiao and C.-T. King, Tornado: Capability-aware peer-to-peer storage networks, in: Proceedings of the International Parallel and Distributed Processing Symposium, Apr. 2003.
[454] B. Y. Zhao, L. Huang, A. D. Joseph, and J. D. Kubiatowicz, Rapid mobility via type indirection, in: Proceedings of the 3rd International Workshop on Peer-to-Peer Systems (IPTPS¡¯04), San Diego, Feb. 2004.
[455] J. Li, et al., A performance vs. cost framework for evaluating DHT design tradeoffs under churn, in: Proceedings of the 24th IEEE Infocom Mar 2005.
[456] J. Li, J. Stribling, R. Morris, and M. F. Kaashoek. Bandwidth-efficient management of DHT routing tables, in: the Proceedings of the 2nd USENIX Symposium on Networked Systems Design and Implementation (NSDI ¡¯05), Boston, 2005.
[457] A. Gupta, B. Liskov, and R. Rodrigues, Efficient routing for peer-to-peer overlays, in: Proceedings of the 1st USENIX Symposium on Networked Systems Design and Implementation (NSDI ¡¯04), Mar. 2004.
[458] M. Gerla, C. Lindemann, and A. Rowstron, P2P MANET¡¯s . New Research Issues, Perspectives Workshop: Peer-to-Peer Mobile Ad Hoc Networks: New Research Issues, Schloss Dagstuhl, Germany, 2005.
[459] O. Landsiedel, S. Go¡§tz, and K. Wehrle, Towards scalable mobility in distributed hash tables, in 6th International IEEE Conference on Peer-to-Peer-Computing, Cambridge, UK, Aug./Sept. 2006.
[460] B. Karp and H. T. Kung, GPSR: greedy perimeter stateless routing for wireless networks, in: Proceedings of the 6th Annual international Conference on Mobile Computing and Networking, MobiCom ¡¯00, Boston, Aug. 6.11, 2000, ACM, 2000.
[461] T. Zahn and J. Schiller, Designing structured peer-to-peer overlays as a platform for distributed network applications in mobile ad hoc networks, Computer Communications, Vol. 31, No. 3, Feb. 2008.
[462] The SpoVNet Consortium, SpoVNet: An architecture for supporting future Internet applications, www.spovnet.de. 392 References
[463] T. Anderson, L. Peterson, S. Shenker, and J. Turner, Overcoming the Internet impasse through virtualization, GDD-05-01, Geni Project Office, Global Environment for Network Innovations (GENI), www.geni.net, Apr. 2005.
[464] IETF HIP WG, End-host mobility and multihoming with the Host Identity Protocol (HIP), IETF RFC5206, Apr. 2008, http://tools.ietf.org/html/rfc5206.
[465] M. Bisignano, G. Di Modica, O. Tomarchio, and L. Vita, P2P over Manet: a comparison of cross-layer approaches, in: 18th International Conference on Database and Expert Systems Applications, 2007 (DEXA ¡¯07), Sept. 3.7, 2007, 814.818.
[466] R. Stacey, IEEE 802.11n emerging wireless standards discussion., presentation at IEEE Globecom 2006, Nov. 2006.
[467] D. Leeper, Ultrawideband (UWB) wireless technology, presentation at IEEE Globecom 2006, Nov. 2006.
[468] Ambient Networks Deliverable, System design of SATO & ASI, www.ambientnetworks. org/Files/deliverables/D12-F.1_PU.pdf, Sept. 2007.
[469] C. Cramer and T. Fuhrmann, ISPRP: A message-efficient protocol for initializing structured P2P networks, in: Proc. 24th IEEE International Performance, Computing, and Communications Conference (IPCCC 2005), 2005, 365.370.
[470] I. Gruber, R. Schollmeier, and W. Kellerer, Performance evaluation of the mobile peer-topeer service, in: Proceedings IEEE CCGrid 2004, 2004, 363.371.
[471] A. Klemm, C. Lindemann, and O. Waldhorst, A special-purpose peer-to-peer file sharing system for mobile ad hoc networks, in: Proceeding Workshop on Mobile Ad Hoc Networking and Computing (MADNET 2003), 2003, 41.49.
[472] H. Pucha, S. Das, and Y. C. Hu, Ekta: An efficient DHT substrate for distributed applications in mobile ad hoc networks, Proc. 6th IEEE Workshop on Mobile Computing Systems and Applications (WMCSA), 2004, 163.173.
[473] M. Conti, E. Gregori, and G. Turi, A crosslayer optimization of Gnutella for mobile ad hoc networks, in: Proc. of the 6th ACM international symposium on Mobile ad hoc networking and computing (MobiHoc05), ACM Press, 2005, 343.354.
[474] T. Zahn and J. Schiller, MADPastry: A DHT substrate for practicably sized MANETs, in: 5th Workshop on Applications and Services in Wireless Networks (ASWN2005), Paris, June 2005.
[475] B. Tang, Z. Zhou, A. Kashyap, and T. Chiueh, An integrated approach for P2P file sharing on multi-hopwireless networks, in: Proc. of the IEEE Int. Conf. on Wireless and Mobile Computing, Networking and Communication (WIMOB¡¯05), Montreal, Aug. 2005.
[476] T. Zahn and J. Schiller, Designing structured peer-to-peer overlays as a platform for distributed network applications in mobile ad hoc networks, Compute Communications, Vol. 31, Issue 2, Feb. 5, 2008, 643.654.
[477] H. Pucha, S. M. Das, and Y. C. Hu, Imposed route reuse in ad hoc network routing protocols using structured peer-to-peer overlay routing, IEEE Trans. Parallel Distrib. Syst. 17, 12, Dec. 2006, 1452.1467.

Chapter 14

[478] News and Events, Triversa, www.tiversa.com/news/. References 393
[479] M. Eric Johnson, and Scott Dynes, Inadvertent disclosure: Information leaks in the extended enterprise,¡± Proceedings of the 6th Workshop on the Economics of Information Security, Carnegie Mellon University, June 7.8, 2007.
[480] M. Eric Johnson, Dan McGuire, and Nicholas D. Willey, Why file sharing networks are dangerous, available at http://reform.democrats.house.gov/documents/ 20070724140635.pdf.
[481] M. Eric Johnson, Inadvertent file sharing over peer-to-peer networks, testimony of Professor M. Eric Johnson before the committee on oversight and government reform, US House of Representatives, July 24, 2007, available at http://oversight.house.gov/ documents/20070724103956.pdf.
[482] G. Johnson, Arrest in case of ID theft by file-sharing, USA Today, Sept. 07, 2007, available at www.usatoday.com/tech/news/computersecurity/infotheft/2007-09-07-id-theft-filesharing_ N.htm#uslPageReturn.
[483] S. Moskowitz, Introduction: digital rights management, Multimedia Security Technologies for Digital Rights Management, Zeng, Yu, and Lin (eds.), Elsevier, 2006.
[484] W. Stallings, Network and internetwork security, Prentice Hall, 1995.
[485] J. R. Douceur, The Sybil attack, in: Proceedings, the 1st International Workshop on Peerto- Peer Systems (IPTPS ¡¯02), Cambridge, MA, Mar. 2002.
[486] Wrapster, www.unwrapper.com.
[487] S. McBride and G. A. Fowler, Estimate of film-piracy cost soars: Hollywood loss is put at $6.1 billion a year, The Wall Street Journal Europe, May 4, 2006, www.lek.com/about/ newsarchive.cfm.
[488] L. Garber, Denial of service attacks rip the Internet, Computer, Vol. 33, No. 4, 2000, 12.17.
[489] J. Mirkovic and P. Reiher, A taxonomy of DDoS attack and DDoS defense mechanisms, Computer Communications Review, Vol. 34, No. 2, Apr. 2004.
[490] N. Naoumov, and K. Ross, Exploiting P2P systems for DDoS attacks, in: Proceedings, the 1st international conference on Scalable information systems, Hong Kong, 2006.
[491] Prolexic distributed denial of service attack alert, Prolexic Technologies Inc., May 14, 2007, available at www.prolexic.com/news/20070514-alert.php.
[492] DC©­©­, http://dcplusplus.sourceforge.net/features/.
[493] R. R. Brooks, Disruptive security technologies with mobile code and peer-to-peer networks, CRC Press, 2005.
[494] L. Divac-Krnic and R. Ackermann, Security-related issues in peer-to-peer networks, Chapter 31, P2P Systems and Applications, Steinmetz and Wehrle (eds.), Springer-Verlag, 2005, 529.545.
[495] F. R. Schreiber, Sybil, Warner Books, 1973.
[496] M. Castro, et al., Secure routing for structured peer-to-peer overlay networks, in: Proceedings, 5th Symp. on Operating Sys. Design and Impl., Boston, Dec. 2002, 299.314.
[497] D. Wallach, A survey of peer-to-peer security issues, in: Proceedings, International Symposium on Software Security . Theories and Systems, Tokyo, Nov. 2002, 42.57.
[498] Overnet, www.overnet.com.
[499] Cisco PIX 500 series security appliances introduction, Cisco, available at www.cisco.com/ en/US/products/hw/vpndevc/ps2030/. 394 References
[500] K. C. Sia, DDoS vulnerability analysis of the Bittorrent protocol, UCLA Technical Report, June 2006, available at http://oak.cs.ucla.edu/sia/cs239spring06.pdf.
[501] I. Stoica, R. Morris, et al., Chord: A scalable peer-to-peer lookup protocol for internet applications, IEEE/ACM Transaction on Networking, Vol. 11, No. 1, 2003, 17.32.
[502] A. Rowstron and P. Druschel, Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems, in: Proceedings, the ACM/IFIP Int. Middleware Conf., Nov. 2001.
[503] B. Y. Zhao, et al., Tapestry: A resilient global-scale overlay for service deployment, IEEE Journal on Selected Areas in Communications, Vol. 22, No. 1, Jan. 2004, 41.53.
[504] H. Yu, J. Buford, and M. Meratbi, Improving messaging security in structured P2P overlay networks, in Proceedings, IEEE International Conference on Multimedia and Expo, Beijing, July 2007.
[505] P. Nikander, et al., Mobile IP Version 6 route optimization security design background, IETF RFC4225, Dec. 2005, available at www.ietf.org/rfc/rfc4225.txt.
[506] E. Adar, and B. Huberman, Free riding on Gnutella, First Monday, Vol. 5, No. 10, 2000.
[507] T. Ngan, D. Wallach, and P. Druschel, Enforcing fair sharing of peer-to-peer resources, in: Proceedings, 2nd International Workshop on Peer-to-Peer Systems (IPTPS), Berkeley, CA, Feb. 2003.
[508] A. Nandi, et al., On designing incentive comptabile peer to peer systems, in: Proceedings, 2nd Bertinoro Workshop on Future Directions in Distributed Computing, Bertinoro, Italy, June 2004.
[509] K. Aberer and Z. Despotovic, Managing trust in a peer-2-peer information system, in: Proceedings, the tenth international conference on Information and knowledge management, 2001.
[510] A. Abdul-Rahman and S. Hailes, Supporting trust in virtual communities, in: Proceedings, the 33rd Hawaii International Conference on System Sciences, 2000.
[511] L. Xiong and L. Liu, A reputation-based model for peer-to-peer communities, in: Proceedings, IEEE International Conference on Distributed Computing Systems, Providence, RI, May 2003.
[512] J. Camp, and A. Friedman, Peer-to-peer security, in: Proceedings, Telecommunications Policy Research Conference, Washington DC, Sept. 2003.
[513] K. Wongrujira, T. Hsin-Ting, and A. Seneviratne, Avoidance routing to misbehaving nodes in P2P by using reputation and variance, in: Proceedings, 6th Int. Conf. on Adv. Comm. Tech.: Broadband Convergence Network Infrastructure, South Korea, Feb. 9.11, 2004.
[514] Z. Despotovic, and K. Aberer, P2P reputation management: Probabilistic estimation vs. social networks, Computer Networks, Vol. 50(4), Mar. 15, 2006, 485.500.
[515] I. Goldberg, Privacy-enhancing technologies for the Internet, II: five years later, Privacy Enhancing Technologies, Springer, 2003.
[516] M. Kinateder and S. Pearson, A privacy-enhanced peer-to-peer reputation system, E-commerce and Web technologies, Springer, 2003.
[517] Trusted Computing Platform Alliance: TCPA main specification, version 1.1, 2001, available at www.trustedcomputing.org.
[518] R. Sherwood, B. Bhattacharjee, and A. Srinivasan, P5: A protocol for scalable anonymous communication, Journal of Computer Security, Vol. 13, No. 6, 2005, 839.876. References 395
[519] The Free Haven Project, www.freehaven.net.
[520] M. J. Freedman and R. Morris, Tarzan: a peer-to-peer anonymizing network layer, in: Proceedings, ACM Conference on Computer and Communications Security, Washington, DC, 2002.
[521] Groove, www.groove.net.
[522] Overpeer, www.overpeer.com.
[523] J. Liang, R. Kumar, Y. Xi, K. W. Ross, Pollution in P2P file sharing systems, in Proceedings, Infocom 05, Miami, 2005.
[524] KaZaA, www.kazaa.com.

Chapter 15

[525] Associated Press, Skype service outage caused by software problems, Aug 16, 2007.
[526] S. A. Baset and H. Schulzrinne, An analysis of the Skype peer-to-peer Internet telephony protocol, Columbia University Technical Report CUCS-039-04, 2004.
[527] J. Buford, Management of peer-to-peer overlays, International J. of Internet Protocol Technology, Special Issue on Management of IP Networks and Services, Vol. 3, No.1, 2008, 2.12.
[528] J. Buford, Telecommunication services and service management challenges, J. Universal Computer Science, Special Issue for the Future of Computer Science Symposium (FOCSS), June 2001.
[529] S. El-Ansary, L. O. Alima, P. Brand, and S. Haridi, Efficient broadcast in structured P2P networks, 2nd International Workshop on Peer-to-Peer Systems (IPTPS¡¯03), Berkeley, CA, Feb. 2003.
[530] M. Lue, C. King, and H. Fang, Scoped broadcast in structured P2P networks, in: Proceedings of the 1st international Conference on Scalable information Systems, Hong Kong, May 30.June 01, 2006, InfoScale ¡¯06, Vol. 152, ACM Press, 2006, 51.
[531] L. R. Monnerat and C. L. Amorim, D1HT: A distributed one-hop hash table, Proc. of the 20th IEEE Intl Parallel & Distributed Processing Symp. (IPDPS), Apr. 2006.
[532] W. Stalling, SNMP, SNMPv2, SNMPv3, and RMON 1 and 2, 3rd ed., Addison-Wesley, 1998.
[533] K. Terplan, OSS essentials: Support system solutions for service providers, John Wiley, 2001.
[534] V. Vischnevsky, A. Safonov, M. Yakimov, E. Shim, and A. Gelman, Scalable blind search and broadcasting in peer-to-peer networks, 6th IEEE International Conference on Peer-to-Peer Computing, Sept. 2006.
[535] H. Yu and J. Buford, Improving messaging security in structured P2P overlay networks, Proc. 2007 International Conference on Multimedia and Expo., to appear.
[536] J. Buford, Telecommunication services and service management challenges, J. Universal Computer Science, Special Issue for the Future of Computer Science Symposium (FOCSS), June 2001.
[537] L. Lewis, Managing business and service networks, Kluwer Academic Publishers, 2001.
[538] L. Lewis, Service level management for enterprise networks, Artech House, 1999.
[539] P. Druschel and A. Rowstron, PAST: A large-scale, persistent peer-to-peer storage utility, HotOS VIII, Schoss Elmau, Germany, May 2001. 396 References
[540] J. Kubiatowicz, et al., OceanStore: an architecture for global-scale persistent storage, SIGPLAN Not. 35, 11, Nov. 2000, 190.201.
[541] F. Dabek, et al., Wide-area cooperative storage with CFS, in: Proceedings of the 18th ACM Symposium on Operating Systems Principles, Banff, Canada, Oct. 21.24, 2001, SOSP ¡¯01, ACM, 2001, 202.215.
[542] Athicha Muthitacharoen, Robert Morris, Thomer M. Gil, and Benjie Chen, Ivy: A read/ write peer-to-peer file system, 5th Symposium on Operating Systems Design and Implementation (OSDI), Boston, Dec. 2002.
[543] J. Li, K. Sollins, and D. Lim, Implementing aggregation and broadcast over distributed hash tables, SIGCOMM Comput. Commun. Rev. 35, 1 Jan. 2005, 81.92.
[544] Hung-Chang Hsiao and Chung-Ta King, Scoped broadcast in dynamic peer-to-peer networks, 29th Annual International Computer Software and Applications Conference, 2005, COMPSAC 2005, July 26.28, 2005, Vol. 2, 533.538.
[545] P. Van Roy, Self-management for large-scale distributed systems based on structured overlay networks and components, retrieved from www.ist-selfman.org/wiki/index.php/ SELFMAN_Project, July 2008.
[546] DCIA, Proactive network Provider Participation for P2P (P4P). Retrieved from www.dcia. info/activities/#P4P, July 2008.
[547] H. Xie, et al., P4P: Provider Portal for (P2P) applications, IETF P2P Infrastructure Workshop (P2Pi), May 2008.
[548] H. Xie, et al., P4P: Provide portal for (P2P) applications, in: Proceedings of ACM SIGCOMM, Seattle, Aug. 2008.
[549] E. Rescorlak, Notes on P2P blocking and evasion, IETF P2P Infrastructure Workshop (P2Pi), May 2008.
[550] E. Marocco, et al., Peer-to-peer infrastructure: A survey of research on the applicationlayer traffic optimization problem and the need for layer cooperation, IETF P2P Infrastructure Workshop (P2Pi), May 2008. References 397