Scaling all-pairs overlay routing

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 (n[superscript 2]) communication overhead to broadcast its link state to all other nodes. In...

Full description

Bibliographic Details
Main Authors: Sontag, David Alexander, Zhang, Yang, Phanishayee, Amar, Andersen, David G., Karger, David R.
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:en_US
Published: Association for Computing Machinery (ACM) 2012
Online Access:http://hdl.handle.net/1721.1/73003
https://orcid.org/0000-0002-0024-5847

Internet

http://hdl.handle.net/1721.1/73003
https://orcid.org/0000-0002-0024-5847

Similar Items