Managing clouds: a case for a fresh look at large unreliable dynamic networks
ACM SIGOPS Operating Systems Review
The promise, and limitations, of gossip protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Compositional gossip: a conceptual architecture for designing gossip-based applications
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Exploiting the synergy between gossiping and structured overlays
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Stochastic maintenance of overlays in structured P2P systems
Computer Communications
Bootstrapping large-scale DHT networks
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
T-Man: Gossip-based fast overlay topology construction
Computer Networks: The International Journal of Computer and Telecommunications Networking
CNP: A Protocol for Reducing Maintenance Cost of Structured P2P
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
O(log n)-time overlay network construction from graphs with out-degree 1
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Peer to peer multidimensional overlays: approximating complex structures
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Decentralized, connectivity-preserving, and cost-effective structured overlay maintenance
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
Cross-layer Mobile Chord P2P protocol design for VANET
International Journal of Ad Hoc and Ubiquitous Computing
Re-Chord: a self-stabilizing chord overlay network
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
DISC'06 Proceedings of the 20th international conference on Distributed Computing
Tiara: A self-stabilizing deterministic skip list and skip graph
Theoretical Computer Science
T-Man: gossip-based overlay topology management
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
| Hi-index | 0.00 |
Structured peer-to-peer overlay networks are now an established paradigm for implementing a wide range of distributed services. While the problem of maintaining these networks in the presence of churn and other failures is the subject of intensive research, the problem of building them from scratch has not been addressed (apart from individual nodes joining an already functioning overlay). In this paper we address the problem of jump-starting a popular structured overlay, Chord, from scratch. This problem is of crucial importance in scenarios where one is assigned a limited time interval in a distributed environment such as Planet-Lab, or a Grid, and the overlay infrastructure needs to be set up from the ground up as quickly and efficiently as possible, or when a temporary overlay has to be generated to solve a specific task on demand. We introduce T-CHORD, that can build a Chord network efficiently starting from a random unstructured overlay. After jump-starting, the structured overlay can be handed over to the Chord protocol for further maintenance. We demonstrate through extensive simulation experiments that the proposed protocol can create a perfect Chord topology in a logarithmic number of steps. Furthermore, using a simple extension of the protocol, we can optimize the network from the point of view of message latency.