On the performance of multiplexing independent regulated inputs
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Large deviations ordering of point processes in some queueing networks
Queueing Systems: Theory and Applications
The output of a switch, or, effective bandwidths for networks
Queueing Systems: Theory and Applications
Large Deviations for Small Buffers: An Insensitivity Result
Queueing Systems: Theory and Applications
A network service curve approach for the stochastic analysis of networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
The burstiness behavior of regulated flows in networks
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Application of network calculus to guaranteed service networks
IEEE Transactions on Information Theory
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
A calculus for network delay. II. Network analysis
IEEE Transactions on Information Theory
Large deviations approximation for fluid queues fed by a large number of on/off sources
IEEE Journal on Selected Areas in Communications
Perspectives on network calculus: no free lunch, but still good value
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Perspectives on network calculus: no free lunch, but still good value
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
On the impact of storage in residential power distribution systems
ACM SIGMETRICS Performance Evaluation Review
| Hi-index | 0.00 |
By characterizing the worst-case profile, which maximizes the content of a buffer fed with leaky bucket regulated flows in packet telecommunication networks, we derive a tight upper bound in the many-sources regime for the tail distribution of the workload generated by these flows in a FIFO queue with constant service rate. Furthermore, we compare this workload distribution with an M/G/1 queue and get insights on the better-than-Poisson property of regulated flows. We conclude that the superposition of independent regulated flows generates an asymptotically smaller workload than a marked Poisson process whose service times and intensity depend on the parameters of regulated sources.