On the Stochastic End-to-End Delay Analysis in Sink Trees Under Independent and Dependent Arrivals

DOI10.1007/978-3-030-43024-5_9zbMath1484.68020OpenAlexW3011846608MaRDI QIDQ5014505

Paul Nikolaus, Jens B. Schmitt

Publication date: 8 December 2021

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-43024-5_9

zbMATH Keywords

fractional Brownian motionHölder's inequalitynetwork calculusmoment-generating functionssink trees

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Wireless sensor networks as related to computer science (68M18)

Cites Work

• Tight performance bounds in the worst-case analysis of feed-forward networks
• Stability, queue length, and delay of deterministic and stochastic queueing networks
• On the equivalent bandwidth of self-similar sources
• Delay Bounds in Communication Networks With Heavy-Tailed and Self-Similar Traffic
• Analytic Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Stochastic End-to-End Delay Analysis in Sink Trees Under Independent and Dependent Arrivals