
NSF Org: |
CNS Division Of Computer and Network Systems |
Recipient: |
|
Initial Amendment Date: | August 25, 2005 |
Latest Amendment Date: | August 25, 2005 |
Award Number: | 0519442 |
Award Instrument: | Standard Grant |
Program Manager: |
Darleen Fisher
CNS Division Of Computer and Network Systems CSE Directorate for Computer and Information Science and Engineering |
Start Date: | September 1, 2005 |
End Date: | August 31, 2009 (Estimated) |
Total Intended Award Amount: | $300,000.00 |
Total Awarded Amount to Date: | $300,000.00 |
Funds Obligated to Date: |
|
History of Investigator: |
|
Recipient Sponsored Research Office: |
3124 TAMU COLLEGE STATION TX US 77843-3124 (979)862-6777 |
Sponsor Congressional District: |
|
Primary Place of Performance: |
3124 TAMU COLLEGE STATION TX US 77843-3124 |
Primary Place of
Performance Congressional District: |
|
Unique Entity Identifier (UEI): |
|
Parent UEI: |
|
NSF Program(s): | Networking Technology and Syst |
Primary Program Source: |
|
Program Reference Code(s): |
|
Program Element Code(s): |
|
Award Agency Code: | 4900 |
Fund Agency Code: | 4900 |
Assistance Listing Number(s): | 47.070 |
ABSTRACT
In the light of TCP's scalability issues in high bandwidth-delay networks, explicit-feedback congestion control has gained renewed interest in the last several years. Sometimes referred to as Active Queue Management (AQM) congestion control, these algorithms rely on the routers to provide the various types of congestion feedback including changes to the congestion window, packet loss, single-bit congestion indication, queuing delay, and link prices. This information helps end-flows converge their sending rates to some social optimum and achieve a certain optimization objective. Unlike some of the largely ineffective AQM aimed at improving the performance of TCP, properly designed explicit congestion control promises to provide scalability to arbitrary bandwidth (i.e., terabits and petabits per second), tunable link utilization, low delay, zero loss, oscillation-free steady state, and exponential convergence to fairness/efficiency. Such algorithms, once deployed successfully in the Internet, may remain in service for many years to come.
This proposal does not aim to settle the debate of whether or when explicit congestion control can/will be adopted by the Internet, but to explore the various properties of the existing AQM methods (such as XCP, RCP, MKC, AVQ, and MaxNet), propose a new controller that improves the performance of existing approaches in highly heterogeneous network conditions, and evaluate its performance in a network of software and hardware routers.
Broader Impact: Aside from theoretical contributions to delayed and discontinuous stability analysis of congestion control, this project will deliver a low-overhead implementation of the studied methods, educate graduate and undergraduate students, and disseminate the various findings to the public.
PUBLICATIONS PRODUCED AS A RESULT OF THIS RESEARCH
Note:
When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external
site maintained by the publisher. Some full text articles may not yet be available without a
charge during the embargo (administrative interval).
Some links on this page may take you to non-federal websites. Their policies may differ from
this site.
Please report errors in award information by writing to: awardsearch@nsf.gov.