Related papers: A max-algebra approach to modeling and simulation …
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 unavailable, it enters a virtual queue, called the orbit,…
To study the impacts of price responsive demand on the electric power system requires better load models. This paper discusses the modeling of uncertainties in aggregated thermostatically controlled loads using a state queueing (SQ) model.…
In a recent study [C Arita and D Yanagisawa: J. Stat. Phys. 141, 829 (2010)] the stationary state of a parallel-update TASEP with varying system length, which can be regarded as a queueing process with excluded-volume effect (exclusive…
This paper studies a scheduling control problem for a single-server multiclass queueing network in heavy traffic, operating in a changing environment. The changing environment is modeled as a finite state Markov process that modulates the…
Motivated by timeouts in Internet services, we consider networks of infinite server queues in which routing decisions are based on deadlines. Specifically, at each node in the network, the total service time equals the minimum of several…
Queueing theory is used for modeling biological processes, traffic flows and many more real-life situations. Beyond that, queues describe systems out of equilibrium and can thus be considered as minimal models of non-equilibrium statistical…
We introduce a QPLEX Decision Process (QDP) as a model for dynamic control of queueing systems with non-stationary arrivals, general service distributions, and service-level chance constraints. QDPs integrate QPLEX, a computational modeling…
In the present paper the infinite-server MMAPkGk queueing model with random resource vector of customers, marked MAP arrival and semi-Markov (SM) arrival of catastrophes is considered. The joint generating functions (PGF) of transient and…
In this paper we study the dynamics of a class of bi-agent logistics systems consisting of two types of agents interacting on an arbitrary complex network. By approximating the system with simple microscopic models and solving them…
We study three non-equivalent queueing models in continuous time that each generalise the classical M/M/1 queue in a different way. Inter-event times in all models are Mittag-Leffler distributed, which is a heavy tail distribution with no…
We consider a stationary Markov process that models certain queues with a bulk service of a fixed number $m$ of admitted customers. We find an integral expression of its transition probability function in terms of certain multi-orthogonal…
Queue networks describe complex stochastic systems of both theoretical and practical interest. They provide the means to assess alterations, diagnose poor performance and evaluate robustness across sets of interconnected resources. In the…
With the rapid development of economy and global trade, flying has increasingly become the main way for people to travel, and taxi is the main transfer tool of the airport, especially in the airport with wide passenger sources and large…
Motivated by applications in online marketplaces such as ride-hailing platforms and payment channel networks, we study a single-server queue with state-dependent arrival control. The service operator dynamically chooses the arrival rate as…
Understanding the detailed queueing behavior of a networking session is critical in enabling low-latency services over the Internet. Especially when the packet arrival and service rates at the queue of a link vary over time and moreover…
We show how to simulate numerically both the evolution of 1D quantum systems under dissipation as well as in thermal equilibrium. The method applies to both finite and inhomogeneous systems and it is based on two ideas: (a) a representation…
We examine the one-humped map at the period-doubling transition to chaos, and ask whether its long-term memory is stack-like (last-in, first-out) or queue-like (first-in, first-out). We show that it can be recognized by a real-time…
Fundamental to many transportation network studies, traffic flow models can be used to describe traffic dynamics determined by drivers' car-following, lane-changing, merging, and diverging behaviors. In this study, we develop a…
This paper analyzes a service system modeled as a single-server queue, in which the service provider aims to dynamically maximize the expected revenue per unit of time. This is achieved by constructing a stochastic gradient descent…
This paper presents a second-order heavy traffic analysis of a single server queue that processes customers having deadlines using the earliest-deadline-first scheduling policy. For such systems, referred to as real-time queueing systems,…