Traditionally, capacity on the Internet has been allocated between competing flows through a distributed fairness calculation implemented by end-to-end congestion control protocols like TCP. Increasingly, however, network operators are deploying fair queuing and other forms of router-based enforcement mechanisms to prevent greedy or misbehaving end points from consuming more than their fair share of the network’s capacity. In environments where fairness is enforced by the network itself, it seems worthwhile to reconsider the role of the congestion control protocol. In particular, we ask if it might be both safe and sensible in the long term for self-interested senders to send at rates that exceed the capacity of the network. Through simulation, we identify and quantify the source of inefficiency in this regime, which we term zombie packets. Surprisingly, we show that such aggressive mechanisms are not only tenable in a wide variety of network structures, but, combined with effective use of erasure coding, they can avoid creating zombie packets and achieve throughputs that approach optimal.
The authors of these documents have submitted their reports to this technical report series for the purpose of non-commercial dissemination of scientific work. The reports are copyrighted by the authors, and their existence in electronic format does not imply that the authors have relinquished any rights. You may copy a report for scholarly, non-commercial purposes, such as research or instruction, provided that you agree to respect the author's copyright. For information concerning the use of this document for other than research or instructional purposes, contact the authors. Other information concerning this technical report series can be obtained from the Computer Science and Engineering Department at the University of California at San Diego, firstname.lastname@example.org.
[ Search ]