Sciweavers

456 search results - page 40 / 92
» On Routing in Distributed Hash Tables
Sort
View
GLOBECOM
2008
IEEE
14 years 1 days ago
Evaluating P2PSIP under Attack: An Emulative Study
— Recently, establishing a VoIP call using a P2P network instead of regular SIP-servers has been proposed; this novel approach to SIP-signaling is commonly referred to as P2PSIP ...
Jan Seedorf, Frank Ruwolt, Martin Stiemerling, Sav...
PODC
2003
ACM
14 years 4 months ago
Compact roundtrip routing with topology-independent node names
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
Marta Arias, Lenore Cowen, Kofi A. Laing
SPAA
2006
ACM
14 years 4 months ago
Towards a scalable and robust DHT
The problem of scalable and robust distributed data storage has recently attracted a lot of attention. A common approach in the area of peer-to-peer systems has been to use a dist...
Baruch Awerbuch, Christian Scheideler
COMPSAC
2004
IEEE
14 years 2 months ago
Spatial Data Query Support in Peer-to-Peer Systems
Recently distributed hash table (DHT) mechanisms have been proposed to manage data in very large, structured peer-to-peer (P2P) systems. DHT algorithms provide efficient exact-mat...
Roger Zimmermann, Wei-Shinn Ku, Haojun Wang
USITS
2003
14 years 9 days ago
Using Random Subsets to Build Scalable Network Services
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participan...
Dejan Kostic, Adolfo Rodriguez, Jeannie R. Albrech...