Publications related to Hop (networking)

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

Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Junxiong Wang

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, Diego Didona, Junxiong Wang

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 ...

ASSOC COMPUTING MACHINERY2018

Empirical Performance Evaluation of Data Dissemination Mechanisms for Spot Applications

Jean-Yves Le Boudec, Alaeddine El Fawal, Adel Aziz

We evaluate, by measurements on a real testbed, the performance of networking services required for spot applications. We call a “spot application” an application for smartphones (such as “Ad-hoc Flash Sales”) that disseminates information in a local neigh ...

2012

Understanding and Tackling the Root Causes of Instability in Wireless Mesh Networks

Patrick Thiran, Adel Aziz, David Starobinski

We investigate, both theoretically and experimentally, the stability of CSMA-based wireless mesh networks, where a network is said to be stable if and only if the queue of each relay node remains (almost surely) finite. We identify two key factors that imp ...

2011

Bringing Stability to Wireless Mesh Networks

Adel Aziz

Wireless mesh networks were designed as a mean to rapidly deliver large-scale communication capabilities without the support of any prior infrastructure. Among the different properties of mesh networks, the self-organizing feature is particularly interesti ...

EPFL2011

Signaling and Reciprocity : Robust Decentralized Information Flows in Social, Communication, and Computer Networks

Wojciech Galuba

Complex networks exist for a number of purposes. The neural, metabolic and food networks ensure our survival, while the social, economic, transportation and communication networks allow us to prosper. Independently of the purposes and particularities of th ...

EPFL2011

Neighbor discovery with reception status feedback to transmitters

Ramin Khalili

Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighbors. In this paper we study the problem of neighbor discovery in a static and s ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

Elucidating the Instability of Random Access Wireless Mesh Networks

Patrick Thiran, Adel Aziz, David Starobinski

We investigate both theoretically and experimentally the stability of CSMA-based wireless mesh networks, where a network is said to be stable if and only if the queue of each relay node remains (almost surely) finite. We identify two key factors that impac ...

2009

Multi-hop Broadcast from Theory to Reality: Practical Design for Ad Hoc Networks

Jean-Yves Le Boudec, Alaeddine El Fawal

We propose a complete design for a scope limited, multi-hop broadcast middleware, which is adapted to the variability of the ad-hoc environment and works in unlimited ad-hoc networks such as a crowd in a city, or car passengers in a busy highway system. We ...

2007

Network coding for efficient communication in extreme networks

Jean-Yves Le Boudec, Jörg Widmer

Some forms of ad-hoc networks need to operate in extremely performance- challenged environments where end-to-end connectivity is rare. Such environments can be found for example in very sparse mobile networks where nodes ”meet” only occasionally and are ab ...

2005

Packet Combining in Sensor Networks

Martin Vetterli, Henri Julien Dubois-Ferrière

This paper presents the Simple Packet Combining (SPaC) error-correction scheme for wireless sensor networks. Nodes buffer corrupt packets, and when two or more corrupt versions of a packet have been received, a packet combining procedure attempts to recove ...

2005