We find an equilibrium in a single-server queueing system with retrials and strategic timing
of the customers. We consider a set of customers, each of which must decide when to arrive …

A single server retrial queueing system with two-classes of orbiting customers, and general
class dependent service times is considered. If an arriving customer finds the server …

We establish stability criterion for a two-class retrial system with Poisson inputs, general
class-dependent service times and class-dependent constant retrial rates. We also …

In this work we consider a single-server system accepting N types of retrial customers, which
arrive according to independent Poisson streams. In case of blocking, type-i customer, i= 1 …

This work introduces the join the shortest queue policy in the retrial setting. We consider a
Markovian single server retrial system with two infinite capacity orbits. An arriving job finding …

This paper considers a single-server queueing system with strategic users in which
customers (players) enter the system with preemptive access. As soon as the customer …

In this work, we investigate the stability conditions of a multiclass retrial system with coupled
orbit queues and service interruptions. We consider a single server system accepting N …

This paper considers a single-server queueing system in which players send requests into
the system with preemptive access and fixed reward for completing request. When a request …

In this work, we consider a random access IoT wireless network assisted by two
aggregators. The nodes and the aggregators are transmitting in a random access manner …

We study a single-server retrial queueing model with N classes of customers following
independent Poisson inputs. A class-i customer, which meets server busy, joins a type-i …