Related papers: Classification of Discrete-Time Queues
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…
Lyapunov drift and Lyapunov optimization are powerful techniques for optimizing time averages in stochastic queueing networks subject to stability. However, there are various definitions of queue stability in the literature, and the most…
We investigate how decoherence affects the short-time separation between quantum and classical dynamics for classically chaotic systems, within the framework of a specific model. For a wide range of parameters, the distance between the…
Linearizability is the de facto correctness criterion for concurrent data structures. Unfortunately, linearizability imposes a performance penalty which scales linearly in the number of contending threads. Quiescent consistency is an…
We study the joint control of arrival and service rates in queueing systems with the objective of minimizing long-run expected cost minus revenue. Although the objective function is non-convex, first-order methods have been empirically…
We discuss the method of folding for discrete planar systems and use it to establish the existence or non-existence of cycles or chaos in planar systems of rational difference equations with variable coefficients. These include some systems…
We propose a microscopic decision model for route choice based on discrete choice theory. The correlation of overlapping routes is included in the random portions of the utility explicitly. For computational efficiency, we restrict the…
A network of signalized intersections is modeled as a queuing network. The intersections are regulated by fixed-time (FT) controls, all with the same cycle length or period, $T$. Vehicles arrive from outside the network at entry links in a…
In this paper, we propose a class of discrete-time approximation schemes for stochastic optimal control problems under the $G$-expectation framework. The proposed schemes are constructed recursively based on piecewise constant policy. We…
We study the transport properties of nonautonomous chaotic dynamical systems over a finite time duration. We are particularly interested in those regions that remain coherent and relatively non-dispersive over finite periods of time,…
This paper proposes a way to effectively compare the potential of processes to cause conflict. In discrete event systems theory, two concurrent systems are said to be in conflict if they can get trapped in a situation where they are both…
In this note we consider continuous-time systems x'(t) = A(t) x(t) + B(t) u(t), y(t) = C(t) x(t) + D(t) u(t), as well as discrete-time systems x(t+1) = A(t) x(t) + B(t) u(t), y(t) = C(t) x(t) + D(t) u(t) whose coefficient matrices A, B, C…
The exclusive queueing process (EQP) is a generalization of the classical M/M/1 queue. It is equivalent to a totally asymmetric exclusion process (TASEP) of varying length. Here we consider two discrete-time versions of the EQP with…
This paper considers a parallel system of queues fed by independent arrival streams, where the service rate of each queue depends on the number of customers in all of the queues. Necessary and sufficient conditions for the stability of the…
When scheduling public works or events in a shared facility one needs to accommodate preferences of a population. We formalize this problem by introducing the notion of a collective schedule. We show how to extend fundamental tools from…
In this paper, we study synchronization in the delayed discrete-time complex networks. Several criterions of synchronization stability for such networks are established. And illustrative examples are presented. The numerical simulations…
This note describes several open questions concerning scaling limits of queue-length processes of symmetric queues in heavy traffic, distinguishing between service-time distributions with finite and infinite variance.
Three similar convergence notions are considered. Two of them are the long established notions of convergent dynamics and incremental stability. The other is the more recent notion of contraction analysis. All three convergence notions…
In this paper, we consider a new queueing model where queues balance themselves according to a mean field interaction with a time delay. Unlike other work with delayed information our model considers multi-server queues with customer…
We consider optimizing average queueing delay and average power consumption in a nonpreemptive multi-class M/G/1 queue with dynamic power control that affects instantaneous service rates. Four problems are studied: (1) satisfying per-class…