Performance and stability of communication networks via robust exponential bounds
IEEE/ACM Transactions on Networking (TON)
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Use of &agr;-stable self-similar stochastic processes for modeling traffic in broadband networks
Performance Evaluation - Special issue on performance and control of network systems
Queueing Systems: Theory and Applications
Analysis on Generalized Stochastically Bounded Bursty Traffic for Communication Networks
LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
Asymptotics of Subexponential Max Plus Networks: the Stochastic Event Graph Case
Queueing Systems: Theory and Applications
Performance Evaluation - Long range dependence and heavy tail distributions
Scaling properties of statistical end-to-end bounds in the network calculus
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
A survey of envelope processes and their applications in quality of service provisioning
IEEE Communications Surveys & Tutorials
Invited Fluid queues with long-tailed activity period distributions
Computer Communications
Stochastically bounded burstiness for communication networks
IEEE Transactions on Information Theory
On the use of fractional Brownian motion in the theory of connectionless networks
IEEE Journal on Selected Areas in Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Symptotics: a framework for analyzing the scalability of real-world wireless networks
Proceedings of the 9th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
| Hi-index | 0.00 |
Traffic with self-similar and heavy-tailed characteristics has been widely reported in networks, yet, only few analytical results are available for predicting the delay performance of such networks. We address a particularly difficult type of heavy-tailed traffic where only the first moment can be computed, and present the first non-asymptotic end-to-end delay bounds for such traffic. The derived performance bounds are non-asymptotic in that they do not assume a steady state, large buffer, or many sources regime. Our analysis considers a multihop path of fixed-capacity links with heavy-tailed self-similar cross traffic at each node. A key contribution of the analysis is a probabilistic sample-path bound for heavy-tailed arrival and service processes, which is based on a scale-free sampling method. We explore how delays scale as a function of the length of the path, and compare them with lower bounds. A comparison with simulations illustrates pitfalls when simulating self-similar heavytailed traffic, providing further evidence for the need of analytical bounds.