IPTPS
2005
Springer
13 years 10 months ago
2005
Springer
To improve performance, large-scale Internet systems require clients to access nearby servers. While centralized systems can leverage static topology maps for rough network distan...
IPTPS
2005
Springer
13 years 10 months ago
2005
Springer
A great deal of work has been done to improve peerto-peer routing by strategically moving or replicating content. However, there are many applications for which a peer-to-peer arc...
IPTPS
2005
Springer
13 years 10 months ago
2005
Springer
Arpeggio is a peer-to-peer file-sharing network based on the Chord lookup primitive. Queries for data whose metadata matches a certain criterion are performed efficiently by using...
IPTPS
2005
Springer
13 years 10 months ago
2005
Springer
IPTPS
2005
Springer
13 years 10 months ago
2005
Springer
Recent work has shown that intelligent neighbor selection during construction can significantly enhance the performance of peer-to-peer overlay networks. While its impact on perf...
IPTPS
2005
Springer
13 years 10 months ago
2005
Springer
High availability in peer-to-peer DHTs requires data redundancy. This paper compares two popular redundancy schemes: replication and erasure coding. Unlike previous comparisons, w...
IPTPS
2005
Springer
13 years 10 months ago
2005
Springer
— The problem of digital preservation is widely acknowledged, but the underlying assumptions implicit to the design of systems that address this problem have not been analyzed ex...
IPTPS
2005
Springer
13 years 10 months ago
2005
Springer
In Peer-to-Peer networks based on consistent hashing and ring topology each server is responsible for an interval chosen (pseudo-)randomly on a circle. The topology of the network...
IPTPS
2005
Springer
13 years 10 months ago
2005
Springer
In this paper, we present Chainsaw, a p2p overlay multicast system that completely eliminates trees. Peers are notified of new packets by their neighbors and must explicitly requ...
IPTPS
2005
Springer
13 years 10 months ago
2005
Springer