Back to the main P2PRG Bibliography Project page

research-year.html: grouped by research area: sorted by year

--None--

Almi

BitTorrent

CDN

Content Distribution

Content Distribution Systems

Distributed Protocol

Dynamic Replica Management

Genetic Algorithms

Incentive Mechanism

Indra

Large File Distribution

Mithos

Multicast

Neighbor-Selection Strategy

Network Dimensioning

Network Economics

Network Intrusion Detection

Network Intrusion Prevention

Overlay Networks

P2P

Parallel Downloading

Peer-to-Peer Networks

Peer-to-peer

Peer-to-peer networking

active networking

anonymity

anycasting

application level group communication middleware

application-layer multicast

bulk data transfer

caching

clustering

content-addressable overlay network

crypto

darknet

directory

distributed attack

distributed hash tables

dns

forwarding

general

global routing

gnutella

groupware

load-balance

lookup

malicious attacks

measurement

media streaming

minimum spanning tree

multicast

multicast security

multicast tree

overlay network

p2p

peer to peer

publish-subscribe

reliable multicast

replica enumeration

routing

search

security

server selection

sharing information

skip graphs

storage

streaming media

structured overlays

theory

topology discovery

topology models

trust

unstructured

virtual networking

wireless

--None--

1. 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.
2. 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.

Almi

3. 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.

BitTorrent

4. 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.

CDN

5. 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.

Content Distribution

6. 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.

Content Distribution Systems

7. 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.

Distributed Protocol

8. 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.

Genetic Algorithms

9. 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.

Incentive Mechanism

10. 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.
11. 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.

Indra

12. 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.

Large File Distribution

13. 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.

Mithos

14. 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.

Multicast

15. 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.

Neighbor-Selection Strategy

16. 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.

Network Dimensioning

17. 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.

Network Economics

18. 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.

Network Intrusion Detection

19. 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.

Network Intrusion Prevention

20. 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.

Overlay Networks

21. 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.

P2P

22. 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.

Parallel Downloading

23. 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.

Peer-to-Peer Networks

24. 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.
25. 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.
26. 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.

Peer-to-peer

27. 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.

Peer-to-peer networking

28. 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.

active networking

29. Reasoning About Active Network Protocols
S. Bhattacharjee and K. Calvert and E. Zegura
Proceedings of International Conference on Network Portocols (ICNP) '98, 1998.
30. Directions in Active Networks
K. Calvert and S. Bhattacharjee and E. Zegura and J. Sterbenz
IEEE Communications Magazine, 1998.
31. Active Networks:Architectures, Composition, and Applications
Samrat Bhattacharjee
Ph.D. Thesis
Georgia Institute of Technology, July, 1999.
32. 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.
33. Control on Demand
G'isli Hj'almt'ysson and Samrat Bhattacharjee
Proceedings of the First International Working Conference on Active Networks (IWAN), June, 1999.
34. Bowman: A Node OS for Active Networks
S. Merugu and S. Bhattacharjee and E. Zegura and K. Calvert
Proceedings IEEE INFOCOM'2000, 2000.
35. 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.

anonymity

36. 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.

anycasting

37. 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
38. 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.
39. A Framework for Global IP-Anycast (GIA)
Katabi, D. and Wroclawski, J.
Proceedings of SIGCOMM, 2000.

application-layer multicast

40. Yoid: Extending the Multicast Internet Architecture
P. Francis
1999.
Note: White paper http://www.aciri.org/yoid/.
41. 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.
42. A Case for End System Multicast
Y.-H. Chu and S. G. Rao and H. Zhang
Proceedings of ACM SIGMETRICS, June, 2000.
43. Scattercast: An Architecture for Internet Broadcast Distribution as an Infrastructure Service
Y. Chawathe
Ph.D. Thesis, University of California, Berkeley, December, 2000.
44. 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.
45. 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.
46. 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.
47. 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.
48. Scalable Application Layer Multicast
Suman Banerjee and Bobby Bhattacharjee and Christopher Kommreddy
Proceedings of ACM SIGCOMM, 2002.
49. 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.
50. Resilient Multicast using Overlays
Suman Banerjee and Seungjoon Lee and Bobby Bhattacharjee and Aravind Srinivasan
Proceedings of ACM SIGMETRICS, 2003.

bulk data transfer

51. Slurpie: A Cooperative Bulk Data Transfer Protocol
Rob Sherwood and Ryan Braud and Bobby Bhattacharjee
Proceedings of IEEE INFOCOM, 2004.

