OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Analyzing peer-to-peer traffic across large networks
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Routing Algorithms for DHTs: Some Open Questions
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Building Topology-Aware Overlays Using Global Soft-State
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Location Awareness in Unstructured Peer-to-Peer Systems
IEEE Transactions on Parallel and Distributed Systems
An analysis of internet content delivery systems
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
The emergence of sparse spanners and greedy well-separated pair decomposition
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |
Peer-to-Peer (P2P) computing systems are rapidly growing in importance as the medium of choice for the mass storage. Peers in the most P2P systems randomly choose logical neighbors without any knowledge about underlying physical topology. This mechanism can cause a serious topology mismatch between the P2P overlay network and the underlying network. It greatly limits the performance gain from various search or routing techniques. In this paper, a distributed topology-aware overlays construction algorithm Taonet is proposed, in which the overlay network construction is based on the location information of underlying topology. The nodes that are close in the logical network are also close in terms of network latency. This leads to low latency stretch of the overlay network. This algorithm is scalable and distributed. Simulation results indicate that the latency of data location in these topology-aware P2P systems that are constructed with Taonet can be significantly decreased.