2011/11/13 by Kishore Angrishi, Angrishi, Kishore, Ulrich Killat +1
Business, Management and Accounting · Computer Science · Decision Sciences · #Advanced Queuing Theory Analysis #FOS: Computer and information sciences #Networking and Internet Architecture (cs.NI) #Probability and Risk Models #Risk and Portfolio Optimization #cs.NI
paper · pdf · doi:10.48550/arxiv.1111.3063
4 pages, 2 figure
openalex publication_date 2011/11/13 · arxiv created 2012/12/10 · arxiv updated 2012/12/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Stochastic network calculus is the probabilistic version of the network calculus, which uses envelopes to perform probabilistic analysis of queueing networks. The accuracy of probabilistic end-to-end delay or backlog bounds computed using network calculus has always been a concern. In this paper, we propose novel end-to-end probabilistic bounds based on demisubmartingale inequalities which improve the existing bounds for the tandem networks of GI/GI/1 queues. In particular, we show that reasonably accurate bounds are achieved by comparing the new bounds with the existing results for a network of M/M/1 queues.