Convex optimization of output link scheduling and active queue management in QoS constrained packet switches

Mung Chiang, Bernard L.F. Chan, Stephen Boyd

Research output: Contribution to journalConference article

3 Scopus citations

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 semefinite 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.

Original languageEnglish (US)
Pages (from-to)2126-2130
Number of pages5
JournalIEEE International Conference on Communications
Volume4
StatePublished - Jan 1 2002
Event2002 International Conference on Communications (ICC 2002) - New York, NY, United States
Duration: Apr 28 2002May 2 2002

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Convex optimization of output link scheduling and active queue management in QoS constrained packet switches'. Together they form a unique fingerprint.

  • Cite this