Asynchronous Adaptation and Learning Over Networks—Part I: Modeling and Stability Analysis
Related publications (74)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Network coding permits to deploy distributed packet delivery algorithms that locally adapt to the network availability in media streaming applications. However, it may also increase delay and computational complexity if it is not implemented efficiently. W ...
Organizations exploit the information diffusion and signaling properties of their existing inter-organizational networks to manage the risks and uncertainty involved in forming new partnerships. How then do new organizations that are unknown to existing ne ...
Optical burst switching (OBS) is able to operate under both asynchronous and synchronous burst departures. Although the asynchronous approach is generally assumed in OBS owing to its simplicity and low technical requirements, it has been shown that perform ...
Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The impossibility of fault-tolerant set agreement in asynchronous networks is one of the seminal ...
Network coding permits to deploy distributed packet delivery algorithms that locally adapt to the network availability in media streaming applications. However, it may also increase delay and computational complexity if it is not implemented efficiently. W ...
Boolean Inference makes it possible to observe the congestion status of end-to-end paths and infer, from that, the congestion status of individual network links. In principle, this can be a powerful monitoring tool, in scenarios where we want to monitor a ...
Consider a set of nodes distributed spatially over some region forming a network, where every node takes measurements of an underlying process. The objective is for every node in the network to estimate some parameter of interest from these measurements by ...
Modelling, dimensioning and performance analysis of optical backbone networks is the main concern of this thesis. Modelling consists in representing a network under a abstract form, simpler and easier to analyse, the model. Dimensioning is achieved when ne ...
This work studies the asynchronous behavior of diffusion adaptation strategies for distributed optimization over networks. Under the assumed model, agents in the network may stop updating their estimates or may stop exchanging information at random times. ...
We consider the problem of reaching agreement in distributed systems in which some processes may deviate from their prescribed behavior before they eventually crash. We call this failure model "mortal Byzantine". After discussing some application examples ...