Zobrazeno 1 - 10
of 334
pro vyhledávání: '"Bouillard, P."'
In this paper, we characterize the class of {\em contraction perfect} graphs which are the graphs that remain perfect after the contraction of any edge set. We prove that a graph is contraction perfect if and only if it is perfect and the contraction
Externí odkaz:
http://arxiv.org/abs/2401.12793
Time-sensitive networks require timely and accurate monitoring of the status of the network. To achieve this, many devices send packets periodically, which are then aggregated and forwarded to the controller. Bounding the aggregate burstiness of the
Externí odkaz:
http://arxiv.org/abs/2305.14946
Autor:
Cremonesi, Francesco, Vesin, Marc, Cansiz, Sergen, Bouillard, Yannick, Balelli, Irene, Innocenti, Lucia, Silva, Santiago, Ayed, Samy-Safwan, Taiello, Riccardo, Kameni, Laetita, Vidal, Richard, Orlhac, Fanny, Nioche, Christophe, Lapel, Nathan, Houis, Bastien, Modzelewski, Romain, Humbert, Olivier, Önen, Melek, Lorenzi, Marco
The real-world implementation of federated learning is complex and requires research and development actions at the crossroad between different domains ranging from data science, to software programming, networking, and security. While today several
Externí odkaz:
http://arxiv.org/abs/2304.12012
Autor:
Bouillard, Anne
Stochastic Network Calculus is a probabilistic method to compute performance bounds in networks, such as end-to-end delays. It relies on the analysis of stochastic processes using formalism of (Deterministic) Network Calculus. However, unlike the det
Externí odkaz:
http://arxiv.org/abs/2211.05657
In feed-forward time-sensitive networks with Deficit Round-Robin (DRR), worst-case delay bounds were obtained by combining Total Flow Analysis (TFA) with the strict service curve characterization of DRR by Tabatabaee et al. The latter is the best-kno
Externí odkaz:
http://arxiv.org/abs/2208.11400
Autor:
Mohammed A. Ibrahem, Emanuele Verrelli, Ali M. Adawi, Jean-Sebastien G. Bouillard, Mary O’Neill
Publikováno v:
ACS Omega, Vol 9, Iss 9, Pp 10169-10176 (2024)
Externí odkaz:
https://doaj.org/article/f7c8986da6b74a8bab592a8f83c73637
The stochastic network calculus (SNC) holds promise as a versatile and uniform framework to calculate probabilistic performance bounds in networks of queues. A great challenge to accurate bounds and efficient calculations are stochastic dependencies
Externí odkaz:
http://arxiv.org/abs/2104.14215
Autor:
Bouillard, Anne
Computing accurate deterministic performance bounds is a strong need for communication technologies having strong requirements on latency and reliability. Beyond new scheduling protocols such as TSN, the FIFO policy remains at work within each class
Externí odkaz:
http://arxiv.org/abs/2010.09263
Autor:
Bouillard, Martin, Boucher, Guillaume, Ortas, Júlia Ferrer, Pointard, Benjamin, Tualle-Brouri, Rosa
Publikováno v:
Phys. Rev. Lett. 122, 210501 (2019)
Quantum memories are a crucial element towards efficient quantum protocols. In the continuous variables domain, such memories need to have near unity efficiencies. Moreover, one needs to store complex quantum states exhibiting negative Wigner functio
Externí odkaz:
http://arxiv.org/abs/1810.07419
Publikováno v:
NetCal 2018, Sep 2018, Vienne, Austria
Stochastic network calculus is a tool for computing error bounds on the performance of queueing systems. However, deriving accurate bounds for networks consisting of several queues or subject to non-independent traffic inputs is challenging. In this
Externí odkaz:
http://arxiv.org/abs/1810.04875