相关论文: The stability of join-the-shortest-queue models wi…

We introduce and study a new model that we call the {\em matching model}. Items arrive one by one in a buffer and depart from it as soon as possible but by pairs. The items of a departing pair are said to be {\em matched}. There is a finite…

Consider the workload process for a single server queue with deterministic service times in which customers arrive according to a scheduled traffic process. A scheduled arrival sequence is one in which customers are scheduled to arrive at…

The linear switching system is a system of ODE with the time-dependent matrix taking values from a given control matrix set. The system is (asymptotically) stable if all its trajectories tend to zero for every control function. We consider…

In this paper, we present a stability criterion for Processor Sharing queues, in which the throughput may depend on the number of customers in the system (in such cases such as interferences between the users). Such a system is represented…

We investigate, under general stationary ergodic assumptions, the stability of systems of $S$ parallel queues in which any incoming customer joins the queue of the server having the $p+1$-th shortest workload ($p < S$), or a free server if…

This paper deals with stability of discrete-time switched linear systems whose all subsystems are unstable. We present sufficient conditions on the subsystems matrices such that a switched system is globally exponentially stable under a set…

We study the stability of coupled impedance passive regular linear systems under power-preserving interconnections. We present new conditions for strong, exponential, and non-uniform stability of the closed-loop system. We apply the…

This paper establishes comprehensive stability results for quasi-variational inequalities (QVIs) under monotone perturbations of the governing operator. We prove strong convergence of both minimal and maximal solutions when sequences of…

The use of available disturbance predictions within a nominal model predictive control formulation is studied. The main challenge that arises is the loss of recursive feasibility and stability guarantees when a persistent disturbance is…

We introduce the concept of non-uniform input-to-state stability for networks. It combines the uniform global stability with the uniform attractivity of any subnetwork, while it allows for non-uniform convergence of all components. For an…

In this paper we provide a set of stability conditions for linear time-varying networked control systems with arbitrary topologies using a piecewise quadratic switching stabilization approach with multiple quadratic Lyapunov functions. We…

This paper introduces and studies the notion of output-input stability, which represents a variant of the minimum-phase property for general smooth nonlinear control systems. The definition of output-input stability does not rely on a…

We present a new sufficient condition for finite-gain $L_2$ input-to-output stability of a networked system. The condition requires a matrix, that combines information on the $L_2$ gains of the sub-systems and their interconnections, to be…

This thesis addresses the question of stability of systems defined by differential equations which contain nonlinearity and delay. In particular, we analyze the stability of a well-known delayed nonlinear implementation of a certain…

Learning solution operators for differential equations with neural networks has shown great potential in scientific computing, but ensuring their stability under input perturbations remains a critical challenge. This paper presents a robust…

In this work, we study protocols so that populations of distributed processes can construct networks. In order to highlight the basic principles of distributed network construction we keep the model minimal in all respects. In particular,…

We introduce a parallel machine scheduling problem in which the processing times of jobs are not given in advance but are determined by a system of linear constraints. The objective is to minimize the makespan, i.e., the maximum job…

Extensively evaluating the capabilities of (large) language models is difficult. Rapid development of state-of-the-art models induce benchmark saturation, while creating more challenging datasets is labor-intensive. Inspired by the recent…

We present an overview of scalable load balancing algorithms which provide favorable delay performance in large-scale systems, and yet only require minimal implementation overhead. Aimed at a broad audience, the paper starts with an…

We study the asymptotic stability properties of nonlinear switched systems under the assumption of the existence of a common weak Lyapunov function. We consider the class of nonchaotic inputs, which generalize the different notions of…