An intersection-based multipath routing scheme

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

2 Scopus citations


We consider the problem of choosing multiple paths across an overlay network in order to provide applications with high-throughput data transfer. Approaches based on traditional (link state) routing algorithms involve a substantial (quadratic) overhead for exchange of state information in fully-connected overlays. Moreover, in the absence of coordination, an apparently "good" link may be selected by multiple sessions simultaneously, causing it to become congested. The simple solution-more frequent exchange of state information-only exacerbates the overhead problem. We present an alternative algorithm that uses a lazy approach to collect link state information, and computes paths by finding the intersection of sets of candidate intermediate hops. Results from experiments show that this intersection-based approach produces paths that provide better performance, has significantly lower overhead, and distributes load more evenly through the network than link-state alternatives.

Original languageEnglish
Title of host publicationIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
StatePublished - 2006
EventIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference - San Francisco, CA, United States
Duration: Nov 27 2006Dec 1 2006

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference


ConferenceIEEE GLOBECOM 2006 - 2006 Global Telecommunications Conference
Country/TerritoryUnited States
CitySan Francisco, CA

ASJC Scopus subject areas

  • General Engineering


Dive into the research topics of 'An intersection-based multipath routing scheme'. Together they form a unique fingerprint.

Cite this