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.
|Number of pages||13|
|Publication status||Published - 1 Aug 2001|
- Large deviations
- Generalized processor sharing
- resource partitioning
- buffer-bandwidth trade-off