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)
Effective bandwidths for multiclass Markov fluids and other ATM sources
IEEE/ACM Transactions on Networking (TON)
Charging and accounting for bursty connections
Internet economics
Broadband Network Traffic: Performance Evaluation and Design of Broadband Multiservice Networks: Final Report of Action Cost 242
An exact model for the multiplexing of worst case traffic sources
Proceedings of the Sixth IFIP WG6.3 Conference on Performance of Computer Networks: Data Communications and their Performance
Large deviations approximation for fluid queues fed by a large number of on/off sources
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
On the performance of multiplexing independent regulated inputs
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue: Rare event simulation
A most probable path approach to queueing systems with general Gaussian input
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Advances in modeling and engineering of Longe-Range dependent traffic
Models of Network Access Using Feedback Fluid Queues
Queueing Systems: Theory and Applications
Large Deviation Bounds for Single Class Queueing Networks and Their Calculation
Queueing Systems: Theory and Applications
Queueing Systems: Theory and Applications
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Design and dimensioning of an edge router using Markov model
International Journal of Communication Networks and Distributed Systems
On the effectiveness of the many-sources asymptotic for admission control
Computer Communications
| Hi-index | 0.00 |
We analyse the deviant behavior of a queue fed by a large number of traffic streams. In particular, we explicitly give the most likely trajectory (or ‘optimal path’) to buffer overflow, by applying large deviations techniques. This is done for a broad class of sources, consisting of Markov fluid sources and periodic sources. Apart from a number of ramifications of this result, we present guidelines for the numerical evaluation of the optimal path.