caching

52. Self-Organizing Wide-Area Network Caches
Samrat Bhattacharjee and Ken Calvert and Ellen Zegura
IEEE Infocom'98, 1998.
53. 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.

clustering

54. 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.
55. An Evaluation of Preference Clustering in Large-scale Multicast Applications
Wong, T. and Katz, R. and McCanne, S.
Proceedings of INFOCOM, March, 2000.

crypto

56. Authenticated Multi-Party Key Agreement in Constant Rounds
J. Katz and M. Yung
Submitted to Eurocrypt 2003.
57. Secure Distributed Computing in a Commercial Environment
P. Golle and S. Stubblebine
Financial Cryptography, 2001.
58. Uncheatable Distributed Computations
Cryptographers' Track --- RSA, 2001.
59. Incentives for Sharing in Peer-to-Peer Networks
ACM Conference on Electronic Commerce, 2001.
60. A Forward-Secure Public-Key Encryption Scheme
Jonathan Katz
2002.

darknet

61. WASTE website.
62. More on See You on the Darknet - note on etymology
Farber, D..
63. 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.
64. 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.
65. 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.
66. Routing in the Dark: Scalable Searches in Dark P2P Networks
Clarke, I. and Sandberg, O.
DefCon 13, Las Vegas, NV, USA, July, 2005.

directory

67. End-To-End Arguments in System Design
H. Saltzer and D. P. Reed and D. Clark
ACM Transactions on Computing Systems, 2(4)1984.
68. The Directory: Overview of Concepts, Models and Service.
CCITT Recommendation X.500., 1988.
69. The Directory: Models.
CCITT Recommendation X.501 ISO/IEC JTC 1/SC21; International Standard 9594-2, 1988.
70. The Directory: Abstract Service Definition.
CCITT Recommendation X.511, ISO/IEC JTC 1/SC21; International Standard 9594-3, 1988.
71. 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
72. X.500 Lightweight Directory Access Protocol
W. Yeong and T. Howes and S. Kille
Network Working Group RFC 1487, ISODE Consortium, 1993.
73. 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.
74. 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
75. 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.
76. 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.
77. 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.
78. The Service Location Protocol
Erik Guttman
IEEE Internet Computing, July, 1999.
79. 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.
80. Routing in the TerraDir Directory Service
Bujor Silaghi and Bobby Bhattacharjee and Pete Keleher
Proceedings of SPIE ITCOM, 2002.
81. 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.
82. 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.

distributed attack

83. 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.

distributed hash tables

84. 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.

dns

85. 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

forwarding

86. 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.

general

87. Specification of Basic Encoding Rules for Abstract Syntax Notation One (ASN.1)
CCITT Recommendation X.209, 1988.
88. 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.
89. 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/.
90. 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.
91. The XML Companion
Neil Bradley
Edition: Second, Addison-Wesley, 2000.

global routing

92. 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.

gnutella

93. The Gnutella Protocol Specification v0.4.
94. Gnutella Developers' Forum.
95. Dynamic Query Protocol
Fisk, A.

Note: Gnutella Developers' Forum, http://www.the-gdf.org/.
96. The Download Mesh
Bollaert, M. and Thadani, S. and Mickish, A.

Note: Gnutella Developers' Forum, http://www.the-gdf.org/.
97. The Popularity of Gnutella Queries and its Implications on Scalability
Sripanidkulchai, K.
February, 2001.
98. 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.
99. I Jumped in the GnutellaNet and What Did I See? Lessons From a Simple Gnutella Network Simulation
Miconi, T.
October, 2002.
100. 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.
101. Query Routing for the Gnutella Network
Rohrs, C.
May, 2002.
102. 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.
103. 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.

groupware

104. WASTE website.
105. 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.
106. 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.

load-balance

107. 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.

lookup

108. Gnutella home page
http://gnutella.wego.com..
109. 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.
110. 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.
111. 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.
112. 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.
113. 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.
114. 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.
115. 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.
116. Routing in the TerraDir Directory Service
Bujor Silaghi and Bobby Bhattacharjee and Pete Keleher
Proceedings of SPIE ITCOM, 2002.
117. 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.
118. 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.
119. 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.
120. 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.
121. 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.
122. 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.

malicious attacks

123. 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.

measurement

