Sciweavers

1503 search results - page 206 / 301
» Self-optimizing distributed trees
Sort
View
140
Voted
SIGCOMM
2005
ACM
15 years 9 months ago
A case study in building layered DHT applications
Recent research has shown that one can use Distributed Hash Tables (DHTs) to build scalable, robust and efficient applications. One question that is often left unanswered is that ...
Yatin Chawathe, Sriram Ramabhadran, Sylvia Ratnasa...
IWDC
2005
Springer
117views Communications» more  IWDC 2005»
15 years 9 months ago
Oasis: A Hierarchical EMST Based P2P Network
Peer-to-peer systems and applications are distributed systems without any centralized control. P2P systems form the basis of several applications, such as file sharing systems and ...
Pankaj Ghanshani, Tarun Bansal
PDP
2010
IEEE
15 years 9 months ago
Load Balancing Algorithms with Partial Information Management for the DLML Library
Abstract—Load balancing algorithms are an essential component of parallel computing reducing the response time of applications. Frequently, balancing algorithms have a centralize...
Juan Santana-Santana, Miguel A. Castro-Garcí...
PODC
2003
ACM
15 years 9 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
ICDCS
2002
IEEE
15 years 9 months ago
On the Performance of Group Key Agreement Protocols
Group key agreement is a fundamental building block for secure peer group communication systems. Several group key agreement protocols were proposed in the last decade, all of the...
Yair Amir, Yongdae Kim, Cristina Nita-Rotaru, Gene...