Congestion controllers for the Internet can be viewed as
algorithms to solve a problem of resource allocation among competing users.
The resource allocation problem is a convex program, which
we solve using an exact penalty function approach. In an exact
penalty function approach, the system solves a constrained optimization
problem using penalty functions; however, by appropriate choice
of penalty functions, the solution to the penalty formulation coincides exactly
with the solution to the original convex program even
when the penalty is not infinite. This is achieved by tuning the parameters
of the penalty functions so that they converge to the
Lagrange multipliers associated with the constraints in the convex program.
We will show that such an approach naturally
suggests a robust active queue management scheme at the routers which we call
the Adaptive Virtual Queue (AVQ). Under the AVQ scheme, each router maintains
a virtual queue whose capacity is adapted to reach a desired utilization.
References:
S. Kunniyur and R. Srikant.
A time-scale
decomposition approach to adaptive ECN marking.
S. Kunniyur and R. Srikant.
Analysis and Design of an Adaptive Virtual Queue Algorithm for Active Queue Management
Copyright. All Rights Reserved.