|
| 1. The Gnutella Protocol Specification v0.4. |
| 2. Gnutella Developers' Forum. |
| 3. WASTE website. |
| 4. Gnutella home page http://gnutella.wego.com.. |
| 5. The Directory: Overview of Concepts, Models and Service. CCITT Recommendation X.500., 1988. |
| 6. The Directory: Models. CCITT Recommendation X.501 ISO/IEC JTC 1/SC21; International Standard 9594-2, 1988. |
| 7. The Directory: Abstract Service Definition. CCITT Recommendation X.511, ISO/IEC JTC 1/SC21; International Standard 9594-3, 1988. |
| 8. Specification of Basic Encoding Rules for Abstract Syntax Notation One (ASN.1) CCITT Recommendation X.209, 1988. |
| 9. Uncheatable Distributed Computations Cryptographers' Track --- RSA, 2001. |
| 10. Incentives for Sharing in Peer-to-Peer Networks ACM Conference on Electronic Commerce, 2001. |
| 11. A Distributed Trust Model Alfarez Abdul-Rahman and Stephen Hailes Proceedings of the New Security Paradigms Workshop (NSPW-97), 48--60, ACM, sep 23--26, 1997. |
| 12. Supporting Trust in Virtual Communities Alfarez Abdul-Rahman and Stephen Hailes Proceedings Hawaii International Conference on System Sciences 33, 2000. |
| 13. Managing Trust in a Peer-2-Peer Information System Karl Aberer and Zoran Despotovic Proceedings of the Tenth International Conference on Information and Knowledge Management (CIKM-01), 310--317, Editor(s): Henrique Paques and Ling Liu and David Grossman, ACM Press, nov 5--10, 2001. |
| 14. Free riding on gnutella. E. Adar and B. Huberman First Monday, 5(10)2000. Note: http://www.firstmonday.dk/issues/issue5-10/adar/. |
| 15. The design and implementation of an intentional naming system William Adjie-Winoto and Elliot Schwartz and Hari Balakrishnan and Jeremy Lilley Symposium on Operating Systems Principles, 186-201, 1999. |
| 16. Detour: A Case for Informed Internet Routing and Transport S. Savage and T. Anderson and A. Aggarwal and D. Becker and N. Cardwell and A. Collin s and E. Hoffman and J. Snell and A. Vahdat and G. Voelker and J. Zahorjan IEEE Micro, 1999. |
| 17. Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol Fan, Li and Cao, Pei and Almeida, Jussara and Broder, Andrei Z. Computer Communications Review (Proceedings of SIGOCOMM'98), 28(4):254--265, September, 1998. Abstract: The sharing of caches among Web proxies is an important technique to reduce Web traffic and alleviate network bottlenecks. Nevertheless it is not widely deployed due to the overhead of existing protocols. In this paper we propose a new protocol called ''Summary Cache''; each proxy keeps a summary of the URLs of cached documents of each participating proxy and checks these summaries for potential hits before sending any queries. Two factors contribute to the low overhead: the summaries are updated only periodically, and the summary representations are economical -- as low as 8 bits per entry. Using trace-driven simulations and a prototype implementation, we show that compared to the existing Internet Cache Protocol (ICP), Summary Cache reduces the number of inter-cache messages by a factor of 25 to 60, reduces the bandwidth consumption by over 50%, and eliminates between 30% to 95% of the CPU overhead, while at the same time maintaining almost the same hit ratio as ICP. Hence Summary Cache enables cache sharing among a large number of proxies. |
| 18. Application-layer anycasting: a server selection architecture and use in a replicated Web service Ellen W. Zegura and Mostafa H. Ammar and Zongming Fei and Samrat Bhattacharjee j-IEEE-TRANS-NETWORKING, 8(4):455--466, 2000. |
| 19. On the Use of Destination Set Grouping to Improve Fairness in Multicast Video Distribution Cheung, S.Y. and Ammar, M.H. and Li, X. Proceedings of Infocom, March, 1996. Abstract: We address the problem of fairness in a feedback-controlled multicast video distribution scheme. In a fair scheme each receiver should receive a video stream with a quality that is commensurate with its capabilities or the capabilities of the path leading to it, regardless of other receivers or network paths. This fairness problem results from the fact that multicast communication trades economy of bandwidth with granularity of control. Distributing video using individual feedback-controlled point-to-point streams results in high bandwidth utilization but the granularity of control is high as communication parameters can be negotiated individually with each receiver. In contrast, using a single multicast stream has good bandwidth economy, but very low granularity of control. In this paper we propose, implement and experiment with a system that spans the spectrum represented by the two extremes above. In the scheme, Californialled destination set grouping (DSG), a source maintains a small number of video streams, carrying the same video but each targeted at receivers with different capabilities. Each stream is feedback-controlled within prescribed limits by its group of receivers. Receivers may move among streams as their capabilities or the capabilities of the network paths leading to them change. The scheme is shown to improve fairness significantly at a small bandwidth cost. |
| 20. On the Use of Destination Set Grouping to Improve Fairness in Multicast Video Distribution Cheung, S.Y. and Ammar, M.H. and Li, X. Proceedings of Infocom, March, 1996. Abstract: We address the problem of fairness in a feedback-controlled multicast video distribution scheme. In a fair scheme each receiver should receive a video stream with a quality that is commensurate with its capabilities or the capabilities of the path leading to it, regardless of other receivers or network paths. This fairness problem results from the fact that multicast communication trades economy of bandwidth with granularity of control. Distributing video using individual feedback-controlled point-to-point streams results in high bandwidth utilization but the granularity of control is high as communication parameters can be negotiated individually with each receiver. In contrast, using a single multicast stream has good bandwidth economy, but very low granularity of control. In this paper we propose, implement and experiment with a system that spans the spectrum represented by the two extremes above. In the scheme, Californialled destination set grouping (DSG), a source maintains a small number of video streams, carrying the same video but each targeted at receivers with different capabilities. Each stream is feedback-controlled within prescribed limits by its group of receivers. Receivers may move among streams as their capabilities or the capabilities of the network paths leading to them change. The scheme is shown to improve fairness significantly at a small bandwidth cost. |
| 21. Layered Video Multicast with Retransmissions (LVMR): Evaluation of Hierarchical Rate Control Li, X. and Paul, S. and Ammar, M. Proceedings of INFOCOM, March/April, 1998. Abstract: Layered Video Multicast with Retransmissions (LVMR) is a system for distributing video using layered coding over the Internet, The two key contributions of the system are: (1) improving the quality of reception within each layer by retransmitting lost packets given an upper bound on recovery time and applying an adaptive playback point scheme to help achieve more successful retransmission, and (2) adapting to network congestion and heterogeneity using hierarchical rate control mechanism. This paper concentrates on the rate control aspects of LVMR. In contrast to the existing sender-based and receiver-based rate control in which the entire information about network congestion is either available at the sender (in sender-based approach) or replicated at the receivers (in receiver-based approach), the hierarchical rate control mechanism distributes the information between the sender, receivers, and some agents in the network in such a way that each entity maintains only the information relevant to itself. In addition to that, the hierarchical approach enables intelligent decisions to be made in terms of conducting concurrent experiments and choosing one of several possible experiments at any instant of time based on minimal state information at the agents in the network. Protocol details are presented in the paper together with experimental and simulation results to back our claims. |
| 22. On the Use of Destination Set Grouping to Improve Fairness in Multicast Video Distribution Cheung, S.Y. and Ammar, M.H. and Li, X. Proceedings of Infocom, March, 1996. Abstract: We address the problem of fairness in a feedback-controlled multicast video distribution scheme. In a fair scheme each receiver should receive a video stream with a quality that is commensurate with its capabilities or the capabilities of the path leading to it, regardless of other receivers or network paths. This fairness problem results from the fact that multicast communication trades economy of bandwidth with granularity of control. Distributing video using individual feedback-controlled point-to-point streams results in high bandwidth utilization but the granularity of control is high as communication parameters can be negotiated individually with each receiver. In contrast, using a single multicast stream has good bandwidth economy, but very low granularity of control. In this paper we propose, implement and experiment with a system that spans the spectrum represented by the two extremes above. In the scheme, Californialled destination set grouping (DSG), a source maintains a small number of video streams, carrying the same video but each targeted at receivers with different capabilities. Each stream is feedback-controlled within prescribed limits by its group of receivers. Receivers may move among streams as their capabilities or the capabilities of the network paths leading to them change. The scheme is shown to improve fairness significantly at a small bandwidth cost. |
| 23. On the Use of Destination Set Grouping to Improve Fairness in Multicast Video Distribution Cheung, S.Y. and Ammar, M.H. and Li, X. Proceedings of Infocom, March, 1996. Abstract: We address the problem of fairness in a feedback-controlled multicast video distribution scheme. In a fair scheme each receiver should receive a video stream with a quality that is commensurate with its capabilities or the capabilities of the path leading to it, regardless of other receivers or network paths. This fairness problem results from the fact that multicast communication trades economy of bandwidth with granularity of control. Distributing video using individual feedback-controlled point-to-point streams results in high bandwidth utilization but the granularity of control is high as communication parameters can be negotiated individually with each receiver. In contrast, using a single multicast stream has good bandwidth economy, but very low granularity of control. In this paper we propose, implement and experiment with a system that spans the spectrum represented by the two extremes above. In the scheme, Californialled destination set grouping (DSG), a source maintains a small number of video streams, carrying the same video but each targeted at receivers with different capabilities. Each stream is feedback-controlled within prescribed limits by its group of receivers. Receivers may move among streams as their capabilities or the capabilities of the network paths leading to them change. The scheme is shown to improve fairness significantly at a small bandwidth cost. |
| 24. Resilient Overlay Networks Andersen, D.G. and Balakrishnan, H. and Frans Kaashoek, M. and Morris, R. Proceedings of 18th ACM Symposium on Operating Systems Principles, October, 2001. |
| 25. Detour: A Case for Informed Internet Routing and Transport S. Savage and T. Anderson and A. Aggarwal and D. Becker and N. Cardwell and A. Collin s and E. Hoffman and J. Snell and A. Vahdat and G. Voelker and J. Zahorjan IEEE Micro, 1999. |
| 26. Sybil-Resistant DHT Routing Danezis, G. and Lesniewski-Laas, C. and Kaashoek, M. F. and Anderson, R. 10th European Symposium on Research in Computer Security (ESORICS 2005), Milan, Italy, September, 2005. |
| 27. Skip Graphs Aspnes, J. and Shah, G. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, January, 2003. |
| 28. Security Udell, J. and Asthagiri, N. and Tuvell, W. Peer-to-Peer: Harnessing the Power of Disruptive Technologies, 354-380, Editor(s): Oram, A., O'Reilly, 2001. |
| 29. Hashcash --- a denial of service countermeasure Adam Back Technical Report cypherspace.org, 2002. Note: Available at http://www.cypherspace.org/ adam/hashcash/hashcash.pdf. |
| 30. Incentive-Based Propagation of Metadata Updates in Peer-to-Peer Networks Roussopoulos, M. and Baker, M. P2P Journal, 1-6, September, 2003. |
| 31. CUP: Controlled Update Propagation in Peer-to-Peer Networks Roussopoulos, M. and Baker, M. USENIX Annual Technical Conference, San Antonio, TX, USA, June, 2003. |
| 32. The design and implementation of an intentional naming system William Adjie-Winoto and Elliot Schwartz and Hari Balakrishnan and Jeremy Lilley Symposium on Operating Systems Principles, 186-201, 1999. |
| 33. Resilient Overlay Networks Andersen, D.G. and Balakrishnan, H. and Frans Kaashoek, M. and Morris, R. Proceedings of 18th ACM Symposium on Operating Systems Principles, October, 2001. |
| 34. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications Stoica, I. and Morris, R. and Karger, D. and Kaashoek, M. F. and Balakrishnan, H. SIGCOMM 2001, San Diego, CA, USA, August, 2001. |
| 35. Observations on the Dynamic Evolution of Peer-to-Peer Networks Liben-Nowell, D. and Balakrishnan, H. and Karger, D. 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Cambridge, MA, USA, March, 2002. |
| 36. Scalable Multicast Key Distribution A. Ballardie May, 1996. Note: Network Working Group, RFC 1949.. |
| 37. Core based trees (CBT) Ballardie, Tony and Francis, Paul and Crowcroft, Jon Proceedings of SIGCOMM, 85--95, ACM, September, 1993. Abstract: One of the central problems in one-to-many wide-area communications is forming the delivery tree -- the collection of nodes and links that a multicast packet traverses. Significant problems remain to be solved in the area of multicast tree formation, the problem of scaling being paramount among these. In this paper we show how the current IP multicast architecture scales poorly (by scale poorly, we mean consume too much memory, bandwidth, or too many processing resources), and subsequently present a multicast protocol based on a new scalable architecture that is low-cost, relatively simple, and efficient. We also show how this architecture is decoupled from (though dependent on) unicast routing, and is therefore easy to install in an internet that comprises multiple heterogeneous unicast routing algorithms. |
| 38. Algorithmic design of the Globe wide-area location service Maarten van Steen and Franz J. Hauck and Gerco Ballintijn and Andrew S. Tanenbaum The Computer Journal, 41(5):297--310, 1998. |
| 39. Scalable Application Layer Multicast Suman Banerjee and Bobby Bhattacharjee and Christopher Kommreddy Proceedings of ACM SIGCOMM, 2002. |
| 40. Scalable Secure Group Communication over IP Multicast Suman Banerjee and Bobby Bhattacharjee JSAC Special Issue on Network Support for Group Communication, 20(8)Oct, 2002. |
| 41. Construction of an Efficient Overlay Multicast Infrastructure for Real-time Applications Suman Banerjee and Christopher Kommareddy and Koushik Kar and Bobby Bhattacharjee and Samir Khuller Proceedings of INFOCOM, 2003. |
| 42. Resilient Multicast using Overlays Suman Banerjee and Seungjoon Lee and Bobby Bhattacharjee and Aravind Srinivasan Proceedings of ACM SIGMETRICS, 2003. |
| 43. A Cooperative Framework to Scale Multi-Party Applications Suman Banerjee PhD Thesis, University of Maryland, 2003. |
| 44. Scalable Secure Group Communication over IP Mulitcast Banerjee, S. and Bhattacharjee, B. Proceedings of International Conference on Network Protocols, November, 2001. |
| 45. Scalable Peer Finding on the Internet Banerjee, S. and Kommareddy, C. and Bhattacharjee, B. Proceedings of Global Internet Symposium, Globecom, November, 2002. |
| 46. Dynamic Replica Management in Distributed Hash Tables Marcel Waldvogel and Paul Hurley and Daniel Bauer Technical Report Research Report, RZ--3502, IBM, July, 2003. Abstract: Interest in distributed storage is fueled by demand for reliability and resilience combined with decreasing hardware costs. Peer-to-peer storage networks based on distributed hash tables are an attractive solution due to their efficient use of resources and resulting performance. The placement and subsequent efficient location of replicas in such systems remain open problems, especially the requirement to update replicated content, working in the absence of global information, and how to determine the locations in a dynamic system without introducing single points of failure. We present and evaluate a novel and versatile technique, replica enumeration, which allows for controlled replication and replica access. The possibility of enumerating and addressing individual replicas allows dynamic updates as well as superior performance without burdening the network with state information, yet taking advantage of locality information when available. We simulate, analyze, and prove properties of the system, and discuss some applications. |
| 47. Symphony: Distributed Hashing in a Small World Manku, G. S. and Bawa, M. and Raghavan, P. 4th USENIX Symposium on Internet Technologies and Systems, Seattle, WA, USA, March, 2003. |
| 48. HyperCast: A Protocol for Maintaining Multicast Group Members in a Logical Hypercube Topology Liebeherr, J. and Beam, T.K. Proceedings of 1st International Workshop on Networked Group Communications, July, 1999. |
| 49. Detour: A Case for Informed Internet Routing and Transport S. Savage and T. Anderson and A. Aggarwal and D. Becker and N. Cardwell and A. Collin s and E. Hoffman and J. Snell and A. Vahdat and G. Voelker and J. Zahorjan IEEE Micro, 1999. |
| 50. Design of the TerraDir Distributed Directory Bobby Bhattacharjee and Pete Keleher and Bujor Silaghi Technical Report CS-TR-4163, University of Maryland at College Park, 2001. |
| 51. Finding Close Friends over the Internet Narendar Shankar and Christopher Komareddy and Bobby Bhattacharjee Proceedings of International Conference on Network Protocols, November, 2001. |
| 52. Scalable Application Layer Multicast Suman Banerjee and Bobby Bhattacharjee and Christopher Kommreddy Proceedings of ACM SIGCOMM, 2002. |
| 53. Routing in the TerraDir Directory Service Bujor Silaghi and Bobby Bhattacharjee and Pete Keleher Proceedings of SPIE ITCOM, 2002. |
| 54. Scalable Secure Group Communication over IP Multicast Suman Banerjee and Bobby Bhattacharjee JSAC Special Issue on Network Support for Group Communication, 20(8)Oct, 2002. |
| 55. Cooperative peer groups in NICE Seungjoon Lee and Rob Sherwood and Bobby Bhattacharjee Proceedings of INFOCOM, 2003. |
| 56. Construction of an Efficient Overlay Multicast Infrastructure for Real-time Applications Suman Banerjee and Christopher Kommareddy and Koushik Kar and Bobby Bhattacharjee and Samir Khuller Proceedings of INFOCOM, 2003. |
| 57. Resilient Multicast using Overlays Suman Banerjee and Seungjoon Lee and Bobby Bhattacharjee and Aravind Srinivasan Proceedings of ACM SIGMETRICS, 2003. |
| 58. Efficient Peer-To-Peer Searches Using Result-Caching Bobby Bhattacharjee and Sudarshan Chawathe and Vijay Gopalakrishnan and Pete Keleher and Bujor Silaghi The 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03), February, 2003. |
| 59. Slurpie: A Cooperative Bulk Data Transfer Protocol Rob Sherwood and Ryan Braud and Bobby Bhattacharjee Proceedings of IEEE INFOCOM, 2004. |
| 60. Hierarchical Routing with Soft-State Replicas in TerraDir Bujor Silaghi and Vijay Gopalakrishnan and Bobby Bhattacharjee and Pete Keleher The 18th International Parallel and Distributed Processing Symposium, April, 2004. |
| 61. Adaptive Replication in Peer-to-Peer Systems Vijay Gopalakrishnan and Bujor Silaghi and Bobby Bhattacharjee and Pete Keleher The 24th International Conference on Distributed Computing Systems, March, 2004. |
| 62. How to Model an Internetwork K. Calvert and E. Zegura and S. Bhattacharjee Proceedings of IEEE Infocom, 1996. |
| 63. Reasoning About Active Network Protocols S. Bhattacharjee and K. Calvert and E. Zegura Proceedings of International Conference on Network Portocols (ICNP) '98, 1998. |
| 64. Directions in Active Networks K. Calvert and S. Bhattacharjee and E. Zegura and J. Sterbenz IEEE Communications Magazine, 1998. |
| 65. Bowman: A Node OS for Active Networks S. Merugu and S. Bhattacharjee and E. Zegura and K. Calvert Proceedings IEEE INFOCOM'2000, 2000. |
| 66. Self-Organizing Wide-Area Network Caches Samrat Bhattacharjee and Ken Calvert and Ellen Zegura IEEE Infocom'98, 1998. |
| 67. Active Networks:Architectures, Composition, and Applications Samrat Bhattacharjee Ph.D. Thesis Georgia Institute of Technology, July, 1999. |
| 68. Control on Demand: An efficient approach to router programmability. G'isli Hj'almt'ysson and Samrat Bhattacharjee IEEE Journal on Selected Areas in Communications (JSAC): Special Issue on Service Enabling Platforms for Networked Multimedia Systems, August, 1999. Note: Guest Editors--D. Hutchison, G. Pacifici, B. Plattner, R. Stadler and J. Sventek. |
| 69. Control on Demand G'isli Hj'almt'ysson and Samrat Bhattacharjee Proceedings of the First International Working Conference on Active Networks (IWAN), June, 1999. |
| 70. Application-layer anycasting: a server selection architecture and use in a replicated Web service Ellen W. Zegura and Mostafa H. Ammar and Zongming Fei and Samrat Bhattacharjee j-IEEE-TRANS-NETWORKING, 8(4):455--466, 2000. |
| 71. Are Virtualized Overlay Networks Too Much of a Good Thing? Pete Keleher and Samrat Bhattacharjee and Bujor Silaghi The 1st International Workshop on Peer-to-Peer Systems (IPTPS'02), 2002. |
| 72. Trust-Preserving Set Operations Ruggero Morselli and Samrat Bhattacharjee and Jonathan Katz and Pete Keleher The 23rd Conference of the IEEE Communications Society (Infocom), March, 2004. |
| 73. Scalable Secure Group Communication over IP Mulitcast Banerjee, S. and Bhattacharjee, B. Proceedings of International Conference on Network Protocols, November, 2001. |
| 74. Finding Close Friends on the Internet Kommareddy, C. and Shankar, N. and Bhattacharjee, B. Proceedings of ICNP, November, 2001. |
| 75. Scalable Peer Finding on the Internet Banerjee, S. and Kommareddy, C. and Bhattacharjee, B. Proceedings of Global Internet Symposium, Globecom, November, 2002. |
| 76. Exposing the network: Support for topology-sensitive applications Y. Chae and S. Merugu and E. Zegura and S. Bhattarcharjee Proceedings of IEEE OpenArch 2000, 2000. |
| 77. The Darknet and the Future of Content Distribution Biddle, P. and England, P. and Peinado, M. and Willman, B. Proceedings of the 2nd ACM Workshop on Digital Rights Management, Lecture Notes in Computer Science 2696, 155-176, Springer Verlag, 2003. |
| 78. OceanStore: An Architecture for Global-Scale Persistent Storage John Kubiatowicz and David Bindel and Yan Chen and Steven Czerwinski and Patrick Eaton and Dennis Geels and Ramakrishna Gummadi and Sean Rhea and Hakim Weatherspoon and Westley Weimer and Chris Wells and Ben Zhao. Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), 2000. |
| 79. The Download Mesh Bollaert, M. and Thadani, S. and Mickish, A. Note: Gnutella Developers' Forum, http://www.the-gdf.org/. |
| 80. The XML Companion Neil Bradley Edition: Second, Addison-Wesley, 2000. |
| 81. Client Puzzles: A Cryptographic Defense Against Connection Depletion Attacks A. Juels and J. Brainard Proceedings of NDSS '99 (Networks and Distributed Security Systems), 1999. |
| 82. Slurpie: A Cooperative Bulk Data Transfer Protocol Rob Sherwood and Ryan Braud and Bobby Bhattacharjee Proceedings of IEEE INFOCOM, 2004. |
| 83. Extensible Markup Language (XML) 1.0 T. Bray and J. Paoli and C. Sperberg-McQueen World Wide Web Consortium Recommendation. Available at http://www.w3.org/TR/REC-xml, February, 1998. |
| 84. OPUS: An Overlay Utility Service Rebecca Braynard and Dejan Kostic and Adolfo Rodriguez and Jeff Chase and Amin Vahdat Poster at 18th ACM Symposium on Operating System Principles, October, 2001. |
| 85. Making gnutella-like P2P systems scalable Yatin Chawathe and Sylvia Ratnasamy and Lee Breslau and Nick Lanham and Scott Shenker Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, 407--418, ACM Press, 2003. |
| 86. Making Gnutella-like P2P Systems Scalable Chawathe, Y. and Ratnasamy, S. and Breslau, L. and Lanham, N. and Shenker, S. Proceedings of SIGCOMM, August, 2003. |
| 87. RMX: Reliable Multicast for Heterogeneous Networks Y. Chawathe and S. McCanne and E. A. Brewer Proceedings of Infocom, 2000. |
| 88. Scalable, distributed data structures for internet service construction. Steven D. Gribble and Eric A. Brewer and Joseph M. Hellerstein and David Culler In Symposium on Operating Systems Design and Implementation, 2000. |
| 89. MARKS : Zero Side Effect Multicast Key Management Using Arbitrarily Revealed Key Sequences B. Briscoe 1st International Workshop on Networked Group Communication, Pisa, Italy, November 1999., November, 1999. |
| 90. Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol Fan, Li and Cao, Pei and Almeida, Jussara and Broder, Andrei Z. Computer Communications Review (Proceedings of SIGOCOMM'98), 28(4):254--265, September, 1998. Abstract: The sharing of caches among Web proxies is an important technique to reduce Web traffic and alleviate network bottlenecks. Nevertheless it is not widely deployed due to the overhead of existing protocols. In this paper we propose a new protocol called ''Summary Cache''; each proxy keeps a summary of the URLs of cached documents of each participating proxy and checks these summaries for potential hits before sending any queries. Two factors contribute to the low overhead: the summaries are updated only periodically, and the summary representations are economical -- as low as 8 bits per entry. Using trace-driven simulations and a prototype implementation, we show that compared to the existing Internet Cache Protocol (ICP), Summary Cache reduces the number of inter-cache messages by a factor of 25 to 60, reduces the bandwidth consumption by over 50%, and eliminates between 30% to 95% of the CPU overhead, while at the same time maintaining almost the same hit ratio as ICP. Hence Summary Cache enables cache sharing among a large number of proxies. |
| 91. Generic Router Assist (GRA) Building Block Motivation and Architecture Cain, B. and Speakman, T. and Towsley, D. Technical Report Internet Draft, Internet Engineering Task Force, March, 2000. Note: Work in progress. |
| 92. How to Model an Internetwork K. Calvert and E. Zegura and S. Bhattacharjee Proceedings of IEEE Infocom, 1996. |
| 93. Reasoning About Active Network Protocols S. Bhattacharjee and K. Calvert and E. Zegura Proceedings of International Conference on Network Portocols (ICNP) '98, 1998. |
| 94. Directions in Active Networks K. Calvert and S. Bhattacharjee and E. Zegura and J. Sterbenz IEEE Communications Magazine, 1998. |
| 95. Bowman: A Node OS for Active Networks S. Merugu and S. Bhattacharjee and E. Zegura and K. Calvert Proceedings IEEE INFOCOM'2000, 2000. |
| 96. A quantitative comparison of graph-based models for Internet topology Ellen W. Zegura and Kenneth L. Calvert and Michael J. Donahoo IEEEslash ACM Transactions on Networking, 5(6):770--783, 1997. |
| 97. Self-Organizing Wide-Area Network Caches Samrat Bhattacharjee and Ken Calvert and Ellen Zegura IEEE Infocom'98, 1998. |
| 98. A quantitative comparison of graph-based models for Internet topology Ellen W. Zegura and Kenneth L. Calvert and Michael J. Donahoo IEEEslash ACM Transactions on Networking, 5(6):770--783, 1997. |
| 99. Multicast Security: A Taxonomy and Efficient Constructions Canetti, Ran and Garay, Juan and Itkis, Gene and Micciancio, Daniele and Naor, Moni and Pinkas, Benny Proceedings of INFOCOM, March, 1999. Abstract: Multicast communication is becoming the basis for a growing number of applications. It is therefore critical to provide founded security mechanisms for multicast communication. Yet, existing security protocols for multicast offer only very partial solutions. We first present a taxonomy of multicast scenarios on the Internet and point out the relevant security concerns. Next we identify two major security problems of multicast communication: individual authentication, and key revocation. Maintaining authenticity in multicast protocols is a much more complex problem than for unicast; in particular, known solutions are prohibitively inefficient in many cases. We present a solution that is reasonable for a range of scenarios. Our approach can be regarded as a `midpoint' between traditional Message Authentication Codes and digital signatures. We also present an improved and very efficient solution to another prevailing problem for multicast protocols, namely the key revocation problem. |
| 100. Search and Replication in Unstructured Peer-to-Peer Networks Lv, Q. and Cao, P. and Cohen, E. and Li, K. and Shenker, S. 16th International Conference on Supercomputing, New York, NY, USA, June, 2002. |
| 101. Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol Fan, Li and Cao, Pei and Almeida, Jussara and Broder, Andrei Z. Computer Communications Review (Proceedings of SIGOCOMM'98), 28(4):254--265, September, 1998. Abstract: The sharing of caches among Web proxies is an important technique to reduce Web traffic and alleviate network bottlenecks. Nevertheless it is not widely deployed due to the overhead of existing protocols. In this paper we propose a new protocol called ''Summary Cache''; each proxy keeps a summary of the URLs of cached documents of each participating proxy and checks these summaries for potential hits before sending any queries. Two factors contribute to the low overhead: the summaries are updated only periodically, and the summary representations are economical -- as low as 8 bits per entry. Using trace-driven simulations and a prototype implementation, we show that compared to the existing Internet Cache Protocol (ICP), Summary Cache reduces the number of inter-cache messages by a factor of 25 to 60, reduces the bandwidth consumption by over 50%, and eliminates between 30% to 95% of the CPU overhead, while at the same time maintaining almost the same hit ratio as ICP. Hence Summary Cache enables cache sharing among a large number of proxies. |
| 102. Detour: A Case for Informed Internet Routing and Transport S. Savage and T. Anderson and A. Aggarwal and D. Becker and N. Cardwell and A. Collin s and E. Hoffman and J. Snell and A. Vahdat and G. Voelker and J. Zahorjan IEEE Micro, 1999. |
| 103. The VersaKey Framework: Versatile Group Key Management M. Waldvogel and G. Caronni and D. Sun and N. Weiler and B. Plattner IEEE Journal on Selected Areas in Communications, Special Issue on Middleware, 17(9)August, 1999. |
| 104. Server Selection Using Dynamic Path Characterization in Wide-Area Networks Carter, Robert L. and Crovella, Mark E. Proceedings of INFOCOMM, 1014, Boston University, April, 1997. Abstract: Replication is a commonly proposed solution to problems of scale associated with distributed services. However, when a service is replicated, each client must be assigned a server. Prior work has generally assumed that assignment to be static. In contrast, we propose dynamic server selection, and show that enables application-level congestion avoidance. Using tools to measure available bandwidth and round trip latency (RTT), we demonstrate dynamic server selection and compare it to previous static approaches. We show that because of the variability of paths in the Internet, dynamic server selection consistently outperforms static policies, reducing response times by as much as 50%. However, we also must adopt a systems perspective and consider the impact of the measurement method on the network. Therefore, we look at alternative low-cost approximations and find that the careful measurements provided by our tools can be closely approximated by much lighter-weight measurements. We propose a protocol using this method which is limited to at most a 1% increase in network traffic but which often costs much less in practice. |
| 105. Design and Evaluation of a Wide-Area Event Notification Service Antonio Carzaniga and David S. Rosenblum and Alexander L Wolf ACM Transactions on Computer Systems, 19(3):332--383, August, 2001. |
| 106. First IETF Internet Audiocast S. Casner and S. Deering 1992. |
| 107. Security for structured peer-to-peer overlay networks Miguel Castro and Peter Druschel and Ayalvadi Ganesh and Antony Rowstron and Dan S. Wallach Proceedings of the Fifth Symposium on Operating Systems Design and Implementation (OSDI'02), 2002. |
| 108. Secure Routing for Structured Peer-to-Peer Overlay Networks Miguel Castro and Peter Druschel and Ayalvadi J. Ganesh and Antony I. T. Rowstron and Dan S. Wallach Proceedings of OSDI, 2002. |
| 109. Security for Structured Peer-to-Peer Overlay Networks Castro, M. and Druschel, P. and Ganesh, A. and Rowstron, A. and Wallach, D. S. 5th Symposium on Operating Systems Design and Implementation, Boston, MA, USA, December, 2002. |
| 110. Topology-Aware Routing in Structured Peer-to-Peer Overlay Networks Castro, M. and Druschel, P. and Hu, Y. C. and Rowstron, A. Technical Report MSR-TR-2002-82, Microsoft Research, 2002. |
| 111. Proximity Neighbor Selection in Tree-Based Structured Peer-to-Peer Overlays Castro, M. and Druschel, P. and Hu, Y. C. and Rowstron, A. Technical Report MSR-TR-2003-52, Microsoft Research, 2003. |
| 112. Exposing the network: Support for topology-sensitive applications Y. Chae and S. Merugu and E. Zegura and S. Bhattarcharjee Proceedings of IEEE OpenArch 2000, 2000. |
| 113. Key Management for Secure Internet Multicast using Boolean Function Minimization Techniques Chang, I. and Engel, R. and Kandlur, D. and Pendarakis, D. and Saha, D. Proceedings of Infocom, March, 1999. Abstract: The Internet today provides no support for privacy or authentication of multicast data distribution. However, an increasing number of applications will require secure multicast services in order to restrict group membership and enforce accountability of group members. A major problem associated with the deployment of secure multicast delivery services is the scalability of the key distribution protocol. This is particularly true with regard to the handling of group membership changes, such as member departures and/or expulsions, which necessitate the distribution of a new session key to all the remaining group members. In this paper, we present a new multicast key management scheme which uses a set of auxiliary keys in order to improve scalability. In contrast to previous schemes which generate a fixed hierarchy of keys, we dynamically generate the most suitable key hierarchy by composing different keys. However, our work goes one step further by focusing on the problem of cumulative member removal. Using Boolean function minimization techniques, our scheme outperforms all other schemes known to us in terms of message complexity in removing multiple group members. The efficiency of our scheme in aggregating key updates, due to multiple member departures, offers the potential of a significant performance advantage. The proposed scheme has been used within a toolkit for secure Internet multicast services that we have developed. |
| 114. OPUS: An Overlay Utility Service Rebecca Braynard and Dejan Kostic and Adolfo Rodriguez and Jeff Chase and Amin Vahdat Poster at 18th ACM Symposium on Operating System Principles, October, 2001. |
| 115. Describing and Manipulating XML Data Sudarshan S. Chawathe Bulletin of the IEEE Technical Committee on Data Engineering, 22(3):3--9, 1999. Note: Available at http://www.cs.umd.edu/verb# #chaw/pubs/. |
| 116. Efficient Peer-To-Peer Searches Using Result-Caching Bobby Bhattacharjee and Sudarshan Chawathe and Vijay Gopalakrishnan and Pete Keleher and Bujor Silaghi The 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03), February, 2003. |
| 117. Describing and Manipulating XML Data Sudarshan S. Chawathe Bulletin of the IEEE Technical Committee on Data Engineering, 22(3):3--9, 1999. Note: Available at http://www.cs.umd.edu/verb# #chaw/pubs/. |
| 118. Scattercast: An Architecture for Internet Broadcast Distribution as an Infrastructure Service Y. Chawathe Ph.D. Thesis, University of California, Berkeley, December, 2000. |
| 119. RMX: Reliable Multicast for Heterogeneous Networks Y. Chawathe and S. McCanne and E. A. Brewer Proceedings of Infocom, 2000. |
| 120. Making gnutella-like P2P systems scalable Yatin Chawathe and Sylvia Ratnasamy and Lee Breslau and Nick Lanham and Scott Shenker Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, 407--418, ACM Press, 2003. |
| 121. Making Gnutella-like P2P Systems Scalable Chawathe, Y. and Ratnasamy, S. and Breslau, L. and Lanham, N. and Shenker, S. Proceedings of SIGCOMM, August, 2003. |
| 122. OceanStore: An Architecture for Global-Scale Persistent Storage John Kubiatowicz and David Bindel and Yan Chen and Steven Czerwinski and Patrick Eaton and Dennis Geels and Ramakrishna Gummadi and Sean Rhea and Hakim Weatherspoon and Westley Weimer and Chris Wells and Ben Zhao. Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), 2000. |
| 123. Multicast Routing in Datagram Internetworks and Extended LANs S. Deering and D. Cheriton ACM Transactions on Computer Systems, May, 1990. |
| 124. On the Use of Destination Set Grouping to Improve Fairness in Multicast Video Distribution Cheung, S.Y. and Ammar, M.H. and Li, X. Proceedings of Infocom, March, 1996. Abstract: We address the problem of fairness in a feedback-controlled multicast video distribution scheme. In a fair scheme each receiver should receive a video stream with a quality that is commensurate with its capabilities or the capabilities of the path leading to it, regardless of other receivers or network paths. This fairness problem results from the fact that multicast communication trades economy of bandwidth with granularity of control. Distributing video using individual feedback-controlled point-to-point streams results in high bandwidth utilization but the granularity of control is high as communication parameters can be negotiated individually with each receiver. In contrast, using a single multicast stream has good bandwidth economy, but very low granularity of control. In this paper we propose, implement and experiment with a system that spans the spectrum represented by the two extremes above. In the scheme, Californialled destination set grouping (DSG), a source maintains a small number of video streams, carrying the same video but each targeted at receivers with different capabilities. Each stream is feedback-controlled within prescribed limits by its group of receivers. Receivers may move among streams as their capabilities or the capabilities of the network paths leading to them change. The scheme is shown to improve fairness significantly at a small bandwidth cost. |
| 125. On the Use of Destination Set Grouping to Improve Fairness in Multicast Video Distribution Cheung, S.Y. and Ammar, M.H. and Li, X. Proceedings of Infocom, March, 1996. Abstract: We address the problem of fairness in a feedback-controlled multicast video distribution scheme. In a fair scheme each receiver should receive a video stream with a quality that is commensurate with its capabilities or the capabilities of the path leading to it, regardless of other receivers or network paths. This fairness problem results from the fact that multicast communication trades economy of bandwidth with granularity of control. Distributing video using individual feedback-controlled point-to-point streams results in high bandwidth utilization but the granularity of control is high as communication parameters can be negotiated individually with each receiver. In contrast, using a single multicast stream has good bandwidth economy, but very low granularity of control. In this paper we propose, implement and experiment with a system that spans the spectrum represented by the two extremes above. In the scheme, Californialled destination set grouping (DSG), a source maintains a small number of video streams, carrying the same video but each targeted at receivers with different capabilities. Each stream is feedback-controlled within prescribed limits by its group of receivers. Receivers may move among streams as their capabilities or the capabilities of the network paths leading to them change. The scheme is shown to improve fairness significantly at a small bandwidth cost. |
| 126. Content Availability, Pollution and Poisoning in File Sharing Peer-to-Peer Networks Christin, N. and Weigend, A. S. and Chuang, J. ACM Conference on Electronic Commerce, Vancouver, Canada, June, 2005. |
| 127. Availability and Locality Measurements of Peer-to-Peer File Systems Jacky Chu and Kevin Labonte and Brian Neil Levine Proc. ITCom: Scalability and Traffic Control in IP Networks, july, 2002. |
| 128. A Case for End System Multicast Y.-H. Chu and S. G. Rao and H. Zhang Proceedings of ACM SIGMETRICS, June, 2000. |
| 129. Enabling Conferencing Applications on the Internet using an Overlay Multicast Architecture Y.-H. Chu and S. G. Rao and S. Seshan and H. Zhang Proceedings of ACM SIGCOMM, August, 2001. |
| 130. Content Availability, Pollution and Poisoning in File Sharing Peer-to-Peer Networks Christin, N. and Weigend, A. S. and Chuang, J. ACM Conference on Electronic Commerce, Vancouver, Canada, June, 2005. |
| 131. End-To-End Arguments in System Design H. Saltzer and D. P. Reed and D. Clark ACM Transactions on Computing Systems, 2(4)1984. |
| 132. Routing in the Dark: Scalable Searches in Dark P2P Networks Clarke, I. and Sandberg, O. DefCon 13, Las Vegas, NV, USA, July, 2005. |
| 133. Search and Replication in Unstructured Peer-to-Peer Networks Lv, Q. and Cao, P. and Cohen, E. and Li, K. and Shenker, S. 16th International Conference on Supercomputing, New York, NY, USA, June, 2002. |
| 134. Publius: A robust, tamper-evident, censorship-resistant, web publishing system Marc Waldman and Aviel D. Rubin and Lorrie Faith Cranor Proc. 9th USENIX Security Symposium, 59--72, August, 2000. |
| 135. Safe and Private Data Sharing with Turtle: Friends Team-Up and Beat the System Popescu, B. C. and Crispo, B. and Tanenbaum, A. S. 12th International Workshop on Security Protocols, Cambridge, UK, April, 2004. |
| 136. Server Selection Using Dynamic Path Characterization in Wide-Area Networks Carter, Robert L. and Crovella, Mark E. Proceedings of INFOCOMM, 1014, Boston University, April, 1997. Abstract: Replication is a commonly proposed solution to problems of scale associated with distributed services. However, when a service is replicated, each client must be assigned a server. Prior work has generally assumed that assignment to be static. In contrast, we propose dynamic server selection, and show that enables application-level congestion avoidance. Using tools to measure available bandwidth and round trip latency (RTT), we demonstrate dynamic server selection and compare it to previous static approaches. We show that because of the variability of paths in the Internet, dynamic server selection consistently outperforms static policies, reducing response times by as much as 50%. However, we also must adopt a systems perspective and consider the impact of the measurement method on the network. Therefore, we look at alternative low-cost approximations and find that the careful measurements provided by our tools can be closely approximated by much lighter-weight measurements. We propose a protocol using this method which is limited to at most a 1% increase in network traffic but which often costs much less in practice. |
| 137. Core based trees (CBT) Ballardie, Tony and Francis, Paul and Crowcroft, Jon Proceedings of SIGCOMM, 85--95, ACM, September, 1993. Abstract: One of the central problems in one-to-many wide-area communications is forming the delivery tree -- the collection of nodes and links that a multicast packet traverses. Significant problems remain to be solved in the area of multicast tree formation, the problem of scaling being paramount among these. In this paper we show how the current IP multicast architecture scales poorly (by scale poorly, we mean consume too much memory, bandwidth, or too many processing resources), and subsequently present a multicast protocol based on a new scalable architecture that is low-cost, relatively simple, and efficient. We also show how this architecture is decoupled from (though dependent on) unicast routing, and is therefore easy to install in an internet that comprises multiple heterogeneous unicast routing algorithms. |
| 138. Collaborative Management of Global Directories in P2P Systems Peery, C. and Cuenca-Acuna, F. M. and Martin, R. P. and Nguyen, T. D. Technical Report DCS-TR-510, November, 2002. |
| 139. Scalable, distributed data structures for internet service construction. Steven D. Gribble and Eric A. Brewer and Joseph M. Hellerstein and David Culler In Symposium on Operating Systems Design and Implementation, 2000. |
| 140. An Architecture for a Secure Service Discovery Service Steven Czerwinski and Ben Y. Zhao and Todd Hodes and Anthony D. Joseph and Randy Katz Proceedings of the Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom-99, 24--35, ACM Press, aug 15--20, 1999. |
| 141. OceanStore: An Architecture for Global-Scale Persistent Storage John Kubiatowicz and David Bindel and Yan Chen and Steven Czerwinski and Patrick Eaton and Dennis Geels and Ramakrishna Gummadi and Sean Rhea and Hakim Weatherspoon and Westley Weimer and Chris Wells and Ben Zhao. Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), 2000. |
| 142. Wide-area cooperative storage with CFS Frank Dabek and M. Frans Kaashoek and David Karger and Robert Morris and Ion Stoica Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01), October, 2001. |
| 143. Sybil-Resistant DHT Routing Danezis, G. and Lesniewski-Laas, C. and Kaashoek, M. F. and Anderson, R. 10th European Symposium on Research in Computer Security (ESORICS 2005), Milan, Italy, September, 2005. |
| 144. Open Problems in Data-Sharing Peer-to-Peer Systems Daswani, N. and Garcia-Molina, H. and Yang, B. Proceedings of the 9th International Conference on Database Theory, Lecture Notes in Computer Science 2572, 1-15, Springer Verlag, 2003. |
| 145. Multicast Routing in Datagram Internetworks and Extended LANs S. Deering and D. Cheriton ACM Transactions on Computer Systems, May, 1990. |
| 146. First IETF Internet Audiocast S. Casner and S. Deering 1992. |
| 147. Protocol Independent Multicast-Sparse Mode, RFC 2117 D. Estrin and D. Farinacci and A. Helmy and D. Thaler and S. Deering and M. Handley and V. Jacobson and C. Liu and P. Sharma Technical Report IETF, 1997. |
| 148. Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification D. Estrin and D. Farinacci and A. Helmy and D. Thaler and S. Deering and M. Handley and V. Jacobson and C. Liu and P. Sharma RFC 2362, IETF, 1998. |
| 149. Distance Vector Multicast Routing Protocol D. Waitzman and C. Partridge and S. Deering RFC 1075, 1998. |
| 150. Managing Trust in a Peer-2-Peer Information System Karl Aberer and Zoran Despotovic Proceedings of the Tenth International Conference on Information and Knowledge Management (CIKM-01), 310--317, Editor(s): Henrique Paques and Ling Liu and David Grossman, ACM Press, nov 5--10, 2001. |
| 151. Peer-to-Peer: Harnessing the Power of Disruptive Technologies Roger Dingledine and Michael Freedman and David Molnar Editor(s): Edited by Andy Oram, O'Reilly, March, 2001. |
| 152. A quantitative comparison of graph-based models for Internet topology Ellen W. Zegura and Kenneth L. Calvert and Michael J. Donahoo IEEEslash ACM Transactions on Networking, 5(6):770--783, 1997. |
| 153. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility Antony Rowstran and Peter Druschel Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP'01), 2001. |
| 154. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems Antony Rowstran and Peter Druschel Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), 2001. |
| 155. Security for structured peer-to-peer overlay networks Miguel Castro and Peter Druschel and Ayalvadi Ganesh and Antony Rowstron and Dan S. Wallach Proceedings of the Fifth Symposium on Operating Systems Design and Implementation (OSDI'02), 2002. |
| 156. Secure Routing for Structured Peer-to-Peer Overlay Networks Miguel Castro and Peter Druschel and Ayalvadi J. Ganesh and Antony I. T. Rowstron and Dan S. Wallach Proceedings of OSDI, 2002. |
| 157. Pastry: Scalable Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems Druschel, P. and Rowstron, A. 18th IFIP/ACM Conference on Distributed Systems Platforms (Middleware 2001), Heidelberg, Germany, November, 2001. |
| 158. Security for Structured Peer-to-Peer Overlay Networks Castro, M. and Druschel, P. and Ganesh, A. and Rowstron, A. and Wallach, D. S. 5th Symposium on Operating Systems Design and Implementation, Boston, MA, USA, December, 2002. |
| 159. Topology-Aware Routing in Structured Peer-to-Peer Overlay Networks Castro, M. and Druschel, P. and Hu, Y. C. and Rowstron, A. Technical Report MSR-TR-2002-82, Microsoft Research, 2002. |
| 160. Proximity Neighbor Selection in Tree-Based Structured Peer-to-Peer Overlays Castro, M. and Druschel, P. and Hu, Y. C. and Rowstron, A. Technical Report MSR-TR-2003-52, Microsoft Research, 2003. |
| 161. Development of the Domain Name System Mockapetris, Paul V. and Dunlap, Kevin J. Proceedings of SIGCOMM, 123--133, ACM, August, 1988. Abstract: The Domain Name System (DNS) provides name service for the DARPA Internet. It is one of the largest name services in operation today, serves a highly diverse community of hosts, users, and networks, and uses a unique combination of hierarchies, caching, and datagram access. This paper examines the ideas behind the initial design of DNS in 1983, discusses the evolution of these ideas into the current implementations and usages, notes conspicuous surprises, successess and shortcomings, and attempts to predict its future evolution. Note: also in Computer Communication Review 18 (4), Aug. 1988 |
| 162. OceanStore: An Architecture for Global-Scale Persistent Storage John Kubiatowicz and David Bindel and Yan Chen and Steven Czerwinski and Patrick Eaton and Dennis Geels and Ramakrishna Gummadi and Sean Rhea and Hakim Weatherspoon and Westley Weimer and Chris Wells and Ben Zhao. Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), 2000. |
| 163. Key Management for Secure Internet Multicast using Boolean Function Minimization Techniques Chang, I. and Engel, R. and Kandlur, D. and Pendarakis, D. and Saha, D. Proceedings of Infocom, March, 1999. Abstract: The Internet today provides no support for privacy or authentication of multicast data distribution. However, an increasing number of applications will require secure multicast services in order to restrict group membership and enforce accountability of group members. A major problem associated with the deployment of secure multicast delivery services is the scalability of the key distribution protocol. This is particularly true with regard to the handling of group membership changes, such as member departures and/or expulsions, which necessitate the distribution of a new session key to all the remaining group members. In this paper, we present a new multicast key management scheme which uses a set of auxiliary keys in order to improve scalability. In contrast to previous schemes which generate a fixed hierarchy of keys, we dynamically generate the most suitable key hierarchy by composing different keys. However, our work goes one step further by focusing on the problem of cumulative member removal. Using Boolean function minimization techniques, our scheme outperforms all other schemes known to us in terms of message complexity in removing multiple group members. The efficiency of our scheme in aggregating key updates, due to multiple member departures, offers the potential of a significant performance advantage. The proposed scheme has been used within a toolkit for secure Internet multicast services that we have developed. |
| 164. The Darknet and the Future of Content Distribution Biddle, P. and England, P. and Peinado, M. and Willman, B. Proceedings of the 2nd ACM Workshop on Digital Rights Management, Lecture Notes in Computer Science 2696, 155-176, Springer Verlag, 2003. |
| 165. Protocol Independent Multicast-Sparse Mode, RFC 2117 D. Estrin and D. Farinacci and A. Helmy and D. Thaler and S. Deering and M. Handley and V. Jacobson and C. Liu and P. Sharma Technical Report IETF, 1997. |
| 166. Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification D. Estrin and D. Farinacci and A. Helmy and D. Thaler and S. Deering and M. Handley and V. Jacobson and C. Liu and P. Sharma RFC 2362, IETF, 1998. |
| 167. Fault Isolation in Multicast Trees Reddy, A. and Govindan, R. and Estrin, D. Proceedings of SIGCOMM, August, 2000. |
| 168. Fault Isolation in Multicast Trees Reddy, A. and Govindan, R. and Estrin, D. Computer Communications Review, August, 2000. Note: Proceedings of ACM SIGCOMM'00. |
| 169. Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol Fan, Li and Cao, Pei and Almeida, Jussara and Broder, Andrei Z. Computer Communications Review (Proceedings of SIGOCOMM'98), 28(4):254--265, September, 1998. Abstract: The sharing of caches among Web proxies is an important technique to reduce Web traffic and alleviate network bottlenecks. Nevertheless it is not widely deployed due to the overhead of existing protocols. In this paper we propose a new protocol called ''Summary Cache''; each proxy keeps a summary of the URLs of cached documents of each participating proxy and checks these summaries for potential hits before sending any queries. Two factors contribute to the low overhead: the summaries are updated only periodically, and the summary representations are economical -- as low as 8 bits per entry. Using trace-driven simulations and a prototype implementation, we show that compared to the existing Internet Cache Protocol (ICP), Summary Cache reduces the number of inter-cache messages by a factor of 25 to 60, reduces the bandwidth consumption by over 50%, and eliminates between 30% to 95% of the CPU overhead, while at the same time maintaining almost the same hit ratio as ICP. Hence Summary Cache enables cache sharing among a large number of proxies. |
| 170. More on See You on the Darknet - note on etymology Farber, D.. |
| 171. Protocol Independent Multicast-Sparse Mode, RFC 2117 D. Estrin and D. Farinacci and A. Helmy and D. Thaler and S. Deering and M. Handley and V. Jacobson and C. Liu and P. Sharma Technical Report IETF, 1997. |
| 172. Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification D. Estrin and D. Farinacci and A. Helmy and D. Thaler and S. Deering and M. Handley and V. Jacobson and C. Liu and P. Sharma RFC 2362, IETF, 1998. |
| 173. Application-layer anycasting: a server selection architecture and use in a replicated Web service Ellen W. Zegura and Mostafa H. Ammar and Zongming Fei and Samrat Bhattacharjee j-IEEE-TRANS-NETWORKING, 8(4):455--466, 2000. |
| 174. Dynamic Query Protocol Fisk, A. Note: Gnutella Developers' Forum, http://www.the-gdf.org/. |
| 175. Reliable Multicast Framework for Light-weight Sessions and Application Level Framing Floyd, S. and Jacobson, V. and Liu, C.-G. and McCanne, S. and Zhang, L. Proceedings of SIGCOMM, September, 1995. Abstract: This paper describes SRM (Scalable Reliable Multicast), a reliable multicast framework for application level framing and light-weight sessions. The algorithms of this framework are efficient, robust, and scale well to both very large networks and very large sessions. The framework has been prototyped in wb, a distributed whiteboard application, and has been extensively tested on a global scale with sessions ranging from a few to more than 1000 participants. The paper describes the principles that have guided our design, including the IP multicast group delivery model, an end-to-end, receiver-based model of reliability, and the application level framing protocol model. As with unicast communications, the performance of a reliable multicast delivery algorithm depends on the underlying topology and operational environment. We investigate that dependence via analysis and simulation, and demonstrate an adaptive algorithm that uses the results of previous loss recovery events to adapt the control parameters used for future loss recovery. With the adaptive algorithm, our reliable multicast delivery algorithm provides good performance over a wide range of underlying topologies. |
| 176. Reliable Multicast Framework for Light-weight Sessions and Application Level Framing Floyd, S. and Jacobson, V. and Liu, C.-G. and McCanne, S. and Zhang, L. Proceedings of SIGCOMM, September, 1995. Abstract: This paper describes SRM (Scalable Reliable Multicast), a reliable multicast framework for application level framing and light-weight sessions. The algorithms of this framework are efficient, robust, and scale well to both very large networks and very large sessions. The framework has been prototyped in wb, a distributed whiteboard application, and has been extensively tested on a global scale with sessions ranging from a few to more than 1000 participants. The paper describes the principles that have guided our design, including the IP multicast group delivery model, an end-to-end, receiver-based model of reliability, and the application level framing protocol model. As with unicast communications, the performance of a reliable multicast delivery algorithm depends on the underlying topology and operational environment. We investigate that dependence via analysis and simulation, and demonstrate an adaptive algorithm that uses the results of previous loss recovery events to adapt the control parameters used for future loss recovery. With the adaptive algorithm, our reliable multicast delivery algorithm provides good performance over a wide range of underlying topologies. |
| 177. Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design Ripeanu, M. and Foster, I. and Iamnitchi, A. IEEE Internet Computing, 6(1)2002. |
| 178. Yoid: Extending the Multicast Internet Architecture P. Francis 1999. Note: White paper http://www.aciri.org/yoid/. |
| 179. A Scalable Content Addressable Network Sylvia Ratnasamy and Paul Francis and Mark Handley and Richard Karp and Scott Shenker In Proceedings of the ACM SIGCOMM 2001 Technical Conference, 2001. |
| 180. A Scalable Content-Addressable Network Ratnasamy, S. and Francis, P. and Handley, M. and Karp, R. and Shenker, S. SIGCOMM 2001, San Diego, CA, USA, August, 2001. |
| 181. Core based trees (CBT) Ballardie, Tony and Francis, Paul and Crowcroft, Jon Proceedings of SIGCOMM, 85--95, ACM, September, 1993. Abstract: One of the central problems in one-to-many wide-area communications is forming the delivery tree -- the collection of nodes and links that a multicast packet traverses. Significant problems remain to be solved in the area of multicast tree formation, the problem of scaling being paramount among these. In this paper we show how the current IP multicast architecture scales poorly (by scale poorly, we mean consume too much memory, bandwidth, or too many processing resources), and subsequently present a multicast protocol based on a new scalable architecture that is low-cost, relatively simple, and efficient. We also show how this architecture is decoupled from (though dependent on) unicast routing, and is therefore easy to install in an internet that comprises multiple heterogeneous unicast routing algorithms. |
| 182. Peer-to-Peer: Harnessing the Power of Disruptive Technologies Roger Dingledine and Michael Freedman and David Molnar Editor(s): Edited by Andy Oram, O'Reilly, March, 2001. |
| 183. Efficient Peer-to-Peer Lookup Based on a Distributed Trie Freedman, M. and Vingralek, R. Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Lecture Notes in Computer Science 2429, 66-75, Springer Verlag, 2002. |
| 184. Security for structured peer-to-peer overlay networks Miguel Castro and Peter Druschel and Ayalvadi Ganesh and Antony Rowstron and Dan S. Wallach Proceedings of the Fifth Symposium on Operating Systems Design and Implementation (OSDI'02), 2002. |
| 185. Secure Routing for Structured Peer-to-Peer Overlay Networks Miguel Castro and Peter Druschel and Ayalvadi J. Ganesh and Antony I. T. Rowstron and Dan S. Wallach Proceedings of OSDI, 2002. |
| 186. Secure Routing for Structured Peer-to-Peer Overlay Networks Miguel Castro and Peter Druschel and Ayalvadi J. Ganesh and Antony I. T. Rowstron and Dan S. Wallach Proceedings of OSDI, 2002. |
| 187. Security for Structured Peer-to-Peer Overlay Networks Castro, M. and Druschel, P. and Ganesh, A. and Rowstron, A. and Wallach, D. S. 5th Symposium on Operating Systems Design and Implementation, Boston, MA, USA, December, 2002. |
| 188. Multicast Security: A Taxonomy and Efficient Constructions Canetti, Ran and Garay, Juan and Itkis, Gene and Micciancio, Daniele and Naor, Moni and Pinkas, Benny Proceedings of INFOCOM, March, 1999. Abstract: Multicast communication is becoming the basis for a growing number of applications. It is therefore critical to provide founded security mechanisms for multicast communication. Yet, existing security protocols for multicast offer only very partial solutions. We first present a taxonomy of multicast scenarios on the Internet and point out the relevant security concerns. Next we identify two major security problems of multicast communication: individual authentication, and key revocation. Maintaining authenticity in multicast protocols is a much more complex problem than for unicast; in particular, known solutions are prohibitively inefficient in many cases. We present a solution that is reasonable for a range of scenarios. Our approach can be regarded as a `midpoint' between traditional Message Authentication Codes and digital signatures. We also present an improved and very efficient solution to another prevailing problem for multicast protocols, namely the key revocation problem. |
| 189. Improving Internet Multicast with Routing Labels Levine, B.N. and Garcia-Luna-Aceves, J.J. Proc. IEEE International Conference on Network Protocols, 241--50, October, 1997. |
| 190. Organizing Multicast Receivers Deterministically According to Packet-Loss Correlation Levine, B.N. and Paul, S. and Garcia-Luna-Aceves, J.J. Proc. Sixth ACM International Multimedia Conference (ACM Multimedia 98), September, 1998. |
| 191. Organizing Multicast Receivers Deterministically According to Packet-Loss Correlation Levine, B.N. and Paul, S. and Garcia-Luna-Aceves, J.J. Proc. Sixth ACM International Multimedia Conference (ACM Multimedia 98), September, 1998. |
| 192. Improving Search in Peer-to-Peer Networks Yang, B. and Garcia-Molina, H. Proceedings of the 22nd International Conference on Distributed Computing Systems, Vienna, Austria, July, 2002. |
| 193. Open Problems in Data-Sharing Peer-to-Peer Systems Daswani, N. and Garcia-Molina, H. and Yang, B. Proceedings of the 9th International Conference on Database Theory, Lecture Notes in Computer Science 2572, 1-15, Springer Verlag, 2003. |
| 194. Designing a Super-Peer Network Yang, B. and Garcia-Molina, H. Proceedings of the IEEE International Conference on Data Engineering, March, 2003. |
| 195. OceanStore: An Architecture for Global-Scale Persistent Storage John Kubiatowicz and David Bindel and Yan Chen and Steven Czerwinski and Patrick Eaton and Dennis Geels and Ramakrishna Gummadi and Sean Rhea and Hakim Weatherspoon and Westley Weimer and Chris Wells and Ben Zhao. Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), 2000. |
| 196. Adaptive Clustering for Mobile, Wireless Networks Lin, C.R. and Gerla, M. Journal on Selected Areas of Communication, 15(7)September, 1997. |
| 197. Overcast: Reliable Multicasting with an Overlay Network J. Jannotti and D. Gifford and K. Johnson and M. Kaashoek and J. O'Toole Proceedings of the 4th Symposium on Operating Systems Design and Implementation, 2000. |
| 198. Comparing the Performance of Distributed Hash Tables Under Churn Li, J. and Stribling, J. and Gil, T. M. and Morris, R. and Kaashoek, M. F. 3rd International Workshop on Peer-to-Peer Systems (IPTPS '04), San Diego, CA, USA, February, 2004. |
| 199. Secure Distributed Computing in a Commercial Environment P. Golle and S. Stubblebine Financial Cryptography, 2001. |
| 200. Efficient Peer-To-Peer Searches Using Result-Caching Bobby Bhattacharjee and Sudarshan Chawathe and Vijay Gopalakrishnan and Pete Keleher and Bujor Silaghi The 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03), February, 2003. |
| 201. Hierarchical Routing with Soft-State Replicas in TerraDir Bujor Silaghi and Vijay Gopalakrishnan and Bobby Bhattacharjee and Pete Keleher The 18th International Parallel and Distributed Processing Symposium, April, 2004. |
| 202. Adaptive Replication in Peer-to-Peer Systems Vijay Gopalakrishnan and Bujor Silaghi and Bobby Bhattacharjee and Pete Keleher The 24th International Conference on Distributed Computing Systems, March, 2004. |
| 203. Secure Group Communications Using Key Graphs Wong, C.K. and Gouda, M. and Lam, S. Proceedings of SIGCOMM, 28(4):68--79, September, 1998. Abstract: Many emerging applications (e.g. teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work ) are based upon a group communications model, i.e., they require packet delivery from one or more authorized receivers. As a result, securing group communications (i.e., providing confidentiality, integrity, and authenticity of messages delivered between group members) will become a critical networking issue. In this paper, we present a novel solution to the scalability problem of group/multicast key management. We formalize the notion of a secure group as a triple (U, K, R) where U denotes a set of users, K a set of keys held by the users ,and R a user-key relation. We then introduce key graphs to specify secure groups. For a special class of key graphs, we present three strategies for securely distributing rekey messages after a join/leave, and specify protocols for joining and leaving a secure group. The rekeying strategies and join/leave protocols are implemented in a prototype group key server we have built. We present measurement results from experiments and discuss performance comparisons. We show that our group key management service, using any of the three rekeying strategies, is scalable to large groups with frequent joins and leaves. In particular, the average measured processing time per join/leave increases linearly with the logarithm of group size. |
| 204. Batch Updates for Key Trees Li, X. and Yang, R. and Gouda, M. and Lam, S. Technical Report University of Texas, Austin, September, 2000. |
| 205. Heuristics for Internet Map Discovery R. Govindan and H. Tangmunarunkit Proceedings of Infocom, March, 2000. |
| 206. Heuristics for Internet Map Discovery R. Govindan and H. Tangmunarunkit Proceedings of Infocom, March, 2000. |
| 207. Fault Isolation in Multicast Trees Reddy, A. and Govindan, R. and Estrin, D. Proceedings of SIGCOMM, August, 2000. |
| 208. Fault Isolation in Multicast Trees Reddy, A. and Govindan, R. and Estrin, D. Computer Communications Review, August, 2000. Note: Proceedings of ACM SIGCOMM'00. |
| 209. Scalable, distributed data structures for internet service construction. Steven D. Gribble and Eric A. Brewer and Joseph M. Hellerstein and David Culler In Symposium on Operating Systems Design and Implementation, 2000. |
| 210. A Measurement Study of Peer-to-Peer File Sharing Systems Saroiu, S. and Krishna Gummadi, P. and Gribble, S. D. Proceedings of Multimedia Computing and Networking (MMCN '02), January, 2002. |
| 211. The Impact of DHT Routing Geometry on Resilience and Proximity Gummadi, K. P. and Gummadi, R. and Gribble, S. D. and Ratnasamy, S. and Shenker, S. and Stoica, I. SIGCOMM 2003, Karlsruhe, Germany, August, 2003. |
| 212. OceanStore: An Architecture for Global-Scale Persistent Storage John Kubiatowicz and David Bindel and Yan Chen and Steven Czerwinski and Patrick Eaton and Dennis Geels and Ramakrishna Gummadi and Sean Rhea and Hakim Weatherspoon and Westley Weimer and Chris Wells and Ben Zhao. Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), 2000. |
| 213. The Impact of DHT Routing Geometry on Resilience and Proximity Gummadi, K. P. and Gummadi, R. and Gribble, S. D. and Ratnasamy, S. and Shenker, S. and Stoica, I. SIGCOMM 2003, Karlsruhe, Germany, August, 2003. |
| 214. The Impact of DHT Routing Geometry on Resilience and Proximity Gummadi, K. P. and Gummadi, R. and Gribble, S. D. and Ratnasamy, S. and Shenker, S. and Stoica, I. SIGCOMM 2003, Karlsruhe, Germany, August, 2003. |
| 215. Steiner points in tree metrics don't (really) help A. Gupta Symposium of Discrete Algorithms, January, 2001. |
| 216. The Service Location Protocol Erik Guttman IEEE Internet Computing, July, 1999. |
| 217. WASRV Architectural Principles Rosenberg, J. and Schulzrinne, H. and Guttman, E. and Moats, R. Technical Report Internet Draft, Internet Engineering Task Force, February, 1998. Abstract: This document defines the problem of wide area service location, describing its key attributes, and giving examples of location prob- lems which do or do not fall under its definition. It also touches on a number of related protocols, and looks at how they fit, or do not fit, the problem of wide area service location. Note: Work in progress |
| 218. A Distributed Trust Model Alfarez Abdul-Rahman and Stephen Hailes Proceedings of the New Security Paradigms Workshop (NSPW-97), 48--60, ACM, sep 23--26, 1997. |
| 219. Supporting Trust in Virtual Communities Alfarez Abdul-Rahman and Stephen Hailes Proceedings Hawaii International Conference on System Sciences 33, 2000. |
| 220. Protocol Independent Multicast-Sparse Mode, RFC 2117 D. Estrin and D. Farinacci and A. Helmy and D. Thaler and S. Deering and M. Handley and V. Jacobson and C. Liu and P. Sharma Technical Report IETF, 1997. |
| 221. Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification D. Estrin and D. Farinacci and A. Helmy and D. Thaler and S. Deering and M. Handley and V. Jacobson and C. Liu and P. Sharma RFC 2362, IETF, 1998. |
| 222. A Scalable Content Addressable Network Sylvia Ratnasamy and Paul Francis and Mark Handley and Richard Karp and Scott Shenker In Proceedings of the ACM SIGCOMM 2001 Technical Conference, 2001. |
| 223. Application-level Multicast using Content-Addressable Networks Ratnasamy, S. and Handley, M. and Karp, R. and Shenker, S. Proceedings of 3rd International Workshop on Networked Group Communications, November, 2001. |
| 224. A Scalable Content-Addressable Network Ratnasamy, S. and Francis, P. and Handley, M. and Karp, R. and Shenker, S. SIGCOMM 2001, San Diego, CA, USA, August, 2001. |
| 225. Group Key Management Protocol (GKMP) Architecture Harney, H. and Muckenhirn, C. Technical Report Request for Comments (Experimental), 2094, Internet Engineering Task Force, July, 1997. Abstract: This document describes an architecture for the management of cryptographic keys for multicast communications. We identify the roles and responsibilities of communications system elements in accomplishing multicast key management, define security and functional requirements of each, and provide a detailed introduction to the Group Key Management Protocol (GKMP) which provides the ability to create and distribute keys within arbitrary-sized groups without the intervention of a global/centralized key manager. |
| 226. Group Key Management Protocol (GKMP) Architecture Harney, H. and Muckenhirn, C. Technical Report Request for Comments (Experimental), 2094, Internet Engineering Task Force, July, 1997. Abstract: This document describes an architecture for the management of cryptographic keys for multicast communications. We identify the roles and responsibilities of communications system elements in accomplishing multicast key management, define security and functional requirements of each, and provide a detailed introduction to the Group Key Management Protocol (GKMP) which provides the ability to create and distribute keys within arbitrary-sized groups without the intervention of a global/centralized key manager. |
| 227. Skipnet: A Scalable Overlay Network with Practical Locality Properties Harvey, N. J. A. and Jones, M. B. and Saroiu, S. and Theimer, M. and Wolman, A. 4th USENIX Symposium on Internet Technologies and Systems, Seattle, WA, USA, March, 2003. |
| 228. Algorithmic design of the Globe wide-area location service Maarten van Steen and Franz J. Hauck and Gerco Ballintijn and Andrew S. Tanenbaum The Computer Journal, 41(5):297--310, 1998. |
| 229. Scalable, distributed data structures for internet service construction. Steven D. Gribble and Eric A. Brewer and Joseph M. Hellerstein and David Culler In Symposium on Operating Systems Design and Implementation, 2000. |
| 230. Range Queries over DHTs Sylvia Ratnasamy and Joseph M. Hellerstein and Scott Shenker Technical Report IRB-TR-03-009, Intel Research, June, 2003. |
| 231. Protocol Independent Multicast-Sparse Mode, RFC 2117 D. Estrin and D. Farinacci and A. Helmy and D. Thaler and S. Deering and M. Handley and V. Jacobson and C. Liu and P. Sharma Technical Report IETF, 1997. |
| 232. Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification D. Estrin and D. Farinacci and A. Helmy and D. Thaler and S. Deering and M. Handley and V. Jacobson and C. Liu and P. Sharma RFC 2362, IETF, 1998. |
| 233. Control on Demand: An efficient approach to router programmability. G'isli Hj'almt'ysson and Samrat Bhattacharjee IEEE Journal on Selected Areas in Communications (JSAC): Special Issue on Service Enabling Platforms for Networked Multimedia Systems, August, 1999. Note: Guest Editors--D. Hutchison, G. Pacifici, B. Plattner, R. Stadler and J. Sventek. |
| 234. Control on Demand G'isli Hj'almt'ysson and Samrat Bhattacharjee Proceedings of the First International Working Conference on Active Networks (IWAN), June, 1999. |
| 235. An Architecture for a Secure Service Discovery Service Steven Czerwinski and Ben Y. Zhao and Todd Hodes and Anthony D. Joseph and Randy Katz Proceedings of the Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom-99, 24--35, ACM Press, aug 15--20, 1999. |
| 236. Detour: A Case for Informed Internet Routing and Transport S. Savage and T. Anderson and A. Aggarwal and D. Becker and N. Cardwell and A. Collin s and E. Hoffman and J. Snell and A. Vahdat and G. Voelker and J. Zahorjan IEEE Micro, 1999. |
| 237. Globe: A Wide-Area Distributed System Maarten van Steen and Philip Homburg and Andrew S. Tanenbaum IEEE Concurrency, 7(1):70--78, jan-mar, 1999. |
| 238. Escrow Services and Incentives in Peer-to-Peer Networks B. Horne and B. Pinkas and T. Sander Proceedings of the 3rd ACM conference on Electronic Commerce, October, 2001. |
| 239. Routing Information Organization To Support Scalable Interdomain Routing with Heterogeneous Path Requirements S. Hotz Ph.D. Thesis University of Southern California, 1996. |
| 240. X.500 Lightweight Directory Access Protocol W. Yeong and T. Howes and S. Kille Network Working Group RFC 1487, ISODE Consortium, 1993. |
| 241. Topology-Aware Routing in Structured Peer-to-Peer Overlay Networks Castro, M. and Druschel, P. and Hu, Y. C. and Rowstron, A. Technical Report MSR-TR-2002-82, Microsoft Research, 2002. |
| 242. Proximity Neighbor Selection in Tree-Based Structured Peer-to-Peer Overlays Castro, M. and Druschel, P. and Hu, Y. C. and Rowstron, A. Technical Report MSR-TR-2003-52, Microsoft Research, 2003. |
| 243. Tapestry: A Resilient Global-scale Overlay for Service Deployment Ben Y. Zhao and Ling Huang and Jeremy Stribling and Sean C. Rhea and Anthony D. Joseph and John D. Kubiatowicz IEEE Journal on Selected Areas in Communications, 22(1)January, 2004. |
| 244. Free riding on gnutella. E. Adar and B. Huberman First Monday, 5(10)2000. Note: http://www.firstmonday.dk/issues/issue5-10/adar/. |
| 245. Dynamic Replica Management in Distributed Hash Tables Marcel Waldvogel and Paul Hurley and Daniel Bauer Technical Report Research Report, RZ--3502, IBM, July, 2003. Abstract: Interest in distributed storage is fueled by demand for reliability and resilience combined with decreasing hardware costs. Peer-to-peer storage networks based on distributed hash tables are an attractive solution due to their efficient use of resources and resulting performance. The placement and subsequent efficient location of replicas in such systems remain open problems, especially the requirement to update replicated content, working in the absence of global information, and how to determine the locations in a dynamic system without introducing single points of failure. We present and evaluate a novel and versatile technique, replica enumeration, which allows for controlled replication and replica access. The possibility of enumerating and addressing individual replicas allows dynamic updates as well as superior performance without burdening the network with state information, yet taking advantage of locality information when available. We simulate, analyze, and prove properties of the system, and discuss some applications. |
| 246. Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design Ripeanu, M. and Foster, I. and Iamnitchi, A. IEEE Internet Computing, 6(1)2002. |
| 247. Multicast Security: A Taxonomy and Efficient Constructions Canetti, Ran and Garay, Juan and Itkis, Gene and Micciancio, Daniele and Naor, Moni and Pinkas, Benny Proceedings of INFOCOM, March, 1999. Abstract: Multicast communication is becoming the basis for a growing number of applications. It is therefore critical to provide founded security mechanisms for multicast communication. Yet, existing security protocols for multicast offer only very partial solutions. We first present a taxonomy of multicast scenarios on the Internet and point out the relevant security concerns. Next we identify two major security problems of multicast communication: individual authentication, and key revocation. Maintaining authenticity in multicast protocols is a much more complex problem than for unicast; in particular, known solutions are prohibitively inefficient in many cases. We present a solution that is reasonable for a range of scenarios. Our approach can be regarded as a `midpoint' between traditional Message Authentication Codes and digital signatures. We also present an improved and very efficient solution to another prevailing problem for multicast protocols, namely the key revocation problem. |
| 248. Protocol Independent Multicast-Sparse Mode, RFC 2117 D. Estrin and D. Farinacci and A. Helmy and D. Thaler and S. Deering and M. Handley and V. Jacobson and C. Liu and P. Sharma Technical Report IETF, 1997. |
| 249. Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification D. Estrin and D. Farinacci and A. Helmy and D. Thaler and S. Deering and M. Handley and V. Jacobson and C. Liu and P. Sharma RFC 2362, IETF, 1998. |
| 250. Reliable Multicast Framework for Light-weight Sessions and Application Level Framing Floyd, S. and Jacobson, V. and Liu, C.-G. and McCanne, S. and Zhang, L. Proceedings of SIGCOMM, September, 1995. Abstract: This paper describes SRM (Scalable Reliable Multicast), a reliable multicast framework for application level framing and light-weight sessions. The algorithms of this framework are efficient, robust, and scale well to both very large networks and very large sessions. The framework has been prototyped in wb, a distributed whiteboard application, and has been extensively tested on a global scale with sessions ranging from a few to more than 1000 participants. The paper describes the principles that have guided our design, including the IP multicast group delivery model, an end-to-end, receiver-based model of reliability, and the application level framing protocol model. As with unicast communications, the performance of a reliable multicast delivery algorithm depends on the underlying topology and operational environment. We investigate that dependence via analysis and simulation, and demonstrate an adaptive algorithm that uses the results of previous loss recovery events to adapt the control parameters used for future loss recovery. With the adaptive algorithm, our reliable multicast delivery algorithm provides good performance over a wide range of underlying topologies. |
| 251. Reliable Multicast Framework for Light-weight Sessions and Application Level Framing Floyd, S. and Jacobson, V. and Liu, C.-G. and McCanne, S. and Zhang, L. Proceedings of SIGCOMM, September, 1995. Abstract: This paper describes SRM (Scalable Reliable Multicast), a reliable multicast framework for application level framing and light-weight sessions. The algorithms of this framework are efficient, robust, and scale well to both very large networks and very large sessions. The framework has been prototyped in wb, a distributed whiteboard application, and has been extensively tested on a global scale with sessions ranging from a few to more than 1000 participants. The paper describes the principles that have guided our design, including the IP multicast group delivery model, an end-to-end, receiver-based model of reliability, and the application level framing protocol model. As with unicast communications, the performance of a reliable multicast delivery algorithm depends on the underlying topology and operational environment. We investigate that dependence via analysis and simulation, and demonstrate an adaptive algorithm that uses the results of previous loss recovery events to adapt the control parameters used for future loss recovery. With the adaptive algorithm, our reliable multicast delivery algorithm provides good performance over a wide range of underlying topologies. |
| 252. On the Placement of Internet Instrumentation Jamin, S. and Jin, C. and Jin, Y. and Raz, D. and Shavitt, Y. and Zhang, L. Proceedings of Infocom'00, March, 2000. |
| 253. Indra: A Peer-to-Peer Approach to Network Intrusion Detection and Prevention Ramaprabhu Janakiraman and Marcel Waldvogel and Qi Zhang Proceedings of IEEE WETICE 2003, June, 2003. Abstract: While the spread of the Internet has made the network ubiquitous, it has also rendered networked systems vulnerable to malicious attacks orchestrated from anywhere. These attacks or intrusions typically start with attackers infiltrating a network through a vulnerable host and then launching further attacks on the local network or Intranet. Attackers rely on increasingly sophisticated techniques like using distributed attack sources and obfuscating their network addresses. On the other hand, software that guards against them remains rooted in traditional centralized techniques, presenting an easily-targeted single point of failure. Scalable, distributed network intrusion prevention techniques are sorely needed. We propose Indra---a distributed scheme based on sharing information between trusted peers in a network to guard the network as a whole against intrusion attempts. We present initial ideas for running Indra over a peer-to-peer infrastructure to distribute up-to-date rumors, facts, and trust information in a scalable way. |
| 254. Overcast: Reliable Multicasting with an Overlay Network J. Jannotti and D. Gifford and K. Johnson and M. Kaashoek and J. O'Toole Proceedings of the 4th Symposium on Operating Systems Design and Implementation, 2000. |
| 255. On the Placement of Internet Instrumentation Jamin, S. and Jin, C. and Jin, Y. and Raz, D. and Shavitt, Y. and Zhang, L. Proceedings of Infocom'00, March, 2000. |
| 256. On the Placement of Internet Instrumentation Jamin, S. and Jin, C. and Jin, Y. and Raz, D. and Shavitt, Y. and Zhang, L. Proceedings of Infocom'00, March, 2000. |
| 257. Overcast: Reliable Multicasting with an Overlay Network J. Jannotti and D. Gifford and K. Johnson and M. Kaashoek and J. O'Toole Proceedings of the 4th Symposium on Operating Systems Design and Implementation, 2000. |
| 258. Skipnet: A Scalable Overlay Network with Practical Locality Properties Harvey, N. J. A. and Jones, M. B. and Saroiu, S. and Theimer, M. and Wolman, A. 4th USENIX Symposium on Internet Technologies and Systems, Seattle, WA, USA, March, 2003. |
| 259. The Right Type of Trust for Distributed Systems Audun Josang Proceedings on the Workshop on New Security Paradigms, 119--131, ACM Press, sep 17--20, 1997. |
| 260. Bayeux: An Architecture for Scalable and Fault-tolerant Wide-area Data Dissemination S. Q. Zhuang and B. Y. Zhao and A. D. Joseph and R. Katz and J. Kubiatowicz Eleventh International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV 2001), 2001. |
| 261. An Architecture for a Secure Service Discovery Service Steven Czerwinski and Ben Y. Zhao and Todd Hodes and Anthony D. Joseph and Randy Katz Proceedings of the Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom-99, 24--35, ACM Press, aug 15--20, 1999. |
| 262. Tapestry: A Resilient Global-scale Overlay for Service Deployment Ben Y. Zhao and Ling Huang and Jeremy Stribling and Sean C. Rhea and Anthony D. Joseph and John D. Kubiatowicz IEEE Journal on Selected Areas in Communications, 22(1)January, 2004. |
| 263. Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing Zhao, B. Y. and Kubiatowicz, J. D. and Joseph, A. D. Technical Report UCB/CSD-01-1141, UC Berkeley, April, 2001. |
| 264. Client Puzzles: A Cryptographic Defense Against Connection Depletion Attacks A. Juels and J. Brainard Proceedings of NDSS '99 (Networks and Distributed Security Systems), 1999. |
| 265. Overcast: Reliable Multicasting with an Overlay Network J. Jannotti and D. Gifford and K. Johnson and M. Kaashoek and J. O'Toole Proceedings of the 4th Symposium on Operating Systems Design and Implementation, 2000. |
| 266. Wide-area cooperative storage with CFS Frank Dabek and M. Frans Kaashoek and David Karger and Robert Morris and Ion Stoica Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01), October, 2001. |
| 267. Wide-area cooperative storage with CFS Frank Dabek and M. Frans Kaashoek and David Karger and Robert Morris and Ion Stoica Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01), October, 2001. |
| 268. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications Stoica, I. and Morris, R. and Karger, D. and Kaashoek, M. F. and Balakrishnan, H. SIGCOMM 2001, San Diego, CA, USA, August, 2001. |
| 269. Koorde: A Simple Degree-Optimal Distributed Hash Table Kaashoek, M. F. and Karger, D. R. Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03), Lecture Notes in Computer Science 2735, 98-107, Springer Verlag, 2003. |
| 270. Comparing the Performance of Distributed Hash Tables Under Churn Li, J. and Stribling, J. and Gil, T. M. and Morris, R. and Kaashoek, M. F. 3rd International Workshop on Peer-to-Peer Systems (IPTPS '04), San Diego, CA, USA, February, 2004. |
| 271. Sybil-Resistant DHT Routing Danezis, G. and Lesniewski-Laas, C. and Kaashoek, M. F. and Anderson, R. 10th European Symposium on Research in Computer Security (ESORICS 2005), Milan, Italy, September, 2005. |
| 272. Key Management for Secure Internet Multicast using Boolean Function Minimization Techniques Chang, I. and Engel, R. and Kandlur, D. and Pendarakis, D. and Saha, D. Proceedings of Infocom, March, 1999. Abstract: The Internet today provides no support for privacy or authentication of multicast data distribution. However, an increasing number of applications will require secure multicast services in order to restrict group membership and enforce accountability of group members. A major problem associated with the deployment of secure multicast delivery services is the scalability of the key distribution protocol. This is particularly true with regard to the handling of group membership changes, such as member departures and/or expulsions, which necessitate the distribution of a new session key to all the remaining group members. In this paper, we present a new multicast key management scheme which uses a set of auxiliary keys in order to improve scalability. In contrast to previous schemes which generate a fixed hierarchy of keys, we dynamically generate the most suitable key hierarchy by composing different keys. However, our work goes one step further by focusing on the problem of cumulative member removal. Using Boolean function minimization techniques, our scheme outperforms all other schemes known to us in terms of message complexity in removing multiple group members. The efficiency of our scheme in aggregating key updates, due to multiple member departures, offers the potential of a significant performance advantage. The proposed scheme has been used within a toolkit for secure Internet multicast services that we have developed. |
| 273. On the economics of peer-to-peer content distribution systems for large-volume contents Koo, Simon G. M. and Kannan, Karthik and Lee, C. S. George and Kwong, Sze-Wan Proceedings of the 8th World Conference on Systemics, Cybernetics and Informatics (SCI 2004), 422--424, July, 2004. |
| 274. A genetic-algorithm-based neighbor-selection strategy for hybrid peer-to-peer networks Koo, Simon G. M. and Lee, C. S. George and Kannan, Karthik Proceedings of the 13th IEEE International Conference on Computer Communications and Networks (ICCCN'04), 469--474, October, 2004. |
| 275. An incentive-compatible capacity assignment algorithm for bulk data distribution using P2P Koo, Simon G. M. and Lee, C. S. George and Kannan, Karthik Proceedings of the 24th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2005), 127, July, 2005. |
| 276. A resource-trading mechanism for efficient distribution of large-volume contents on peer-to-peer networks Koo, Simon G. M. and Lee, C. S. George and Kannan, Karthik Proceedings of the 14th IEEE International Conference on Computer Communications and Networks (ICCCN'05), 428--433, October, 2005. |
| 277. Construction of an Efficient Overlay Multicast Infrastructure for Real-time Applications Suman Banerjee and Christopher Kommareddy and Koushik Kar and Bobby Bhattacharjee and Samir Khuller Proceedings of INFOCOM, 2003. |
| 278. Wide-area cooperative storage with CFS Frank Dabek and M. Frans Kaashoek and David Karger and Robert Morris and Ion Stoica Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01), October, 2001. |
| 279. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications Stoica, I. and Morris, R. and Karger, D. and Kaashoek, M. F. and Balakrishnan, H. SIGCOMM 2001, San Diego, CA, USA, August, 2001. |
| 280. Observations on the Dynamic Evolution of Peer-to-Peer Networks Liben-Nowell, D. and Balakrishnan, H. and Karger, D. 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Cambridge, MA, USA, March, 2002. |
| 281. Koorde: A Simple Degree-Optimal Distributed Hash Table Kaashoek, M. F. and Karger, D. R. Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03), Lecture Notes in Computer Science 2735, 98-107, Springer Verlag, 2003. |
| 282. Koorde: A Simple Degree-Optimal Distributed Hash Table Kaashoek, M. F. and Karger, D. R. Proceedings of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03), Lecture Notes in Computer Science 2735, 98-107, Springer Verlag, 2003. |
| 283. A Scalable Content Addressable Network Sylvia Ratnasamy and Paul Francis and Mark Handley and Richard Karp and Scott Shenker In Proceedings of the ACM SIGCOMM 2001 Technical Conference, 2001. |
| 284. Application-level Multicast using Content-Addressable Networks Ratnasamy, S. and Handley, M. and Karp, R. and Shenker, S. Proceedings of 3rd International Workshop on Networked Group Communications, November, 2001. |
| 285. A Scalable Content-Addressable Network Ratnasamy, S. and Francis, P. and Handley, M. and Karp, R. and Shenker, S. SIGCOMM 2001, San Diego, CA, USA, August, 2001. |
| 286. Scalable Reliable Multicast Using Multiple Multicast Channels Kasera, S. and Towsley, D. and Kurose, J. Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems (Sigmetrics '97), June, 1997. |
| 287. Scalable Reliable Multicast Using Multiple Multicast Channels Kasera, S. and Towsley, D. and Kurose, J. Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems (Sigmetrics '97), June, 1997. |
| 288. A Comparison of Server-Based and Receiver-Based Local Recovery Approaches for Scalable Reliable Multicast Kasera, S. and Kurose, J. and Towsley, D. Proceedings of Infocom, April, 1998. |
| 289. A Comparison of Server-Based and Receiver-Based Local Recovery Approaches for Scalable Reliable Multicast Kasera, S. and Kurose, J. and Towsley, D. Proceedings of Infocom, April, 1998. |
| 290. A Framework for Global IP-Anycast (GIA) Katabi, D. and Wroclawski, J. Technical Report Internet Draft, Internet Engineering Task Force, June, 1999. Abstract: This document describes GIA, an architecture for a scalable Global IP-Anycast service. In contrast to previous approaches, which route IP-anycast through the unicast routing system, GIA provides IP-anycast with its own routing protocol. To scale, GIA pushes the overhead of anycast routing to the edge of the network and off-load the middle routers of the burden of storing anycast routes. Note: Work in progress |
| 291. A Framework for Global IP-Anycast (GIA) Katabi, D. and Wroclawski, J. Proceedings of SIGCOMM, 2000. |
| 292. Authenticated Multi-Party Key Agreement in Constant Rounds J. Katz and M. Yung Submitted to Eurocrypt 2003. |
| 293. A Forward-Secure Public-Key Encryption Scheme Jonathan Katz 2002. |
| 294. Trust-Preserving Set Operations Ruggero Morselli and Samrat Bhattacharjee and Jonathan Katz and Pete Keleher The 23rd Conference of the IEEE Communications Society (Infocom), March, 2004. |
| 295. Bayeux: An Architecture for Scalable and Fault-tolerant Wide-area Data Dissemination S. Q. Zhuang and B. Y. Zhao and A. D. Joseph and R. Katz and J. Kubiatowicz Eleventh International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV 2001), 2001. |
| 296. An Architecture for a Secure Service Discovery Service Steven Czerwinski and Ben Y. Zhao and Todd Hodes and Anthony D. Joseph and Randy Katz Proceedings of the Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom-99, 24--35, ACM Press, aug 15--20, 1999. |
| 297. An Evaluation of Preference Clustering in Large-scale Multicast Applications Wong, T. and Katz, R. and McCanne, S. Proceedings of INFOCOM, March, 2000. |
| 298. An Evaluation of Preference Clustering in Large-scale Multicast Applications Wong, T. and Katz, R. and McCanne, S. Proceedings of INFOCOM, March, 2000. |
| 299. A Network Measurement Architecture for Adaptive Applications Stemm, Mark and Seshan, Srinivasan and Katz, Randy H. Proceedings of INFOCOM, March, 2000. |
| 300. Design of the TerraDir Distributed Directory Bobby Bhattacharjee and Pete Keleher and Bujor Silaghi Technical Report CS-TR-4163, University of Maryland at College Park, 2001. |
| 301. Routing in the TerraDir Directory Service Bujor Silaghi and Bobby Bhattacharjee and Pete Keleher Proceedings of SPIE ITCOM, 2002. |
| 302. Are Virtualized Overlay Networks Too Much of a Good Thing? Pete Keleher and Samrat Bhattacharjee and Bujor Silaghi The 1st International Workshop on Peer-to-Peer Systems (IPTPS'02), 2002. |
| 303. Efficient Peer-To-Peer Searches Using Result-Caching Bobby Bhattacharjee and Sudarshan Chawathe and Vijay Gopalakrishnan and Pete Keleher and Bujor Silaghi The 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03), February, 2003. |
| 304. Hierarchical Routing with Soft-State Replicas in TerraDir Bujor Silaghi and Vijay Gopalakrishnan and Bobby Bhattacharjee and Pete Keleher The 18th International Parallel and Distributed Processing Symposium, April, 2004. |
| 305. Adaptive Replication in Peer-to-Peer Systems Vijay Gopalakrishnan and Bujor Silaghi and Bobby Bhattacharjee and Pete Keleher The 24th International Conference on Distributed Computing Systems, March, 2004. |
| 306. Trust-Preserving Set Operations Ruggero Morselli and Samrat Bhattacharjee and Jonathan Katz and Pete Keleher The 23rd Conference of the IEEE Communications Society (Infocom), March, 2004. |
| 307. Construction of an Efficient Overlay Multicast Infrastructure for Real-time Applications Suman Banerjee and Christopher Kommareddy and Koushik Kar and Bobby Bhattacharjee and Samir Khuller Proceedings of INFOCOM, 2003. |
| 308. X.500 Lightweight Directory Access Protocol W. Yeong and T. Howes and S. Kille Network Working Group RFC 1487, ISODE Consortium, 1993. |
| 309. Choosing a Random Peer King, V. and Saia, J. Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, 125-130, July, 2004. |
| 310. Finding Close Friends over the Internet Narendar Shankar and Christopher Komareddy and Bobby Bhattacharjee Proceedings of International Conference on Network Protocols, November, 2001. |
| 311. Construction of an Efficient Overlay Multicast Infrastructure for Real-time Applications Suman Banerjee and Christopher Kommareddy and Koushik Kar and Bobby Bhattacharjee and Samir Khuller Proceedings of INFOCOM, 2003. |
| 312. Finding Close Friends on the Internet Kommareddy, C. and Shankar, N. and Bhattacharjee, B. Proceedings of ICNP, November, 2001. |
| 313. Scalable Peer Finding on the Internet Banerjee, S. and Kommareddy, C. and Bhattacharjee, B. Proceedings of Global Internet Symposium, Globecom, November, 2002. |
| 314. Scalable Application Layer Multicast Suman Banerjee and Bobby Bhattacharjee and Christopher Kommreddy Proceedings of ACM SIGCOMM, 2002. |
| 315. Analysis of Parallel Downloading for Large File Distribution Koo, Simon G. M. and Rosenberg, Catherine and Xu, Dongyan Proceedings of the 9th IEEE International Workshop on Future Trends of Distributed Computing Systems (FTDCS 2003), 128--135, May, 2003. |
| 316. On the economics of peer-to-peer content distribution systems for large-volume contents Koo, Simon G. M. and Kannan, Karthik and Lee, C. S. George and Kwong, Sze-Wan Proceedings of the 8th World Conference on Systemics, Cybernetics and Informatics (SCI 2004), 422--424, July, 2004. |
| 317. A genetic-algorithm-based neighbor-selection strategy for hybrid peer-to-peer networks Koo, Simon G. M. and Lee, C. S. George and Kannan, Karthik Proceedings of the 13th IEEE International Conference on Computer Communications and Networks (ICCCN'04), 469--474, October, 2004. |
| 318. An incentive-compatible capacity assignment algorithm for bulk data distribution using P2P Koo, Simon G. M. and Lee, C. S. George and Kannan, Karthik Proceedings of the 24th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2005), 127, July, 2005. |
| 319. A resource-trading mechanism for efficient distribution of large-volume contents on peer-to-peer networks Koo, Simon G. M. and Lee, C. S. George and Kannan, Karthik Proceedings of the 14th IEEE International Conference on Computer Communications and Networks (ICCCN'05), 428--433, October, 2005. |
| 320. Bulk content distribution using peer-to-peer overlay: design and analysis Koo, Simon G. M. Ph.D. Thesis School or Electrical and Computer Engineering, Purdue University, August, 2005. |
| 321. OPUS: An Overlay Utility Service Rebecca Braynard and Dejan Kostic and Adolfo Rodriguez and Jeff Chase and Amin Vahdat Poster at 18th ACM Symposium on Operating System Principles, October, 2001. |
| 322. Bayeux: An Architecture for Scalable and Fault-tolerant Wide-area Data Dissemination S. Q. Zhuang and B. Y. Zhao and A. D. Joseph and R. Katz and J. Kubiatowicz Eleventh International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV 2001), 2001. |
| 323. OceanStore: An Architecture for Global-Scale Persistent Storage John Kubiatowicz and David Bindel and Yan Chen and Steven Czerwinski and Patrick Eaton and Dennis Geels and Ramakrishna Gummadi and Sean Rhea and Hakim Weatherspoon and Westley Weimer and Chris Wells and Ben Zhao. Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), 2000. |
| 324. Tapestry: A Resilient Global-scale Overlay for Service Deployment Ben Y. Zhao and Ling Huang and Jeremy Stribling and Sean C. Rhea and Anthony D. Joseph and John D. Kubiatowicz IEEE Journal on Selected Areas in Communications, 22(1)January, 2004. |
| 325. Tapestry: A Resilient Global-scale Overlay for Service Deployment Ben Y. Zhao and Ling Huang and Jeremy Stribling and Sean C. Rhea and Anthony D. Joseph and John D. Kubiatowicz IEEE Journal on Selected Areas in Communications, 22(1)January, 2004. |
| 326. Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing Zhao, B. Y. and Kubiatowicz, J. D. and Joseph, A. D. Technical Report UCB/CSD-01-1141, UC Berkeley, April, 2001. |
| 327. Pollution in P2P File Sharing Systems Liang, J. and Kumar, R. and Xi, Y. and Ross, K. IEEE Infocom, Miami, FL, USA, March, 2005. |
| 328. Real-Time Reliable Multicast Using Proactive Forward Error Correction Dan Rubenstein and Jim Kurose and Don Towsley Proceedings of NOSSDAV, 279--293, U. Mass, Amherst, July, 1998. Abstract: Real-Time reliable multicast over a best-effort service network remains a challenging research problem. Most protocols for reliable multicast use repair techniques that result in significant and variable delay, which can lead to missed deadlines in real-time scenarios. In this paper we present a repair technique that combines forward error correction (FEC) with automatic repeat request (ARQ). The novel aspect of the technique is its ability to reduce delay in reliable multicast delivery by sending repairs proactively (i.e., before they are required). The technique requires minimal state at senders and receivers, and no additional active router functionality beyond what is required by the current multicast service model. Furthermore, the technique uses only end-to-end mechanisms, where all data and repairs are transmitted by the data-originating source, leaving receivers free from any burden of sending repairs. We simulate a simple round-based version of a protocol embodying this technique to show its effectiveness in preventing repair request implosion, reducing the expected time of reliable delivery of data, and keeping bandwidth usage for repairs low. We show how a protocol using the technique can be adapted to provide delivery that is reliable before a real-time deadline with probability extremely close to one. Finally, we develop several variations of the protocol that use the technique in various fashions for high rate data streaming applications, and present results from additional simulations that examine performance in a variety of Internet-like heterogeneous networks. |
| 329. Detecting Shared Congestion of Flows Via End-to-end Measurement Dan Rubenstein and Jim Kurose and Don Towsley Proceedings of Sigmetrics, June, 2000. Abstract: Current Internet congestion control protocols operate independently on a per-flow basis. Recent work has demonstrated that cooperative congestion control strategies between flows can improve performance for a variety of applications, ranging from aggregated TCP transmissions to multiple-sender multicast applications. However, in order for this cooperation to be effective, one must first identify the flows that are congested at the same set of resources. In this paper, we present techniques based on loss or delay observations at end-hosts to infer whether or not two flows experiencing congestion are congested at the same network resources. We validate these techniques via queueing analysis, simulation, and experimentation within the Internet. |
| 330. Scalable Reliable Multicast Using Multiple Multicast Channels Kasera, S. and Towsley, D. and Kurose, J. Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems (Sigmetrics '97), June, 1997. |
| 331. Scalable Reliable Multicast Using Multiple Multicast Channels Kasera, S. and Towsley, D. and Kurose, J. Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems (Sigmetrics '97), June, 1997. |
| 332. A Comparison of Server-Based and Receiver-Based Local Recovery Approaches for Scalable Reliable Multicast Kasera, S. and Kurose, J. and Towsley, D. Proceedings of Infocom, April, 1998. |
| 333. A Comparison of Server-Based and Receiver-Based Local Recovery Approaches for Scalable Reliable Multicast Kasera, S. and Kurose, J. and Towsley, D. Proceedings of Infocom, April, 1998. |
| 334. On the economics of peer-to-peer content distribution systems for large-volume contents Koo, Simon G. M. and Kannan, Karthik and Lee, C. S. George and Kwong, Sze-Wan Proceedings of the 8th World Conference on Systemics, Cybernetics and Informatics (SCI 2004), 422--424, July, 2004. |
| 335. Availability and Locality Measurements of Peer-to-Peer File Systems Jacky Chu and Kevin Labonte and Brian Neil Levine Proc. ITCom: Scalability and Traffic Control in IP Networks, july, 2002. |
| 336. Secure Group Communications Using Key Graphs Wong, C.K. and Gouda, M. and Lam, S. Proceedings of SIGCOMM, 28(4):68--79, September, 1998. Abstract: Many emerging applications (e.g. teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work ) are based upon a group communications model, i.e., they require packet delivery from one or more authorized receivers. As a result, securing group communications (i.e., providing confidentiality, integrity, and authenticity of messages delivered between group members) will become a critical networking issue. In this paper, we present a novel solution to the scalability problem of group/multicast key management. We formalize the notion of a secure group as a triple (U, K, R) where U denotes a set of users, K a set of keys held by the users ,and R a user-key relation. We then introduce key graphs to specify secure groups. For a special class of key graphs, we present three strategies for securely distributing rekey messages after a join/leave, and specify protocols for joining and leaving a secure group. The rekeying strategies and join/leave protocols are implemented in a prototype group key server we have built. We present measurement results from experiments and discuss performance comparisons. We show that our group key management service, using any of the three rekeying strategies, is scalable to large groups with frequent joins and leaves. In particular, the average measured processing time per join/leave increases linearly with the logarithm of group size. |
| 337. Batch Updates for Key Trees Li, X. and Yang, R. and Gouda, M. and Lam, S. Technical Report University of Texas, Austin, September, 2000. |
| 338. Reliable Group Re-keying: A Performance Analysis Yang, Richard Y. and Li, Steve and Zhang, Brian and Lam, Simon Proceedings of SIGCOMM, August, 2001. |
| 339. Making gnutella-like P2P systems scalable Yatin Chawathe and Sylvia Ratnasamy and Lee Breslau and Nick Lanham and Scott Shenker Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, 407--418, ACM Press, 2003. |
| 340. Making Gnutella-like P2P Systems Scalable Chawathe, Y. and Ratnasamy, S. and Breslau, L. and Lanham, N. and Shenker, S. Proceedings of SIGCOMM, August, 2003. |
| 341. Resource Description Framework (RDF) Model and Syntax Specification O. Lassila and R. Swick W3C Proposed Recommendation, January, 1999. Note: Available at http://www.w3.org/TR/PR-rdf-syntax. |
| 342. Self-Organization in Peer-to-Peer Systems Ledlie, J. and Taylor, J. and Serban, L. and Seltzer, M. 10th ACM SIGOPS European Workshop, Saint-Emilion, France, September, 2002. |
| 343. Cooperative peer groups in NICE Seungjoon Lee and Rob Sherwood and Bobby Bhattacharjee Proceedings of INFOCOM, 2003. |
| 344. Resilient Multicast using Overlays Suman Banerjee and Seungjoon Lee and Bobby Bhattacharjee and Aravind Srinivasan Proceedings of ACM SIGMETRICS, 2003. |
| 345. On the economics of peer-to-peer content distribution systems for large-volume contents Koo, Simon G. M. and Kannan, Karthik and Lee, C. S. George and Kwong, Sze-Wan Proceedings of the 8th World Conference on Systemics, Cybernetics and Informatics (SCI 2004), 422--424, July, 2004. |
| 346. A genetic-algorithm-based neighbor-selection strategy for hybrid peer-to-peer networks Koo, Simon G. M. and Lee, C. S. George and Kannan, Karthik Proceedings of the 13th IEEE International Conference on Computer Communications and Networks (ICCCN'04), 469--474, October, 2004. |
| 347. An incentive-compatible capacity assignment algorithm for bulk data distribution using P2P Koo, Simon G. M. and Lee, C. S. George and Kannan, Karthik Proceedings of the 24th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2005), 127, July, 2005. |
| 348. A resource-trading mechanism for efficient distribution of large-volume contents on peer-to-peer networks Koo, Simon G. M. and Lee, C. S. George and Kannan, Karthik Proceedings of the 14th IEEE International Conference on Computer Communications and Networks (ICCCN'05), 428--433, October, 2005. |
| 349. Sybil-Resistant DHT Routing Danezis, G. and Lesniewski-Laas, C. and Kaashoek, M. F. and Anderson, R. 10th European Symposium on Research in Computer Security (ESORICS 2005), Milan, Italy, September, 2005. |
| 350. Advogato's Trust Metric Raph Levien Note: Available on-line at http://www.advogato.org/trust-metric.html. |
| 351. Availability and Locality Measurements of Peer-to-Peer File Systems Jacky Chu and Kevin Labonte and Brian Neil Levine Proc. ITCom: Scalability and Traffic Control in IP Networks, july, 2002. |
| 352. Improving Internet Multicast with Routing Labels Levine, B.N. and Garcia-Luna-Aceves, J.J. Proc. IEEE International Conference on Network Protocols, 241--50, October, 1997. |
| 353. Organizing Multicast Receivers Deterministically According to Packet-Loss Correlation Levine, B.N. and Paul, S. and Garcia-Luna-Aceves, J.J. Proc. Sixth ACM International Multimedia Conference (ACM Multimedia 98), September, 1998. |
| 354. Organizing Multicast Receivers Deterministically According to Packet-Loss Correlation Levine, B.N. and Paul, S. and Garcia-Luna-Aceves, J.J. Proc. Sixth ACM International Multimedia Conference (ACM Multimedia 98), September, 1998. |
| 355. Comparing the Performance of Distributed Hash Tables Under Churn Li, J. and Stribling, J. and Gil, T. M. and Morris, R. and Kaashoek, M. F. 3rd International Workshop on Peer-to-Peer Systems (IPTPS '04), San Diego, CA, USA, February, 2004. |
| 356. Search and Replication in Unstructured Peer-to-Peer Networks Lv, Q. and Cao, P. and Cohen, E. and Li, K. and Shenker, S. 16th International Conference on Supercomputing, New York, NY, USA, June, 2002. |
| 357. Reliable Group Re-keying: A Performance Analysis Yang, Richard Y. and Li, Steve and Zhang, Brian and Lam, Simon Proceedings of SIGCOMM, August, 2001. |
| 358. On the Use of Destination Set Grouping to Improve Fairness in Multicast Video Distribution Cheung, S.Y. and Ammar, M.H. and Li, X. Proceedings of Infocom, March, 1996. Abstract: We address the problem of fairness in a feedback-controlled multicast video distribution scheme. In a fair scheme each receiver should receive a video stream with a quality that is commensurate with its capabilities or the capabilities of the path leading to it, regardless of other receivers or network paths. This fairness problem results from the fact that multicast communication trades economy of bandwidth with granularity of control. Distributing video using individual feedback-controlled point-to-point streams results in high bandwidth utilization but the granularity of control is high as communication parameters can be negotiated individually with each receiver. In contrast, using a single multicast stream has good bandwidth economy, but very low granularity of control. In this paper we propose, implement and experiment with a system that spans the spectrum represented by the two extremes above. In the scheme, Californialled destination set grouping (DSG), a source maintains a small number of video streams, carrying the same video but each targeted at receivers with different capabilities. Each stream is feedback-controlled within prescribed limits by its group of receivers. Receivers may move among streams as their capabilities or the capabilities of the network paths leading to them change. The scheme is shown to improve fairness significantly at a small bandwidth cost. |
| 359. On the Use of Destination Set Grouping to Improve Fairness in Multicast Video Distribution Cheung, S.Y. and Ammar, M.H. and Li, X. Proceedings of Infocom, March, 1996. Abstract: We address the problem of fairness in a feedback-controlled multicast video distribution scheme. In a fair scheme each receiver should receive a video stream with a quality that is commensurate with its capabilities or the capabilities of the path leading to it, regardless of other receivers or network paths. This fairness problem results from the fact that multicast communication trades economy of bandwidth with granularity of control. Distributing video using individual feedback-controlled point-to-point streams results in high bandwidth utilization but the granularity of control is high as communication parameters can be negotiated individually with each receiver. In contrast, using a single multicast stream has good bandwidth economy, but very low granularity of control. In this paper we propose, implement and experiment with a system that spans the spectrum represented by the two extremes above. In the scheme, Californialled destination set grouping (DSG), a source maintains a small number of video streams, carrying the same video but each targeted at receivers with different capabilities. Each stream is feedback-controlled within prescribed limits by its group of receivers. Receivers may move among streams as their capabilities or the capabilities of the network paths leading to them change. The scheme is shown to improve fairness significantly at a small bandwidth cost. |
| 360. Layered Video Multicast with Retransmissions (LVMR): Evaluation of Hierarchical Rate Control Li, X. and Paul, S. and Ammar, M. Proceedings of INFOCOM, March/April, 1998. Abstract: Layered Video Multicast with Retransmissions (LVMR) is a system for distributing video using layered coding over the Internet, The two key contributions of the system are: (1) improving the quality of reception within each layer by retransmitting lost packets given an upper bound on recovery time and applying an adaptive playback point scheme to help achieve more successful retransmission, and (2) adapting to network congestion and heterogeneity using hierarchical rate control mechanism. This paper concentrates on the rate control aspects of LVMR. In contrast to the existing sender-based and receiver-based rate control in which the entire information about network congestion is either available at the sender (in sender-based approach) or replicated at the receivers (in receiver-based approach), the hierarchical rate control mechanism distributes the information between the sender, receivers, and some agents in the network in such a way that each entity maintains only the information relevant to itself. In addition to that, the hierarchical approach enables intelligent decisions to be made in terms of conducting concurrent experiments and choosing one of several possible experiments at any instant of time based on minimal state information at the agents in the network. Protocol details are presented in the paper together with experimental and simulation results to back our claims. |
| 361. Batch Updates for Key Trees Li, X. and Yang, R. and Gouda, M. and Lam, S. Technical Report University of Texas, Austin, September, 2000. |
| 362. Pollution in P2P File Sharing Systems Liang, J. and Kumar, R. and Xi, Y. and Ross, K. IEEE Infocom, Miami, FL, USA, March, 2005. |
| 363. Observations on the Dynamic Evolution of Peer-to-Peer Networks Liben-Nowell, D. and Balakrishnan, H. and Karger, D. 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Cambridge, MA, USA, March, 2002. |
| 364. HyperCast: A Protocol for Maintaining Multicast Group Members in a Logical Hypercube Topology Liebeherr, J. and Beam, T.K. Proceedings of 1st International Workshop on Networked Group Communications, July, 1999. |
| 365. The design and implementation of an intentional naming system William Adjie-Winoto and Elliot Schwartz and Hari Balakrishnan and Jeremy Lilley Symposium on Operating Systems Principles, 186-201, 1999. |
| 366. Adaptive Clustering for Mobile, Wireless Networks Lin, C.R. and Gerla, M. Journal on Selected Areas of Communication, 15(7)September, 1997. |
| 367. RMTP: a reliable multicast transport protocol Lin, J.C. and Paul, S. Proceedings of INFOCOM, March, 1996. Abstract: This paper describes the design and implementation of a reliable multicast transport protocol called RMTP. RMTP provides sequenced, lossless delivery of bulk data from one sender to a group of receivers. It allows a receiver to join or leave a group without notifying the sender or other receivers. Protocol state maintained at each multicast participant is independent of the number of participants. The sender knows neither the identity of each receiver nor the number of receivers in the multicast group. RMTP is based on a multi-level hierarchical approach, in which the receivers are grouped into a hierarchy of local regions, with a Designated Receiver (DR) in each local region. Receivers in each local region periodically send acknowledgments (ACKs) to their corresponding DR, DRs send ACKs to the higher-level DRs, until the DRs in the highest level send ACKs to the sender, thereby avoiding the ACK-implosion problem. DRs cache received data and respond to retransmission requests of the receivers in their corresponding local regions, thereby decreasing end-to-end latency. RMTP uses a packet-based selective repeat retransmission scheme for higher throughput. This paper also provides the measurements of RMTP's performance with receivers located at various sites in the Internet. |
| 368. RMTP: a reliable multicast transport protocol Lin, J.C. and Paul, S. Proceedings of INFOCOM, March, 1996. Abstract: This paper describes the design and implementation of a reliable multicast transport protocol called RMTP. RMTP provides sequenced, lossless delivery of bulk data from one sender to a group of receivers. It allows a receiver to join or leave a group without notifying the sender or other receivers. Protocol state maintained at each multicast participant is independent of the number of participants. The sender knows neither the identity of each receiver nor the number of receivers in the multicast group. RMTP is based on a multi-level hierarchical approach, in which the receivers are grouped into a hierarchy of local regions, with a Designated Receiver (DR) in each local region. Receivers in each local region periodically send acknowledgments (ACKs) to their corresponding DR, DRs send ACKs to the higher-level DRs, until the DRs in the highest level send ACKs to the sender, thereby avoiding the ACK-implosion problem. DRs cache received data and respond to retransmission requests of the receivers in their corresponding local regions, thereby decreasing end-to-end latency. RMTP uses a packet-based selective repeat retransmission scheme for higher throughput. This paper also provides the measurements of RMTP's performance with receivers located at various sites in the Internet. |
| 369. Protocol Independent Multicast-Sparse Mode, RFC 2117 D. Estrin and D. Farinacci and A. Helmy and D. Thaler and S. Deering and M. Handley and V. Jacobson and C. Liu and P. Sharma Technical Report IETF, 1997. |
| 370. Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification D. Estrin and D. Farinacci and A. Helmy and D. Thaler and S. Deering and M. Handley and V. Jacobson and C. Liu and P. Sharma RFC 2362, IETF, 1998. |
| 371. Reliable Multicast Framework for Light-weight Sessions and Application Level Framing Floyd, S. and Jacobson, V. and Liu, C.-G. and McCanne, S. and Zhang, L. Proceedings of SIGCOMM, September, 1995. Abstract: This paper describes SRM (Scalable Reliable Multicast), a reliable multicast framework for application level framing and light-weight sessions. The algorithms of this framework are efficient, robust, and scale well to both very large networks and very large sessions. The framework has been prototyped in wb, a distributed whiteboard application, and has been extensively tested on a global scale with sessions ranging from a few to more than 1000 participants. The paper describes the principles that have guided our design, including the IP multicast group delivery model, an end-to-end, receiver-based model of reliability, and the application level framing protocol model. As with unicast communications, the performance of a reliable multicast delivery algorithm depends on the underlying topology and operational environment. We investigate that dependence via analysis and simulation, and demonstrate an adaptive algorithm that uses the results of previous loss recovery events to adapt the control parameters used for future loss recovery. With the adaptive algorithm, our reliable multicast delivery algorithm provides good performance over a wide range of underlying topologies. |
| 372. Reliable Multicast Framework for Light-weight Sessions and Application Level Framing Floyd, S. and Jacobson, V. and Liu, C.-G. and McCanne, S. and Zhang, L. Proceedings of SIGCOMM, September, 1995. Abstract: This paper describes SRM (Scalable Reliable Multicast), a reliable multicast framework for application level framing and light-weight sessions. The algorithms of this framework are efficient, robust, and scale well to both very large networks and very large sessions. The framework has been prototyped in wb, a distributed whiteboard application, and has been extensively tested on a global scale with sessions ranging from a few to more than 1000 participants. The paper describes the principles that have guided our design, including the IP multicast group delivery model, an end-to-end, receiver-based model of reliability, and the application level framing protocol model. As with unicast communications, the performance of a reliable multicast delivery algorithm depends on the underlying topology and operational environment. We investigate that dependence via analysis and simulation, and demonstrate an adaptive algorithm that uses the results of previous loss recovery events to adapt the control parameters used for future loss recovery. With the adaptive algorithm, our reliable multicast delivery algorithm provides good performance over a wide range of underlying topologies. |
| 373. Search and Replication in Unstructured Peer-to-Peer Networks Lv, Q. and Cao, P. and Cohen, E. and Li, K. and Shenker, S. 16th International Conference on Supercomputing, New York, NY, USA, June, 2002. |
| 374. Can Heterogeneity Make Gnutella Scalable? Lv, Q. and Ratnasamy, S. and Shenker, S. Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Lecture Notes in Computer Science 2429, 94-103, Springer Verlag, 2002. |
| 375. Resilient Overlay Networks Andersen, D.G. and Balakrishnan, H. and Frans Kaashoek, M. and Morris, R. Proceedings of 18th ACM Symposium on Operating Systems Principles, October, 2001. |
| 376. On the Decomposition of Large Communication Networks for Hierarchical Control Implementation Muralidhar, K. and M. Sundareshan, M. IEEE Transactions on Communications, COM-34, 10, 985--987, 1986. |
| 377. Symphony: Distributed Hashing in a Small World Manku, G. S. and Bawa, M. and Raghavan, P. 4th USENIX Symposium on Internet Technologies and Systems, Seattle, WA, USA, March, 2003. |
| 378. Formalising Trust as a Computational Concept S. Marsh Ph.D. Thesis University of Sterling, 1994. |
| 379. Collaborative Management of Global Directories in P2P Systems Peery, C. and Cuenca-Acuna, F. M. and Martin, R. P. and Nguyen, T. D. Technical Report DCS-TR-510, November, 2002. |
| 380. Kademlia: A Peer-to-Peer Information System Based on the XOR Metric Maymounkov, P. and Mazieres, D. Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Lecture Notes in Computer Science 2429, 53-65, Springer Verlag, 2002. |
| 381. Kademlia: A Peer-to-Peer Information System Based on the XOR Metric Maymounkov, P. and Mazieres, D. Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Lecture Notes in Computer Science 2429, 53-65, Springer Verlag, 2002. |
| 382. RMX: Reliable Multicast for Heterogeneous Networks Y. Chawathe and S. McCanne and E. A. Brewer Proceedings of Infocom, 2000. |
| 383. The Breadcrumb Forwarding Service: A Synthesis of PGM and EXPRESS to Improve and Simplify Global IP Multicast Koichi Yano and Steven McCanne ACM Computer Communication Review, 30(2)2000. |
| 384. Reliable Multicast Framework for Light-weight Sessions and Application Level Framing Floyd, S. and Jacobson, V. and Liu, C.-G. and McCanne, S. and Zhang, L. Proceedings of SIGCOMM, September, 1995. Abstract: This paper describes SRM (Scalable Reliable Multicast), a reliable multicast framework for application level framing and light-weight sessions. The algorithms of this framework are efficient, robust, and scale well to both very large networks and very large sessions. The framework has been prototyped in wb, a distributed whiteboard application, and has been extensively tested on a global scale with sessions ranging from a few to more than 1000 participants. The paper describes the principles that have guided our design, including the IP multicast group delivery model, an end-to-end, receiver-based model of reliability, and the application level framing protocol model. As with unicast communications, the performance of a reliable multicast delivery algorithm depends on the underlying topology and operational environment. We investigate that dependence via analysis and simulation, and demonstrate an adaptive algorithm that uses the results of previous loss recovery events to adapt the control parameters used for future loss recovery. With the adaptive algorithm, our reliable multicast delivery algorithm provides good performance over a wide range of underlying topologies. |
| 385. Reliable Multicast Framework for Light-weight Sessions and Application Level Framing Floyd, S. and Jacobson, V. and Liu, C.-G. and McCanne, S. and Zhang, L. Proceedings of SIGCOMM, September, 1995. Abstract: This paper describes SRM (Scalable Reliable Multicast), a reliable multicast framework for application level framing and light-weight sessions. The algorithms of this framework are efficient, robust, and scale well to both very large networks and very large sessions. The framework has been prototyped in wb, a distributed whiteboard application, and has been extensively tested on a global scale with sessions ranging from a few to more than 1000 participants. The paper describes the principles that have guided our design, including the IP multicast group delivery model, an end-to-end, receiver-based model of reliability, and the application level framing protocol model. As with unicast communications, the performance of a reliable multicast delivery algorithm depends on the underlying topology and operational environment. We investigate that dependence via analysis and simulation, and demonstrate an adaptive algorithm that uses the results of previous loss recovery events to adapt the control parameters used for future loss recovery. With the adaptive algorithm, our reliable multicast delivery algorithm provides good performance over a wide range of underlying topologies. |
| 386. An Evaluation of Preference Clustering in Large-scale Multicast Applications Wong, T. and Katz, R. and McCanne, S. Proceedings of INFOCOM, March, 2000. |
| 387. An Evaluation of Preference Clustering in Large-scale Multicast Applications Wong, T. and Katz, R. and McCanne, S. Proceedings of INFOCOM, March, 2000. |
| 388. Bowman: A Node OS for Active Networks S. Merugu and S. Bhattacharjee and E. Zegura and K. Calvert Proceedings IEEE INFOCOM'2000, 2000. |
| 389. Exposing the network: Support for topology-sensitive applications Y. Chae and S. Merugu and E. Zegura and S. Bhattarcharjee Proceedings of IEEE OpenArch 2000, 2000. |
| 390. Multicast Security: A Taxonomy and Efficient Constructions Canetti, Ran and Garay, Juan and Itkis, Gene and Micciancio, Daniele and Naor, Moni and Pinkas, Benny Proceedings of INFOCOM, March, 1999. Abstract: Multicast communication is becoming the basis for a growing number of applications. It is therefore critical to provide founded security mechanisms for multicast communication. Yet, existing security protocols for multicast offer only very partial solutions. We first present a taxonomy of multicast scenarios on the Internet and point out the relevant security concerns. Next we identify two major security problems of multicast communication: individual authentication, and key revocation. Maintaining authenticity in multicast protocols is a much more complex problem than for unicast; in particular, known solutions are prohibitively inefficient in many cases. We present a solution that is reasonable for a range of scenarios. Our approach can be regarded as a `midpoint' between traditional Message Authentication Codes and digital signatures. We also present an improved and very efficient solution to another prevailing problem for multicast protocols, namely the key revocation problem. |
| 391. The Download Mesh Bollaert, M. and Thadani, S. and Mickish, A. Note: Gnutella Developers' Forum, http://www.the-gdf.org/. |
| 392. I Jumped in the GnutellaNet and What Did I See? Lessons From a Simple Gnutella Network Simulation Miconi, T. October, 2002. |
| 393. Iolus: A Framework for Scalable Secure Multicasting Mittra, S. Proceedings of SIGCOMM, October, 1997. Abstract: As multicast applications are deployed for mainstream use, the need to secure multicast communications will become critical. Multicast, however, does not fit the point-to-point model of most network security protocols which were designed with unicast communications in mind. As we will show, securing multicast (or group) communications is fundamentally different from securing unicast (or paired) communications. In turn, these differences can result in scalability problems for many typical applications. In this paper, we examine and model the differences between unicast and multicast security and then propose Iolus: a novel framework for scalable secure multicasting. Protocols based on Iolus can be used to achieve a variety of security objectives and may be used either to directly secure multicast communications or to provide a separate group key management service to other |
| 394. WASRV Architectural Principles Rosenberg, J. and Schulzrinne, H. and Guttman, E. and Moats, R. Technical Report Internet Draft, Internet Engineering Task Force, February, 1998. Abstract: This document defines the problem of wide area service location, describing its key attributes, and giving examples of location prob- lems which do or do not fall under its definition. It also touches on a number of related protocols, and looks at how they fit, or do not fit, the problem of wide area service location. Note: Work in progress |
| 395. Development of the Domain Name System Mockapetris, Paul V. and Dunlap, Kevin J. Proceedings of SIGCOMM, 123--133, ACM, August, 1988. Abstract: The Domain Name System (DNS) provides name service for the DARPA Internet. It is one of the largest name services in operation today, serves a highly diverse community of hosts, users, and networks, and uses a unique combination of hierarchies, caching, and datagram access. This paper examines the ideas behind the initial design of DNS in 1983, discusses the evolution of these ideas into the current implementations and usages, notes conspicuous surprises, successess and shortcomings, and attempts to predict its future evolution. Note: also in Computer Communication Review 18 (4), Aug. 1988 |
| 396. Peer-to-Peer: Harnessing the Power of Disruptive Technologies Roger Dingledine and Michael Freedman and David Molnar Editor(s): Edited by Andy Oram, O'Reilly, March, 2001. |
| 397. Wide-area cooperative storage with CFS Frank Dabek and M. Frans Kaashoek and David Karger and Robert Morris and Ion Stoica Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01), October, 2001. |
| 398. Resilient Overlay Networks Andersen, D.G. and Balakrishnan, H. and Frans Kaashoek, M. and Morris, R. Proceedings of 18th ACM Symposium on Operating Systems Principles, October, 2001. |
| 399. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications Stoica, I. and Morris, R. and Karger, D. and Kaashoek, M. F. and Balakrishnan, H. SIGCOMM 2001, San Diego, CA, USA, August, 2001. |
| 400. Security Considerations for Peer-to-Peer Distributed Hash Tables Sit, E. and Morris, R. Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Lecture Notes in Computer Science 2429, 261-269, Springer Verlag, 2002. |
| 401. Comparing the Performance of Distributed Hash Tables Under Churn Li, J. and Stribling, J. and Gil, T. M. and Morris, R. and Kaashoek, M. F. 3rd International Workshop on Peer-to-Peer Systems (IPTPS '04), San Diego, CA, USA, February, 2004. |
| 402. Trust-Preserving Set Operations Ruggero Morselli and Samrat Bhattacharjee and Jonathan Katz and Pete Keleher The 23rd Conference of the IEEE Communications Society (Infocom), March, 2004. |
| 403. Open Shortest Path First (Version 2) Moy, J. RFC 2178, 1997. |
| 404. Group Key Management Protocol (GKMP) Architecture Harney, H. and Muckenhirn, C. Technical Report Request for Comments (Experimental), 2094, Internet Engineering Task Force, July, 1997. Abstract: This document describes an architecture for the management of cryptographic keys for multicast communications. We identify the roles and responsibilities of communications system elements in accomplishing multicast key management, define security and functional requirements of each, and provide a detailed introduction to the Group Key Management Protocol (GKMP) which provides the ability to create and distribute keys within arbitrary-sized groups without the intervention of a global/centralized key manager. |
| 405. Group Key Management Protocol (GKMP) Architecture Harney, H. and Muckenhirn, C. Technical Report Request for Comments (Experimental), 2094, Internet Engineering Task Force, July, 1997. Abstract: This document describes an architecture for the management of cryptographic keys for multicast communications. We identify the roles and responsibilities of communications system elements in accomplishing multicast key management, define security and functional requirements of each, and provide a detailed introduction to the Group Key Management Protocol (GKMP) which provides the ability to create and distribute keys within arbitrary-sized groups without the intervention of a global/centralized key manager. |
| 406. On the Decomposition of Large Communication Networks for Hierarchical Control Implementation Muralidhar, K. and M. Sundareshan, M. IEEE Transactions on Communications, COM-34, 10, 985--987, 1986. |
| 407. Resilient Multicast Support for Continuous-Media Applications Rex Xu, X. and Myers, A.C. and Zhang, H. and Yavatkar, R. Proceedings of NOSSDAV, May, 1997. Abstract: The IP multicast delivery mechanism provides a popular basis for delivery of continuous media to many participants in a conferencing application. However, the best-effort nature of multicast delivery results in poor playback quality in the presence of network congestion and packet loss. Contrary to widespread belief that the real-time nature of continuous media applications precludes the possibility of recovery of lost packets using retransmissions, we have found that these applications offer an interesting tradeoff between the desired playback quality and the desired degree of interactivity. In particular, we propose a new model of multicast delivery called resilient multicast in which each receiver in a multicast group can decide its own tradeoff between reliability and real-time requirements. To be effective, error recovery mechanisms in such a model need to be both fast (due to the real-time constraint) and have a low overhead (due to high volume of continuous media data). We have designed a resilient multicast protocol called STORM (STructure-Oriented Resilient Multicast) in which senders and receivers collaborate to recover from lost packets using two key ideas. First, group participants self-organize themselves into a distribution structure and use the structure to recover lost packets from adjacent nodes. Second, the distribution structure is dynamic and a lightweight algorithm is used to adapt the structure to changing network traffic conditions and group membership. We have implemented STORM in both VAT and a packet level simulator. Experimental results using both the MBONE and a simulation model demonstrate the effectiveness of our approach. |
| 408. Resilient Multicast Support for Continuous-Media Applications Rex Xu, X. and Myers, A.C. and Zhang, H. and Yavatkar, R. Proceedings of NOSSDAV, May, 1997. Abstract: The IP multicast delivery mechanism provides a popular basis for delivery of continuous media to many participants in a conferencing application. However, the best-effort nature of multicast delivery results in poor playback quality in the presence of network congestion and packet loss. Contrary to widespread belief that the real-time nature of continuous media applications precludes the possibility of recovery of lost packets using retransmissions, we have found that these applications offer an interesting tradeoff between the desired playback quality and the desired degree of interactivity. In particular, we propose a new model of multicast delivery called resilient multicast in which each receiver in a multicast group can decide its own tradeoff between reliability and real-time requirements. To be effective, error recovery mechanisms in such a model need to be both fast (due to the real-time constraint) and have a low overhead (due to high volume of continuous media data). We have designed a resilient multicast protocol called STORM (STructure-Oriented Resilient Multicast) in which senders and receivers collaborate to recover from lost packets using two key ideas. First, group participants self-organize themselves into a distribution structure and use the structure to recover lost packets from adjacent nodes. Second, the distribution structure is dynamic and a lightweight algorithm is used to adapt the structure to changing network traffic conditions and group membership. We have implemented STORM in both VAT and a packet level simulator. Experimental results using both the MBONE and a simulation model demonstrate the effectiveness of our approach. |
| 409. Multicast Security: A Taxonomy and Efficient Constructions Canetti, Ran and Garay, Juan and Itkis, Gene and Micciancio, Daniele and Naor, Moni and Pinkas, Benny Proceedings of INFOCOM, March, 1999. Abstract: Multicast communication is becoming the basis for a growing number of applications. It is therefore critical to provide founded security mechanisms for multicast communication. Yet, existing security protocols for multicast offer only very partial solutions. We first present a taxonomy of multicast scenarios on the Internet and point out the relevant security concerns. Next we identify two major security problems of multicast communication: individual authentication, and key revocation. Maintaining authenticity in multicast protocols is a much more complex problem than for unicast; in particular, known solutions are prohibitively inefficient in many cases. We present a solution that is reasonable for a range of scenarios. Our approach can be regarded as a `midpoint' between traditional Message Authentication Codes and digital signatures. We also present an improved and very efficient solution to another prevailing problem for multicast protocols, namely the key revocation problem. |
| 410. Kerberos: An Authentication Service for Computer Networks B. Clifford Neuman and Theodore Ts'o IEEE Communications, 32(9)September, 1994. |
| 411. Collaborative Management of Global Directories in P2P Systems Peery, C. and Cuenca-Acuna, F. M. and Martin, R. P. and Nguyen, T. D. Technical Report DCS-TR-510, November, 2002. |
| 412. Overcast: Reliable Multicasting with an Overlay Network J. Jannotti and D. Gifford and K. Johnson and M. Kaashoek and J. O'Toole Proceedings of the 4th Symposium on Operating Systems Design and Implementation, 2000. |
| 413. A Measurement Study of Peer-to-Peer File Sharing Systems Saroiu, S. and Krishna Gummadi, P. and Gribble, S. D. Proceedings of Multimedia Computing and Networking (MMCN '02), January, 2002. |
| 414. Building low-diameter peer-to-peer networks G. Pandurangan and P. Raghavan and E. Upfal IEEE Journal on Selected Areas in Communications, 21, 995--1002, 2003. |
| 415. Extensible Markup Language (XML) 1.0 T. Bray and J. Paoli and C. Sperberg-McQueen World Wide Web Consortium Recommendation. Available at http://www.w3.org/TR/REC-xml, February, 1998. |
| 416. Distance Vector Multicast Routing Protocol D. Waitzman and C. Partridge and S. Deering RFC 1075, 1998. |
| 417. An error control scheme for large-scale multicast applications C. Papadopoulos, G. Parulkar and G. Varghese Proceedings of Infocom'98, 1998. |
| 418. An error control scheme for large-scale multicast applications C. Papadopoulos, G. Parulkar and G. Varghese Proceedings of Infocom'98, 1998. |
| 419. RMTP: a reliable multicast transport protocol Lin, J.C. and Paul, S. Proceedings of INFOCOM, March, 1996. Abstract: This paper describes the design and implementation of a reliable multicast transport protocol called RMTP. RMTP provides sequenced, lossless delivery of bulk data from one sender to a group of receivers. It allows a receiver to join or leave a group without notifying the sender or other receivers. Protocol state maintained at each multicast participant is independent of the number of participants. The sender knows neither the identity of each receiver nor the number of receivers in the multicast group. RMTP is based on a multi-level hierarchical approach, in which the receivers are grouped into a hierarchy of local regions, with a Designated Receiver (DR) in each local region. Receivers in each local region periodically send acknowledgments (ACKs) to their corresponding DR, DRs send ACKs to the higher-level DRs, until the DRs in the highest level send ACKs to the sender, thereby avoiding the ACK-implosion problem. DRs cache received data and respond to retransmission requests of the receivers in their corresponding local regions, thereby decreasing end-to-end latency. RMTP uses a packet-based selective repeat retransmission scheme for higher throughput. This paper also provides the measurements of RMTP's performance with receivers located at various sites in the Internet. |
| 420. RMTP: a reliable multicast transport protocol Lin, J.C. and Paul, S. Proceedings of INFOCOM, March, 1996. Abstract: This paper describes the design and implementation of a reliable multicast transport protocol called RMTP. RMTP provides sequenced, lossless delivery of bulk data from one sender to a group of receivers. It allows a receiver to join or leave a group without notifying the sender or other receivers. Protocol state maintained at each multicast participant is independent of the number of participants. The sender knows neither the identity of each receiver nor the number of receivers in the multicast group. RMTP is based on a multi-level hierarchical approach, in which the receivers are grouped into a hierarchy of local regions, with a Designated Receiver (DR) in each local region. Receivers in each local region periodically send acknowledgments (ACKs) to their corresponding DR, DRs send ACKs to the higher-level DRs, until the DRs in the highest level send ACKs to the sender, thereby avoiding the ACK-implosion problem. DRs cache received data and respond to retransmission requests of the receivers in their corresponding local regions, thereby decreasing end-to-end latency. RMTP uses a packet-based selective repeat retransmission scheme for higher throughput. This paper also provides the measurements of RMTP's performance with receivers located at various sites in the Internet. |
| 421. Organizing Multicast Receivers Deterministically According to Packet-Loss Correlation Levine, B.N. and Paul, S. and Garcia-Luna-Aceves, J.J. Proc. Sixth ACM International Multimedia Conference (ACM Multimedia 98), September, 1998. |
| 422. Organizing Multicast Receivers Deterministically According to Packet-Loss Correlation Levine, B.N. and Paul, S. and Garcia-Luna-Aceves, J.J. Proc. Sixth ACM International Multimedia Conference (ACM Multimedia 98), September, 1998. |
| 423. Layered Video Multicast with Retransmissions (LVMR): Evaluation of Hierarchical Rate Control Li, X. and Paul, S. and Ammar, M. Proceedings of INFOCOM, March/April, 1998. Abstract: Layered Video Multicast with Retransmissions (LVMR) is a system for distributing video using layered coding over the Internet, The two key contributions of the system are: (1) improving the quality of reception within each layer by retransmitting lost packets given an upper bound on recovery time and applying an adaptive playback point scheme to help achieve more successful retransmission, and (2) adapting to network congestion and heterogeneity using hierarchical rate control mechanism. This paper concentrates on the rate control aspects of LVMR. In contrast to the existing sender-based and receiver-based rate control in which the entire information about network congestion is either available at the sender (in sender-based approach) or replicated at the receivers (in receiver-based approach), the hierarchical rate control mechanism distributes the information between the sender, receivers, and some agents in the network in such a way that each entity maintains only the information relevant to itself. In addition to that, the hierarchical approach enables intelligent decisions to be made in terms of conducting concurrent experiments and choosing one of several possible experiments at any instant of time based on minimal state information at the agents in the network. Protocol details are presented in the paper together with experimental and simulation results to back our claims. |
| 424. Collaborative Management of Global Directories in P2P Systems Peery, C. and Cuenca-Acuna, F. M. and Martin, R. P. and Nguyen, T. D. Technical Report DCS-TR-510, November, 2002. |
| 425. The Darknet and the Future of Content Distribution Biddle, P. and England, P. and Peinado, M. and Willman, B. Proceedings of the 2nd ACM Workshop on Digital Rights Management, Lecture Notes in Computer Science 2696, 155-176, Springer Verlag, 2003. |
| 426. ALMI: An Application Level Multicast Infrastructure D. Pendarakis and S. Shi and D. Verma and M. Waldvogel Proceedings of 3rd Usenix Symposium on Internet Technologies & Systems, March, 2001. |
| 427. Key Management for Secure Internet Multicast using Boolean Function Minimization Techniques Chang, I. and Engel, R. and Kandlur, D. and Pendarakis, D. and Saha, D. Proceedings of Infocom, March, 1999. Abstract: The Internet today provides no support for privacy or authentication of multicast data distribution. However, an increasing number of applications will require secure multicast services in order to restrict group membership and enforce accountability of group members. A major problem associated with the deployment of secure multicast delivery services is the scalability of the key distribution protocol. This is particularly true with regard to the handling of group membership changes, such as member departures and/or expulsions, which necessitate the distribution of a new session key to all the remaining group members. In this paper, we present a new multicast key management scheme which uses a set of auxiliary keys in order to improve scalability. In contrast to previous schemes which generate a fixed hierarchy of keys, we dynamically generate the most suitable key hierarchy by composing different keys. However, our work goes one step further by focusing on the problem of cumulative member removal. Using Boolean function minimization techniques, our scheme outperforms all other schemes known to us in terms of message complexity in removing multiple group members. The efficiency of our scheme in aggregating key updates, due to multiple member departures, offers the potential of a significant performance advantage. The proposed scheme has been used within a toolkit for secure Internet multicast services that we have developed. |
| 428. ALMI: An Application Level Multicast Infrastructure Pendarakis, Dimitris and Shi, Sherlia and Verma, Dinesh and Waldvogel, Marcel 3rd USNIX Symposium on Internet Technologies and Systems (USITS '01), 49--60, March, 2001. Abstract: The IP multicast model allows scalable and efficient multi-party communication, particularly for groups of large size. However, deployment of IP multicast requires substantial infrastructure modifications and is hampered by a host of unresolved open problems. To circumvent this situation, we have designed and implemented ALMI, an application level group communication middleware, which allows accelerated application deployment and simplified network configuration, without the need of network infrastructure support. ALMI is tailored toward support of multicast groups of relatively small size (several 10s of members) with many to many semantics. Session participants are connected via a virtual multicast tree, which consists of unicast connections between end hosts and is formed as a minimum spanning tree (MST) using application-specific performance metric. Using simulation, we show that the performance penalties, introduced by this shift of multicast to end systems, is a relatively small increase in traffic load and that ALMI multicast trees approach the efficiency of IP multicast trees. We have also implemented ALMI as a Java based middleware package and performed experiments over the Internet. Experimental results show that ALMI is able to cope with network dynamics and keep the multicast tree efficient. |
| 429. Escrow Services and Incentives in Peer-to-Peer Networks B. Horne and B. Pinkas and T. Sander Proceedings of the 3rd ACM conference on Electronic Commerce, October, 2001. |
| 430. Multicast Security: A Taxonomy and Efficient Constructions Canetti, Ran and Garay, Juan and Itkis, Gene and Micciancio, Daniele and Naor, Moni and Pinkas, Benny Proceedings of INFOCOM, March, 1999. Abstract: Multicast communication is becoming the basis for a growing number of applications. It is therefore critical to provide founded security mechanisms for multicast communication. Yet, existing security protocols for multicast offer only very partial solutions. We first present a taxonomy of multicast scenarios on the Internet and point out the relevant security concerns. Next we identify two major security problems of multicast communication: individual authentication, and key revocation. Maintaining authenticity in multicast protocols is a much more complex problem than for unicast; in particular, known solutions are prohibitively inefficient in many cases. We present a solution that is reasonable for a range of scenarios. Our approach can be regarded as a `midpoint' between traditional Message Authentication Codes and digital signatures. We also present an improved and very efficient solution to another prevailing problem for multicast protocols, namely the key revocation problem. |
| 431. The VersaKey Framework: Versatile Group Key Management M. Waldvogel and G. Caronni and D. Sun and N. Weiler and B. Plattner IEEE Journal on Selected Areas in Communications, Special Issue on Middleware, 17(9)August, 1999. |
| 432. Accessing Nearby Copies of Replicated Objects in a Distributed Environment C. G. Plaxton and R. Rajaraman and A. W. Richa ACM Symposium on Parallel Algorithms and Architectures, 1997. |
| 433. Accessing Nearby Copies of Replicated Objects in a Distributed Environment Plaxton, C. and Rajaram, R. and Richa, A. Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 311-320, June, 1997. |
| 434. Safe and Private Data Sharing with Turtle: Friends Team-Up and Beat the System Popescu, B. C. and Crispo, B. and Tanenbaum, A. S. 12th International Workshop on Security Protocols, Cambridge, UK, April, 2004. |
| 435. An Efficient Scheme for Query Processing on Peer-to-Peer Networks Prinkey, M. T. 2001. |
| 436. Building low-diameter peer-to-peer networks G. Pandurangan and P. Raghavan and E. Upfal IEEE Journal on Selected Areas in Communications, 21, 995--1002, 2003. |
| 437. Symphony: Distributed Hashing in a Small World Manku, G. S. and Bawa, M. and Raghavan, P. 4th USENIX Symposium on Internet Technologies and Systems, Seattle, WA, USA, March, 2003. |
| 438. Accessing Nearby Copies of Replicated Objects in a Distributed Environment Plaxton, C. and Rajaram, R. and Richa, A. Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 311-320, June, 1997. |
| 439. Accessing Nearby Copies of Replicated Objects in a Distributed Environment C. G. Plaxton and R. Rajaraman and A. W. Richa ACM Symposium on Parallel Algorithms and Architectures, 1997. |
| 440. Hierarchically organzied, Multi-hop Mobile Wireless Networks for Quality-of-Service Support Ramanathan, R. and Steenstrup, M. Mobile Networks and Applications, 3(1)June, 1998. |
| 441. Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays Ramasubramanian, V. and Sirer, E. G. Symposium on Networked System Design and Implementation, San Francisco, CA, USA, March, 2004. |
| 442. A Case for End System Multicast Y.-H. Chu and S. G. Rao and H. Zhang Proceedings of ACM SIGMETRICS, June, 2000. |
| 443. Enabling Conferencing Applications on the Internet using an Overlay Multicast Architecture Y.-H. Chu and S. G. Rao and S. Seshan and H. Zhang Proceedings of ACM SIGCOMM, August, 2001. |
| 444. A Scalable Content Addressable Network Sylvia Ratnasamy and Paul Francis and Mark Handley and Richard Karp and Scott Shenker In Proceedings of the ACM SIGCOMM 2001 Technical Conference, 2001. |
| 445. Making gnutella-like P2P systems scalable Yatin Chawathe and Sylvia Ratnasamy and Lee Breslau and Nick Lanham and Scott Shenker Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, 407--418, ACM Press, 2003. |
| 446. Range Queries over DHTs Sylvia Ratnasamy and Joseph M. Hellerstein and Scott Shenker Technical Report IRB-TR-03-009, Intel Research, June, 2003. |
| 447. Application-level Multicast using Content-Addressable Networks Ratnasamy, S. and Handley, M. and Karp, R. and Shenker, S. Proceedings of 3rd International Workshop on Networked Group Communications, November, 2001. |
| 448. A Scalable Content-Addressable Network Ratnasamy, S. and Francis, P. and Handley, M. and Karp, R. and Shenker, S. SIGCOMM 2001, San Diego, CA, USA, August, 2001. |
| 449. Can Heterogeneity Make Gnutella Scalable? Lv, Q. and Ratnasamy, S. and Shenker, S. Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Lecture Notes in Computer Science 2429, 94-103, Springer Verlag, 2002. |
| 450. The Impact of DHT Routing Geometry on Resilience and Proximity Gummadi, K. P. and Gummadi, R. and Gribble, S. D. and Ratnasamy, S. and Shenker, S. and Stoica, I. SIGCOMM 2003, Karlsruhe, Germany, August, 2003. |
| 451. Making Gnutella-like P2P Systems Scalable Chawathe, Y. and Ratnasamy, S. and Breslau, L. and Lanham, N. and Shenker, S. Proceedings of SIGCOMM, August, 2003. |
| 452. On the Placement of Internet Instrumentation Jamin, S. and Jin, C. and Jin, Y. and Raz, D. and Shavitt, Y. and Zhang, L. Proceedings of Infocom'00, March, 2000. |
| 453. Fault Isolation in Multicast Trees Reddy, A. and Govindan, R. and Estrin, D. Proceedings of SIGCOMM, August, 2000. |
| 454. Fault Isolation in Multicast Trees Reddy, A. and Govindan, R. and Estrin, D. Computer Communications Review, August, 2000. Note: Proceedings of ACM SIGCOMM'00. |
| 455. End-To-End Arguments in System Design H. Saltzer and D. P. Reed and D. Clark ACM Transactions on Computing Systems, 2(4)1984. |
| 456. Towards a Better Understanding of Churn in Peer-to-Peer Networks Stutzbach, D. and Rejaie, R. Technical Report UO-CIS-TR-04-06, Department of Computer Science, University of Oregon, November, 2004. |
| 457. Efficient Content Distribution in Semi-Decentralized Peer-to-Peer-Networks Strufe, T. and Reschke, D. Proceedings of the 8th International Netties Conference, 33-38, 2002. |
| 458. OceanStore: An Architecture for Global-Scale Persistent Storage John Kubiatowicz and David Bindel and Yan Chen and Steven Czerwinski and Patrick Eaton and Dennis Geels and Ramakrishna Gummadi and Sean Rhea and Hakim Weatherspoon and Westley Weimer and Chris Wells and Ben Zhao. Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), 2000. |
| 459. Tapestry: A Resilient Global-scale Overlay for Service Deployment Ben Y. Zhao and Ling Huang and Jeremy Stribling and Sean C. Rhea and Anthony D. Joseph and John D. Kubiatowicz IEEE Journal on Selected Areas in Communications, 22(1)January, 2004. |
| 460. Tapestry: A Resilient Global-scale Overlay for Service Deployment Ben Y. Zhao and Ling Huang and Jeremy Stribling and Sean C. Rhea and Anthony D. Joseph and John D. Kubiatowicz IEEE Journal on Selected Areas in Communications, 22(1)January, 2004. |
| 461. Accessing Nearby Copies of Replicated Objects in a Distributed Environment C. G. Plaxton and R. Rajaraman and A. W. Richa ACM Symposium on Parallel Algorithms and Architectures, 1997. |
| 462. Accessing Nearby Copies of Replicated Objects in a Distributed Environment Plaxton, C. and Rajaram, R. and Richa, A. Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 311-320, June, 1997. |
| 463. Routing and Data Location in Overlay Peer-to-Peer Networks Roberto Rinaldi and Marcel Waldvogel Technical Report Research Report, RZ--3433, IBM, July, 2002. Abstract: Peer-to-peer overlay networks offer a novel platform for a variety of scalable and decentralized distributed applications. Systems known as Distributed Hash Tables provide efficient and fault- tolerant routing, object location and load balancing within a self- organizing overlay network. The alternative solution we propose is an overlay location and routing infrastructure that efficiently uses minimal local information to achieve global routing. The main novelty of our approach consists in fitting the overlay network in a hyper- toroidal space and building it with locality awareness. Thanks to this specific network construction phase, forwarding decisions always take into account locality preservation in an implicit manner, leading to significant improvements in end-to-end delays and path lengths. With this overlay network it is possible to obtain global routing by adding minimal information to each single host and by making only local forwarding decisions. Our analysis shows how the average path length coming from the overlay routing is close to the optimal average path length of the underlaying network: on average, they only differ by a factor of 2. Furthermore, locality preservation has a significant impact on the end-to-end latency of the routing process as well. Such a system can be viewed as novel in the field of peer-to- peer data location and addressing, allowing the development of new applications in a real low-latency environment. |
| 464. Efficient Topology-Aware Overlay Network Marcel Waldvogel and Roberto Rinaldi Proceedings of HotNets-I, October, 2002. Abstract: Peer-to-peer (P2P) networking has become a household word in the past few years, being marketed as a work-around for server scalability problems and ``wonder drug'' to achieve resilience. Current widely-used P2P networks rely on central directory servers or massive message flooding, clearly not scalable solutions. Distributed Hash Tables (DHT) are expected to eliminate flooding and central servers, but can require many long-haul message deliveries. We introduce Mithos, an content-addressable overlay network that only uses minimal routing information and is directly suitable as an underlay network for P2P systems, both using traditional and DHT addressing. Unlike other schemes, it also efficiently provides locality-aware connectivity, thereby ensuring that a message reaches its destination with minimal overhead. Mithos provides for highly efficient forwarding, making it suitable for use in high-throughput applications. Paired with its ability to have addresses directly mapped into a subspace of the IPv6 address space, it provides a potential candidate for native deployment. Additionally, Mithos can be used to support third-party triangulation to quickly select a close-by replica of data or services. |
| 465. Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design Ripeanu, M. and Foster, I. and Iamnitchi, A. IEEE Internet Computing, 6(1)2002. |
| 466. OPUS: An Overlay Utility Service Rebecca Braynard and Dejan Kostic and Adolfo Rodriguez and Jeff Chase and Amin Vahdat Poster at 18th ACM Symposium on Operating System Principles, October, 2001. |
| 467. Query Routing for the Gnutella Network Rohrs, C. May, 2002. |
| 468. Analysis of Parallel Downloading for Large File Distribution Koo, Simon G. M. and Rosenberg, Catherine and Xu, Dongyan Proceedings of the 9th IEEE International Workshop on Future Trends of Distributed Computing Systems (FTDCS 2003), 128--135, May, 2003. |
| 469. WASRV Architectural Principles Rosenberg, J. and Schulzrinne, H. and Guttman, E. and Moats, R. Technical Report Internet Draft, Internet Engineering Task Force, February, 1998. Abstract: This document defines the problem of wide area service location, describing its key attributes, and giving examples of location prob- lems which do or do not fall under its definition. It also touches on a number of related protocols, and looks at how they fit, or do not fit, the problem of wide area service location. Note: Work in progress |
| 470. Design and Evaluation of a Wide-Area Event Notification Service Antonio Carzaniga and David S. Rosenblum and Alexander L Wolf ACM Transactions on Computer Systems, 19(3):332--383, August, 2001. |
| 471. Pollution in P2P File Sharing Systems Liang, J. and Kumar, R. and Xi, Y. and Ross, K. IEEE Infocom, Miami, FL, USA, March, 2005. |
| 472. Dynamic Distance Maps of the Internet W. Theilmann and K. Rothermel Proceedings of Infocom, March, 2000. |
| 473. Dynamic Distance Maps of the Internet W. Theilmann and K. Rothermel Proceedings of Infocom, March, 2000. |
| 474. Probabilistic Knowledge Discovery and Management for P2P Networks Tsoumakos, D. and Roussopolous, N. P2P Journal, 15-20, November, 2003. |
| 475. Incentive-Based Propagation of Metadata Updates in Peer-to-Peer Networks Roussopoulos, M. and Baker, M. P2P Journal, 1-6, September, 2003. |
| 476. CUP: Controlled Update Propagation in Peer-to-Peer Networks Roussopoulos, M. and Baker, M. USENIX Annual Technical Conference, San Antonio, TX, USA, June, 2003. |
| 477. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility Antony Rowstran and Peter Druschel Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP'01), 2001. |
| 478. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems Antony Rowstran and Peter Druschel Proceedings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware 2001), 2001. |
| 479. Security for structured peer-to-peer overlay networks Miguel Castro and Peter Druschel and Ayalvadi Ganesh and Antony Rowstron and Dan S. Wallach Proceedings of the Fifth Symposium on Operating Systems Design and Implementation (OSDI'02), 2002. |
| 480. Secure Routing for Structured Peer-to-Peer Overlay Networks Miguel Castro and Peter Druschel and Ayalvadi J. Ganesh and Antony I. T. Rowstron and Dan S. Wallach Proceedings of OSDI, 2002. |
| 481. Secure Routing for Structured Peer-to-Peer Overlay Networks Miguel Castro and Peter Druschel and Ayalvadi J. Ganesh and Antony I. T. Rowstron and Dan S. Wallach Proceedings of OSDI, 2002. |
| 482. Pastry: Scalable Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems Druschel, P. and Rowstron, A. 18th IFIP/ACM Conference on Distributed Systems Platforms (Middleware 2001), Heidelberg, Germany, November, 2001. |
| 483. Security for Structured Peer-to-Peer Overlay Networks Castro, M. and Druschel, P. and Ganesh, A. and Rowstron, A. and Wallach, D. S. 5th Symposium on Operating Systems Design and Implementation, Boston, MA, USA, December, 2002. |
| 484. Topology-Aware Routing in Structured Peer-to-Peer Overlay Networks Castro, M. and Druschel, P. and Hu, Y. C. and Rowstron, A. Technical Report MSR-TR-2002-82, Microsoft Research, 2002. |
| 485. Proximity Neighbor Selection in Tree-Based Structured Peer-to-Peer Overlays Castro, M. and Druschel, P. and Hu, Y. C. and Rowstron, A. Technical Report MSR-TR-2003-52, Microsoft Research, 2003. |
| 486. Real-Time Reliable Multicast Using Proactive Forward Error Correction Dan Rubenstein and Jim Kurose and Don Towsley Proceedings of NOSSDAV, 279--293, U. Mass, Amherst, July, 1998. Abstract: Real-Time reliable multicast over a best-effort service network remains a challenging research problem. Most protocols for reliable multicast use repair techniques that result in significant and variable delay, which can lead to missed deadlines in real-time scenarios. In this paper we present a repair technique that combines forward error correction (FEC) with automatic repeat request (ARQ). The novel aspect of the technique is its ability to reduce delay in reliable multicast delivery by sending repairs proactively (i.e., before they are required). The technique requires minimal state at senders and receivers, and no additional active router functionality beyond what is required by the current multicast service model. Furthermore, the technique uses only end-to-end mechanisms, where all data and repairs are transmitted by the data-originating source, leaving receivers free from any burden of sending repairs. We simulate a simple round-based version of a protocol embodying this technique to show its effectiveness in preventing repair request implosion, reducing the expected time of reliable delivery of data, and keeping bandwidth usage for repairs low. We show how a protocol using the technique can be adapted to provide delivery that is reliable before a real-time deadline with probability extremely close to one. Finally, we develop several variations of the protocol that use the technique in various fashions for high rate data streaming applications, and present results from additional simulations that examine performance in a variety of Internet-like heterogeneous networks. |
| 487. Detecting Shared Congestion of Flows Via End-to-end Measurement Dan Rubenstein and Jim Kurose and Don Towsley Proceedings of Sigmetrics, June, 2000. Abstract: Current Internet congestion control protocols operate independently on a per-flow basis. Recent work has demonstrated that cooperative congestion control strategies between flows can improve performance for a variety of applications, ranging from aggregated TCP transmissions to multiple-sender multicast applications. However, in order for this cooperation to be effective, one must first identify the flows that are congested at the same set of resources. In this paper, we present techniques based on loss or delay observations at end-hosts to infer whether or not two flows experiencing congestion are congested at the same network resources. We validate these techniques via queueing analysis, simulation, and experimentation within the Internet. |
| 488. Publius: A robust, tamper-evident, censorship-resistant, web publishing system Marc Waldman and Aviel D. Rubin and Lorrie Faith Cranor Proc. 9th USENIX Security Symposium, 59--72, August, 2000. |
| 489. Key Management for Secure Internet Multicast using Boolean Function Minimization Techniques Chang, I. and Engel, R. and Kandlur, D. and Pendarakis, D. and Saha, D. Proceedings of Infocom, March, 1999. Abstract: The Internet today provides no support for privacy or authentication of multicast data distribution. However, an increasing number of applications will require secure multicast services in order to restrict group membership and enforce accountability of group members. A major problem associated with the deployment of secure multicast delivery services is the scalability of the key distribution protocol. This is particularly true with regard to the handling of group membership changes, such as member departures and/or expulsions, which necessitate the distribution of a new session key to all the remaining group members. In this paper, we present a new multicast key management scheme which uses a set of auxiliary keys in order to improve scalability. In contrast to previous schemes which generate a fixed hierarchy of keys, we dynamically generate the most suitable key hierarchy by composing different keys. However, our work goes one step further by focusing on the problem of cumulative member removal. Using Boolean function minimization techniques, our scheme outperforms all other schemes known to us in terms of message complexity in removing multiple group members. The efficiency of our scheme in aggregating key updates, due to multiple member departures, offers the potential of a significant performance advantage. The proposed scheme has been used within a toolkit for secure Internet multicast services that we have developed. |
| 490. Choosing a Random Peer King, V. and Saia, J. Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, 125-130, July, 2004. |
| 491. End-To-End Arguments in System Design H. Saltzer and D. P. Reed and D. Clark ACM Transactions on Computing Systems, 2(4)1984. |
| 492. Routing in the Dark: Scalable Searches in Dark P2P Networks Clarke, I. and Sandberg, O. DefCon 13, Las Vegas, NV, USA, July, 2005. |
| 493. Escrow Services and Incentives in Peer-to-Peer Networks B. Horne and B. Pinkas and T. Sander Proceedings of the 3rd ACM conference on Electronic Commerce, October, 2001. |
| 494. A Measurement Study of Peer-to-Peer File Sharing Systems Saroiu, S. and Krishna Gummadi, P. and Gribble, S. D. Proceedings of Multimedia Computing and Networking (MMCN '02), January, 2002. |
| 495. Skipnet: A Scalable Overlay Network with Practical Locality Properties Harvey, N. J. A. and Jones, M. B. and Saroiu, S. and Theimer, M. and Wolman, A. 4th USENIX Symposium on Internet Technologies and Systems, Seattle, WA, USA, March, 2003. |
| 496. Detour: A Case for Informed Internet Routing and Transport S. Savage and T. Anderson and A. Aggarwal and D. Becker and N. Cardwell and A. Collin s and E. Hoffman and J. Snell and A. Vahdat and G. Voelker and J. Zahorjan IEEE Micro, 1999. |
| 497. WASRV Architectural Principles Rosenberg, J. and Schulzrinne, H. and Guttman, E. and Moats, R. Technical Report Internet Draft, Internet Engineering Task Force, February, 1998. Abstract: This document defines the problem of wide area service location, describing its key attributes, and giving examples of location prob- lems which do or do not fall under its definition. It also touches on a number of related protocols, and looks at how they fit, or do not fit, the problem of wide area service location. Note: Work in progress |
| 498. The design and implementation of an intentional naming system William Adjie-Winoto and Elliot Schwartz and Hari Balakrishnan and Jeremy Lilley Symposium on Operating Systems Principles, 186-201, 1999. |
| 499. Self-Organization in Peer-to-Peer Systems Ledlie, J. and Taylor, J. and Serban, L. and Seltzer, M. 10th ACM SIGOPS European Workshop, Saint-Emilion, France, September, 2002. |
| 500. Self-Organization in Peer-to-Peer Systems Ledlie, J. and Taylor, J. and Serban, L. and Seltzer, M. 10th ACM SIGOPS European Workshop, Saint-Emilion, France, September, 2002. |
| 501. Enabling Conferencing Applications on the Internet using an Overlay Multicast Architecture Y.-H. Chu and S. G. Rao and S. Seshan and H. Zhang Proceedings of ACM SIGCOMM, August, 2001. |
| 502. A Network Measurement Architecture for Adaptive Applications Stemm, Mark and Seshan, Srinivasan and Katz, Randy H. Proceedings of INFOCOM, March, 2000. |
| 503. Skip Graphs Aspnes, J. and Shah, G. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, January, 2003. |
| 504. Finding Close Friends over the Internet Narendar Shankar and Christopher Komareddy and Bobby Bhattacharjee Proceedings of International Conference on Network Protocols, November, 2001. |
| 505. Finding Close Friends on the Internet Kommareddy, C. and Shankar, N. and Bhattacharjee, B. Proceedings of ICNP, November, 2001. |
| 506. Protocol Independent Multicast-Sparse Mode, RFC 2117 D. Estrin and D. Farinacci and A. Helmy and D. Thaler and S. Deering and M. Handley and V. Jacobson and C. Liu and P. Sharma Technical Report IETF, 1997. |
| 507. Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification D. Estrin and D. Farinacci and A. Helmy and D. Thaler and S. Deering and M. Handley and V. Jacobson and C. Liu and P. Sharma RFC 2362, IETF, 1998. |
| 508. On the Placement of Internet Instrumentation Jamin, S. and Jin, C. and Jin, Y. and Raz, D. and Shavitt, Y. and Zhang, L. Proceedings of Infocom'00, March, 2000. |
| 509. A Scalable Content Addressable Network Sylvia Ratnasamy and Paul Francis and Mark Handley and Richard Karp and Scott Shenker In Proceedings of the ACM SIGCOMM 2001 Technical Conference, 2001. |
| 510. Making gnutella-like P2P systems scalable Yatin Chawathe and Sylvia Ratnasamy and Lee Breslau and Nick Lanham and Scott Shenker Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, 407--418, ACM Press, 2003. |
| 511. Range Queries over DHTs Sylvia Ratnasamy and Joseph M. Hellerstein and Scott Shenker Technical Report IRB-TR-03-009, Intel Research, June, 2003. |
| 512. Application-level Multicast using Content-Addressable Networks Ratnasamy, S. and Handley, M. and Karp, R. and Shenker, S. Proceedings of 3rd International Workshop on Networked Group Communications, November, 2001. |
| 513. A Scalable Content-Addressable Network Ratnasamy, S. and Francis, P. and Handley, M. and Karp, R. and Shenker, S. SIGCOMM 2001, San Diego, CA, USA, August, 2001. |
| 514. Search and Replication in Unstructured Peer-to-Peer Networks Lv, Q. and Cao, P. and Cohen, E. and Li, K. and Shenker, S. 16th International Conference on Supercomputing, New York, NY, USA, June, 2002. |
| 515. Can Heterogeneity Make Gnutella Scalable? Lv, Q. and Ratnasamy, S. and Shenker, S. Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Lecture Notes in Computer Science 2429, 94-103, Springer Verlag, 2002. |
| 516. The Impact of DHT Routing Geometry on Resilience and Proximity Gummadi, K. P. and Gummadi, R. and Gribble, S. D. and Ratnasamy, S. and Shenker, S. and Stoica, I. SIGCOMM 2003, Karlsruhe, Germany, August, 2003. |
| 517. Making Gnutella-like P2P Systems Scalable Chawathe, Y. and Ratnasamy, S. and Breslau, L. and Lanham, N. and Shenker, S. Proceedings of SIGCOMM, August, 2003. |
| 518. Cooperative peer groups in NICE Seungjoon Lee and Rob Sherwood and Bobby Bhattacharjee Proceedings of INFOCOM, 2003. |
| 519. Slurpie: A Cooperative Bulk Data Transfer Protocol Rob Sherwood and Ryan Braud and Bobby Bhattacharjee Proceedings of IEEE INFOCOM, 2004. |
| 520. ALMI: An Application Level Multicast Infrastructure D. Pendarakis and S. Shi and D. Verma and M. Waldvogel Proceedings of 3rd Usenix Symposium on Internet Technologies & Systems, March, 2001. |
| 521. ALMI: An Application Level Multicast Infrastructure Pendarakis, Dimitris and Shi, Sherlia and Verma, Dinesh and Waldvogel, Marcel 3rd USNIX Symposium on Internet Technologies and Systems (USITS '01), 49--60, March, 2001. Abstract: The IP multicast model allows scalable and efficient multi-party communication, particularly for groups of large size. However, deployment of IP multicast requires substantial infrastructure modifications and is hampered by a host of unresolved open problems. To circumvent this situation, we have designed and implemented ALMI, an application level group communication middleware, which allows accelerated application deployment and simplified network configuration, without the need of network infrastructure support. ALMI is tailored toward support of multicast groups of relatively small size (several 10s of members) with many to many semantics. Session participants are connected via a virtual multicast tree, which consists of unicast connections between end hosts and is formed as a minimum spanning tree (MST) using application-specific performance metric. Using simulation, we show that the performance penalties, introduced by this shift of multicast to end systems, is a relatively small increase in traffic load and that ALMI multicast trees approach the efficiency of IP multicast trees. We have also implemented ALMI as a Java based middleware package and performed experiments over the Internet. Experimental results show that ALMI is able to cope with network dynamics and keep the multicast tree efficient. |
| 522. Design of the TerraDir Distributed Directory Bobby Bhattacharjee and Pete Keleher and Bujor Silaghi Technical Report CS-TR-4163, University of Maryland at College Park, 2001. |
| 523. Routing in the TerraDir Directory Service Bujor Silaghi and Bobby Bhattacharjee and Pete Keleher Proceedings of SPIE ITCOM, 2002. |
| 524. Are Virtualized Overlay Networks Too Much of a Good Thing? Pete Keleher and Samrat Bhattacharjee and Bujor Silaghi The 1st International Workshop on Peer-to-Peer Systems (IPTPS'02), 2002. |
| 525. Efficient Peer-To-Peer Searches Using Result-Caching Bobby Bhattacharjee and Sudarshan Chawathe and Vijay Gopalakrishnan and Pete Keleher and Bujor Silaghi The 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03), February, 2003. |
| 526. Hierarchical Routing with Soft-State Replicas in TerraDir Bujor Silaghi and Vijay Gopalakrishnan and Bobby Bhattacharjee and Pete Keleher The 18th International Parallel and Distributed Processing Symposium, April, 2004. |
| 527. Adaptive Replication in Peer-to-Peer Systems Vijay Gopalakrishnan and Bujor Silaghi and Bobby Bhattacharjee and Pete Keleher The 24th International Conference on Distributed Computing Systems, March, 2004. |
| 528. A Social Mechanism of Reputation Management in Electronic Communities Bin Yu and Munindar P. Singh Proceedings of Fourth International Workshop on Cooperative Information Agents, 2000. |
| 529. Beehive: O(1) Lookup Performance for Power-Law Query Distributions in Peer-to-Peer Overlays Ramasubramanian, V. and Sirer, E. G. Symposium on Networked System Design and Implementation, San Francisco, CA, USA, March, 2004. |
| 530. Security Considerations for Peer-to-Peer Distributed Hash Tables Sit, E. and Morris, R. Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Lecture Notes in Computer Science 2429, 261-269, Springer Verlag, 2002. |
| 531. Detour: A Case for Informed Internet Routing and Transport S. Savage and T. Anderson and A. Aggarwal and D. Becker and N. Cardwell and A. Collin s and E. Hoffman and J. Snell and A. Vahdat and G. Voelker and J. Zahorjan IEEE Micro, 1999. |
| 532. A Lower Bound for Multicast Key Distribution J. Snoeyink and S. Suri and G. Varghese IEEE Infocom, April, 2001. |
| 533. PGM Reliable Transport Protocol Speakman, T. and others Technical Report draft-speakman-pgm-spec-04 txt, Internet Draft, Internet Engineering Task Force, April, 2000. Abstract: Pragmatic General Multicast (PGM) is a reliable multicast transport pro- tocol for applications that require ordered or unordered, duplicate- free, multicast data delivery from multiple sources to multiple receivers. PGM guarantees that a receiver in the group either receives all data packets from transmissions and repairs, or is able to detect unrecoverable data packet loss. PGM is specifically intended as a work- able solution for multicast applications with basic reliability require- ments. Its central design goal is simplicity of operation with due regard for scalability and network efficiency. Note: Work in progress |
| 534. Generic Router Assist (GRA) Building Block Motivation and Architecture Cain, B. and Speakman, T. and Towsley, D. Technical Report Internet Draft, Internet Engineering Task Force, March, 2000. Note: Work in progress. |
| 535. Extensible Markup Language (XML) 1.0 T. Bray and J. Paoli and C. Sperberg-McQueen World Wide Web Consortium Recommendation. Available at http://www.w3.org/TR/REC-xml, February, 1998. |
| 536. Resilient Multicast using Overlays Suman Banerjee and Seungjoon Lee and Bobby Bhattacharjee and Aravind Srinivasan Proceedings of ACM SIGMETRICS, 2003. |
| 537. The Popularity of Gnutella Queries and its Implications on Scalability Sripanidkulchai, K. February, 2001. |
| 538. Algorithmic design of the Globe wide-area location service Maarten van Steen and Franz J. Hauck and Gerco Ballintijn and Andrew S. Tanenbaum The Computer Journal, 41(5):297--310, 1998. |
| 539. Globe: A Wide-Area Distributed System Maarten van Steen and Philip Homburg and Andrew S. Tanenbaum IEEE Concurrency, 7(1):70--78, jan-mar, 1999. |
| 540. Hierarchically organzied, Multi-hop Mobile Wireless Networks for Quality-of-Service Support Ramanathan, R. and Steenstrup, M. Mobile Networks and Applications, 3(1)June, 1998. |
| 541. A Network Measurement Architecture for Adaptive Applications Stemm, Mark and Seshan, Srinivasan and Katz, Randy H. Proceedings of INFOCOM, March, 2000. |
| 542. Directions in Active Networks K. Calvert and S. Bhattacharjee and E. Zegura and J. Sterbenz IEEE Communications Magazine, 1998. |
| 543. Wide-area cooperative storage with CFS Frank Dabek and M. Frans Kaashoek and David Karger and Robert Morris and Ion Stoica Proceedings of the 18th ACM Symposium on Operating Systems Principles (SOSP '01), October, 2001. |
| 544. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications Stoica, I. and Morris, R. and Karger, D. and Kaashoek, M. F. and Balakrishnan, H. SIGCOMM 2001, San Diego, CA, USA, August, 2001. |
| 545. The Impact of DHT Routing Geometry on Resilience and Proximity Gummadi, K. P. and Gummadi, R. and Gribble, S. D. and Ratnasamy, S. and Shenker, S. and Stoica, I. SIGCOMM 2003, Karlsruhe, Germany, August, 2003. |
| 546. Tapestry: A Resilient Global-scale Overlay for Service Deployment Ben Y. Zhao and Ling Huang and Jeremy Stribling and Sean C. Rhea and Anthony D. Joseph and John D. Kubiatowicz IEEE Journal on Selected Areas in Communications, 22(1)January, 2004. |
| 547. Comparing the Performance of Distributed Hash Tables Under Churn Li, J. and Stribling, J. and Gil, T. M. and Morris, R. and Kaashoek, M. F. 3rd International Workshop on Peer-to-Peer Systems (IPTPS '04), San Diego, CA, USA, February, 2004. |
| 548. Efficient Content Distribution in Semi-Decentralized Peer-to-Peer-Networks Strufe, T. and Reschke, D. Proceedings of the 8th International Netties Conference, 33-38, 2002. |
| 549. Secure Distributed Computing in a Commercial Environment P. Golle and S. Stubblebine Financial Cryptography, 2001. |
| 550. Towards a Better Understanding of Churn in Peer-to-Peer Networks Stutzbach, D. and Rejaie, R. Technical Report UO-CIS-TR-04-06, Department of Computer Science, University of Oregon, November, 2004. |
| 551. The VersaKey Framework: Versatile Group Key Management M. Waldvogel and G. Caronni and D. Sun and N. Weiler and B. Plattner IEEE Journal on Selected Areas in Communications, Special Issue on Middleware, 17(9)August, 1999. |
| 552. A Lower Bound for Multicast Key Distribution J. Snoeyink and S. Suri and G. Varghese IEEE Infocom, April, 2001. |
| 553. Resource Description Framework (RDF) Model and Syntax Specification O. Lassila and R. Swick W3C Proposed Recommendation, January, 1999. Note: Available at http://www.w3.org/TR/PR-rdf-syntax. |
| 554. Algorithmic design of the Globe wide-area location service Maarten van Steen and Franz J. Hauck and Gerco Ballintijn and Andrew S. Tanenbaum The Computer Journal, 41(5):297--310, 1998. |
| 555. Globe: A Wide-Area Distributed System Maarten van Steen and Philip Homburg and Andrew S. Tanenbaum IEEE Concurrency, 7(1):70--78, jan-mar, 1999. |
| 556. Safe and Private Data Sharing with Turtle: Friends Team-Up and Beat the System Popescu, B. C. and Crispo, B. and Tanenbaum, A. S. 12th International Workshop on Security Protocols, Cambridge, UK, April, 2004. |
| 557. Heuristics for Internet Map Discovery R. Govindan and H. Tangmunarunkit Proceedings of Infocom, March, 2000. |
| 558. Heuristics for Internet Map Discovery R. Govindan and H. Tangmunarunkit Proceedings of Infocom, March, 2000. |
| 559. Self-Organization in Peer-to-Peer Systems Ledlie, J. and Taylor, J. and Serban, L. and Seltzer, M. 10th ACM SIGOPS European Workshop, Saint-Emilion, France, September, 2002. |
| 560. The Download Mesh Bollaert, M. and Thadani, S. and Mickish, A. Note: Gnutella Developers' Forum, http://www.the-gdf.org/. |
| 561. Protocol Independent Multicast-Sparse Mode, RFC 2117 D. Estrin and D. Farinacci and A. Helmy and D. Thaler and S. Deering and M. Handley and V. Jacobson and C. Liu and P. Sharma Technical Report IETF, 1997. |
| 562. Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification D. Estrin and D. Farinacci and A. Helmy and D. Thaler and S. Deering and M. Handley and V. Jacobson and C. Liu and P. Sharma RFC 2362, IETF, 1998. |
| 563. Dynamic Distance Maps of the Internet W. Theilmann and K. Rothermel Proceedings of Infocom, March, 2000. |
| 564. Dynamic Distance Maps of the Internet W. Theilmann and K. Rothermel Proceedings of Infocom, March, 2000. |
| 565. Skipnet: A Scalable Overlay Network with Practical Locality Properties Harvey, N. J. A. and Jones, M. B. and Saroiu, S. and Theimer, M. and Wolman, A. 4th USENIX Symposium on Internet Technologies and Systems, Seattle, WA, USA, March, 2003. |
| 566. Dynamic Internet Overlay Deployment and Management Using the X-Bone Joe Touch Proceedings of Internet Conference on Network Protocols, November, 2000. |
| 567. Real-Time Reliable Multicast Using Proactive Forward Error Correction Dan Rubenstein and Jim Kurose and Don Towsley Proceedings of NOSSDAV, 279--293, U. Mass, Amherst, July, 1998. Abstract: Real-Time reliable multicast over a best-effort service network remains a challenging research problem. Most protocols for reliable multicast use repair techniques that result in significant and variable delay, which can lead to missed deadlines in real-time scenarios. In this paper we present a repair technique that combines forward error correction (FEC) with automatic repeat request (ARQ). The novel aspect of the technique is its ability to reduce delay in reliable multicast delivery by sending repairs proactively (i.e., before they are required). The technique requires minimal state at senders and receivers, and no additional active router functionality beyond what is required by the current multicast service model. Furthermore, the technique uses only end-to-end mechanisms, where all data and repairs are transmitted by the data-originating source, leaving receivers free from any burden of sending repairs. We simulate a simple round-based version of a protocol embodying this technique to show its effectiveness in preventing repair request implosion, reducing the expected time of reliable delivery of data, and keeping bandwidth usage for repairs low. We show how a protocol using the technique can be adapted to provide delivery that is reliable before a real-time deadline with probability extremely close to one. Finally, we develop several variations of the protocol that use the technique in various fashions for high rate data streaming applications, and present results from additional simulations that examine performance in a variety of Internet-like heterogeneous networks. |
| 568. Detecting Shared Congestion of Flows Via End-to-end Measurement Dan Rubenstein and Jim Kurose and Don Towsley Proceedings of Sigmetrics, June, 2000. Abstract: Current Internet congestion control protocols operate independently on a per-flow basis. Recent work has demonstrated that cooperative congestion control strategies between flows can improve performance for a variety of applications, ranging from aggregated TCP transmissions to multiple-sender multicast applications. However, in order for this cooperation to be effective, one must first identify the flows that are congested at the same set of resources. In this paper, we present techniques based on loss or delay observations at end-hosts to infer whether or not two flows experiencing congestion are congested at the same network resources. We validate these techniques via queueing analysis, simulation, and experimentation within the Internet. |
| 569. Scalable Reliable Multicast Using Multiple Multicast Channels Kasera, S. and Towsley, D. and Kurose, J. Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems (Sigmetrics '97), June, 1997. |
| 570. Scalable Reliable Multicast Using Multiple Multicast Channels Kasera, S. and Towsley, D. and Kurose, J. Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems (Sigmetrics '97), June, 1997. |
| 571. A Comparison of Server-Based and Receiver-Based Local Recovery Approaches for Scalable Reliable Multicast Kasera, S. and Kurose, J. and Towsley, D. Proceedings of Infocom, April, 1998. |
| 572. A Comparison of Server-Based and Receiver-Based Local Recovery Approaches for Scalable Reliable Multicast Kasera, S. and Kurose, J. and Towsley, D. Proceedings of Infocom, April, 1998. |
| 573. Generic Router Assist (GRA) Building Block Motivation and Architecture Cain, B. and Speakman, T. and Towsley, D. Technical Report Internet Draft, Internet Engineering Task Force, March, 2000. Note: Work in progress. |
| 574. Kerberos: An Authentication Service for Computer Networks B. Clifford Neuman and Theodore Ts'o IEEE Communications, 32(9)September, 1994. |
| 575. Probabilistic Knowledge Discovery and Management for P2P Networks Tsoumakos, D. and Roussopolous, N. P2P Journal, 15-20, November, 2003. |
| 576. Security Udell, J. and Asthagiri, N. and Tuvell, W. Peer-to-Peer: Harnessing the Power of Disruptive Technologies, 354-380, Editor(s): Oram, A., O'Reilly, 2001. |
| 577. Security Udell, J. and Asthagiri, N. and Tuvell, W. Peer-to-Peer: Harnessing the Power of Disruptive Technologies, 354-380, Editor(s): Oram, A., O'Reilly, 2001. |
| 578. Building low-diameter peer-to-peer networks G. Pandurangan and P. Raghavan and E. Upfal IEEE Journal on Selected Areas in Communications, 21, 995--1002, 2003. |
| 579. Detour: A Case for Informed Internet Routing and Transport S. Savage and T. Anderson and A. Aggarwal and D. Becker and N. Cardwell and A. Collin s and E. Hoffman and J. Snell and A. Vahdat and G. Voelker and J. Zahorjan IEEE Micro, 1999. |
| 580. OPUS: An Overlay Utility Service Rebecca Braynard and Dejan Kostic and Adolfo Rodriguez and Jeff Chase and Amin Vahdat Poster at 18th ACM Symposium on Operating System Principles, October, 2001. |
| 581. An error control scheme for large-scale multicast applications C. Papadopoulos, G. Parulkar and G. Varghese Proceedings of Infocom'98, 1998. |
| 582. An error control scheme for large-scale multicast applications C. Papadopoulos, G. Parulkar and G. Varghese Proceedings of Infocom'98, 1998. |
| 583. A Lower Bound for Multicast Key Distribution J. Snoeyink and S. Suri and G. Varghese IEEE Infocom, April, 2001. |
| 584. ALMI: An Application Level Multicast Infrastructure D. Pendarakis and S. Shi and D. Verma and M. Waldvogel Proceedings of 3rd Usenix Symposium on Internet Technologies & Systems, March, 2001. |
| 585. ALMI: An Application Level Multicast Infrastructure Pendarakis, Dimitris and Shi, Sherlia and Verma, Dinesh and Waldvogel, Marcel 3rd USNIX Symposium on Internet Technologies and Systems (USITS '01), 49--60, March, 2001. Abstract: The IP multicast model allows scalable and efficient multi-party communication, particularly for groups of large size. However, deployment of IP multicast requires substantial infrastructure modifications and is hampered by a host of unresolved open problems. To circumvent this situation, we have designed and implemented ALMI, an application level group communication middleware, which allows accelerated application deployment and simplified network configuration, without the need of network infrastructure support. ALMI is tailored toward support of multicast groups of relatively small size (several 10s of members) with many to many semantics. Session participants are connected via a virtual multicast tree, which consists of unicast connections between end hosts and is formed as a minimum spanning tree (MST) using application-specific performance metric. Using simulation, we show that the performance penalties, introduced by this shift of multicast to end systems, is a relatively small increase in traffic load and that ALMI multicast trees approach the efficiency of IP multicast trees. We have also implemented ALMI as a Java based middleware package and performed experiments over the Internet. Experimental results show that ALMI is able to cope with network dynamics and keep the multicast tree efficient. |
| 586. Efficient Peer-to-Peer Lookup Based on a Distributed Trie Freedman, M. and Vingralek, R. Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Lecture Notes in Computer Science 2429, 66-75, Springer Verlag, 2002. |
| 587. Detour: A Case for Informed Internet Routing and Transport S. Savage and T. Anderson and A. Aggarwal and D. Becker and N. Cardwell and A. Collin s and E. Hoffman and J. Snell and A. Vahdat and G. Voelker and J. Zahorjan IEEE Micro, 1999. |
| 588. Distance Vector Multicast Routing Protocol D. Waitzman and C. Partridge and S. Deering RFC 1075, 1998. |
| 589. Publius: A robust, tamper-evident, censorship-resistant, web publishing system Marc Waldman and Aviel D. Rubin and Lorrie Faith Cranor Proc. 9th USENIX Security Symposium, 59--72, August, 2000. |
| 590. The VersaKey Framework: Versatile Group Key Management M. Waldvogel and G. Caronni and D. Sun and N. Weiler and B. Plattner IEEE Journal on Selected Areas in Communications, Special Issue on Middleware, 17(9)August, 1999. |
| 591. ALMI: An Application Level Multicast Infrastructure D. Pendarakis and S. Shi and D. Verma and M. Waldvogel Proceedings of 3rd Usenix Symposium on Internet Technologies & Systems, March, 2001. |
| 592. Routing and Data Location in Overlay Peer-to-Peer Networks Roberto Rinaldi and Marcel Waldvogel Technical Report Research Report, RZ--3433, IBM, July, 2002. Abstract: Peer-to-peer overlay networks offer a novel platform for a variety of scalable and decentralized distributed applications. Systems known as Distributed Hash Tables provide efficient and fault- tolerant routing, object location and load balancing within a self- organizing overlay network. The alternative solution we propose is an overlay location and routing infrastructure that efficiently uses minimal local information to achieve global routing. The main novelty of our approach consists in fitting the overlay network in a hyper- toroidal space and building it with locality awareness. Thanks to this specific network construction phase, forwarding decisions always take into account locality preservation in an implicit manner, leading to significant improvements in end-to-end delays and path lengths. With this overlay network it is possible to obtain global routing by adding minimal information to each single host and by making only local forwarding decisions. Our analysis shows how the average path length coming from the overlay routing is close to the optimal average path length of the underlaying network: on average, they only differ by a factor of 2. Furthermore, locality preservation has a significant impact on the end-to-end latency of the routing process as well. Such a system can be viewed as novel in the field of peer-to- peer data location and addressing, allowing the development of new applications in a real low-latency environment. |
| 593. Efficient Topology-Aware Overlay Network Marcel Waldvogel and Roberto Rinaldi Proceedings of HotNets-I, October, 2002. Abstract: Peer-to-peer (P2P) networking has become a household word in the past few years, being marketed as a work-around for server scalability problems and ``wonder drug'' to achieve resilience. Current widely-used P2P networks rely on central directory servers or massive message flooding, clearly not scalable solutions. Distributed Hash Tables (DHT) are expected to eliminate flooding and central servers, but can require many long-haul message deliveries. We introduce Mithos, an content-addressable overlay network that only uses minimal routing information and is directly suitable as an underlay network for P2P systems, both using traditional and DHT addressing. Unlike other schemes, it also efficiently provides locality-aware connectivity, thereby ensuring that a message reaches its destination with minimal overhead. Mithos provides for highly efficient forwarding, making it suitable for use in high-throughput applications. Paired with its ability to have addresses directly mapped into a subspace of the IPv6 address space, it provides a potential candidate for native deployment. Additionally, Mithos can be used to support third-party triangulation to quickly select a close-by replica of data or services. |
| 594. Indra: A Peer-to-Peer Approach to Network Intrusion Detection and Prevention Ramaprabhu Janakiraman and Marcel Waldvogel and Qi Zhang Proceedings of IEEE WETICE 2003, June, 2003. Abstract: While the spread of the Internet has made the network ubiquitous, it has also rendered networked systems vulnerable to malicious attacks orchestrated from anywhere. These attacks or intrusions typically start with attackers infiltrating a network through a vulnerable host and then launching further attacks on the local network or Intranet. Attackers rely on increasingly sophisticated techniques like using distributed attack sources and obfuscating their network addresses. On the other hand, software that guards against them remains rooted in traditional centralized techniques, presenting an easily-targeted single point of failure. Scalable, distributed network intrusion prevention techniques are sorely needed. We propose Indra---a distributed scheme based on sharing information between trusted peers in a network to guard the network as a whole against intrusion attempts. We present initial ideas for running Indra over a peer-to-peer infrastructure to distribute up-to-date rumors, facts, and trust information in a scalable way. |
| 595. Dynamic Replica Management in Distributed Hash Tables Marcel Waldvogel and Paul Hurley and Daniel Bauer Technical Report Research Report, RZ--3502, IBM, July, 2003. Abstract: Interest in distributed storage is fueled by demand for reliability and resilience combined with decreasing hardware costs. Peer-to-peer storage networks based on distributed hash tables are an attractive solution due to their efficient use of resources and resulting performance. The placement and subsequent efficient location of replicas in such systems remain open problems, especially the requirement to update replicated content, working in the absence of global information, and how to determine the locations in a dynamic system without introducing single points of failure. We present and evaluate a novel and versatile technique, replica enumeration, which allows for controlled replication and replica access. The possibility of enumerating and addressing individual replicas allows dynamic updates as well as superior performance without burdening the network with state information, yet taking advantage of locality information when available. We simulate, analyze, and prove properties of the system, and discuss some applications. |
| 596. ALMI: An Application Level Multicast Infrastructure Pendarakis, Dimitris and Shi, Sherlia and Verma, Dinesh and Waldvogel, Marcel 3rd USNIX Symposium on Internet Technologies and Systems (USITS '01), 49--60, March, 2001. Abstract: The IP multicast model allows scalable and efficient multi-party communication, particularly for groups of large size. However, deployment of IP multicast requires substantial infrastructure modifications and is hampered by a host of unresolved open problems. To circumvent this situation, we have designed and implemented ALMI, an application level group communication middleware, which allows accelerated application deployment and simplified network configuration, without the need of network infrastructure support. ALMI is tailored toward support of multicast groups of relatively small size (several 10s of members) with many to many semantics. Session participants are connected via a virtual multicast tree, which consists of unicast connections between end hosts and is formed as a minimum spanning tree (MST) using application-specific performance metric. Using simulation, we show that the performance penalties, introduced by this shift of multicast to end systems, is a relatively small increase in traffic load and that ALMI multicast trees approach the efficiency of IP multicast trees. We have also implemented ALMI as a Java based middleware package and performed experiments over the Internet. Experimental results show that ALMI is able to cope with network dynamics and keep the multicast tree efficient. |
| 597. Security for structured peer-to-peer overlay networks Miguel Castro and Peter Druschel and Ayalvadi Ganesh and Antony Rowstron and Dan S. Wallach Proceedings of the Fifth Symposium on Operating Systems Design and Implementation (OSDI'02), 2002. |
| 598. Secure Routing for Structured Peer-to-Peer Overlay Networks Miguel Castro and Peter Druschel and Ayalvadi J. Ganesh and Antony I. T. Rowstron and Dan S. Wallach Proceedings of OSDI, 2002. |
| 599. Security for Structured Peer-to-Peer Overlay Networks Castro, M. and Druschel, P. and Ganesh, A. and Rowstron, A. and Wallach, D. S. 5th Symposium on Operating Systems Design and Implementation, Boston, MA, USA, December, 2002. |
| 600. OceanStore: An Architecture for Global-Scale Persistent Storage John Kubiatowicz and David Bindel and Yan Chen and Steven Czerwinski and Patrick Eaton and Dennis Geels and Ramakrishna Gummadi and Sean Rhea and Hakim Weatherspoon and Westley Weimer and Chris Wells and Ben Zhao. Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), 2000. |
| 601. Content Availability, Pollution and Poisoning in File Sharing Peer-to-Peer Networks Christin, N. and Weigend, A. S. and Chuang, J. ACM Conference on Electronic Commerce, Vancouver, Canada, June, 2005. |
| 602. The VersaKey Framework: Versatile Group Key Management M. Waldvogel and G. Caronni and D. Sun and N. Weiler and B. Plattner IEEE Journal on Selected Areas in Communications, Special Issue on Middleware, 17(9)August, 1999. |
| 603. OceanStore: An Architecture for Global-Scale Persistent Storage John Kubiatowicz and David Bindel and Yan Chen and Steven Czerwinski and Patrick Eaton and Dennis Geels and Ramakrishna Gummadi and Sean Rhea and Hakim Weatherspoon and Westley Weimer and Chris Wells and Ben Zhao. Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), 2000. |
| 604. OceanStore: An Architecture for Global-Scale Persistent Storage John Kubiatowicz and David Bindel and Yan Chen and Steven Czerwinski and Patrick Eaton and Dennis Geels and Ramakrishna Gummadi and Sean Rhea and Hakim Weatherspoon and Westley Weimer and Chris Wells and Ben Zhao. Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), 2000. |
| 605. The Darknet and the Future of Content Distribution Biddle, P. and England, P. and Peinado, M. and Willman, B. Proceedings of the 2nd ACM Workshop on Digital Rights Management, Lecture Notes in Computer Science 2696, 155-176, Springer Verlag, 2003. |
| 606. Design and Evaluation of a Wide-Area Event Notification Service Antonio Carzaniga and David S. Rosenblum and Alexander L Wolf ACM Transactions on Computer Systems, 19(3):332--383, August, 2001. |
| 607. Skipnet: A Scalable Overlay Network with Practical Locality Properties Harvey, N. J. A. and Jones, M. B. and Saroiu, S. and Theimer, M. and Wolman, A. 4th USENIX Symposium on Internet Technologies and Systems, Seattle, WA, USA, March, 2003. |
| 608. Secure Group Communications Using Key Graphs Wong, C.K. and Gouda, M. and Lam, S. Proceedings of SIGCOMM, 28(4):68--79, September, 1998. Abstract: Many emerging applications (e.g. teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work ) are based upon a group communications model, i.e., they require packet delivery from one or more authorized receivers. As a result, securing group communications (i.e., providing confidentiality, integrity, and authenticity of messages delivered between group members) will become a critical networking issue. In this paper, we present a novel solution to the scalability problem of group/multicast key management. We formalize the notion of a secure group as a triple (U, K, R) where U denotes a set of users, K a set of keys held by the users ,and R a user-key relation. We then introduce key graphs to specify secure groups. For a special class of key graphs, we present three strategies for securely distributing rekey messages after a join/leave, and specify protocols for joining and leaving a secure group. The rekeying strategies and join/leave protocols are implemented in a prototype group key server we have built. We present measurement results from experiments and discuss performance comparisons. We show that our group key management service, using any of the three rekeying strategies, is scalable to large groups with frequent joins and leaves. In particular, the average measured processing time per join/leave increases linearly with the logarithm of group size. |
| 609. An Evaluation of Preference Clustering in Large-scale Multicast Applications Wong, T. and Katz, R. and McCanne, S. Proceedings of INFOCOM, March, 2000. |
| 610. An Evaluation of Preference Clustering in Large-scale Multicast Applications Wong, T. and Katz, R. and McCanne, S. Proceedings of INFOCOM, March, 2000. |
| 611. A Framework for Global IP-Anycast (GIA) Katabi, D. and Wroclawski, J. Technical Report Internet Draft, Internet Engineering Task Force, June, 1999. Abstract: This document describes GIA, an architecture for a scalable Global IP-Anycast service. In contrast to previous approaches, which route IP-anycast through the unicast routing system, GIA provides IP-anycast with its own routing protocol. To scale, GIA pushes the overhead of anycast routing to the edge of the network and off-load the middle routers of the burden of storing anycast routes. Note: Work in progress |
| 612. A Framework for Global IP-Anycast (GIA) Katabi, D. and Wroclawski, J. Proceedings of SIGCOMM, 2000. |
| 613. Resilient Multicast Support for Continuous-Media Applications Rex Xu, X. and Myers, A.C. and Zhang, H. and Yavatkar, R. Proceedings of NOSSDAV, May, 1997. Abstract: The IP multicast delivery mechanism provides a popular basis for delivery of continuous media to many participants in a conferencing application. However, the best-effort nature of multicast delivery results in poor playback quality in the presence of network congestion and packet loss. Contrary to widespread belief that the real-time nature of continuous media applications precludes the possibility of recovery of lost packets using retransmissions, we have found that these applications offer an interesting tradeoff between the desired playback quality and the desired degree of interactivity. In particular, we propose a new model of multicast delivery called resilient multicast in which each receiver in a multicast group can decide its own tradeoff between reliability and real-time requirements. To be effective, error recovery mechanisms in such a model need to be both fast (due to the real-time constraint) and have a low overhead (due to high volume of continuous media data). We have designed a resilient multicast protocol called STORM (STructure-Oriented Resilient Multicast) in which senders and receivers collaborate to recover from lost packets using two key ideas. First, group participants self-organize themselves into a distribution structure and use the structure to recover lost packets from adjacent nodes. Second, the distribution structure is dynamic and a lightweight algorithm is used to adapt the structure to changing network traffic conditions and group membership. We have implemented STORM in both VAT and a packet level simulator. Experimental results using both the MBONE and a simulation model demonstrate the effectiveness of our approach. |
| 614. Resilient Multicast Support for Continuous-Media Applications Rex Xu, X. and Myers, A.C. and Zhang, H. and Yavatkar, R. Proceedings of NOSSDAV, May, 1997. Abstract: The IP multicast delivery mechanism provides a popular basis for delivery of continuous media to many participants in a conferencing application. However, the best-effort nature of multicast delivery results in poor playback quality in the presence of network congestion and packet loss. Contrary to widespread belief that the real-time nature of continuous media applications precludes the possibility of recovery of lost packets using retransmissions, we have found that these applications offer an interesting tradeoff between the desired playback quality and the desired degree of interactivity. In particular, we propose a new model of multicast delivery called resilient multicast in which each receiver in a multicast group can decide its own tradeoff between reliability and real-time requirements. To be effective, error recovery mechanisms in such a model need to be both fast (due to the real-time constraint) and have a low overhead (due to high volume of continuous media data). We have designed a resilient multicast protocol called STORM (STructure-Oriented Resilient Multicast) in which senders and receivers collaborate to recover from lost packets using two key ideas. First, group participants self-organize themselves into a distribution structure and use the structure to recover lost packets from adjacent nodes. Second, the distribution structure is dynamic and a lightweight algorithm is used to adapt the structure to changing network traffic conditions and group membership. We have implemented STORM in both VAT and a packet level simulator. Experimental results using both the MBONE and a simulation model demonstrate the effectiveness of our approach. |
| 615. Pollution in P2P File Sharing Systems Liang, J. and Kumar, R. and Xi, Y. and Ross, K. IEEE Infocom, Miami, FL, USA, March, 2005. |
| 616. Analysis of Parallel Downloading for Large File Distribution Koo, Simon G. M. and Rosenberg, Catherine and Xu, Dongyan Proceedings of the 9th IEEE International Workshop on Future Trends of Distributed Computing Systems (FTDCS 2003), 128--135, May, 2003. |
| 617. Improving Search in Peer-to-Peer Networks Yang, B. and Garcia-Molina, H. Proceedings of the 22nd International Conference on Distributed Computing Systems, Vienna, Austria, July, 2002. |
| 618. Open Problems in Data-Sharing Peer-to-Peer Systems Daswani, N. and Garcia-Molina, H. and Yang, B. Proceedings of the 9th International Conference on Database Theory, Lecture Notes in Computer Science 2572, 1-15, Springer Verlag, 2003. |
| 619. Designing a Super-Peer Network Yang, B. and Garcia-Molina, H. Proceedings of the IEEE International Conference on Data Engineering, March, 2003. |
| 620. Batch Updates for Key Trees Li, X. and Yang, R. and Gouda, M. and Lam, S. Technical Report University of Texas, Austin, September, 2000. |
| 621. Reliable Group Re-keying: A Performance Analysis Yang, Richard Y. and Li, Steve and Zhang, Brian and Lam, Simon Proceedings of SIGCOMM, August, 2001. |
| 622. The Breadcrumb Forwarding Service: A Synthesis of PGM and EXPRESS to Improve and Simplify Global IP Multicast Koichi Yano and Steven McCanne ACM Computer Communication Review, 30(2)2000. |
| 623. Resilient Multicast Support for Continuous-Media Applications Rex Xu, X. and Myers, A.C. and Zhang, H. and Yavatkar, R. Proceedings of NOSSDAV, May, 1997. Abstract: The IP multicast delivery mechanism provides a popular basis for delivery of continuous media to many participants in a conferencing application. However, the best-effort nature of multicast delivery results in poor playback quality in the presence of network congestion and packet loss. Contrary to widespread belief that the real-time nature of continuous media applications precludes the possibility of recovery of lost packets using retransmissions, we have found that these applications offer an interesting tradeoff between the desired playback quality and the desired degree of interactivity. In particular, we propose a new model of multicast delivery called resilient multicast in which each receiver in a multicast group can decide its own tradeoff between reliability and real-time requirements. To be effective, error recovery mechanisms in such a model need to be both fast (due to the real-time constraint) and have a low overhead (due to high volume of continuous media data). We have designed a resilient multicast protocol called STORM (STructure-Oriented Resilient Multicast) in which senders and receivers collaborate to recover from lost packets using two key ideas. First, group participants self-organize themselves into a distribution structure and use the structure to recover lost packets from adjacent nodes. Second, the distribution structure is dynamic and a lightweight algorithm is used to adapt the structure to changing network traffic conditions and group membership. We have implemented STORM in both VAT and a packet level simulator. Experimental results using both the MBONE and a simulation model demonstrate the effectiveness of our approach. |
| 624. Resilient Multicast Support for Continuous-Media Applications Rex Xu, X. and Myers, A.C. and Zhang, H. and Yavatkar, R. Proceedings of NOSSDAV, May, 1997. Abstract: The IP multicast delivery mechanism provides a popular basis for delivery of continuous media to many participants in a conferencing application. However, the best-effort nature of multicast delivery results in poor playback quality in the presence of network congestion and packet loss. Contrary to widespread belief that the real-time nature of continuous media applications precludes the possibility of recovery of lost packets using retransmissions, we have found that these applications offer an interesting tradeoff between the desired playback quality and the desired degree of interactivity. In particular, we propose a new model of multicast delivery called resilient multicast in which each receiver in a multicast group can decide its own tradeoff between reliability and real-time requirements. To be effective, error recovery mechanisms in such a model need to be both fast (due to the real-time constraint) and have a low overhead (due to high volume of continuous media data). We have designed a resilient multicast protocol called STORM (STructure-Oriented Resilient Multicast) in which senders and receivers collaborate to recover from lost packets using two key ideas. First, group participants self-organize themselves into a distribution structure and use the structure to recover lost packets from adjacent nodes. Second, the distribution structure is dynamic and a lightweight algorithm is used to adapt the structure to changing network traffic conditions and group membership. We have implemented STORM in both VAT and a packet level simulator. Experimental results using both the MBONE and a simulation model demonstrate the effectiveness of our approach. |
| 625. X.500 Lightweight Directory Access Protocol W. Yeong and T. Howes and S. Kille Network Working Group RFC 1487, ISODE Consortium, 1993. |
| 626. A Social Mechanism of Reputation Management in Electronic Communities Bin Yu and Munindar P. Singh Proceedings of Fourth International Workshop on Cooperative Information Agents, 2000. |
| 627. Authenticated Multi-Party Key Agreement in Constant Rounds J. Katz and M. Yung Submitted to Eurocrypt 2003. |
| 628. Detour: A Case for Informed Internet Routing and Transport S. Savage and T. Anderson and A. Aggarwal and D. Becker and N. Cardwell and A. Collin s and E. Hoffman and J. Snell and A. Vahdat and G. Voelker and J. Zahorjan IEEE Micro, 1999. |
| 629. How to Model an Internetwork K. Calvert and E. Zegura and S. Bhattacharjee Proceedings of IEEE Infocom, 1996. |
| 630. Reasoning About Active Network Protocols S. Bhattacharjee and K. Calvert and E. Zegura Proceedings of International Conference on Network Portocols (ICNP) '98, 1998. |
| 631. Directions in Active Networks K. Calvert and S. Bhattacharjee and E. Zegura and J. Sterbenz IEEE Communications Magazine, 1998. |
| 632. Bowman: A Node OS for Active Networks S. Merugu and S. Bhattacharjee and E. Zegura and K. Calvert Proceedings IEEE INFOCOM'2000, 2000. |
| 633. Exposing the network: Support for topology-sensitive applications Y. Chae and S. Merugu and E. Zegura and S. Bhattarcharjee Proceedings of IEEE OpenArch 2000, 2000. |
| 634. A quantitative comparison of graph-based models for Internet topology Ellen W. Zegura and Kenneth L. Calvert and Michael J. Donahoo IEEEslash ACM Transactions on Networking, 5(6):770--783, 1997. |
| 635. Self-Organizing Wide-Area Network Caches Samrat Bhattacharjee and Ken Calvert and Ellen Zegura IEEE Infocom'98, 1998. |
| 636. Application-layer anycasting: a server selection architecture and use in a replicated Web service Ellen W. Zegura and Mostafa H. Ammar and Zongming Fei and Samrat Bhattacharjee j-IEEE-TRANS-NETWORKING, 8(4):455--466, 2000. |
| 637. A quantitative comparison of graph-based models for Internet topology Ellen W. Zegura and Kenneth L. Calvert and Michael J. Donahoo IEEEslash ACM Transactions on Networking, 5(6):770--783, 1997. |
| 638. Application-layer anycasting: a server selection architecture and use in a replicated Web service Ellen W. Zegura and Mostafa H. Ammar and Zongming Fei and Samrat Bhattacharjee j-IEEE-TRANS-NETWORKING, 8(4):455--466, 2000. |
| 639. A Case for End System Multicast Y.-H. Chu and S. G. Rao and H. Zhang Proceedings of ACM SIGMETRICS, June, 2000. |
| 640. Enabling Conferencing Applications on the Internet using an Overlay Multicast Architecture Y.-H. Chu and S. G. Rao and S. Seshan and H. Zhang Proceedings of ACM SIGCOMM, August, 2001. |
| 641. Indra: A Peer-to-Peer Approach to Network Intrusion Detection and Prevention Ramaprabhu Janakiraman and Marcel Waldvogel and Qi Zhang Proceedings of IEEE WETICE 2003, June, 2003. Abstract: While the spread of the Internet has made the network ubiquitous, it has also rendered networked systems vulnerable to malicious attacks orchestrated from anywhere. These attacks or intrusions typically start with attackers infiltrating a network through a vulnerable host and then launching further attacks on the local network or Intranet. Attackers rely on increasingly sophisticated techniques like using distributed attack sources and obfuscating their network addresses. On the other hand, software that guards against them remains rooted in traditional centralized techniques, presenting an easily-targeted single point of failure. Scalable, distributed network intrusion prevention techniques are sorely needed. We propose Indra---a distributed scheme based on sharing information between trusted peers in a network to guard the network as a whole against intrusion attempts. We present initial ideas for running Indra over a peer-to-peer infrastructure to distribute up-to-date rumors, facts, and trust information in a scalable way. |
| 642. Reliable Group Re-keying: A Performance Analysis Yang, Richard Y. and Li, Steve and Zhang, Brian and Lam, Simon Proceedings of SIGCOMM, August, 2001. |
| 643. Resilient Multicast Support for Continuous-Media Applications Rex Xu, X. and Myers, A.C. and Zhang, H. and Yavatkar, R. Proceedings of NOSSDAV, May, 1997. Abstract: The IP multicast delivery mechanism provides a popular basis for delivery of continuous media to many participants in a conferencing application. However, the best-effort nature of multicast delivery results in poor playback quality in the presence of network congestion and packet loss. Contrary to widespread belief that the real-time nature of continuous media applications precludes the possibility of recovery of lost packets using retransmissions, we have found that these applications offer an interesting tradeoff between the desired playback quality and the desired degree of interactivity. In particular, we propose a new model of multicast delivery called resilient multicast in which each receiver in a multicast group can decide its own tradeoff between reliability and real-time requirements. To be effective, error recovery mechanisms in such a model need to be both fast (due to the real-time constraint) and have a low overhead (due to high volume of continuous media data). We have designed a resilient multicast protocol called STORM (STructure-Oriented Resilient Multicast) in which senders and receivers collaborate to recover from lost packets using two key ideas. First, group participants self-organize themselves into a distribution structure and use the structure to recover lost packets from adjacent nodes. Second, the distribution structure is dynamic and a lightweight algorithm is used to adapt the structure to changing network traffic conditions and group membership. We have implemented STORM in both VAT and a packet level simulator. Experimental results using both the MBONE and a simulation model demonstrate the effectiveness of our approach. |
| 644. Resilient Multicast Support for Continuous-Media Applications Rex Xu, X. and Myers, A.C. and Zhang, H. and Yavatkar, R. Proceedings of NOSSDAV, May, 1997. Abstract: The IP multicast delivery mechanism provides a popular basis for delivery of continuous media to many participants in a conferencing application. However, the best-effort nature of multicast delivery results in poor playback quality in the presence of network congestion and packet loss. Contrary to widespread belief that the real-time nature of continuous media applications precludes the possibility of recovery of lost packets using retransmissions, we have found that these applications offer an interesting tradeoff between the desired playback quality and the desired degree of interactivity. In particular, we propose a new model of multicast delivery called resilient multicast in which each receiver in a multicast group can decide its own tradeoff between reliability and real-time requirements. To be effective, error recovery mechanisms in such a model need to be both fast (due to the real-time constraint) and have a low overhead (due to high volume of continuous media data). We have designed a resilient multicast protocol called STORM (STructure-Oriented Resilient Multicast) in which senders and receivers collaborate to recover from lost packets using two key ideas. First, group participants self-organize themselves into a distribution structure and use the structure to recover lost packets from adjacent nodes. Second, the distribution structure is dynamic and a lightweight algorithm is used to adapt the structure to changing network traffic conditions and group membership. We have implemented STORM in both VAT and a packet level simulator. Experimental results using both the MBONE and a simulation model demonstrate the effectiveness of our approach. |
| 645. Reliable Multicast Framework for Light-weight Sessions and Application Level Framing Floyd, S. and Jacobson, V. and Liu, C.-G. and McCanne, S. and Zhang, L. Proceedings of SIGCOMM, September, 1995. Abstract: This paper describes SRM (Scalable Reliable Multicast), a reliable multicast framework for application level framing and light-weight sessions. The algorithms of this framework are efficient, robust, and scale well to both very large networks and very large sessions. The framework has been prototyped in wb, a distributed whiteboard application, and has been extensively tested on a global scale with sessions ranging from a few to more than 1000 participants. The paper describes the principles that have guided our design, including the IP multicast group delivery model, an end-to-end, receiver-based model of reliability, and the application level framing protocol model. As with unicast communications, the performance of a reliable multicast delivery algorithm depends on the underlying topology and operational environment. We investigate that dependence via analysis and simulation, and demonstrate an adaptive algorithm that uses the results of previous loss recovery events to adapt the control parameters used for future loss recovery. With the adaptive algorithm, our reliable multicast delivery algorithm provides good performance over a wide range of underlying topologies. |
| 646. Reliable Multicast Framework for Light-weight Sessions and Application Level Framing Floyd, S. and Jacobson, V. and Liu, C.-G. and McCanne, S. and Zhang, L. Proceedings of SIGCOMM, September, 1995. Abstract: This paper describes SRM (Scalable Reliable Multicast), a reliable multicast framework for application level framing and light-weight sessions. The algorithms of this framework are efficient, robust, and scale well to both very large networks and very large sessions. The framework has been prototyped in wb, a distributed whiteboard application, and has been extensively tested on a global scale with sessions ranging from a few to more than 1000 participants. The paper describes the principles that have guided our design, including the IP multicast group delivery model, an end-to-end, receiver-based model of reliability, and the application level framing protocol model. As with unicast communications, the performance of a reliable multicast delivery algorithm depends on the underlying topology and operational environment. We investigate that dependence via analysis and simulation, and demonstrate an adaptive algorithm that uses the results of previous loss recovery events to adapt the control parameters used for future loss recovery. With the adaptive algorithm, our reliable multicast delivery algorithm provides good performance over a wide range of underlying topologies. |
| 647. On the Placement of Internet Instrumentation Jamin, S. and Jin, C. and Jin, Y. and Raz, D. and Shavitt, Y. and Zhang, L. Proceedings of Infocom'00, March, 2000. |
| 648. Bayeux: An Architecture for Scalable and Fault-tolerant Wide-area Data Dissemination S. Q. Zhuang and B. Y. Zhao and A. D. Joseph and R. Katz and J. Kubiatowicz Eleventh International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV 2001), 2001. |
| 649. An Architecture for a Secure Service Discovery Service Steven Czerwinski and Ben Y. Zhao and Todd Hodes and Anthony D. Joseph and Randy Katz Proceedings of the Fifth Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom-99, 24--35, ACM Press, aug 15--20, 1999. |
| 650. Tapestry: A Resilient Global-scale Overlay for Service Deployment Ben Y. Zhao and Ling Huang and Jeremy Stribling and Sean C. Rhea and Anthony D. Joseph and John D. Kubiatowicz IEEE Journal on Selected Areas in Communications, 22(1)January, 2004. |
| 651. Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing Zhao, B. Y. and Kubiatowicz, J. D. and Joseph, A. D. Technical Report UCB/CSD-01-1141, UC Berkeley, April, 2001. |
| 652. OceanStore: An Architecture for Global-Scale Persistent Storage John Kubiatowicz and David Bindel and Yan Chen and Steven Czerwinski and Patrick Eaton and Dennis Geels and Ramakrishna Gummadi and Sean Rhea and Hakim Weatherspoon and Westley Weimer and Chris Wells and Ben Zhao. Proceedings of the Ninth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), 2000. |
| 653. Bayeux: An Architecture for Scalable and Fault-tolerant Wide-area Data Dissemination S. Q. Zhuang and B. Y. Zhao and A. D. Joseph and R. Katz and J. Kubiatowicz Eleventh International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV 2001), 2001. |
| 654. Pretty Good Privacy User's Guide P. Zimmermann Distributed with PGP software, June, 1993. |
| 655. PGM Reliable Transport Protocol Speakman, T. and others Technical Report draft-speakman-pgm-spec-04 txt, Internet Draft, Internet Engineering Task Force, April, 2000. Abstract: Pragmatic General Multicast (PGM) is a reliable multicast transport pro- tocol for applications that require ordered or unordered, duplicate- free, multicast data delivery from multiple sources to multiple receivers. PGM guarantees that a receiver in the group either receives all data packets from transmissions and repairs, or is able to detect unrecoverable data packet loss. PGM is specifically intended as a work- able solution for multicast applications with basic reliability require- ments. Its central design goal is simplicity of operation with due regard for scalability and network efficiency. Note: Work in progress |
| 656. Detour: A Case for Informed Internet Routing and Transport S. Savage and T. Anderson and A. Aggarwal and D. Becker and N. Cardwell and A. Collin s and E. Hoffman and J. Snell and A. Vahdat and G. Voelker and J. Zahorjan IEEE Micro, 1999. |