Related papers: Delay Bounds for Multiclass FIFO

We write the relations that characterize the simpliest timed automaton, the inertial delay buffer, in two versions: the non-deterministic and the deterministic one, by making use of the derivatives of the R->{0,1} functions.

This paper addresses the quantitative verification of finite-time constrained occupation time for stochastic continuous-time systems governed by stochastic differential equations (SDEs). Unlike classical reachability analysis, which focuses…

Stability of linear systems with uncertain bounded time-varying delays is studied under assumption that the nominal delay values are not equal to zero. An input-output approach to stability of such systems is known to be based on the bound…

Two common objectives for evaluating a schedule are the makespan, or schedule length, and the average completion time. This short note gives improved bounds on the existence of schedules that simultaneously optimize both criteria. In…

A bound uniform over various loss-classes is given for data generated by stationary and phi-mixing processes, where the mixing time (the time needed to obtain approximate independence) enters the sample complexity only in an additive way.…

Federated learning has been identified as an efficient decentralized training paradigm for scaling the machine learning model training on a large number of devices while guaranteeing the data privacy of the trainers. FedAvg has become a…

In this manuscript, we investigate a fractional stochastic neutral differential equation with time delay, which includes both deterministic and stochastic components. Our primary objective is to rigorously prove the existence of a unique…

The degrees of freedom (DoF) region of the 2-user multiple-antenna or MIMO (multiple-input, multiple-output) interference channel (IC) is studied under fast fading and the assumption of {\em delayed} channel state information (CSI) wherein…

In this paper, we study continuous and discrete linear delay systems given respectively by \[ \dot{X}(\xi) = A_0 X(\xi) + X(\xi)A_1 + B_0 X(\xi-\sigma) + X(\xi-\sigma)B_1 + G(\xi), \] and its discrete analogue \[ X(u+1) = A_0 X(u) + X(u)A_1…

We study the generalization of the G/G/1 queue obtained by relaxing the assumption of independence between inter-arrival times and service requirements. The analysis is carried out for the class of multivariate matrix exponential…

In this paper, with the notion of independent identically distributed (IID) random variables under sublinear expectations introduced by Peng [7-9], we investigate moment bounds for IID sequences under sublinear expectations. We can obtain a…

This paper focuses on consensus problems for high-order, linear multi-agent systems. Undirected communication topologies and fixed, uniform communication time delay are taken into account. This class of problems has been widely study in the…

In this paper, we consider multistopping problems for finite discrete time sequences $X_1,...,X_n$. $m$-stops are allowed and the aim is to maximize the expected value of the best of these $m$ stops. The random variables are neither assumed…

This paper studies the response time bound of a DAG (directed acyclic graph) task. Recently, the idea of using multiple paths to bound the response time of a DAG task, instead of using a single longest path in previous results, was proposed…

This paper addresses aircraft delays, emphasizing their impact on safety and financial losses. To mitigate these issues, an innovative machine learning (ML)-enhanced landing scheduling methodology is proposed, aiming to improve automation…

Recently, Atar and Miyazawa [2] introduced a multi-level GI/G/1 queue with a finite number of levels, where both the arrival and service rates depend on the level corresponding to the current queue length. For this model, they proved that…

We consider a GI/GI/1 queue with the shortest remaining processing time discipline (SRPT) and light-tailed service times. Our interest is focused on the tail behavior of the sojourn-time distribution. We obtain a general expression for its…

We consider the age of information in G/G/1/1 systems under two service discipline models. In the first model, if a new update arrives when the service is busy, it is blocked; in the second model, a new update preempts the current update in…

Federated learning aims to learn a global model collaboratively while the training data belongs to different clients and is not allowed to be exchanged. However, the statistical heterogeneity challenge on non-IID data, such as class…

This paper presents a novel First Order Plus Fractional Diffusive Delay (FOPFDD) model, capable of modeling delay dominant systems with high accuracy. The novelty of the FOPFDD is the Fractional Diffusive Delay (FDD) term, an exponential…