Scaling all-pairs overlay routing

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

• Type: Conference
• Year: 2009
• Where: CONEXT
• Authors: David Sontag, Yang Zhang, Amar Phanishayee, David G. Andersen, David Karger
• Keywords: Computer Networks, CONEXT 2009, Efficient One-hop Link-state, Exchanges Routing State, Node