Performance and stability of communication networks via robust exponential bounds
IEEE/ACM Transactions on Networking (TON)
Improved loss calculations at an ATM multiplexer
IEEE/ACM Transactions on Networking (TON)
Loss probability calculations and asymptotic analysis for finite buffer multiplexers
IEEE/ACM Transactions on Networking (TON)
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Many-Sources Delay Asymptotics with Applications to Priority Queues
Queueing Systems: Theory and Applications
A min, + system theory for constrained traffic regulation and dynamic service guarantees
IEEE/ACM Transactions on Networking (TON)
Computing Loss Probabilities in Discrete-Time Queues
Operations Research
Stochastic Network Calculus
Perspectives on router buffer sizing: recent results and open problems
ACM SIGCOMM Computer Communication Review
Performance Modeling, Loss Networks, and Statistical Multiplexing
Performance Modeling, Loss Networks, and Statistical Multiplexing
BufferBloat: what's wrong with the internet?
Communications of the ACM
Statistical service assurances for traffic scheduling algorithms
IEEE Journal on Selected Areas in Communications
Loss performance analysis of an ATM multiplexer loaded with high-speed on-off sources
IEEE Journal on Selected Areas in Communications
On applying stochastic network calculus
Frontiers of Computer Science: Selected Publications from Chinese Universities
Hi-index | 0.00 |
The literature on queueing systems with finite buffers addresses mostly asymptotic performance metrics on an aggregate flow, and/or generally relies on a convenient, but provably inaccurate, approximation of the loss probability by the overflow probability in an infinite size buffer. This paper addresses non-asymptotic per-flow metrics in a multi-flow queueing system with finite buffer and FIFO scheduling. The analysis dispenses with the above approximation, and lends itself to several interesting insights on the impact of finite buffers on per-flow metrics. Counterintuitively, the per-flow delay distribution is not monotonous in the buffer size, and such an effect is especially visible in high burstiness regimes. Another observation is that buffer dimensioning becomes insensitive to the type of SLA constraint, e.g., fixed violation probability on either loss or delay, in high multiplexing regimes. In the particular case of aggregate scheduling, the results on the aggregate input flow significantly improve upon existing results by capturing the manifestation of bufferless multiplexing in regimes with many flows.