Abstract
AbstractWe consider an acyclic network of single-server queues with heterogeneous processing rates. It is assumed that each queue is fed by the superposition of a large number of i.i.d. Gaussian processes with stationary increments and positive drifts, which can be correlated across different queues. The flow of work departing from each server is split deterministically and routed to its neighbors according to a fixed routing matrix, with a fraction of it leaving the network altogether. We study the exponential decay rate of the probability that the steady-state queue length at any given node in the network is above any fixed threshold, also referred to as the ‘overflow probability’. In particular, we first leverage Schilder’s sample-path large deviations theorem to obtain a general lower bound for the limit of this exponential decay rate, as the number of Gaussian processes goes to infinity. Then, we show that this lower bound is tight under additional technical conditions. Finally, we show that if the input processes to the different queues are nonnegatively correlated, non-short-range dependent fractional Brownian motions, and if the processing rates are large enough, then the asymptotic exponential decay rates of the queues coincide with the ones of isolated queues with appropriate Gaussian inputs.
Funder
Nederlandse Organisatie voor Wetenschappelijk Onderzoek
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Management Science and Operations Research,Computer Science Applications
Reference19 articles.
1. Kilpi, Jorma, Norros, Ilkka: Testing the Gaussian approximation of aggregate traffic. In 2nd ACM SIGCOMM Internet Measurement Workshop, pages 49–61, (2002)
2. Meent, Remco van de, Mandjes, Michel, Pras, Aiko: Gaussian traffic everywhere? In 2006 IEEE International Conference on Communications, pages 573–578, (2006)
3. Botvich, D., Duffield, N.: Large deviations, the shape of loss curve, and economies of scale in large multiplexers. Queueing Syst. 20, 293–320 (1995)
4. Courcoubetis, C., Weber, R.: Buffer overflow asymptotics for a buffer handling many traffic sources. J. Appl. Probab. 33, 886–903 (1996)
5. Addie, R., Mannersalo, P., Norros, I.: Most probable paths and performance formulae for buffers with Gaussian input traffic. Eur. Trans. Telecommun. 13, 183–196 (2002)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献