PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The end-to-end effects of Internet path selection
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
On the constancy of internet path properties
IMW '01 Proceedings of the 1st ACM SIGCOMM Workshop on Internet Measurement
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
IEEE Transactions on Knowledge and Data Engineering
Backup Path Allocation Based on a Correlated Link Failure Probability Model in Overlay Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
A routing underlay for overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Search with Probabilistic Guarantees in Unstructured Peer-to-Peer Networks
P2P '05 Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing
Scalable routing overlay networks
ACM SIGOPS Operating Systems Review
Improving the reliability of internet paths with one-hop source routing
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
One hop reputations for peer to peer file sharing workloads
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Symbiotic relationships in internet routing overlays
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Census: location-aware membership management for large-scale distributed systems
USENIX'09 Proceedings of the 2009 conference on USENIX Annual technical conference
Practical locality-awareness for large scale information sharing
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Finding routing shortcuts using an internet coordinate system
IWSOS'11 Proceedings of the 5th international conference on Self-organizing systems
Automatic creation of VPN backup paths for improved resilience against BGP-attackers
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Adding resilience to message oriented middleware
Proceedings of the 2nd International Workshop on Software Engineering for Resilient Systems
Hi-index | 0.00 |
This paper presents and experimentally evaluates a new algorithm for efficient one-hop link-state routing in full-mesh networks. Prior techniques for this setting scale poorly, as each node incurs quadratic (n2) communication overhead to broadcast its link state to all other nodes. In contrast, in our algorithm each node exchanges routing state with only a small subset of overlay nodes determined by using a quorum system. Using a two round protocol, each node can find an optimal one-hop path to any other node using only n1.5 per-node communication. Our algorithm can also be used to find the optimal shortest path of arbitrary length using only n1.5 logn per-node communication. The algorithm is designed to be resilient to both node and link failures. We apply this algorithm to a Resilient Overlay Network (RON) system, and evaluate the results using a large-scale, globally distributed set of Internet hosts. The reduced communication overhead from using our improved full-mesh algorithm allows the creation of all-pairs routing overlays that scale to hundreds of nodes, without reducing the system's ability to rapidly find optimal routes.