End-to-end delay analysis for networks with partial assumptions of statistical independence: invited paper

Authors:
Florin Ciucu
Affiliations:
T-Labs/Technische Universität Berlin
Venue:
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Year:
2009

Citing 14
Cited 0

Performance and stability of communication networks via robust exponential bounds

IEEE/ACM Transactions on Networking (TON)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Second moment resource allocation in multi-service networks

SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Performance Guarantees in Communication Networks

Performance Guarantees in Communication Networks
Some properties of variable length packet shapers

IEEE/ACM Transactions on Networking (TON)
Quantitative Characterization of Event Streams in Analysis of Hard Real-Time Applications

Real-Time Systems
Communication nets; stochastic message flow and delay

Communication nets; stochastic message flow and delay
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 basic stochastic network calculus

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A calculus for stochastic QoS analysis

Performance Evaluation
Analysis of manufacturing blocking systems with network calculus

Performance Evaluation
Scaling properties in the stochastic network calculus

Scaling properties in the stochastic network calculus
Network calculus delay bounds in queueing networks with exact solutions

ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
A Min-Plus Calculus for End-to-End Statistical Service Guarantees

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

By accounting for statistical properties of arrivals and service, stochastic formulations of the network calculus yield significantly tighter backlog and delay bounds than those obtained in a purely deterministic framework. This paper proposes a stochastic network calculus formulation which can account for partial assumptions on statistical independence of arrivals and service across multiple network nodes. Scenarios where this can be useful are packet tandem networks with cross traffic and independent arrivals, where identical packet sizes create correlations across the nodes. As an application, the paper investigates the role of partial statistical independence on end-to-end delay bounds in four main scenarios arising by combining assumptions on the statistical independence of arrivals and packet sizes at different network nodes.