Publications related to IEEE 802.1aq

D-Cliques: Compensating for Data Heterogeneity with Topology in Decentralized Federated Learning

The convergence speed of machine learning models trained with Federated Learning is significantly affected by non-independent and identically distributed (non-IID) data partitions, even more so in a fully decentralized setting without a central server. In ...

2022

Verifying Software Network Functions with No Verification Expertise

George Candea, Solal Vincenzo Pirelli, Rishabh Ramesh Iyer, Aikaterini Argyraki, Luis David Figueiredo Mascarenhas Moreira Pedrosa, Matteo Rizzo

We present the design and implementation of Vigor, a software stack and toolchain for building and running software network middleboxes that are guaranteed to be correct, while preserving competitive performance and developer productivity. Developers write ...

ACM2019

Extrapolating Paths with Graph Neural Networks

Andreas Loukas, Jean-Baptiste Francis Marie Juliette Cordonnier

We consider the problem of path inference: given a path prefix, i.e., a partially observed sequence of nodes in a graph, we want to predict which nodes are in the missing suffix. In particular, we focus on natural paths occurring as a by-product of the int ...

IJCAI, Inc.2019

On the Delays in Time-Varying Networks: Does Larger Service-Rate Variance Imply Larger Delays?

Patrick Thiran, Sébastien Christophe Henri

In all networks, link or route capacities fluctuate for multiple reasons, e.g., fading and multi-path effects on wireless channels, interference and contending users on a shared medium, varying loads in WAN routers, impedance changes on power-line channels ...

2018

Phonological Posterior Hashing for Query by Example Spoken Term Detection

Hervé Bourlard, Afsaneh Asaei, Dhananjay Ram

State of the art query by example spoken term detection (QbE-STD) systems in zero-resource conditions rely on representation of speech in terms of sequences of class-conditional posterior probabilities estimated by deep neural network (DNN). The posteriors ...

ISCA-INT SPEECH COMMUNICATION ASSOC2018

Frugal Topology Construction for Stream Aggregation in the Cloud

Rachid Guerraoui, Rhicheek Patra, Bao Duy Tran

Aggregation of streamed data is key to the expansion of the Internet of Things. This paper addresses the problem of designing a topology for reliably aggregating data flows from many devices arriving at a datacenter. Reliability here means ensuring operati ...

Ieee2016

Experimental Validation of the Usability of Wi-Fi over Redundant Paths for Streaming Phasor Data

Jean-Yves Le Boudec, Athanasios Giannakopoulos, Miroslav Popovic, Maaz Mashood Mohiuddin

Applications performing streaming of phasor- measurement data require low latency and losses from the communication network. Traditionally, such requirements are realized through wired infrastructure. Recently, wireless infras- tructure has gained attentio ...

Ieee2016

Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast

Michael Christoph Gastpar, Jasper Goseling

Compute-and-Forward (CF), also known as reliable physical layer network coding, is a technique that provides the possibility of exploiting the features of broadcast and superposition in wireless networks. It has been shown that the throughput for multiple ...

Institute of Electrical and Electronics Engineers2014

Stable Routing And Unique-Max Coloring On Trees

Laura Sanità, Rico Zenklusen, Nicolai Hähnle

Some of the routing protocols used in telecommunication networks route traffic on a shortest path tree according to configurable integral link weights. One crucial issue for network operators is finding a weight function that ensures a stable routing: when ...

SIAM Publications2013

Evaluation of classification algorithms for intrusion detection in MANETs

Aikaterini Mitrokotsa

Mobile Ad hoc Networks (MANETs) are wireless networks without fixed infrastructure based on the cooperation of independent mobile nodes. The proliferation of these networks and their use in critical scenarios (like battlefield communications or vehicular n ...

Elsevier Science Bv2012

Maximum likelihood estimation for multiple-source losss tomography with network coding

Christina Fragouli

Loss tomography aims at inferring the loss rate of links in a network from end-to-end measurements. Previous work in [1] has developed optimal maximum likelihood estimators (MLEs) for link loss rates in a single-source multicast tree. However, only sub-opt ...

2011

Valuable Detours: Least-Cost Anypath Routing

Martin Vetterli, Matthias Grossglauser, Henri Julien Dubois-Ferrière

In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. This observation was previously exploited by opportunistic routing protocols by using single-path routing metrics to assign to each no ...

2011

Definitive Consensus for Distributed Data Inference

Leonidas Georgopoulos

Inference from data is of key importance in many applications of informatics. The current trend in performing such a task of inference from data is to utilise machine learning algorithms. Moreover, in many applications that it is either required or is pref ...

EPFL2011

On the capacity of non-coherent network coding

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani, Soheil Mohajerzefreh

We consider the problem of multicasting information from a source to a set of receivers over a network where interme- diate network nodes perform randomized linear network coding operations on the source packets. We propose a channel model for the noncoher ...

2011

Degraded two-message multicast over graphs

Christina Fragouli, Shirin Saeedi Bidokhti

We consider communication of two degraded mes- sage sets over graphs where a common source sends two prioritized messages (a common and a private message) to several receivers. All receivers require the common message and a subset of the receivers require ...

2011

A network coding approach to the shipper detection problem

Christina Fragouli, Lorenzo Keller, Abdulkadir Karaagaç

This paper experimentally studies the reliability and delay of flooding based multicast protocols for a sniper detection application. In particular using an emulator it studies under which conditions protocols based on network coding deliver performance im ...

2011

Multi-objective optimization of regenerator placement using Constraint Programming

Sébastien Rumley, Christian Gaumier

In translucent optical networks, connections bypass most intermediate nodes transparently. However, their signal quality is affected by the traveled distance and/or the bypass operations. Hence, they might require optical-electrical-optical conversions at ...

2011

Stable routing under the Spanning Tree Protocol

Laura Sanità

The Spanning Tree Protocol routes traffic on shortest path trees. If some edges fail, the traffic has to be rerouted consequently, setting up alternative trees. In this paper we design efficient algorithms to compute polynomial-size integer weights so as t ...

Elsevier2010

Algebraic techniques for deterministic networks

Christina Fragouli, Javad Ebrahimi Boroojeni

We here summarize some recent advances in the study of linear deterministic networks, recently proposed as approximations for wireless channels. This work started by extending the algebraic framework developed for multicasting over graphs in [1] to include ...

2010

QoSNC: A Novel Approach to QoS-Based Network Coding for Fixed Networks

Amir Hesam Salavati

In this paper, we present a decentralized algorithm to find minimum cost quality of service (QoS) flow subgraphs in network coded multicast schemes. The main objective is to find minimum cost subgraphs that also satisfy user-specified QoS constraints, spec ...

2010