124. 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.
125. 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.
126. A Network Measurement Architecture for Adaptive Applications
Stemm, Mark and Seshan, Srinivasan and Katz, Randy H.
Proceedings of INFOCOM, March, 2000.
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.

media streaming

128. First IETF Internet Audiocast
S. Casner and S. Deering
1992.

minimum spanning tree

129. 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.

multicast

130. Multicast Routing in Datagram Internetworks and Extended LANs
S. Deering and D. Cheriton
ACM Transactions on Computer Systems, May, 1990.
131. 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.
132. 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.
133. 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.
134. 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.
135. Scalable Multicast Key Distribution
A. Ballardie
May, 1996.
Note: Network Working Group, RFC 1949..
136. 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.
137. 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.
138. 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.
139. 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
140. 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.
141. 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.
142. 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.
143. 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.
144. 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.
145. 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.
146. 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.
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. 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.
149. 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.
150. An error control scheme for large-scale multicast applications
C. Papadopoulos, G. Parulkar and G. Varghese
Proceedings of Infocom'98, 1998.
151. 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.
152. 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.
153. 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.
154. 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.
155. An error control scheme for large-scale multicast applications
C. Papadopoulos, G. Parulkar and G. Varghese
Proceedings of Infocom'98, 1998.
156. 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.
157. 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.
158. 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.
159. 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.
160. 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.
161. Fault Isolation in Multicast Trees
Reddy, A. and Govindan, R. and Estrin, D.
Proceedings of SIGCOMM, August, 2000.
162. An Evaluation of Preference Clustering in Large-scale Multicast Applications
Wong, T. and Katz, R. and McCanne, S.
Proceedings of INFOCOM, March, 2000.
163. 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
164. RMX: Reliable Multicast for Heterogeneous Networks
Y. Chawathe and S. McCanne and E. A. Brewer
Proceedings of Infocom, 2000.
165. Batch Updates for Key Trees
Li, X. and Yang, R. and Gouda, M. and Lam, S.
Technical Report
University of Texas, Austin, September, 2000.
166. Fault Isolation in Multicast Trees
Reddy, A. and Govindan, R. and Estrin, D.
Computer Communications Review, August, 2000.
Note: Proceedings of ACM SIGCOMM'00.
167. Reliable Group Re-keying: A Performance Analysis
Yang, Richard Y. and Li, Steve and Zhang, Brian and Lam, Simon
Proceedings of SIGCOMM, August, 2001.
168. A Lower Bound for Multicast Key Distribution
J. Snoeyink and S. Suri and G. Varghese
IEEE Infocom, April, 2001.
169. Scalable Secure Group Communication over IP Mulitcast
Banerjee, S. and Bhattacharjee, B.
Proceedings of International Conference on Network Protocols, November, 2001.
170. Steiner points in tree metrics don't (really) help
A. Gupta
Symposium of Discrete Algorithms, January, 2001.
171. 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.

multicast security

172. 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.
173. 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.

multicast tree

174. 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.

overlay network

175. 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.

p2p

176. Advogato's Trust Metric
Raph Levien

Note: Available on-line at http://www.advogato.org/trust-metric.html.
177. Gnutella home page
http://gnutella.wego.com..
178. 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.
179. 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.
180. Yoid: Extending the Multicast Internet Architecture
P. Francis
1999.
Note: White paper http://www.aciri.org/yoid/.
181. 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.
182. 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.
183. A Case for End System Multicast
Y.-H. Chu and S. G. Rao and H. Zhang
Proceedings of ACM SIGMETRICS, June, 2000.
184. Scattercast: An Architecture for Internet Broadcast Distribution as an Infrastructure Service
Y. Chawathe
Ph.D. Thesis, University of California, Berkeley, December, 2000.
185. 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.
186. 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.
187. 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.
188. Free riding on gnutella.
E. Adar and B. Huberman
First Monday, 5(10)2000.
Note: http://www.firstmonday.dk/issues/issue5-10/adar/.
189. 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.
190. 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.
191. 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.
192. 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.
193. 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.
194. 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.
195. 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.
196. 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.
197. 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.
198. 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.
199. 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.
200. 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.
201. 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.
202. 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.
203. 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.
204. Scalable Application Layer Multicast
Suman Banerjee and Bobby Bhattacharjee and Christopher Kommreddy
Proceedings of ACM SIGCOMM, 2002.
205. 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.
206. 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.
207. Routing in the TerraDir Directory Service
Bujor Silaghi and Bobby Bhattacharjee and Pete Keleher
Proceedings of SPIE ITCOM, 2002.
208. 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.
209. 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.
210. 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.
211. Cooperative peer groups in NICE
Seungjoon Lee and Rob Sherwood and Bobby Bhattacharjee
Proceedings of INFOCOM, 2003.
212. 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.
213. 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.
214. Resilient Multicast using Overlays
Suman Banerjee and Seungjoon Lee and Bobby Bhattacharjee and Aravind Srinivasan
Proceedings of ACM SIGMETRICS, 2003.
215. 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.
216. A Cooperative Framework to Scale Multi-Party Applications
Suman Banerjee
PhD Thesis, University of Maryland, 2003.
217. Range Queries over DHTs
Sylvia Ratnasamy and Joseph M. Hellerstein and Scott Shenker
Technical Report
IRB-TR-03-009, Intel Research, June, 2003.
218. 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.
219. 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.
220. Slurpie: A Cooperative Bulk Data Transfer Protocol
Rob Sherwood and Ryan Braud and Bobby Bhattacharjee
Proceedings of IEEE INFOCOM, 2004.
221. 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.
222. 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.
223. 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.

