On the scalability of path exploration using opportunistic path-vector routing

Hasan T. Karaoǧlu, Murat Yüksel, Mehmet H. Güneş

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    3 Scopus citations

    Abstract

    It can be argued that, BGP, de-facto inter-domain routing protocol, provides fairly stable routes. Path stability is a desired product of that limited level of deterministic performance of BGP. To attain this performance level, BGP relies on keeping up-to-date (aggregated) global information by incurring the cost of control traffic and delayed convergence. In this work, we developed an Opportunistic Path-Vector (OPVR) protocol which provides nice trade-offs between path stability, routing scalability and path quality to enable flexible inter-domain level routing services. Our approach is to redefine routing problem as a set of smaller scale problems which can be solved locally without requiring a global coordination but local communication. We also provide guidelines on how to solve these localized routing problems efficiently. Our analysis show that our method provide a good compromise between scalability and opportunity through smartly randomized (non-deterministic) choices. Our experiments with OPVRs on Internet AS-level topology show us that OPVRs can provide non-deterministic, scalable path exploration mechanisms with reasonable control traffic cost.

    Original languageEnglish
    Title of host publication2011 IEEE International Conference on Communications, ICC 2011
    DOIs
    StatePublished - 2011
    Event2011 IEEE International Conference on Communications, ICC 2011 - Kyoto, Japan
    Duration: 5 Jun 20119 Jun 2011

    Publication series

    NameIEEE International Conference on Communications
    ISSN (Print)0536-1486

    Conference

    Conference2011 IEEE International Conference on Communications, ICC 2011
    Country/TerritoryJapan
    CityKyoto
    Period5/06/119/06/11

    Fingerprint

    Dive into the research topics of 'On the scalability of path exploration using opportunistic path-vector routing'. Together they form a unique fingerprint.

    Cite this