 
Summary: Scaling AllPairs Overlay Routing
David Sontag, Yang Zhang, Amar Phanishayee, David G. Andersen, David Karger
Massachusetts Institute of Technology, Carnegie Mellon University
ABSTRACT
This paper presents and experimentally evaluates a new algorithm
for efficient onehop linkstate routing in fullmesh 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 onehop 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 largescale, globally dis
tributed set of Internet hosts. The reduced communication overhead
from using our improved fullmesh algorithm allows the creation of
