Spiros Dimou - Academia.edu (original) (raw)

Spiros Dimou

Related Authors

Jeffrey Townsend

ANNIE SELDEN

Julio Mosquera

Udayan Prajapati

Marcia Pinheiro

Alonso Castillo-Ramirez

Oliver Knill

MD NAZMUL ISLAM

MD NAZMUL ISLAM

International University Of Business Agriculture and Technology(IUBAT)

Jana  Javornik

Gwen Robbins Schug

Uploads

Papers by Spiros Dimou

Research paper thumbnail of Equilibrium results for the M/G/k group-arrival loss system

TOP, 2010

In this paper we consider a specific M/G/k group-arrival loss system, under statistical equilibri... more In this paper we consider a specific M/G/k group-arrival loss system, under statistical equilibrium and two cases of acceptance policy. In the first case the system works under the partial acceptance policy. Explicit results are obtained for the corresponding stationary distribution, which extend previous relevant results. In the second case, where the system works under the all-or-nothing acceptance policy, a sufficient condition is given for the stationary distribution to have a closed-product form. In both cases customers depart individually, while the joint service time distribution of the accepted members of a group may depend both on its initial and the accepted size plus an additional condition.

Research paper thumbnail of The Single Server Queue with Catastrophes and Geometric Reneging

Methodology and Computing in Applied Probability, 2011

This paper is concerned with the distribution of the number of times that a limited-capacity sing... more This paper is concerned with the distribution of the number of times that a limited-capacity single-server queue with catastrophes and restorations reaches its capacity in time t. When occurrence of a catastrophe all the customers in the system is destroyed immediately but the system takes its own time to be ready to accept new customers, this time is referred to as 'the restoration time'. The afore said distribution is obtained as a marginal distribution of the joint distribution of the number of customers in the system at time t and the nu mber of times system reaches its capacity in time t under the conditions of catastrophes and restorations.

Research paper thumbnail of The single server vacation queueing model with geometric abandonments

Journal of Statistical Planning and Inference, 2011

Several recent papers have investigated the customer reneging behavior in queueing systems with v... more Several recent papers have investigated the customer reneging behavior in queueing systems with vacations, where the customers become impatient during the absence of the server(s). These studies have treated the cases of independent and synchronized abandonments. In the case of independent abandonments, the customers have their own independent patience times and abandon the system when such times expire. In the case of synchronized abandonments, the abandonment opportunities occur according to a certain point process and then all present customers decide simultaneously but independently whether they will abandon the system or not. In the present paper, we complement these studies by considering the case of geometric abandonments. This case arises when the abandonment opportunities occur according to a certain point process and the customers decide sequentially whether they will leave the system or not. We derive explicit expressions and computational schemes for various performance descriptors, including the number of customers in system, the sojourn time of a customer, the duration and the maximum number of customers in a busy period.

Research paper thumbnail of Equilibrium results for the M/G/k group-arrival loss system

TOP, 2010

In this paper we consider a specific M/G/k group-arrival loss system, under statistical equilibri... more In this paper we consider a specific M/G/k group-arrival loss system, under statistical equilibrium and two cases of acceptance policy. In the first case the system works under the partial acceptance policy. Explicit results are obtained for the corresponding stationary distribution, which extend previous relevant results. In the second case, where the system works under the all-or-nothing acceptance policy, a sufficient condition is given for the stationary distribution to have a closed-product form. In both cases customers depart individually, while the joint service time distribution of the accepted members of a group may depend both on its initial and the accepted size plus an additional condition.

Research paper thumbnail of The Single Server Queue with Catastrophes and Geometric Reneging

Methodology and Computing in Applied Probability, 2011

This paper is concerned with the distribution of the number of times that a limited-capacity sing... more This paper is concerned with the distribution of the number of times that a limited-capacity single-server queue with catastrophes and restorations reaches its capacity in time t. When occurrence of a catastrophe all the customers in the system is destroyed immediately but the system takes its own time to be ready to accept new customers, this time is referred to as 'the restoration time'. The afore said distribution is obtained as a marginal distribution of the joint distribution of the number of customers in the system at time t and the nu mber of times system reaches its capacity in time t under the conditions of catastrophes and restorations.

Research paper thumbnail of The single server vacation queueing model with geometric abandonments

Journal of Statistical Planning and Inference, 2011

Several recent papers have investigated the customer reneging behavior in queueing systems with v... more Several recent papers have investigated the customer reneging behavior in queueing systems with vacations, where the customers become impatient during the absence of the server(s). These studies have treated the cases of independent and synchronized abandonments. In the case of independent abandonments, the customers have their own independent patience times and abandon the system when such times expire. In the case of synchronized abandonments, the abandonment opportunities occur according to a certain point process and then all present customers decide simultaneously but independently whether they will abandon the system or not. In the present paper, we complement these studies by considering the case of geometric abandonments. This case arises when the abandonment opportunities occur according to a certain point process and the customers decide sequentially whether they will leave the system or not. We derive explicit expressions and computational schemes for various performance descriptors, including the number of customers in system, the sojourn time of a customer, the duration and the maximum number of customers in a busy period.

Log In