Related papers: If others jump to the queue front, how long I will…
We present in this paper a method to estimate urban traffic state with communicating vehicles. Vehicles moving on the links of the urban road network form queues at the traffic lights. We assume that a proportion of vehicles are equipped…
Cognitive radio transceiver can opportunistically access the underutilized spectrum resource of primary systems for new wireless services. With interleave implementation, the secondary transmission may be interrupted by the primary user's…
We propose a model for the intersection of two urban streets. The traffic status of the crossroads is controlled by a set of traffic lights which periodically switch to red and green with a total period of T. Two different types of…
Queueing networks are notoriously difficult to analyze sans both Markovian and stationarity assumptions. Much of the theoretical contribution towards performance analysis of time-inhomogeneous single class queueing networks has focused on…
In a queueing system involving multiple service windows, choice behavior is a significant concern. This paper incorporates the choice of service windows into a queueing model with a floor represented by discrete cells. We contrived a…
We study a time-changed variant of the Erlang queue by taking the first hitting time of a mixed stable subordinator as the time-changing component. We call it the mixed time-changed Erlang queue. We derive the system of fractional…
We use the results of a pedestrian tracking experiment to identify a follow-the-leader model for pedestrians walking-in-line. We demonstrate the existence of a time-delay between a subject's response and the predecessor's corresponding…
The time needed to exchange information in the physical world induces a delay term when the respective system is modeled by differential equations. Time delays are hence ubiquitous, being furthermore likely to induce instabilities and with…
Overlap times have been studied as a way of understanding the time of interaction between customers in a service facility. Most of the previous analysis relies on the single jump assumption for arrivals, which implies the queue increases by…
We propose a unified approach to establishing diffusion approximations for queues with impatient customers within a general framework of scaling customer patience time. The approach consists of two steps. The first step is to show that the…
We introduce a framework and develop a theory of transitory queueing models. These are models that are not only non-stationary and time-varying but also have other features such as the queueing system operates over finite time, or only a…
We say that a random variable is $light$-$tailed$ if moments of order $2+\epsilon$ are finite for some $\epsilon>0$; otherwise, we say that it is $heavy$-$tailed$. We study queueing networks that operate under the Max-Weight scheduling…
In discrete time, $\ell$-blocks of red lights are separated by $\ell$-blocks of green lights. Cars arrive at random. The maximum line length of idle cars is fully understood for $\ell = 1$, but only partially for $2 \leq \ell \leq 3$.
We investigate Markovian queues that are examined by a controller at random times determined by a Poisson process. Upon examination, the controller sets the service speed to be equal to the minimum of the current number of customers in the…
We examine a generalised queuing model which we call the G/G/n/G/+ model, which encompasses the G/G/n and G/G/n/s models as special cases. Our model accommodates useful generalisations in user behaviour and limitations on the facilities for…
An efficient system of a queue control and regulation in public spaces is very important in order to avoid the traffic jams and to improve the customer satisfaction. This article offers a detailed road map based on a merger of intelligent…
In this note we consider M/D/1/N queue with renovation and derive analytic expressions for the following performance characteristics: stationary loss rate, moments of the number in the system. Moments of consecutive losses, waiting/sojourn…
Two networks of queues models, presented initially by Jackson, in the open case, and Gordon and Newell, in the closed case, stochastic processes are presented and studied in some of their details and problems. The service times are…
We consider multi-robot applications, where a team of robots can ask for the intervention of a human operator to handle difficult situations. As the number of requests grows, team members will have to wait for the operator attention, hence…
Motivated by the ongoing COVID-19 pandemic, this paper investigates customers' infection risk by evaluating the overlapping time of a virtual customer with others in queueing systems. Most of the current methodologies focus on…