On a new characterization of the exponential distribution related to a queueing system with an unreliable server

1990 ◽  
Vol 27 (1) ◽  
pp. 221-226 ◽  
Author(s):  
B. Dimitrov ◽  
Z. Khalil

In this paper we derive a new property of the exponential distribution, closely related to a single-server queueing system with unreliable server. We show that this new property is another characterization of the exponential law.

1990 ◽  
Vol 27 (01) ◽  
pp. 221-226 ◽  
Author(s):  
B. Dimitrov ◽  
Z. Khalil

In this paper we derive a new property of the exponential distribution, closely related to a single-server queueing system with unreliable server. We show that this new property is another characterization of the exponential law.


1998 ◽  
Vol 35 (1) ◽  
pp. 236-239 ◽  
Author(s):  
Jian-Lun Xu

The characterization of the exponential distribution via the coefficient of the variation of the blocking time in a queueing system with an unreliable server, as given by Lin (1993), is improved by substantially weakening the conditions. Based on the coefficient of variation of certain random variables, including the blocking time, the normal service time and the minimum of the normal service and the server failure times, two new characterizations of the exponential distribution are obtained.


1998 ◽  
Vol 35 (01) ◽  
pp. 236-239
Author(s):  
Jian-Lun Xu

The characterization of the exponential distribution via the coefficient of the variation of the blocking time in a queueing system with an unreliable server, as given by Lin (1993), is improved by substantially weakening the conditions. Based on the coefficient of variation of certain random variables, including the blocking time, the normal service time and the minimum of the normal service and the server failure times, two new characterizations of the exponential distribution are obtained.


1994 ◽  
Vol 26 (01) ◽  
pp. 172-182 ◽  
Author(s):  
Z. Khalil ◽  
B. Dimitrov

Consider the total service time of a job on an unreliable server under preemptive-repeat-different and preemptive-resume service disciplines. With identical initial conditions, for both cases, we notice that the distributions of the total service time under these two disciplines coincide, when the original service time (without interruptions due to server failures) is exponential and independent of the server reliability. We show that this fact under varying server reliability is a characterization of the exponential distribution. Further we show, under the same initial conditions, that the coincidence of the mean values also leads to the same characterization.


We consider a single server vacation queue with two types of repair facilities and server timeout. Here customers are in compound Poisson arrivals with general service time and the lifetime of the server follows an exponential distribution. The server find if the system is empty, then he will wait until the time ‘c’. At this time if no one customer arrives into the system, then the server takes vacation otherwise the server commence the service to the arrived customers exhaustively. If the system had broken down immediately, it is sent for repair. Here server failure can be rectified in two case types of repair facilities, case1, as failure happens during customer being served willstays in service facility with a probability of 1-q to complete the remaining service and in case2 it opts for new service also who joins in the head of the queue with probability q. Obtained an expression for the expected system length for different batch size distribution and also numerical results are shown


1994 ◽  
Vol 31 (1) ◽  
pp. 274-279 ◽  
Author(s):  
Janos Galambos ◽  
Charles Hagwood

Consider a workstation with one server, performing jobs with a service time, Y, having distribution function, G(t). Assume that the station is unreliable, in that it occasionally breaks down. The station is instantaneously repaired, and the server restarts the uncompleted job from the beginning. Let T denote the time it takes to complete each job. If G(t) is exponential with parameter A, then because of the lack-of-memory property of the exponential, P (T > t) = Ḡ(t) =exp(−γt), irrespective of when and how the failures occur. This property also characterizes the exponential distribution.


1994 ◽  
Vol 31 (01) ◽  
pp. 274-279 ◽  
Author(s):  
Janos Galambos ◽  
Charles Hagwood

Consider a workstation with one server, performing jobs with a service time, Y, having distribution function, G(t). Assume that the station is unreliable, in that it occasionally breaks down. The station is instantaneously repaired, and the server restarts the uncompleted job from the beginning. Let T denote the time it takes to complete each job. If G(t) is exponential with parameter A, then because of the lack-of-memory property of the exponential, P (T > t) = Ḡ(t) =exp(−γt), irrespective of when and how the failures occur. This property also characterizes the exponential distribution.


1994 ◽  
Vol 26 (1) ◽  
pp. 172-182 ◽  
Author(s):  
Z. Khalil ◽  
B. Dimitrov

Consider the total service time of a job on an unreliable server under preemptive-repeat-different and preemptive-resume service disciplines. With identical initial conditions, for both cases, we notice that the distributions of the total service time under these two disciplines coincide, when the original service time (without interruptions due to server failures) is exponential and independent of the server reliability. We show that this fact under varying server reliability is a characterization of the exponential distribution. Further we show, under the same initial conditions, that the coincidence of the mean values also leads to the same characterization.


Author(s):  
Varghese Jacob

This paper presents a retrial queueing system with customer induced interruption while in service. We consider a single server queueing system of infinite capacity to which customers arrive according to a Poisson process and the service time follows an exponential distribution.An arriving customer to an idle server obtains service immediately and customers who find server busy go directly to the orbit from where he retry for service. The inter-retrial time follows exponential distribution. The customer interruption while in service occurs according to a Poisson process and the interruption duration follows an exponential distribution. The customer whose service is got interrupted will enter into a finite buffer. Any interrupted customer, finding the buffer full, is considered lost. Those interrupted customers who complete their interruptions will be placed into another buffer of same size. The interrupted customers waiting for service are given non-preemptive priority over new customers. We analyse the steady-state behavior of this queuing system. Several performance measures are obtained. Numerical illustrations of the system behaviour are also provided with example.


Sign in / Sign up

Export Citation Format

Share Document