Bounds and approximations for the periodic on/off queue with applications to ATM traffic control
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
Smoothing, statistical multiplexing, and call admission control for stored video
IEEE Journal on Selected Areas in Communications
Equilibrium bandwidth and buffer allocations for elastic traffics
IEEE/ACM Transactions on Networking (TON)
Performance and fluid simulations of a novel shared buffer management system
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Chernoff bounds for mean overflow rates
Queueing Systems: Theory and Applications
A min, + system theory for constrained traffic regulation and dynamic service guarantees
IEEE/ACM Transactions on Networking (TON)
Allocating commodity resources in aggregate traffic networks
Performance Evaluation
On the time scales in video traffic characterization for queueing behavior
Computer Communications
On the aggregation of deterministic service flows
Computer Communications
| Hi-index | 0.02 |
In this paper, we study the problem of resource allocation and control for an ATM node with regulated traffic. Both guaranteed lossless service and statistical service with small loss probability are considered. We investigate the relationship between source characteristics and the buffer/bandwidth trade-off under both services.Our contributions are the following. For guaranteed lossless service, we find that the optimal resource allocation scheme suggests a time scale separation of sources sharing an ATM node with finite bandwidth and buffer space, with the optimal buffer/bandwidth trade-off is determined by the sources' time scale. For statistical service with a small loss probability, we present a new approach for estimating the loss probability in a shared buffer multiplexor with the so called ``extremal'' on-off, periodic sources. Under this approach, the optimal resource allocation for statistical service is achieved by maximizing both the benefits of buffering sharing and bandwidth sharing. The optimal buffer/bandwidth trade-off is again determined by time scale separation.Besides their obvious application to resource allocation and call admission control, our results have many other implications in network design and control such as network dimensioning and traffic shaping.