论文信息 - A mean-field limit for a class of queueing networks

A mean-field limit for a class of queueing networks

A model of centralized symmetric message-switched networks is considered, where the messages having a common address must be served in the central node in the order which corresponds to their epochs of arrival to the network. The limitN → ∞ is discussed, whereN is the branching number of the network graph. This procedure is inspired by an analogy with statistical mechanics (the mean-field approximation). The corresponding limit theorems are established and the limiting probability distribution for the network response time is obtained. Properties of this distribution are discussed in terms of an associated boundary problem.

[1] Leonard Kleinrock,et al. Communication Nets: Stochastic Message Flow and Delay , 1964 .

[2] S. Dharmadhikari,et al. BOUNDS ON MOMENTS OF CERTAIN RANDOM VARIABLES , 1969 .

[3] V. V. Petrov. Sums of Independent Random Variables , 1975 .

[4] P. K. Pollett,et al. Some distributional approximations in Markovian queueing networks , 1982, Advances in Applied Probability.

[5] V. Schmidt,et al. Queues and Point Processes , 1983 .

[6] P. Franken,et al. Queues and Point Processes , 1983 .

[7] Aleksandr Alekseevich Borovkov,et al. Asymptotic methods in queuing theory , 1984 .

[8] Erol Gelenbe,et al. An End-to-End Approach to the Resequencing Problem , 1984, JACM.

[9] H. Thorisson. The queue GI/G/1: Finite moments of the cycle variables and uniform rates of convergence☆ , 1985 .

[10] The G/G/s/∞ Queue , 1987 .

[11] S. A. Berezner,et al. The stability of infinite-server networks with random routing , 1989, Journal of Applied Probability.

[12] Armand M. Makowski,et al. Queueing models for systems with synchronization constraints , 1989, Proc. IEEE.

[13] Donald F. Towsley,et al. Acyclic fork-join queuing networks , 1989, JACM.

[14] F. Baccelli,et al. On a Class of Stochastic Recursive Sequences Arising in Queueing Theory , 1992 .