Related papers: Stability of a processor sharing queue with varyin…
This paper considers a GI/GI/1 processor sharing queue in which jobs have soft deadlines. At each point in time, the collection of residual service times and deadlines is modeled using a random counting measure on the right half-plane. The…
In this paper, we analyze a retrial queueing system with Batch Markovian Arrival Processes and two types of customers. The rate of individual repeated attempts from the orbit is modulated according to a Markov Modulated Poisson Process.…
We study a production-inventory system with two customer classes with different priorities which are admitted to the system following a flexible admission control scheme. The inventory management is according to a base stock policy and…
We consider stability and network capacity in discrete time queueing systems. Relationships between four common notions of stability are described. Specifically, we consider rate stability, mean rate stability, steady state stability, and…
In this paper, we study the problem of cooperative communications in cognitive radio systems where the secondary user has limited relaying room for the overheard primary packets. More specifically, we characterize the stable throughput…
We present an example of a single-server polling system with two queues and an adaptive service policy where the stability region depends on the expected values of all the primitives and also on a certain exponential moment of the…
The replication mechanism resolves some challenges with big data such as data durability, data access, and fault tolerance. Yet, replication itself gives birth to another challenge known as the consistency in distributed systems.…
This paper presents a new condition for the existence of optimal stationary policies in average-cost continuous-time Markov decision processes with unbounded cost and transition rates, arising from controlled queueing systems. This…
The paper studies a multiserver retrial queueing system with $m$ servers. Arrival process is a point process with strictly stationary and ergodic increments. A customer arriving to the system occupies one of the free servers. If upon…
We investigate control of a non-linear process when communication and processing capabilities are limited. The sensor communicates with a controller node through an erasure channel which introduces i.i.d. packet dropouts. Processor…
The parallel execution of requests in a Cloud Computing platform, as for Virtualized Network Functions, is modeled by an $M^{[X]}/M/1$ Processor-Sharing (PS) system, where each request is seen as a batch of unit jobs. The performance of…
A FORTRAN program to simulate the operation of infinite servers queues is presented in this work. Poisson arrivals processes are considered but not only. For many parameters of interest in queuing systems study or application, either there…
In this paper, we study the stability of queues with impatient customers. Under general stationary ergodic assumptions, we first provide some conditions for such a queue to be regenerative (i.e. to empty a.s. an infinite number of times).…
The paper studies approximations and control of a processor sharing (PS) server where the service rate depends on the number of jobs occupying the server. The control of such a system is implemented by imposing a limit on the number of jobs…
Bounding the price of anarchy, which quantifies the damage to social welfare due to selfish behavior of the participants, has been an important area of research. In this paper, we study this phenomenon in the context of a game modeling…
The energy transition is causing many stability-related challenges for power systems. Transient stability refers to the ability of a power grid's bus angles to retain synchronism after the occurrence of a major fault. In this paper a…
We consider the $N$-model queueing system with a waiting time dependent threshold on the diagonal: the service discipline is First--Come--First--Served, but type-1 jobs can only be served by server 2 if their waiting time exceeds a…
In this work, we consider a computational model of a distributed system formed by a set of servers in which jobs, that are continuously arriving, have to be executed. Every job is formed by a set of dependent tasks (i.~e., each task may…
We develop a robust queueing network analyzer algorithm to approximate the steady-state performance of a single-class open queueing network of single-server queues with Markovian routing. The algorithm allows non-renewal external arrival…
Motivated by the work of Whitt, who studied stabilization of the mean virtual waiting time (excluding service time) in a $GI_t/GI_t/1/FCFS$ queue, this paper investigates the stabilization of the mean virtual response time in a…