Slick packets

  • Authors:
  • Giang T.K. Nguyen;Rachit Agarwal;Junda Liu;Matthew Caesar;P. Brighten Godfrey;Scott Shenker

  • Affiliations:
  • University of Illinois at Urbana-Champaign, Urbana-Champaign, USA;University of Illinois at Urbana-Champaign, Urbana-Champaign, USA;University of California at Berkeley, Berkeley, USA;University of Illinois at Urbana-Champaign, Urbana-Champaign, USA;University of Illinois at Urbana-Champaign, Urbana-Champaign, USA;University of California at Berkeley, Berkeley, USA

  • Venue:
  • Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Source-controlled routing has been proposed as a way to improve flexibility of future network architectures, as well as simplifying the data plane. However, if a packet specifies its path, this precludes fast local re-routing within the network. We propose SlickPackets, a novel solution that allows packets to slip around failures by specifying alternate paths in their headers, in the form of compactly-encoded directed acyclic graphs. We show that this can be accomplished with reasonably small packet headers for real network topologies, and results in responsiveness to failures that is competitive with past approaches that require much more state within the network. Our approach thus enables fast failure response while preserving the benefits of source-controlled routing.