Related papers: Classification of Discrete-Time Queues
We consider multi-component matching systems in heavy traffic consisting of $K\geq 2$ distinct perishable components which arrive randomly over time at high speed at the assemble-to-order station, and they wait in their respective queues…
Discrete-event systems usually consist of discrete states and transitions between them caused by spontaneous occurrences of labelled (aka partially-observed) events. Due to the partially-observed feature, fundamental properties therein…
In this paper we consider a single-server, cyclic polling system with switch-over times. A distinguishing feature of the model is that the rates of the Poisson arrival processes at the various queues depend on the server location. For this…
In this article we study networks of coupled dynamical systems with time-delayed connections. If two such networks hold different delays on the connections it is in general possible that they exhibit different dynamical behavior as well. We…
In this paper, we study the stability of light traffic achieved by a scheduling algorithm which is suitable for heterogeneous traffic networks. Since analyzing a scheduling algorithm is intractable using the conventional mathematical tool,…
A discrete-time batch service queue with batch renewal input and random serving capacity rule under the late arrival delayed access system (LAS-DA), has recently appeared in the literature [2]. In this paper, we consider the same model…
Consider the problem of a multiple access channel in a time dependent environment with a large number of users. In such a system, mostly due to practical constraints (e.g., decoding complexity), not all users can be scheduled together, and…
We consider a queueing system with $n$ parallel queues operating according to the so-called "supermarket model" in which arriving customers join the shortest of $d$ randomly selected queues. Assuming rate $n\lambda_{n}$ Poisson arrivals and…
This paper examines a discrete-time queuing system with applications to telecommunications traffic. The arrival process is a particular Markov modulated process which belongs to the class of discrete batched Markovian arrival processes. The…
We consider the problem of selfish agents in discrete-time queuing systems, where competitive queues try to get their packets served. In this model, a queue gets to send a packet each step to one of the servers, which will attempt to serve…
We study a queueing network with a single shared server, that serves the queues in a cyclic order according to the gated service discipline. External customers arrive at the queues according to independent Poisson processes. After…
We study the effect of team and hierarchy on the waiting-time dynamics of priority-queue networks. To this end, we introduce generalized priority-queue network models incorporating interaction rules based on team-execution and hierarchy in…
Two nested classes of discrete-time linear time-invariant systems, which differ by the set of periodic signals that they leave invariant, are studied. The first class preserves the property of periodic monotonicity (period-wise…
We develop a formal framework for the behavioral comparison of linear systems across different time domains. We accomplish this by introducing the notion of system interpolation, which determines whether the input-state trajectories of a…
A classical result for the steady-state queue-length distribution of single-class queueing systems is the following: the distribution of the queue length just before an arrival epoch equals the distribution of the queue length just after a…
The general aim of this paper is to supply a method to decide whether a discrete system decoheres or not, and under what conditions decoherence occurs, with no need of appealing to computer simulations to obtain the time evolution of the…
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…
We consider a discrete time parallel queue, which is two-queue network, where at each time-slot there is a the same batch arrival to both queues and at each queue there is a random service available. The service law at each time-slot for…
Quantitative information flow analyses measure how much information on secrets is leaked by publicly observable outputs. One area of interest is to quantify and estimate the information leakage of composed systems. Prior work has focused on…
This paper addresses the qualitative theory of mixed-order positive linear coupled systems with bounded or unbounded delays. First, we introduce a general result on the existence and uniqueness of solutions to mixed-order linear coupled…