Sciweavers

63 search results - page 2 / 13
» Efficient Routing for Peer-to-Peer Overlays
Sort
View
CCGRID
2003
IEEE
13 years 10 months ago
DKS (N, k, f): A Family of Low Communication, Scalable and Fault-Tolerant Infrastructures for P2P Applications
In this paper, we present DKS(N, k, f), a family of infrastructures for building Peer-To-Peer applications. Each instance of DKS(N, k, f) is a fully decentralized overlay network ...
Luc Onana Alima, Sameh El-Ansary, Per Brand, Seif ...
NSDI
2004
13 years 6 months ago
Efficient Routing for Peer-to-Peer Overlays
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
Anjali Gupta, Barbara Liskov, Rodrigo Rodrigues
ICCCN
2007
IEEE
13 years 9 months ago
Scalable Peer-to-Peer File Sharing with Efficient Complex Query Support
A good P2P file sharing system is usually expected to achieve the following design goals: scalability, routing efficiency and complex query support. In this paper, we propose such ...
Yan Li, Jyoti Ahuja, Li Lao, Jun-Hong Cui
GCC
2003
Springer
13 years 10 months ago
Improving Topology-Aware Routing Efficiency in Chord
Due to their minimum consideration to an actual network topology, the existing peer-to-peer (P2P) overlay networks will lead to high latency and low efficiency. In TaChord, we pres...
Dongfeng Chen, Shoubao Yang
MASCOTS
2010
13 years 6 months ago
Fair Allocation of Substrate Resources among Multiple Overlay Networks
Overlay networks are becoming prevalent in today's networking environment. We consider scenarios where substrate resources are primarily consumed by many overlay networks plac...
Mehmet Demirci, Mostafa H. Ammar