Optimal flow control schemes that regulate the burstiness of traffic
IEEE/ACM Transactions on Networking (TON)
Exact admission control for networks with a bounded delay service
IEEE/ACM Transactions on Networking (TON)
Improved loss calculations at an ATM multiplexer
IEEE/ACM Transactions on Networking (TON)
Control and Performance in Packet, Circuit, and ATM Networks
Control and Performance in Packet, Circuit, and ATM Networks
Admission control of multi-class traffic with service priorities in high-speed networks
Queueing Systems: Theory and Applications
Source Time Scale and Optimal Buffer/Bandwidth Trade-off for Regulated Traffic in an ATM Node
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Network delay analysis of a class of fair queueing algorithms
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
A number of independent traffic streams arrive at a queueing node which provides a finite buffer and a non-idling service at constant rate. Customers which arrive when the buffer is full are dropped and counted as overflows. We present Chernoff type bounds for mean overflow rates in the form of finite-dimensional minimization problems. The results are based on bounds for moment generating functions of buffer and bandwidth usage of the individual streams in an infinite buffer with constant service rate. We calculate these functions for regulated, Poisson and certain on/off sources. The achievable statistical multiplexing gain and the tightness of the bounds are demonstrated by several numerical examples.