NASCENT: Network Layer Service for Vicinity Ad-hoc Groups
Related publications (54)
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Concurrency and failures are fundamental problems in distributed computing. One likes to think that the mechanisms needed to address these problems can be separated from the rest of the distributed application: in modern words, these mechanisms could be as ...
We designed the terminode routing protoc ol with the objective to scale in large mobile ad hoc networks where the topology, or node distribution, is irregular. Our routing protocol is a combination of two protocols: Terminode Local Routing (TLR - to reach ...
The perfectly synchronized round model provides the powerful abstraction of crash-stop failures with atomic message delivery. This abstraction makes distributed programming very easy. We present an implementation of this abstraction in a distributed system ...
It is now recognized that the Consensus problem is a fundamental problem when one has to design and implement reliable asynchronous distributed systems. This chapter is on the Consensus problem. It studies Consensus in two failure models, namely, the Crash ...
Well adapted to the loosely coupled nature of distributed interaction in large-scale applications, the publish/subscribe communication paradigm has recently received increasing attention. With systems based on the publish/subscribe interaction scheme, subs ...
Concurrency and failures are fundamental problems in distributed computing. One likes to think that the mechanisms needed to address these problems can be separated from the rest of the distributed application: in modern words, these mechanisms could be as ...
In this thesis we study two routing problems related to mobility. The first problem concerns scalable multicast routing when there is a large number of multicast groups with a small number of receivers. Existing dense and sparse mode routing protocols have ...
The developing environment presented in the paper is built around an interactive tool that can accompany the software engineer for the whole software development process of concurrent and distributed applications. This environment relies on a concept of ac ...
Contention-Aware Metrics for Distributed Algorithms: Comparison of Atomic Broadcast Algorithms Peter Urban, Xavier Defago and Andre Schiper Resource contention is widely recognized as having a major impact on the performance of distributed algorithms. Neve ...
This paper defines the fault-tolerant mutual exclusion problem in a message-passing asynchronous system and determines the weakest failure detector to solve the problem. This failure detector, which we call the trusting failure detector, and which we denot ...