On superlinear scaling of network delays

Authors:
Almut Burchard;Jörg Liebeherr;Florin Ciucu
Affiliations:
Department of Mathematics, University of Toronto, Toronto, ON, Canada;Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada;Deutsche Telekom Laboratories, Berlin, Germany
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2011

Citing 13
Cited 4

Performance and stability of communication networks via robust exponential bounds

IEEE/ACM Transactions on Networking (TON)
Performance bounds in communication networks with variable-rate links

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Performance bonds for flow control protocols

IEEE/ACM Transactions on Networking (TON)
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
Performance Guarantees in Communication Networks

Performance Guarantees in Communication Networks
A Service-Curve Model with Loss and a Multiplexing Problem

ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
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 network calculus with effective bandwidth

IEEE/ACM Transactions on Networking (TON)
Stochastic Network Calculus

Stochastic Network Calculus
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
Quality of service guarantees in virtual circuit switched networks

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
Sharp bounds in stochastic network calculus

Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
On applying stochastic network calculus

Frontiers of Computer Science: Selected Publications from Chinese Universities

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate scaling properties of end-to-end delays in packet networks for a flow that traverses a sequence of H nodes and that experiences cross traffic at each node. When the traffic flow and the cross traffic do not satisfy independence assumptions, we find that delay bounds scale faster than linearly. More precisely, for exponentially bounded packetized traffic, we show that delays grow with Θ(H log H) in the number of nodes on the network path. This superlinear scaling of delays is qualitatively different from the scaling behavior predicted by a worst-case analysis or by a probabilistic analysis assuming independence of traffic arrivals at network nodes.