IEEE/ACM Transactions on Networking (TON)
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)
Experimental queueing analysis with long-range dependent packet traffic
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Proof of a fundamental result in self-similar traffic modeling
ACM SIGCOMM Computer Communication Review
Self-similarity in World Wide Web traffic: evidence and possible causes
IEEE/ACM Transactions on Networking (TON)
Dynamics of IP traffic: a study of the role of variability and the impact of control
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
On the equivalent bandwidth of self-similar sources
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on modeling and simulation of communication networks
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Analysis on Generalized Stochastically Bounded Bursty Traffic for Communication Networks
LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
Time Scale Analysis of an ATM Queueing System With Long-Range Dependent Traffic
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Scheduling for quality of service guarantees via service curves
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
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
IEEE/ACM Transactions on Networking (TON)
Scaling properties in the stochastic network calculus
Scaling properties in the stochastic network calculus
A network calculus with effective bandwidth
IEEE/ACM Transactions on Networking (TON)
Stochastic Network Calculus
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Sample path bounds for long memory FBM traffic
INFOCOM'10 Proceedings of the 29th conference on Information communications
Non-asymptotic delay bounds for networks with heavy-tailed traffic
INFOCOM'10 Proceedings of the 29th conference on Information communications
Investigating self-similarity and heavy-tailed distributions on a large-scale experimental facility
IEEE/ACM Transactions on Networking (TON)
Survey of deterministic and stochastic service curve models in the network calculus
IEEE Communications Surveys & Tutorials
Stochastically bounded burstiness for communication networks
IEEE Transactions on Information Theory
A calculus for network delay. I. Network elements in isolation
IEEE Transactions on Information Theory
A Min-Plus Calculus for End-to-End Statistical Service Guarantees
IEEE Transactions on Information Theory
Statistical service assurances for traffic scheduling algorithms
IEEE Journal on Selected Areas in Communications
On the use of fractional Brownian motion in the theory of connectionless networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Fractional Brownian motion (fBm) emerged as a useful model for self-similar and long-range dependent aggregate Internet traffic. Asymptotic, respectively, approximate performance measures are known for single queueing systems with fBm through traffic. In this paper end-to-end performance bounds for a through flow in a network of tandem queues under open-loop fBm cross traffic are derived. To this end, a rigorous sample path envelope for fBm is proven that complements previous approximate results. The sample path envelope and the concept of leftover service curves are employed to model the remaining service after scheduling fBm cross traffic at a queuing system. Using composition results for tandem systems from the stochastic network calculus end-to-end statistical performance bounds for individual flows in networks under fBm cross traffic are derived. The discovery is that these bounds grow in On(logn)^1^/^(^2^-^2^H^) for n systems in series where H is the Hurst parameter of the cross traffic. Explicit results on the impact of the variability and the burstiness of through and cross traffic on network performance are shown. Our analysis has direct implications on fundamental questions in network planning and service management.