Abstract
Generalized Processor Sharing (GPS) is an important scheduling discipline because it enables bandwidth sharing with work conservation and traffic isolation properties. While Markov Modulated Fluid Processes (MMFP) capture the dynamics of the sources, the analysis of such sources with a GPS server is difficult because of the large state space. In this paper, we study a multi-queue GPS system with MMFP classes and propose a scalable, low complexity algorithm for the tail distributions of the logical queues. The effective bandwidth of the classes and a simple Connection Admission Control (CAC) scheme are derived. Numerical results illustrate the efficiency and accuracy of the technique. The application to an example system of classes consisting of voice and variable-bitrate (VBR) video traffic is included.
Original language | English (US) |
---|---|
Pages | 2341-2346 |
Number of pages | 6 |
State | Published - 2001 |
Event | IEEE Global Telecommunicatins Conference GLOBECOM'01 - San Antonio, TX, United States Duration: Nov 25 2001 → Nov 29 2001 |
Other
Other | IEEE Global Telecommunicatins Conference GLOBECOM'01 |
---|---|
Country/Territory | United States |
City | San Antonio, TX |
Period | 11/25/01 → 11/29/01 |
Keywords
- Effective Bandwidth
- Generalized Processor Sharing
- Markov Modulated Fluid Process
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Global and Planetary Change