NSDI '05 Abstract
Negotiation-Based Routing Between Neighboring ISPs
Ratul Mahajan, David Wetherall, and Thomas Anderson, University of Washington
We explore negotiation as
the basis for
cooperation between competing entities, for the specific case of
routing between two neighboring ISPs. Interdomain routing is often
driven by self-interest and based on a limited view of the
internetwork, which hurts the stability and efficiency of routing. We
present a negotiation framework in which adjacent ISPs share
information using coarse preferences and jointly decide the paths for
the traffic flows they exchange. Our framework enables pairs of ISPs
to agree on routing paths based on their specific relationship, even
if they have different optimization criteria. We use simulation with
over sixty measured ISP topologies to evaluate our framework. We find
that the quality of negotiated routing is close to that of globally
optimal routing that uses complete, detailed information about both
ISPs. We also find that ISPs have incentive to negotiate because both
of them benefit compared to routing independently based on local
- View the full text of this paper in HTML and PDF.
Until May 2005, you will need your USENIX membership identification in order to access the full papers. The Proceedings are published as a collective work, © 2005 by the USENIX Association. All Rights Reserved. Rights to individual papers remain with the author or the author's employer. Permission is granted for the noncommercial reproduction of the complete work for educational or research purposes. USENIX acknowledges all trademarks within this paper.
- If you need the latest Adobe Acrobat Reader, you can download it from Adobe's site.