Publication

Scalable Routing Easy as PIE: a Practical Isometric Embedding Protocol

Publications associées (28)

Causal Consistency and Latency Optimality: Friend or Foe? [Extended Version]

Rachid Guerraoui, Willy Zwaenepoel, Junxiong Wang, Diego Didona

Causal consistency is an attractive consistency model for geo-replicated data stores. It is provably the strongest model that tolerates network partitions. It avoids the long latencies associated with strong consistency, and, especially when using read-onl ...

2018

Causal Consistency and Latency Optimality: Friend or Foe?

Rachid Guerraoui, Willy Zwaenepoel, Junxiong Wang, Diego Didona

ASSOC COMPUTING MACHINERY2018

Network utility maximization for delay-sensitive applications in unknown communication settings

Stefano D'Aronco

In the last decades the Internet traffic has greatly evolved. The advent of new Internet services and applications has, in fact, led to a significant growth of the amount of data transmitted, as well as to a transformation of the data type. As a matter of ...

EPFL2018

Scalable Bias-Resistant Distributed Randomness

Linus Gasser, Nicolas Gailly, Eleftherios Kokoris Kogias, Bryan Alexander Ford, Ismail Khoffi, Philipp Svetolik Jovanovic

Bias-resistant public randomness is a critical component in many (distributed) protocols. Existing solutions do not scale to hundreds or thousands of participants, as is needed in many decentralized systems. We propose two large-scale distributed protocols ...

IEEE2017

Space lower bounds for low-stretch greedy embeddings

Christos Kalaitzis

Greedy (geometric) routing is an important paradigm for routing in communication networks. It uses an embedding of the nodes of a network into points of a space (e.g., R-d) equipped with a distance function (e.g., the Euclidean distance l(2)) and uses as a ...

Elsevier Science Bv2016

Dynamic Routing for Flying Ad Hoc Networks

Dario Floreano, Bixio Rimoldi, Grégoire Hilaire Marie Heitz, Stefano Rosati, Karol Jacek Kruzelecki

This paper reports experimental results on self-organizing wireless networks carried by small flying robots. Flying ad hoc networks (FANETs) composed of small unmanned aerial vehicles (UAVs) are flexible, inexpensive and fast to deploy. This makes them a v ...

Ieee-Inst Electrical Electronics Engineers Inc2016

Reliable and Real-Time Distributed Abstractions

David Kozhaya

The celebrated distributed computing approach for building systems and services using multiple machines continues to expand to new domains. Computation devices nowadays have additional sensing and communication capabilities, while becoming, at the same tim ...

EPFL2016

Clock-Gating of Streaming Applications for Energy Efficient Implementations on FPGAs

Marco Mattavelli, Endri Bezati, Simone Casale Brunet

This paper investigates the reduction of dynamic power for streaming applications yielded by asynchronous dataflow designs by using clock gating techniques. Streaming applications constitute a very broad class of computing algorithms in areas such as signa ...

2016