peer to peer

224. The Gnutella Protocol Specification v0.4.
225. Gnutella Developers' Forum.
226. Dynamic Query Protocol
Fisk, A.

Note: Gnutella Developers' Forum, http://www.the-gdf.org/.
227. The Download Mesh
Bollaert, M. and Thadani, S. and Mickish, A.

Note: Gnutella Developers' Forum, http://www.the-gdf.org/.
228. WASTE website.
229. More on See You on the Darknet - note on etymology
Farber, D..
230. 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.
231. 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.
232. 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.
233. 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.
234. 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.
235. An Efficient Scheme for Query Processing on Peer-to-Peer Networks
Prinkey, M. T.
2001.
236. The Popularity of Gnutella Queries and its Implications on Scalability
Sripanidkulchai, K.
February, 2001.
237. 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.
238. 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.
239. 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.
240. 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.
241. 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.
242. 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.
243. 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.
244. 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.
245. 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.
246. 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.
247. 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.
248. I Jumped in the GnutellaNet and What Did I See? Lessons From a Simple Gnutella Network Simulation
Miconi, T.
October, 2002.
249. 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.
250. Query Routing for the Gnutella Network
Rohrs, C.
May, 2002.
251. 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.
252. 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.
253. 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.
254. 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.
255. 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.
256. 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.
257. 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.
258. 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.
259. 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.
260. 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.
261. Incentive-Based Propagation of Metadata Updates in Peer-to-Peer Networks
Roussopoulos, M. and Baker, M.
P2P Journal, 1-6, September, 2003.
262. CUP: Controlled Update Propagation in Peer-to-Peer Networks
Roussopoulos, M. and Baker, M.
USENIX Annual Technical Conference, San Antonio, TX, USA, June, 2003.
263. Probabilistic Knowledge Discovery and Management for P2P Networks
Tsoumakos, D. and Roussopolous, N.
P2P Journal, 15-20, November, 2003.
264. Designing a Super-Peer Network
Yang, B. and Garcia-Molina, H.
Proceedings of the IEEE International Conference on Data Engineering, March, 2003.
265. 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.
266. 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.
267. 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.
268. 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.
269. 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.
270. Routing in the Dark: Scalable Searches in Dark P2P Networks
Clarke, I. and Sandberg, O.
DefCon 13, Las Vegas, NV, USA, July, 2005.
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. 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.
273. Pollution in P2P File Sharing Systems
Liang, J. and Kumar, R. and Xi, Y. and Ross, K.
IEEE Infocom, Miami, FL, USA, March, 2005.

publish-subscribe

274. 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.
275. 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.

reliable multicast

276. 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.
277. 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.
278. 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.
279. 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.
280. 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.
281. 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.
282. An error control scheme for large-scale multicast applications
C. Papadopoulos, G. Parulkar and G. Varghese
Proceedings of Infocom'98, 1998.
283. 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.
284. An error control scheme for large-scale multicast applications
C. Papadopoulos, G. Parulkar and G. Varghese
Proceedings of Infocom'98, 1998.
285. 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
286. RMX: Reliable Multicast for Heterogeneous Networks
Y. Chawathe and S. McCanne and E. A. Brewer
Proceedings of Infocom, 2000.
287. 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.

replica enumeration

288. 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.

routing

