Related papers: Classification of Discrete-Time Queues
A general theory is developed to study individual based models which are discrete in time. We begin by constructing a Markov chain model that converges to a one-dimensional map in the infinite population limit. Stochastic fluctuations are…
In this paper we analyze an $M/M/1$ queueing system with an arbitrary number of customer classes, with class-dependent exponential service rates and preemptive priorities between classes. The queuing system can be described by a…
In this paper, we aim to improve the percentage of packets meeting their deadline in discrete-time M/M/1 queues with infrequent monitoring. More specifically, we look into policies that only monitor the system (and subsequently take…
We study the decoherence process for an open quantum system which is classically chaotic (a quartic double well with harmonic driving coupled to a sea of harmonic oscillators). We analyze the time dependence of the rate of entropy…
We reinvestigate the dynamical behavior of a first order scalar nonlinear delay differential equation with piecewise linearity and identify several interesting features in the nature of bifurcations and chaos associated with it as a…
Consider a population of customers each of which needs to decide independently when to arrive to a facility that provides a service during a fixed period of time, say a day. This is a common scenario in many service systems such as a bank,…
The problem of increased queueing delays in the Internet motivates the study of currently implemented transport protocols and active queue management (AQM) policies. We study Compound TCP (default protocol in Windows) with Random Early…
We introduce a new class of models in which a large number of "agents" organize under the influence of an externally imposed coherent noise. The model shows reorganization events whose size distribution closely follows a power law over many…
We address the problem of determining if a discrete time switched consensus system converges for any switching sequence and that of determining if it converges for at least one switching sequence. For these two problems, we provide…
We consider sample to sample fluctuations of the waiting time between the detection of two consecutive electrons in quasi-one-dimensional disordered conductors at zero temperature. We compute the full distribution of the mean waiting time…
In this paper, we first propose a method that can efficiently compute the maximal robust controlled invariant set for discrete-time linear systems with pure delay in input. The key to this method is to construct an auxiliary linear system…
In this paper, robust finite-time consensus of a group of nonlinear multi-agent systems in the presence of communication time delays is considered. In particular, appropriate delay-dependent strategies which are less conservative are…
We provide algorithmically verifiable necessary and sufficient conditions for fundamental system theoretic properties of discrete time linear systems subject to data losses. More precisely, the systems in our modeling framework are subject…
Classification, the process of assigning a label (or class) to an observation given its features, is a common task in many applications. Nonetheless in most real-life applications, the labels can not be fully explained by the observed…
We consider optimal control of a stochastic network,where service is controlled to prevent buffer overflow. We use a risk-sensitive escape time criterion, which in comparison to the ordinary escape time criteria heavily penalizes exits…
Priority queues with parallel access are an attractive data structure for applications like prioritized online scheduling, discrete event simulation, or greedy algorithms. However, a classical priority queue constitutes a severe bottleneck…
We evaluate the joint distributions of electron waiting times in coherent conductors described by scattering theory. Successive electron waiting times in a single-channel conductor are found to be correlated due to the fermionic statistics…
For linear control systems, the usual state feedback stabilizability has two components: one is a continuous observation mode (i.e., to observe solutions continuously in time), and the other is a class of feedback laws (which is usually the…
Detectability of discrete event systems (DESs) is a question whether the current and subsequent states can be determined based on observations. Shu and Lin designed a polynomial-time algorithm to check strong (periodic) detectability and an…
In this paper, we first establish an exponential stability result for a class of linear switched systems and then apply this result to show the existence of the distributed observer for a discrete-time leader system over jointly connected…