Abstract
Given a stochastic ordering between point processes, say that a p.p. N is smooth if it is less than the Poisson process with the same average intensity for this ordering. In this article we investigate whether initially smooth processes retain their smoothness as they cross a network of FIFO ·/D/1 queues along fixed routes. For the so-called strong variability ordering we show that point processes remain smooth as they proceed through a tandem of quasi-saturated (i.e., loaded to 1) M+·/D/1 queues. We then introduce the Large Deviations ordering, which involves comparison of the rate functions associated with Large Deviations Principles satisfied by the point processes. For this ordering, we show that smoothness is retained when the processes cross a feed-forward network of unsaturated ·/D/1 queues. We also examine the LD characteristics of a deterministic p.p. at the output of an M+·/D/1 queue.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. Asmussen, A. Frey, T. Rolski and V. Schmidt, Does Markov-modulation increase the risk?, ASTIN Bull. 25 (1995) 49-66.
F. Baccelli and P. Brémaud, Elements of Queueing Theory (Springer, New York, 1994).
L. Banège and A. Makowski, Large deviations for partial sum processes over finite intervals, submitted to Stochastic Process. Appl.
P. Billingsley, Convergence of Probability Measures (Wiley, New York, 1968).
D.D. Botvich and N.G. Duffield, Large deviations, the shape of the loss curve, and economies of scale in large multiplexers, Queueing Systems 20 (1995) 294-320.
F. Brichet, L. Massoulié and J. Roberts, Stochastic ordering and the notion of negligible CDV, in: Proc. of the 15th Internat. Teletraffic Conf., Washington (1997).
C.S. Chang, Smoothing point processes as a means to increase throughput, Oper. Res. 43 (1995) 117-129.
C.S. Chang, Sample path large deviations and intree networks, Queueing Systems 20 (1995) 7-36.
C. Courcoubetis and R. Weber, Buffer overflow asymptotics for a buffer handling many traffic sources, to appear in J. Appl. Probab.
A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications (Jones and Bartlett, Boston, 1992).
J.D. Deuschel and D.W. Stroock, Large Deviations (Academic Press, Boston, 1989).
R.L. Dobrushin and E.A. Pechersky, Large deviations for random processes with independent increments on infinite intervals, Preprint.
N.G. Duffield and N. O'Connell, Large deviations and overflow probabilities for the general single server queue with applications, Proc. Camb. Phil. Soc. 118 (1995).
J. Lynch and J. Sethuraman, Large deviations for processes with independent increments, Ann. Probab. 15 (1987) 610-627.
W. Matragi, K. Sohraby and C. Bisdikian, Jitter calculus in ATM networks: Single and multiple nodes, in: Proc. of IEEE Infocom (1994) pp. 242-247.
N. O'Connell, Large deviations for departures from a shared buffer, to appear in J. Appl. Probab.
A. Puhalskii, Large deviations analysis of the single server queue, Queueing Systems 21 (1995) 5-66.
J. Roberts, U. Mocci and J. Virtamo, eds., COST 242 Final report, Broadband Network Teletraffic, Lecture Notes in Computer Sciences 1155 (Springer, New York, 1996).
A. Simonian and J. Guibert, Large deviations approximation for fluid queues fed by a large number of on/off sources, IEEE J. Sel. Areas Commun. 13 (1995) 1017-1027.
D. Stoyan, Comparison Methods for Queues and Other Stochastic Models (Wiley, New York, 1983).
R. Szekli, Stochastic Ordering and Dependence in Applied Probability (Springer, New York, 1995).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Massoulié, L. Large deviations ordering of point processes in some queueing networks. Queueing Systems 28, 317–335 (1998). https://doi.org/10.1023/A:1019159408810
Issue Date:
DOI: https://doi.org/10.1023/A:1019159408810