By Topic

Price of Asynchrony: Queuing under Ideally Smooth Congestion Control

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Podlesny, M. ; Washington Univ., Saint Louis ; Gorinsky, S.

In this paper, we present a model for investigating lower bounds on queuing under smooth congestion control with overprovisioned buffers. We consider an idealized protocol where all flows always transmit at equal rates. The ideally smooth transmission does not eliminate queuing altogether because packets of different flows might arrive to a node simultaneously due to asynchronous arrivals of the flows, which is intrinsic to computer networks. A prominent feature of our model is its simplicity, making analysis tractable and experiments scalable. Our results reveal steady-state queues of at least O(radicN) packets, where N is the number of flows. Hence, no congestion control protocol is able to avoid losses at a fully utilized link with a constant buffer shared by arbitrarily many flows.

Published in:

Network Protocols, 2007. ICNP 2007. IEEE International Conference on

Date of Conference:

16-19 Oct. 2007