Large deviations approximation for fluid queues fed by a large number of on/off sources
IEEE Journal on Selected Areas in Communications
The variation of optimal bandwidth and buffer allocation with the number of sources
IEEE/ACM Transactions on Networking (TON)
How expensive is link utilization?
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Trading link utilization for queueing delays: An adaptive approach
Computer Communications
A Method for Approximating Univariate Convex Functions Using Only Function Value Evaluations
INFORMS Journal on Computing
On the effectiveness of the many-sources asymptotic for admission control
Computer Communications
Convexity properties of loss and overflow functions
Operations Research Letters
| Hi-index | 0.00 |
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.