289. Multicast Routing in Datagram Internetworks and Extended LANs
S. Deering and D. Cheriton
ACM Transactions on Computer Systems, May, 1990.
290. 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.
291. Routing Information Organization To Support Scalable Interdomain Routing with Heterogeneous Path Requirements
S. Hotz
Ph.D. Thesis
University of Southern California, 1996.
292. Open Shortest Path First (Version 2)
Moy, J.
RFC 2178, 1997.
293. 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.
294. 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.
295. Distance Vector Multicast Routing Protocol
D. Waitzman and C. Partridge and S. Deering
RFC 1075, 1998.
296. 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.
297. 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.

search

298. 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.
299. Range Queries over DHTs
Sylvia Ratnasamy and Joseph M. Hellerstein and Scott Shenker
Technical Report
IRB-TR-03-009, Intel Research, June, 2003.

security

300. Authenticated Multi-Party Key Agreement in Constant Rounds
J. Katz and M. Yung
Submitted to Eurocrypt 2003.
301. Pretty Good Privacy User's Guide
P. Zimmermann
Distributed with PGP software, June, 1993.
302. Kerberos: An Authentication Service for Computer Networks
B. Clifford Neuman and Theodore Ts'o
IEEE Communications, 32(9)September, 1994.
303. Scalable Multicast Key Distribution
A. Ballardie
May, 1996.
Note: Network Working Group, RFC 1949..
304. 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
305. 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.
306. 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.
307. 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.
308. 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.
309. 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.
310. Client Puzzles: A Cryptographic Defense Against Connection Depletion Attacks
A. Juels and J. Brainard
Proceedings of NDSS '99 (Networks and Distributed Security Systems), 1999.
311. 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.
312. Batch Updates for Key Trees
Li, X. and Yang, R. and Gouda, M. and Lam, S.
Technical Report
University of Texas, Austin, September, 2000.
313. Reliable Group Re-keying: A Performance Analysis
Yang, Richard Y. and Li, Steve and Zhang, Brian and Lam, Simon
Proceedings of SIGCOMM, August, 2001.
314. Secure Distributed Computing in a Commercial Environment
P. Golle and S. Stubblebine
Financial Cryptography, 2001.
315. Uncheatable Distributed Computations
Cryptographers' Track --- RSA, 2001.
316. Incentives for Sharing in Peer-to-Peer Networks
ACM Conference on Electronic Commerce, 2001.
317. A Lower Bound for Multicast Key Distribution
J. Snoeyink and S. Suri and G. Varghese
IEEE Infocom, April, 2001.
318. Scalable Secure Group Communication over IP Mulitcast
Banerjee, S. and Bhattacharjee, B.
Proceedings of International Conference on Network Protocols, November, 2001.
319. 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.
320. A Forward-Secure Public-Key Encryption Scheme
Jonathan Katz
2002.
321. Hashcash --- a denial of service countermeasure
Adam Back
Technical Report
cypherspace.org, 2002.
Note: Available at http://www.cypherspace.org/ adam/hashcash/hashcash.pdf.
322. 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.
323. 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.
324. 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.
325. 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.
326. Cooperative peer groups in NICE
Seungjoon Lee and Rob Sherwood and Bobby Bhattacharjee
Proceedings of INFOCOM, 2003.
327. 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.

server selection

328. 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.
329. The Service Location Protocol
Erik Guttman
IEEE Internet Computing, July, 1999.

skip graphs

330. Skip Graphs
Aspnes, J. and Shah, G.
14th Annual ACM-SIAM Symposium on Discrete Algorithms, January, 2003.
331. 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.

storage

332. 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.
333. 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.

streaming media

334. 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.
335. 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.
336. 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.
337. 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.
338. 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.
339. 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.
340. 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.

structured overlays

341. 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.
342. 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.
343. 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.
344. 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.
345. 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.
346. 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.
347. 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.
348. 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.
349. 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.
350. 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.
351. 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.
352. 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.
353. 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.
354. 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.
355. 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.
356. 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.
357. 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.
358. 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.
359. 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.
360. 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.
361. 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.

theory

362. Steiner points in tree metrics don't (really) help
A. Gupta
Symposium of Discrete Algorithms, January, 2001.

topology discovery

