The Experts below are selected from a list of 321 Experts worldwide ranked by ideXlab platform
Chunghorng Lung - One of the best experts on this subject based on the ideXlab platform.
-
network capacity region of multi queue multi server Queueing System with time varying connectivities
International Symposium on Information Theory, 2010Co-Authors: Hassan Halabian, Ioannis Lambadaris, Chunghorng LungAbstract:Network capacity region of multi-queue multi-server Queueing System with random connectivities and stationary arrival processes is studied in this paper. Specifically, the necessary and sufficient conditions for the stability of the System are derived under general arrival processes with finite first and second moments. In the case of stationary arrival processes, these conditions establish the network capacity region of the System. It is also shown that AS/LCQ (Any Server/Longest Connected Queue) policy stabilizes the System when it is stabilizable. Furthermore, an upper bound for the average queue occupancy is derived for this policy.
-
network capacity region of multi queue multi server Queueing System with time varying connectivities
arXiv: Information Theory, 2010Co-Authors: Hassan Halabian, Ioannis Lambadaris, Chunghorng LungAbstract:Network capacity region of multi-queue multi-server Queueing System with random ON-OFF connectivities and stationary arrival processes is derived in this paper. Specifically, the necessary and sufficient conditions for the stability of the System are derived under general arrival processes with finite first and second moments. In the case of stationary arrival processes, these conditions establish the network capacity region of the System. It is also shown that AS/LCQ (Any Server/Longest Connected Queue) policy stabilizes the System when it is stabilizable. Furthermore, an upper bound for the average queue occupancy is derived for this policy.
Yeh Lam - One of the best experts on this subject based on the ideXlab platform.
-
a geometric process model for m m 1 Queueing System with a repairable service station
European Journal of Operational Research, 2006Co-Authors: Yeh Lam, Yuan Lin Zhang, Qun LiuAbstract:Abstract In this paper, we study a geometric process model for M / M /1 Queueing System with a repairable service station. By introducing a supplementary variable, some Queueing characteristics of the System and reliability indices of the service station are derived. Then a replacement policy N for the service station by which the service station will be replaced following the N th failure is applied. An optimal replacement policy N ∗ for minimizing the long-run average cost per unit time for the service station is then determined.
Yinghui Tang - One of the best experts on this subject based on the ideXlab platform.
-
on the transient departure process of m x g 1 Queueing System with single server vacation
Journal of Systems Science & Complexity, 2007Co-Authors: Yinghui TangAbstract:This paper studies the transient departure process of Mx/G/1 Queueing System with single server vacation. We present a simple probability decomposition method to derive the expected number of departures occurring in finite time interval from any initial state and the asymptotic expansion of the expected number. Especially, we derive some more practical results for some special cases.
-
On The Transient Departure Process of M x /G/1 Queueing System with Single Server Vacation
Journal of Systems Science & Complexity, 2007Co-Authors: Yinghui TangAbstract:This paper studies the transient departure process of Mx/G/1 Queueing System with single server vacation. We present a simple probability decomposition method to derive the expected number of departures occurring in finite time interval from any initial state and the asymptotic expansion of the expected number. Especially, we derive some more practical results for some special cases.
-
Some reliability problems arising in GIvbGvb1 Queueing System with-repairable service station
Microelectronics Reliability, 1995Co-Authors: Yinghui TangAbstract:Abstract In this paper we study some reliability problems arising in the GI/G/I Queueing System, the service station of which may fail in the busy period of the System. Suppose that the life length of the service station has an exponential distribution, and the repair time length of the failed service station has a general distribution; we obtain the reliability quantities of the service station, i.e. the probability of the station failure at the time t and the expected failure number in (0, t]. We see from these results that it is necessary and useful to consider these reliability problems arising in the Queueing System with a repairable service station.
Gautam Choudhury - One of the best experts on this subject based on the ideXlab platform.
-
a two phase batch arrival retrial Queueing System with bernoulli vacation schedule
Applied Mathematics and Computation, 2007Co-Authors: Gautam ChoudhuryAbstract:Abstract We consider an M x / G /1 Queueing System with two phases of heterogeneous service and Bernoulli vacation schedule which operate under classical retrial policy. In addition, each individual customer is subject to a control admission policy upon the arrival. This model generalized both the classical M / G /1 retrial policy with arrivals in batches and a two phase batch arrival queue with single vacation under Bernoulli vacation schedule. We will carry out an extensive stationary analysis of the System, including existence of the stationary regime, embedded Markov chain, steady state distribution of the server state and number of customer in the retrial group, stochastic decomposition and calculation of the first moments.
-
a two phase batch arrival Queueing System with a vacation time under bernoulli schedule
Applied Mathematics and Computation, 2004Co-Authors: Gautam Choudhury, Kailash C. MadanAbstract:We consider a batch arrival Queueing System, where the server provides two phases of heterogeneous service one after the other to the arriving batches under Bernoulli schedule vacation. After completion of both phases of service the server either goes for a vacation with probability r(0=
-
An M X /G/1 Queueing System with a setup period and a vacation period
Queueing Systems, 2000Co-Authors: Gautam ChoudhuryAbstract:This paper deals with an MX/G/1 Queueing System with a vacation period which comprises an idle period and a random setup period. The server is turned off each time when the System becomes empty. At this point of time the idle period starts. As soon as a customer or a batch of customers arrive, the setup of the service facility begins which is needed before starting each busy period. In this paper we study the steady state behaviour of the queue size distributions at stationary (random) point of time and at departure point of time. One of our findings is that the departure point queue size distribution is the convolution of the distributions of three independent random variables. Also, we drive analytically explicit expressions for the System state probabilities and some performance measures of this Queueing System. Finally, we derive the probability generating function of the additional queue size distribution due to the vacation period as the limiting behaviour of the MX/M/1 type Queueing System.
-
an m x g 1 Queueing System with a setup period and a vacation period
Queueing Systems, 2000Co-Authors: Gautam ChoudhuryAbstract:This paper deals with an MX/G/1 Queueing System with a vacation period which comprises an idle period and a random setup period. The server is turned off each time when the System becomes empty. At this point of time the idle period starts. As soon as a customer or a batch of customers arrive, the setup of the service facility begins which is needed before starting each busy period. In this paper we study the steady state behaviour of the queue size distributions at stationary (random) point of time and at departure point of time. One of our findings is that the departure point queue size distribution is the convolution of the distributions of three independent random variables. Also, we drive analytically explicit expressions for the System state probabilities and some performance measures of this Queueing System. Finally, we derive the probability generating function of the additional queue size distribution due to the vacation period as the limiting behaviour of the MX/M/1 type Queueing System.
Qun Liu - One of the best experts on this subject based on the ideXlab platform.
-
a geometric process model for m m 1 Queueing System with a repairable service station
European Journal of Operational Research, 2006Co-Authors: Yeh Lam, Yuan Lin Zhang, Qun LiuAbstract:Abstract In this paper, we study a geometric process model for M / M /1 Queueing System with a repairable service station. By introducing a supplementary variable, some Queueing characteristics of the System and reliability indices of the service station are derived. Then a replacement policy N for the service station by which the service station will be replaced following the N th failure is applied. An optimal replacement policy N ∗ for minimizing the long-run average cost per unit time for the service station is then determined.
