Related papers: Overlap Times in Tandem Queues: Identically Distri…
Queue length monitoring is a commonly arising problem in numerous applications such as queue management systems, scheduling, and traffic monitoring. Motivated by such applications, we formulate a queue monitoring problem, where there is a…
In this paper, we discuss an interesting but challenging bilateral stochastically matching problem: A more general matched queue with matching batch pair (m, n) and two types (i.e., types A and B) of impatient customers, where the arrivals…
In the context of load balancing, Lu et al. introduced the distributed Join-Idle-Queue algorithm, where a group of dispatchers distribute jobs to a cluster of parallel servers. Each dispatcher maintains a queue of idle servers; when a job…
We consider the queuing networks, which are made from servers, exchanging their positions. The customers, using the network, try to reach their destinations, which is complicated by the movements of the servers, taking their customers with…
This paper studies a service system in which arriving customers are provided with information about the delay they will experience. Based on this information they decide to wait for service or to leave the system. Specifically, every…
In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may switch server independently at random instants of time in an…
In many applications, significant correlations between arrivals of load-generating events make the numerical evaluation of the load of a system a challenging problem. Here, we construct very accurate approximations of the workload…
In this paper, we will develop a tool to analyze polling systems with the autonomous-server, the time-limited, and the k-limited service discipline. It is known that these disciplines do not satisfy the well-known branching property in…
This paper is motivated by emerging edge computing applications in which generated data are pre-processed at the source and then transmitted to an edge server. In such a scenario, there is typically a tradeoff between the amount of…
Distributed averaging of agent initial conditions is a well-studied problem in context of networked systems where coordination amongst the agents is of paramount importance. The asymptotic nature of convergence of distributed averaging…
In this work, we analyze the probabilistic cooperation of a full-duplex relay in a multiuser random-access network. The relay is equipped with on/off modes for the receiver and the transmitter independently. These modes are modeled as…
In this paper we analyze a single server queue with batch arrivals and semi-Markovian service times. We also include the feature that the first service of each busy period might have a different distribution than subsequent service times.…
We consider a single server queue that serves a finite population of $n$ customers that will enter the queue (require service) only once, also known as the $\Delta_{(i)}/G/1$ queue. This paper presents a method for analyzing heavy-traffic…
In this paper we study the number of customers in infinite-server queues with a self-exciting (Hawkes) arrival process. Initially we assume that service requirements are exponentially distributed and that the Hawkes arrival process is of a…
In this short communication we study a fluid queue with a finite buffer. The performance measure we are interested in is the occupation time over a finite time period, i.e., the fraction of time the workload process is below some fixed…
Cognitive radio transceiver can opportunistically access the underutilized spectrum resource of primary systems for new wireless services. With interweave cognitive implementation, the secondary transmission may be interrupted by the…
We consider queueing models, where customers arrive according to a continuous-time binomial process on a finite interval. In this arrival process, a total of $K$ customers arrive in the finite time interval $[0,T]$, where arrival times of…
We consider an acyclic network of single-server queues with heterogeneous processing rates. It is assumed that each queue is fed by the superposition of a large number of i.i.d. Gaussian processes with stationary increments and positive…
Linear consensus iterations guarantee asymptotic convergence, thereby, limiting their applicability in applications where consensus value needs to be used in real time to perform a system level task. It also leads to wastage of power and…
This paper investigates the capacity of a channel in which information is conveyed by the timing of consecutive packets passing through a queue with independent and identically distributed service times. Such timing channels are commonly…