Igor Anatolyevich Ganichev and Dai BIn and Philip Brighten Godfrey and Scott Shenker

EECS Department, University of California, Berkeley

Technical Report No. UCB/EECS-2009-150

October 30, 2009

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-150.pdf

As the Internet is now a critical component of our information infrastructure, several recent papers have proposed using multipath routing for increase the Internet’s reliability, and to give users greater control over the service they receive. However, the paths chosen by these protocols are not guaranteed to have high diversity. In this paper, we propose yet another multipath routing scheme (YAMR) for the interdomain case. YAMR provably constructs a set of paths that is resilient to any one inter-domain link failure, thus achieving high reliability in a systematic way. Further, even though YAMR maintains more paths that BGP, it actually requires significantly less control traffic, thus alleviating instead of worsening the Internet scalability. This reduction in churn is achieved by a novel hiding technique that automatically localize failures leaving the greater part of the Internet completely oblivious.

---

BibTeX citation:

@techreport{Ganichev:EECS-2009-150,
    Author= {Ganichev, Igor Anatolyevich and BIn, Dai and Godfrey, Philip Brighten and Shenker, Scott},
    Title= {YAMR: Yet Another Multipath Routing Protocol},
    Year= {2009},
    Month= {Oct},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-150.html},
    Number= {UCB/EECS-2009-150},
    Abstract= {As the Internet is now a critical component of our information infrastructure, several recent papers have proposed using multipath routing for increase the Internet’s reliability, and to give users greater control over the service they receive. However, the paths chosen by these protocols are not guaranteed to have high diversity. In this paper, we propose yet another multipath routing scheme (YAMR) for the interdomain case. YAMR provably constructs a set of paths that is resilient to any one inter-domain link failure, thus achieving high reliability in a systematic way. Further, even though YAMR maintains more paths that BGP, it actually requires significantly less control traffic, thus alleviating instead of worsening the Internet scalability. This reduction in churn is achieved by a novel hiding technique that automatically
localize failures leaving the greater part of the Internet completely oblivious.},
}

EndNote citation:

%0 Report
%A Ganichev, Igor Anatolyevich 
%A BIn, Dai 
%A Godfrey, Philip Brighten 
%A Shenker, Scott 
%T YAMR: Yet Another Multipath Routing Protocol
%I EECS Department, University of California, Berkeley
%D 2009
%8 October 30
%@ UCB/EECS-2009-150
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2009/EECS-2009-150.html
%F Ganichev:EECS-2009-150