363. Routing Information Organization To Support Scalable Interdomain Routing with Heterogeneous Path Requirements
S. Hotz
Ph.D. Thesis
University of Southern California, 1996.
364. Heuristics for Internet Map Discovery
R. Govindan and H. Tangmunarunkit
Proceedings of Infocom, March, 2000.
365. Dynamic Distance Maps of the Internet
W. Theilmann and K. Rothermel
Proceedings of Infocom, March, 2000.
366. Heuristics for Internet Map Discovery
R. Govindan and H. Tangmunarunkit
Proceedings of Infocom, March, 2000.
367. Dynamic Distance Maps of the Internet
W. Theilmann and K. Rothermel
Proceedings of Infocom, March, 2000.
368. A Network Measurement Architecture for Adaptive Applications
Stemm, Mark and Seshan, Srinivasan and Katz, Randy H.
Proceedings of INFOCOM, March, 2000.
369. Finding Close Friends over the Internet
Narendar Shankar and Christopher Komareddy and Bobby Bhattacharjee
Proceedings of International Conference on Network Protocols, November, 2001.
370. Finding Close Friends on the Internet
Kommareddy, C. and Shankar, N. and Bhattacharjee, B.
Proceedings of ICNP, November, 2001.
371. Scalable Peer Finding on the Internet
Banerjee, S. and Kommareddy, C. and Bhattacharjee, B.
Proceedings of Global Internet Symposium, Globecom, November, 2002.

topology models

372. How to Model an Internetwork
K. Calvert and E. Zegura and S. Bhattacharjee
Proceedings of IEEE Infocom, 1996.
373. 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.

trust

374. Advogato's Trust Metric
Raph Levien

Note: Available on-line at http://www.advogato.org/trust-metric.html.
375. Formalising Trust as a Computational Concept
S. Marsh
Ph.D. Thesis
University of Sterling, 1994.
376. 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.
377. 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.
378. Supporting Trust in Virtual Communities
Alfarez Abdul-Rahman and Stephen Hailes
Proceedings Hawaii International Conference on System Sciences 33, 2000.
379. 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.
380. 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.
381. Cooperative peer groups in NICE
Seungjoon Lee and Rob Sherwood and Bobby Bhattacharjee
Proceedings of INFOCOM, 2003.
382. 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.

unstructured

383. The Gnutella Protocol Specification v0.4.
384. Gnutella Developers' Forum.
385. Dynamic Query Protocol
Fisk, A.

Note: Gnutella Developers' Forum, http://www.the-gdf.org/.
386. The Download Mesh
Bollaert, M. and Thadani, S. and Mickish, A.

Note: Gnutella Developers' Forum, http://www.the-gdf.org/.
387. An Efficient Scheme for Query Processing on Peer-to-Peer Networks
Prinkey, M. T.
2001.
388. The Popularity of Gnutella Queries and its Implications on Scalability
Sripanidkulchai, K.
February, 2001.
389. 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.
390. 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.
391. I Jumped in the GnutellaNet and What Did I See? Lessons From a Simple Gnutella Network Simulation
Miconi, T.
October, 2002.
392. 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.
393. Query Routing for the Gnutella Network
Rohrs, C.
May, 2002.
394. 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.
395. 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.
396. 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.
397. 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.
398. Incentive-Based Propagation of Metadata Updates in Peer-to-Peer Networks
Roussopoulos, M. and Baker, M.
P2P Journal, 1-6, September, 2003.
399. CUP: Controlled Update Propagation in Peer-to-Peer Networks
Roussopoulos, M. and Baker, M.
USENIX Annual Technical Conference, San Antonio, TX, USA, June, 2003.
400. Probabilistic Knowledge Discovery and Management for P2P Networks
Tsoumakos, D. and Roussopolous, N.
P2P Journal, 15-20, November, 2003.
401. Designing a Super-Peer Network
Yang, B. and Garcia-Molina, H.
Proceedings of the IEEE International Conference on Data Engineering, March, 2003.
402. 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.
403. 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.
404. Pollution in P2P File Sharing Systems
Liang, J. and Kumar, R. and Xi, Y. and Ross, K.
IEEE Infocom, Miami, FL, USA, March, 2005.

virtual networking

405. Dynamic Internet Overlay Deployment and Management Using the X-Bone
Joe Touch
Proceedings of Internet Conference on Network Protocols, November, 2000.

wireless

406. Adaptive Clustering for Mobile, Wireless Networks
Lin, C.R. and Gerla, M.
Journal on Selected Areas of Communication, 15(7)September, 1997.
407. 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.
408. 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.
Back to the main P2PRG Bibliography Project page

Web Accessibility