Publications related to Border Gateway Protocol

Turning PathFinder Upside -Down: 1-4,xploring FPGA Switch -Blocks by Negotiating Switch Presence

Automated switch-block exploration gains in importance as technology scaling brings more emphasis on the physical constraints, making it insufficient to rely on abstract measures of routability alone. In this work, we take an approach that significantly di ...

IEEE COMPUTER SOC2021

Two-Step Synthesis of Linear and Bent Dicarboxylic Acid Metalloligands with Lengths of up to 3 nm

Rosario Scopelliti, Kay Severin, Farzaneh Fadaei Tirani, Suzanne Maria Jansze, Ophélie Marie Planes

Nanometer-sized polycarboxylate ligands are interesting building blocks for metallasupramolecular chemistry, but access to these compounds is often limited by complicated synthetic pathways. Here, we describe a simple two-step protocol, which allows prepar ...

2020

Development of collapse-consistent loading protocols for experimental testing of steel columns

Dimitrios Lignos

In order to effectively utilize results from quasi-static cyclic testing on structural components for the earthquake-induced collapse risk quantification of structures, the need exists to establish collapse-consistent loading protocols representing the asy ...

2020

Reliability Mechanisms for Controllers in Real-Time Cyber-Physical Systems

Maaz Mashood Mohiuddin

Cyber-physical systems (CPSs) are real-world processes that are controlled by computer algorithms. We consider CPSs where a centralized, software-based controller maintains the process in a desired state by exchanging measurements and setpoints with proces ...

EPFL2018

Influence of load history on the force-displacement response of in-plane loaded unreinforced masonry walls

Katrin Beyer, Bastian Valentin Wilding, Kiarash Mohtasham Dolatshahi

Empirical drift capacity models for in-plane loaded unreinforced masonry (URM) walls are derived from results of quasi-static cyclic shear-compression tests. The experimentally determined drift capacities are, however, dependent on the applied demand, i.e. ...

2017

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

iPRP - the Parallel Redundancy Protocol for IP Networks: Protocol Design and Operation

Jean-Yves Le Boudec, Dan-Cristian Tomozei, Miroslav Popovic, Maaz Mashood Mohiuddin

Reliable packet delivery within stringent delay-constraints is of paramount importance to mission-critical computer applications with hard real-time constraints. Because retransmission and coding techniques counteract the delay requirements, reliability ma ...

Institute of Electrical and Electronics Engineers2016

Privacy-preserving distributed collaborative filtering

Rachid Guerraoui, Anne-Marie Kermarrec, Davide Frey

We propose a new mechanism to preserve privacy while leveraging user profiles in distributed recommender systems. Our mechanism relies on two contributions: (i) an original obfuscation scheme, and (ii) a randomized dissemination protocol. We show that our ...

Springer Wien2016

Simplifying Development and Management of Software-Defined Networks

Peter Peresini

Computer networks are an important part of our life. Yet, they are traditionally hard to manage and operate. The recent shift to Software-Defined Networking (SDN) is promised to change the way in which the networks are run by their operators. However, SDN ...

EPFL2016

Decoding Delay Minimization in Inter-Session Network Coding

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze

Intra-session network coding has been shown to offer significant gains in terms of achievable throughput and delay in settings where one source multicasts data to several clients. In this paper, we consider a more general scenario where multiple sources tr ...

Institute of Electrical and Electronics Engineers2014

XOR-Based Encoding With Instantaneous Decoding for the Broadcast Erasure Channel With Feedback: The Three-User Case

We study the case of a three-user broadcast erasure channel with multiple unicast traffic sessions, where feedback from the users is fed back to the transmitter in the form of positive acknowledgment (ACK)/negative acknowledgment (NACK) messages. The capac ...

Institute of Electrical and Electronics Engineers2014

Rate allocation and optimized decoding in inter-session network coding

Eirina Bourtsoulatze

Recent advances in data processing and communication systems have led to a continuous increase in the amount of data communicated over today’s networks. These large volumes of data pose new challenges on the current networking infrastructure that only offe ...

EPFL2013

On Degrees of Freedom of Layered Two Unicast Networks with Delayed CSIT

Suhas Diggavi, I-Hsiang Wang

In this paper we study the two unicast information flow problem over layered Gaussian networks with arbitrary number of nodes and connectivity, under the model of delayed channel state information (CSI) at transmitters and instantaneous CSI at receivers. W ...

Ieee2012

Online Testing of Federated and Heterogeneous Distributed Systems

Dejan Novakovic, Dejan Kostic, Marco Canini, Vojin Jovanovic

DiCE is a system for online testing of federated and heterogeneous distributed systems. We have built a prototype of DiCE and integrated it with an open-source BGP router. DiCE quickly detects three important classes of faults, resulting from configuration ...

Association for Computing Machinery2011

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

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

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

Effective Usage of Computational Trust Models in Rational Environments

Karl Aberer, Hung Le Vu

Computational reputation-based trust models using statistical learning have been intensively studied for distributed systems where peers behave maliciously. However practical applications of such models in environments with both malicious and rational beha ...

2011

Online Testing of Federated and Heterogeneous Distributed Systems

Dejan Novakovic, Dejan Kostic, Marco Canini, Vojin Jovanovic

DiCE is a system for online testing of federated and heterogeneous distributed systems. We have built a prototype of DiCE and integrated it with a BGP router. DiCE quickly detects three important classes of faults, resulting from configuration mistakes, po ...

2011

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