Positive correlations and buffer occupancy: lower bounds via supermodular ordering

Proceedings - IEEE INFOCOM - Tập 3 - Trang 1298-1306 vol.3
S. Vanichpun1, A.A. Makowski1
1Department of Electrical and Computer Engineering, University of Maryland, College Park, USA

Tóm tắt

We use recent advances from the theory of multivariate stochastic orderings to formalize the "folk theorem" to the effect that positive correlations lead to increased buffer occupancy and larger buffer levels at a discrete-time infinite capacity multiplexer queue. Input sequences are compared in the supermodular (sm) ordering and buffer contents in the increasing convex (icx) ordering, respectively. Three popular classes of (discrete-time) traffic models are discussed, namely the fractional Gaussian noise traffic model, the on-off source model and the M|G|/spl infin/ traffic model. The independent version of an input process in each of these classes of traffic models is a member of the same class. In varying degree of generality, we show that this independent version is smaller than the input sequence itself, and that the corresponding buffer content processes are similarly ordered.

Từ khóa

#Traffic control #Buffer storage #Queueing analysis #Educational institutions #Stochastic systems #Multiplexing #Gaussian noise #Design engineering #Space stations #Contracts

Tài liệu tham khảo

10.1017/S0305004100036781 shaked, 1994, Stochastic Orders and Their Applications 10.1109/90.282603 stoyan, 1984, Comparison Methods for Queues and Other Stochastic Models 10.1287/mnsc.39.3.322 samorodnitsky, 1994, Stable Non-Gaussian Random Processes Stochastic Models With Infinite Variance 10.1002/047120644X.ch10 10.1006/jmva.1997.1656 10.1214/aop/1176993610 willinger, 1995, Self-similarity in high-speed packet traffic: Analysis and modeling of ethernet traffic measurements, Statistical Science, 10, 67, 10.1214/ss/1177010131 10.1109/35.267444 10.1145/190314.190339 10.1017/S0269964800004964 10.1214/aoms/1177698701 vanichpun, 2001, The Effects of Positive Correlations on Buffer Occupancy Comparisons and Lower-Bounds Via Supermodular Ordering 10.1109/49.103559 10.1017/S0269964800002965 10.1002/047120644X.ch9 10.1109/5.650182 10.1023/A:1014629416504 10.1006/jmva.1999.1867 10.1007/BF01158964 2000, Self-Similar Network Traffic and Performance Evaluation parulekar, 1999, Buffer Engineering for M\G\? Input Processes parulekar, 0, Tail probabilities for a multiplexer with self-similar traffic, Proceedings of IEEE INFOCOM '96 San Francisco (CA) April 1996, 1452 parulekar, 1997, Tail probabilities for a multiplexer driven by M\G\? input processes (I): Preliminary asymptotics, Queueing Systems - Theory and Applications, 27, 271, 10.1023/A:1019122400632 barlow, 1975, Statistical theory of reliability and life testing, International Series in Decision Processes agrawal, 1999, On a reduced load equivalence for a multi-fluid buffer under heavy tail assumptions, Queueing Systems Theory and Applications, 33, 5, 10.1023/A:1019111809660 crovella, 1996, Self-similarity in world wide web traffic: Evidence and possible causes, Performance Evaluation Review, 24, 160, 10.1145/233008.233038 10.1109/INFCOM.1995.515973 10.1109/INFCOM.1997.644490 10.1109/26.380206 beran, 1994, Statistics for Long-Memory Processes 10.1002/047120644X.ch7 10.1239/jap/1032265221 10.1109/90.392383 ba?uerle, 1997, Monotonicity results for M R\GI\1 queues, Journal of Applied Probability, 34, 514, 10.2307/3215390 10.1214/aos/1176325765 10.1007/BF01206557