Fault-tolerant routing in peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
SETI@home: an experiment in public-resource computing
Communications of the ACM
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric
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
The impact of DHT routing geometry on resilience and proximity
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
PlanetLab: an overlay testbed for broad-coverage services
ACM SIGCOMM Computer Communication Review
Performance and Dependability of Structured Peer-to-Peer Overlays
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
OpenDHT: a public DHT service and its uses
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
International Journal of High Performance Computing Applications
The FastTrack overlay: a measurement study
Computer Networks: The International Journal of Computer and Telecommunications Networking - Overlay distribution structures and their applications
Experiences in building and operating ePOST, a reliable peer-to-peer application
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Peer-to-peer communication across network address translators
ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Non-transitive connectivity and DHTs
WORLDS'05 Proceedings of the 2nd conference on Real, Large Distributed Systems - Volume 2
Smartsockets: solving the connectivity problems in grid computing
Proceedings of the 16th international symposium on High performance distributed computing
VTDC '06 Proceedings of the 2nd International Workshop on Virtualization Technology in Distributed Computing
Providing administrative control and autonomy in structured peer-to-peer overlays
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Cluster computing on the fly: P2P scheduling of idle cycles in the internet
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
An Information Brokering Service Provider (IBSP) for Virtual Clusters
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
SocialVPN: Enabling wide-area collaboration with integrated social and overlay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Introducing mobile devices into Grid systems: a survey
International Journal of Web and Grid Services
Experiences with self-organizing, decentralized grids using the grid appliance
Proceedings of the 20th international symposium on High performance distributed computing
| Hi-index | 0.00 |
Self-configuring virtual networks rely on structured P2P routing to provide seamless connectivity among nodes through overlay routing of virtual IP packets, support decentralized hole-punching to establish bi-directional communication links among nodes behind network address translators, and dynamic configuration of virtual IP addresses. Our experiences with deployments of virtual networks in support of wide-area overlays of virtual workstations (WOWs) reveal that connectivity constraints imposed by symmetric NATs and by Internet route outages often hinder P2P overlay structure maintenance and routability, subsequently limiting the ability of WOWs to deliver high-throughput computing through aggregation of resources in different domains. In this paper, we describe and evaluate two novel approaches which are generally applicable and fully decentralized, and show that they improve routability of structured P2P networks in such connectivity constrained environments: (1) a fault-tolerant routing algorithm based on simulated annealing from optimization theory, and (2) tunneling of connections between adjacent nodes (in the P2P identifier space) over common neighbors when direct communication is not possible. Simulation-based analyses show that when pairs of nodes only have 70% chance of being able to communicate directly, the described approaches improve all-to-all routability of the network from 90% to 99%. We have implemented these techniques in the IP-over-P2P (IPOP) virtual network and have conducted experiments with a 180-node WOW Condor pool, demonstrating that, at 81% probability of establishing a pair-wise connection, annealing and tunneling combined allow all nodes to be connected to the pool, compared to only 160 nodes in the absence of these techniques.