SOME GENERALIZATIONS OF WEAK CONVERGENCE RESULTS ON MULTIPLE CHANNEL QUEUES IN HEAVY TRAFFIC.
Authors: not saved
Abstract:
This paper extends certain results of Iglehart and Whitt on multiple channel queues to the case where the inter-arrival times and service times are not necessarily identically distributed. It is shown that the weak convergence results in this case are exactly the same as those obtained by Iglehart and Whitt
similar resources
some generalizations of weak convergence results on multiple channel queues in heavy traffic.
this paper extends certain results of iglehart and whitt on multiple channel queues to the case where the inter-arrival times and service times are not necessarily identically distributed. it is shown that the weak convergence results in this case are exactly the same as those obtained by iglehart and whitt
full textWeak Convergence Limits for Sojourn times in Cyclic Queues under Heavy Traffic Conditions
We consider sequences of closed cycles of exponential single-server nodes with a single bottleneck. We study the cycle time and the successive sojourn times of a customer when the population sizes go to infinity. Starting from old results on themean cycle times under heavy traffic conditions, we prove a central limit theorem for the cycle time distribution. This result is then utilised to prove...
full textOn many-server queues in heavy traffic
We establish a heavy-traffic limit theorem on convergence in distribution for the number of customers in a many-server queue.
full textSome results on convergence and existence of best proximity points
In this paper, we introduce generalized cyclic φ-contraction maps in metric spaces and give some results of best proximity points of such mappings in the setting of a uniformly convex Banach space. Moreover, we obtain convergence and existence results of proximity points of the mappings on reflexive Banach spaces
full textGaussian queues in light and heavy traffic
In this paper we investigate Gaussian queues in the light-traffic and in the heavy-traffic regime. Let Q X ≡ {Q X (t) : t ≥ 0} denote a stationary buffer content process for a fluid queue fed by the centered Gaussian process X ≡ {X(t) : t ∈ R} with stationary increments, X(0) = 0, continuous sample paths and variance function σ 2(·). The system is drained at a constant rate c > 0, so that for a...
full textSteady-State Distribution Convergence for GI/GI/1 + GI Queues in Heavy Traffic
We establish the validity of the heavy traffic steady-state approximation for a single server queue, operating under the FIFO service discipline, in which each customer abandons the system if his waiting time exceeds his generally-distributed patience time. This follows from early results of Kingman when the loading factor approaches one from below, but has not been shown in more generality. We...
full textMy Resources
Journal title
volume 3 issue 2
pages -
publication date 1992-12-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023