Related papers: Stability and Capacity Regions or Discrete Time Qu…
In this paper we show that in a multiclass Markovian network with unit rate servers, the condition that the average load $\rho$ at every server is less than unity is indeed sufficient for the stability or positive recurrence for \emph{any}…
We consider stability of scheduled multiaccess message communication with random coding and joint maximum-likehood decoding of messages. The framework we consider here models both the random message arrivals and the subsequent reliable…
In many reinforcement learning (RL) applications, we want policies that reach desired states and then keep the controlled system within an acceptable region around the desired states over an indefinite period of time. This latter objective…
In this work characterizations of notions of output stability for uncertain time-varying systems described by retarded functional differential equations are provided. Particularly, characterizations by means of Lyapunov and Razumikhin…
We investigate two quantities of interest in a delay-tolerant mobile ad hoc network: the network capacity region and the minimum energy function. The network capacity region is defined as the set of all input rates that the network can…
Collective stable chaos consists of the persistence of disordered patterns in dynamical spatiotemporal systems possessing a negative maximum Lyapunov exponent. We analyze the role of the topology of connectivity on the emergence and…
The effect of signals on stability, throughput region, and delay in a two-user slotted ALOHA based random-access system with collisions is considered. This work gives rise to the development of random access G-networks, which can model…
A method is presented to analyze the stability of feedback systems with neural network controllers. Two stability theorems are given to prove asymptotic stability and to compute an ellipsoidal inner-approximation to the region of attraction…
We study the phenomenon of entrainment in processor sharing networks, whereby, while individual network resources have sufficient capacity to met demand, the requirement for simultaneous availability of resources means that a network may…
A class of chemical reaction networks is described with the property that each positive equilibrium is locally asymptotically stable relative to its stoichiometry class, an invariant subspace on which it lies. The reaction systems treated…
The landing and takeoff operations for an airport at any given day are described in terms of the capacity envelopes associated to runway system configurations, of the scheduled flights along the day and of predefined delay tolerances for…
The rapid increase in the integration of intermittent and stochastic renewable energy resources (RER) introduces challenging issues related to power system stability. Interestingly, identifying grid nodes that can best support stochastic…
In part I, we reviewed how Shannon's classical notion of capacity is not sufficient to characterize a noisy communication channel if the channel is intended to be used as part of a feedback loop to stabilize an unstable scalar linear…
In this paper, we study the stability of two interacting queues under random multiple access in which the queues leverage the feedback information. We derive the stability region under random multiple access where one of the two queues…
In this paper we develop scheduling policies that maximize the stability region of a wireless network under the assumption that mutual information accumulation is implemented at the physical layer. When the link quality between nodes is not…
The nervous system reorganizes memories from an early site to a late site, a commonly observed feature of learning and memory systems known as systems consolidation. Previous work has suggested learning rules by which consolidation may…
Motivated by packet routing in computer networks, online queuing systems are composed of queues receiving packets at different rates. Repeatedly, they send packets to servers, each of them treating only at most one packet at a time. In the…
Queueing networks are gaining attraction for the performance analysis of parallel computer systems. A Jackson network is a set of interconnected servers, where the completion of a job at server i may result in the creation of a new job for…
We consider a discrete-time system comprising a first-come-first-served queue, a non-preemptive server, and a stationary non-work-conserving scheduler. New tasks enter the queue according to a Bernoulli process with a pre-specified arrival…
In this paper we present a stability criterion for finite measure-valued stochastic recursions, generalizing Loynes's Theorem to spaces of measures. This result provides conditions for the reach of a "total stationary state" for the queue…