| Autor: | Michel Mandjes, Krishnan Kumaran |
|---|---|
| Rok vydání: | 2001 |
| Předmět: |
Mathematical optimization
Queueing theory Computer science Real-time computing Regular polygon Management Science and Operations Research Convexity Computer Science Applications Computer Science::Performance Computational Theory and Mathematics Layered queueing network Bandwidth (computing) Large deviations theory Constant (mathematics) Generalized processor sharing |
| Zdroj: | Queueing Systems. 38:471-483 |
| ISSN: | 0257-0130 |
| Popis: | To achieve a constant overflow probability, the two queueing resources, viz. buffer and bandwidth, can be traded off. In this paper we prove that, under general circumstances, the corresponding trade-off curve is convex in the ‘many-sources scaling’. This convexity enables optimal resource partitioning in a queueing system supporting heterogeneous traffic, with heterogeneous quality-of-service requirements. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink