Path splicing

Murtaza Motiwala, Megan Elmore, Nick Feamster, Santosh Vempala

Research output: Contribution to journalConference article

83 Scopus citations

Abstract

We present path splicing, a new routing primitive that allows network paths to be constructed by combining multiple routing trees ("slices") to each destination over a single network topology. Path splicing allows traffic to switch trees at any hop en route to the destination. End systems can change the path on which traffic is forwarded by changing a small number of additional bits in the packet header. We evaluate path splicing for intradomain routing using slices generated from perturbed link weights and find that splicing achieves reliability that approaches the best possible using a small number of slices, for only a small increase in latency and no adverse effects on traffic in the network. In the case of interdomain routing, where splicing derives multiple trees from edges in alternate backup routes, path splicing achieves near-optimal reliability and can provide significant benefits even when only a fraction of ASes deploy it. We also describe several other applications of path splicing, as well as various possible deployment paths.

Original languageEnglish (US)
Pages (from-to)27-38
Number of pages12
JournalComputer Communication Review
Volume38
Issue number4
DOIs
StatePublished - Dec 1 2008
EventACM SIGCOMM 2008 Conference on Data Communication, SIGCOMM'08 - Seattle, WA, United States
Duration: Aug 17 2008Aug 22 2008

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications

Keywords

  • Multi-path routing
  • Path diversity
  • Path splicing

Fingerprint Dive into the research topics of 'Path splicing'. Together they form a unique fingerprint.

  • Cite this

    Motiwala, M., Elmore, M., Feamster, N., & Vempala, S. (2008). Path splicing. Computer Communication Review, 38(4), 27-38. https://doi.org/10.1145/1402946.1402963