Shan Sinha, Srikanth Kandula, and Dina Katabi
TCP's burstiness is usually regarded as harmful, or at best, inconvenient. This paper adopts a new perspective and examines whether TCP's burstiness is useful for certain applications. It shows that the burstiness can be harnessed to make TCP more robust to packet reordering caused by route change. We define a flowlet as a burst of packets from the same flow followed by an idle interval. We develop a scheme that uses flowlets to split traffic across multiple parallel paths. We show that flowlet switching is an ideal technique for load balancing traffic across multiple paths as it has the accuracy of packet switching, combined with the robustness of flow switching to packet reordering. The accuracy, simplicity, and low-overhead of flowlet switching makes it a strong candidate for replacing the current hash-based schemes used in routers for splitting traffic across multiple links. Further, flowlet switching accurately splits traffic across various paths even when their desired traffic shares vary over time, providing a key component for research in the areas of adaptive multipath routing, adaptive multihoming, and traffic engineering.
|Published in||HotNets Workshop|
|Publisher||Association for Computing Machinery, Inc.|
Copyright © 2007 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or email@example.com. The definitive version of this paper can be found at ACM’s Digital Library --http://www.acm.org/dl/.