Graph theory and its applications
Graph theory and its applications
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer 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
An investigation of geographic mapping techniques for internet hosts
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Early measurements of a cluster-based architecture for P2P systems
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
Squirrel: a decentralized peer-to-peer web cache
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A local search mechanism for peer-to-peer networks
Proceedings of the eleventh international conference on Information and knowledge management
IEEE Internet Computing
Brocade: Landmark Routing on Overlay Networks
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
Routing Indices For Peer-to-Peer Systems
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Building Topology-Aware Overlays Using Global Soft-State
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Making Search Efficient on Gnutella-Like P2P Systems
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Exploiting locality for scalable information retrieval in peer-to-peer networks
Information Systems
Large-scale service overlay networking with distance-based clustering
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
pFusion: A P2P Architecture for Internet-Scale Content-Based Search and Retrieval
IEEE Transactions on Parallel and Distributed Systems
GMAC: An overlay multicast network for mobile agent platforms
Journal of Parallel and Distributed Computing
A Read-Only Distributed Hash Table
Journal of Grid Computing
Hi-index | 0.00 |
Overlay networks are application layer systems which facilitate users in performing distributed functions such as searches over the contents of other users. An important problem in such networks is that the connections among peers are arbitrary, leading in that way to a topology structure, which does not match the underlying physical topology. This topology mismatch leads to large user experienced delays, degraded performance and excessive resource consumption in Wide Area Networks. In this work we propose and evaluate the Distributed Domain Name Order (DDNO) technique, which makes unstructured overlay networks topologically aware. In DDNO, a node devotes half of its connections to nodes that share the same domain-name and the remaining half connections to random nodes. The former connections achieve good performance, because the bulk of the overlay traffic is kept within the same domain, while the latter connections ensure that the topology structure remains connected. Discovery of nodes in the same domain is achieved through on-demand lookup messages, which are guided by local ZoneCaches. Our technique is entirely decentralized making it appropriate for use in Wide Area Networks. Our simulation results, which are based on a real dataset of Internet latencies, indicate that DDNO outperforms other proposed techniques and that it optimizes many desirable properties such as end-to-end delays, connectivity and diameter.