Abstract
We present a systematic treatment of efficient non-linear optimizations of queuing systems. The suite of formulations uses the computational tool of convex optimization, with fast polynomial time algorithms to obtain the global optimum for these nonlinear problems under various constraints. We first show convexity structures of several queuing systems, including some surprising transition patterns, followed by formulating and showing numerical examples of several convex performance optimizations for both single queues and queuing networks. Blocking probability minimization and service rate allocation through the effective bandwidth approach is also presented.
| Original language | English (US) |
|---|---|
| Pages | 2425-2429 |
| Number of pages | 5 |
| State | Published - 2002 |
| Event | GLOBECOM'02 - IEEE Global Telecommunications Conference - Taipei, Taiwan, Province of China Duration: Nov 17 2002 → Nov 21 2002 |
Other
| Other | GLOBECOM'02 - IEEE Global Telecommunications Conference |
|---|---|
| Country/Territory | Taiwan, Province of China |
| City | Taipei |
| Period | 11/17/02 → 11/21/02 |
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering
- Global and Planetary Change