Dual-Resource TCP/AQM for Processing-Constrained Networks

This paper examines congestion control issues for TCP flows that require in-network processing on the fly in network elements such as gateways, proxies, firewalls and even routers. Applications of these flows are increasingly abundant in the future as the Internet evolves. Since these flows require...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking Vol. 16; no. 2; pp. 435 - 449
Main Authors: Minsu Shin, Song Chong, Rhee, I.
Format: Journal Article
Language:English
Published: New York IEEE 01.04.2008
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Approximation
Audio compression
Bandwidth
Cellular phones
Central processing units
Computer science
Congestion
Costs
CPU capacity
efficiency
Explosives
fairness
Internet
Internet telephony
Networks
Optical fiber networks
proportional fairness
Queues
Studies
TCP (protocol)
TCP-AQM
TCP-IP
Throughput
Transcoding
transmission link capacity
ISSN:1063-6692, 1558-2566
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper examines congestion control issues for TCP flows that require in-network processing on the fly in network elements such as gateways, proxies, firewalls and even routers. Applications of these flows are increasingly abundant in the future as the Internet evolves. Since these flows require use of CPUs in network elements, both bandwidth and CPU resources can be a bottleneck and thus congestion control must deal with ldquocongestionrdquo on both of these resources. In this paper, we show that conventional TCP/AQM schemes can significantly lose throughput and suffer harmful unfairness in this environment, particularly when CPU cycles become more scarce (which is likely the trend given the recent explosive growth rate of bandwidth). As a solution to this problem, we establish a notion of dual-resource proportional fairness and propose an AQM scheme, called Dual-Resource Queue (DRQ), that can closely approximate proportional fairness for TCP Reno sources with in-network processing requirements. DRQ is scalable because it does not maintain per-flow states while minimizing communication among different resource queues, and is also incrementally deployable because of no required change in TCP stacks. The simulation study shows that DRQ approximates proportional fairness without much implementation cost and even an incremental deployment of DRQ at the edge of the Internet improves the fairness and throughput of these TCP flows. Our work is at its early stage and might lead to an interesting development in congestion control research.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2007.900415