Cover of: On the convergence of multiclass queueing networks in heavy traffic | J. G. Dai Read Online
Share

On the convergence of multiclass queueing networks in heavy traffic

  • 92 Want to read
  • ·
  • 49 Currently reading

Published by Alfred P. Sloan School of Management, Massachusetts Institute of Technology in Cambridge, Mass .
Written in English


Book details:

Edition Notes

StatementJ.G. Dai and Vin Nguyen.
SeriesWP -- #3489-92-MSA, Working paper (Sloan School of Management) -- 3489.
ContributionsNguyen, Vin., Sloan School of Management.
The Physical Object
Pagination16 p. :
Number of Pages16
ID Numbers
Open LibraryOL17938438M
OCLC/WorldCa45912760

Download On the convergence of multiclass queueing networks in heavy traffic

PDF EPUB FB2 MOBI RTF

CiteSeerX - Document Details (Isaac Councill, Lee Giles, Pradeep Teregowda): The subject of this paper is the heavy traffic behavior of a general class of queueing networks with first-in-first-out (FIFO) service discipline. For special cases which require various assumptions on the network structure, several authors have proved heavy traffic limit theorems to justify the approximation of. On the convergence of multiclass queueing networks in heavy traffic Item Preview remove-circle Share or Embed This Item. EMBED. EMBED (for hosted blogs and item tags) Want more? Advanced embedding details, examples, and help! No_Favorite. share Pages: This paper provides a rigorous proof of the connection between the optimal sequencing problem for a two-station, two-customer-class queueing network and the problem of control of a multidimensional Cited by: On the Convergence of Multiclass Queueing Networks in Heavy Traffic. By I. G. Dai and Viên Nguyen. Download PDF (1 MB) Abstract. The subject of this paper is the heavy traffic behavior of a general class of queueing networks with first-in-first-out (FIFO) service discipline. For special cases which require various assumptions on the network Author: I. G. Dai and Viên Nguyen.

On the Convergence of Multiclass Queueing Networks in Heavy Traffic. By J. G. Dai and Viên Nguyen. Abstract. The subject of this paper is the heavy traffic behavior of a general class of queueing networks with first-in-first-out (FIFO) service discipline. For special cases which require various assumptions on the network structure, several Author: J. G. Dai and Viên Nguyen. This paper provides a rigorous proof of the connection between the optimal sequencing problem for a two-station, two-customer-class queueing network and the problem of control of a multidimensional diffusion process, obtained as a heavy traffic limit of the queueing problem. In particular, the diffusion problem, which is one of “singular control” of a Brownian motion, is used to develop Cited by: J. G. Dai and V. Nguyen, "On the convergence of multiclass queueing networks in heavy traffic," Annals of Applied Probability, Vol 4, , [ full paper ( Kbytes)] J. G. Dai and R. J. Williams, "Existence and uniqueness of semimartingale reflecting Brownian motions in convex polyhedrons," Theory of Probability and Its Applications. Diffusion approximations for multiclass queueing networks jobs waiting to be served at its station. We use C(j) to denote the set of classes belonging to station j, and s(k) to denote the station to which class k belongs; when j and k appear together, we implicitly set j = s(k). Associated with each class k of a queueing network, there are two independent and identically.

ON THE CONVERGENCE OF MULTICLASS QUEUEING NETWORKS IN HEAVY TRAFFIC BY J. G. DAil AND VIPN NGUYEN Georgia Institute of Technology and M.I. T. The subject of this paper is the heavy traffic behavior of a general class of queueing networks with first-in . The 'approximately' optimal control problem for tandem queueing or production networks (with local feedback allowed) under heavy traffic is treated. The buffers are finite. This paper presents heavy traffic limit theorems for the queue length and sojourn time processes associated with open queueing networks. These limit theorems state that properly normalized sequences of queue length and sojourn time processes converge weakly to a certain diffusion as the network traffic intensity converges to by: Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networks. State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Systems 30 89– MathSciNet CrossRef Bramson M. () Stability and Heavy Traffic Limits for Queueing Networks. In Cited by: 1.