Name
Title | ||
|---|---|---|
Convex optimization of output link scheduling and active queue management in QoS constrained packet switches |
Abstract | ||
|---|---|---|
We present two novel algorithms at the ingress and egress of packet switches with QoS provisioning and fairness constraints. We first provide a suite of generalized weighted fair queuing formulations for output link scheduling, where the weights can be dynamically optimized under QoS constraints using the tool of geometric programming. We then provide a suite of active queue management formulations for flexible ingress buffer management, using the tool of semifinite programming. Both sets of formulations are nonlinear, and are special cases of convex optimization problems, which can be solved globally and as efficiently as linear problems. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1109/ICC.2002.997223 | ICC |
Keywords | Field | DocType |
packet switching,algorithms,geometric programming,ingress buffer management,output link scheduling,quality of service,active queue management,generalized weighted fair queuing,buffer storage,linear problems,semifinite programming,queueing theory,convex programming,qos fairness constraints,worst queue management matrix,nonlinear formulas,qos provisioning constraints,convex optimization,qos constrained packet switches,linear programming,functional programming,throughput,switches,constraint optimization,weighted fair queuing,dynamic programming,dynamic scheduling | Mathematical optimization,Scheduling (computing),Active queue management,Computer science,Computer network,Real-time computing,Queueing theory,Packet switching,Weighted fair queueing,Geometric programming,Convex optimization,Fair queuing | Conference |
Volume | ISBN | Citations |
4 | 0-7803-7400-2 | 0 |
PageRank | References | Authors |
0.34 | 1 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mung Chiang | 1 | 7303 | 486.32 |
| Bernard L. F. Chan | 2 | 0 | 0.34 |
| Stepiien P. Boyd | 3 | 0 | 0.34 |