Dependence in packet queues
暂无分享,去创建一个
[1] Ward Whitt,et al. Characterizing Superposition Arrival Processes in Packet Multiplexers for Voice and Data , 1986, IEEE J. Sel. Areas Commun..
[2] R. M. Loynes,et al. The stability of a queue with non-independent inter-arrival and service times , 1962, Mathematical Proceedings of the Cambridge Philosophical Society.
[3] Martin I. Reiman,et al. Open Queueing Networks in Heavy Traffic , 1984, Math. Oper. Res..
[4] Donald R. Smith,et al. An Asymptotic Analysis of a Queueing System with Markov-Modulated Arrivals , 1986, Oper. Res..
[5] W. Whitt. Comparing batch delays and customer delays , 1983, The Bell System Technical Journal.
[6] Ward Whitt,et al. Ordinary CLT and WLLN Versions of L = λW , 1988, Math. Oper. Res..
[7] S. Calo. Message Delays in Repeated-Service Tandem Connections , 1981, IEEE Trans. Commun..
[8] P. Billingsley,et al. Convergence of Probability Measures , 1969 .
[9] Ward Whitt,et al. Some Useful Functions for Functional Limit Theorems , 1980, Math. Oper. Res..
[10] D. Iglehart,et al. The Equivalence of Functional Central Limit Theorems for Counting Processes and Associated Partial Sums , 1971 .
[11] J. Kingman. On Queues in Heavy Traffic , 1962 .
[12] W. Whitt. Queues with superposition arrival processes in heavy traffic , 1985 .
[13] P. J. Fleming,et al. An approximate analysis of sojourn times in the M/G/1 queue with round-robin service discipline , 1984, AT&T Bell Laboratories Technical Journal.
[14] A. Paulson,et al. The effect of correlated exponential service times on single server tandem queues , 1977 .
[15] W. Whitt,et al. The Queueing Network Analyzer , 1983, The Bell System Technical Journal.
[16] Ward Whitt,et al. Heavy Traffic Limit Theorems for Queues: A Survey , 1974 .
[17] Aleksandr Alekseevich Borovkov,et al. Stochastic processes in queueing theory , 1976 .
[18] John Frank Charles Kingman,et al. The single server queue in heavy traffic , 1961, Mathematical Proceedings of the Cambridge Philosophical Society.
[19] D. Iglehart,et al. Multiple channel queues in heavy traffic. II: sequences, networks, and batches , 1970, Advances in Applied Probability.
[20] S. Albin. On Poisson Approximations for Superposition Arrival Processes in Queues , 1982 .
[21] Ronald W. Wolff,et al. Poisson Arrivals See Time Averages , 1982, Oper. Res..
[22] Izhak Rubin. An Approximate Time-Delay Analysis for Packet-Switching Communication Networks , 1976, IEEE Trans. Commun..
[23] Ward Whitt,et al. Measurements and approximations to describe the offered traffic and predict the average workload in a single-server queue , 1989, Proc. IEEE.
[24] B. W. Conolly,et al. The Waiting Time Process for a Certain Correlated Queue , 1968, Oper. Res..
[25] Clyde L. Monma,et al. Backbone Network Design and Performance Analysis: A Methodology for Packet Switching Networks , 1986, IEEE J. Sel. Areas Commun..
[26] David M. Lucantoni,et al. A Markov Modulated Characterization of Packetized Voice and Data Traffic and Related Statistical Multiplexer Performance , 1986, IEEE J. Sel. Areas Commun..
[27] J. Michael Harrison,et al. Brownian Models of Queueing Networks with Heterogeneous Customer Populations , 1988 .
[28] O. Boxma. On a tandem queueing model with identical service times at both counters, II , 1979, Advances in Applied Probability.
[29] Ward Whitt,et al. Approximating a Point Process by a Renewal Process, I: Two Basic Methods , 1982, Oper. Res..
[30] David Y. Burman,et al. A Light-Traffic Theorem for Multi-Server Queues , 1983, Math. Oper. Res..
[31] R. Serfozo. Functional limit theorems for stochastic processes based on embedded processes , 1975, Advances in Applied Probability.
[32] J. F. C. Kingman,et al. Queue Disciplines in Heavy Traffic , 1982, Math. Oper. Res..
[33] Susan L. Albin,et al. Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues , 1984, Oper. Res..