Results 1  10
of
10
Robust Simulation of Shared Memory: 20 Years After
, 2008
"... The article explores the concept of simulating the abstraction of a shared memory in message passing systems, despite the existence of failures. This abstraction provides an atomic register accessed with read and write operations. This article describes the Attiya, BarNoy and Dolev simulation, its ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
(Show Context)
The article explores the concept of simulating the abstraction of a shared memory in message passing systems, despite the existence of failures. This abstraction provides an atomic register accessed with read and write operations. This article describes the Attiya, BarNoy and Dolev simulation, its origins and generalizations, as well as its applications in theory and practice.
Data Storage Protocol for Heterogeneous Wireless Sensor Networks
, 2011
"... apport de recherche ..."
(Show Context)
3DLS: Densitydriven data location service for mobile adhoc networks
 in MobiHoc
, 2009
"... Finding data items is one of the most basic services of any distributed system. It is particular challenging in adhoc networks, due to their inherent decentralized nature and lack of infrastructure. A data location service (DLS) provides this capability. This paper presents 3DLS, a novel densityd ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Finding data items is one of the most basic services of any distributed system. It is particular challenging in adhoc networks, due to their inherent decentralized nature and lack of infrastructure. A data location service (DLS) provides this capability. This paper presents 3DLS, a novel densitydriven data location service. 3DLS is based on performing biased walks over a density based virtual topography. 3DLS also includes an autonomic dynamic conguration mechanism for adapting the lengths of the walks, in order to ensure good performance in varying circumstances and loads. This is without any explicit knowledge of the network characteristics, such as size, mobility speed, etc. Moreover, 3DLS does not rely on geographical knowledge, its decisions are based only on local information, it does not invoke multihop routing, and it avoids ooding the network. The paper includes a detailed performance study of 3DLS, carried by simulations, which compares 3DLS to other known approaches. The simulations results validate the viability of 3DLS.
1Content Replication in Mobile Networks
"... Abstract—Performance and reliability of content access in mobile networks is conditioned by the number and location of content replicas deployed at the network nodes. In this work, we design a practical, distributed solution to content replication that is suitable for dynamic environments and achiev ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract—Performance and reliability of content access in mobile networks is conditioned by the number and location of content replicas deployed at the network nodes. In this work, we design a practical, distributed solution to content replication that is suitable for dynamic environments and achieves load balancing. Simulation results show that our mechanism, which uses local measurements only, approximates well an optimal solution while being robust against network and demand dynamics. Also, our scheme outperforms alternative approaches in terms of both content access delay and access congestion. Index Terms—Content replication, mobile networks, node cooperation, distributed algorithms. I.
Proactive Data Dissemination in Wireless Sensor
, 2009
"... HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte p ..."
Abstract
 Add to MetaCart
(Show Context)
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. appor t de r ech er ch e
JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. X, NO. X, MONTH 201X 1 Content Replication in Mobile Networks
"... Abstract—Performance and reliability of content access in mobile networks is conditioned by the number and location of content replicas deployed at the network nodes. In this work, we design a practical, distributed solution to content replication that is suitable for dynamic environments and achiev ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—Performance and reliability of content access in mobile networks is conditioned by the number and location of content replicas deployed at the network nodes. In this work, we design a practical, distributed solution to content replication that is suitable for dynamic environments and achieves load balancing. Simulation results show that our mechanism, which uses local measurements only, approximates well an optimal solution while being robust against network and demand dynamics. Also, our scheme outperforms alternative approaches in terms of both content access delay and access congestion. Index Terms—Content replication, mobile networks, node cooperation, distributed algorithms. I.
1 Partial Probing for Scaling Overlay Routing
"... Abstract—Recent work has demonstrated that path diversity is an effective way for improving the endtoend performance of network applications. For every node pair in a fullmesh network with n nodes, this paper presents a family of new approaches for efficiently identifying an acceptable indirect p ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract—Recent work has demonstrated that path diversity is an effective way for improving the endtoend performance of network applications. For every node pair in a fullmesh network with n nodes, this paper presents a family of new approaches for efficiently identifying an acceptable indirect path that has a similar to or even better performance than the direct path, hence considerably scaling the network at the cost of low pernode traffic overhead. In prior techniques, every node frequently incurs O(n 1.5) traffic overhead to probe the links from itself to all other nodes and to broadcast its probing results to a small set of nodes. In contrast, in our approaches, each node measures its links to only O ( √ n) other nodes and transmits the measuring results to O ( √ n) other nodes, where the two node sets of size O ( √ n) are determined by the partial sampling schemes presented in this paper. Mathematical analysis and tracedriven simulations show that our approaches dramatically reduce the pernode traffic overhead to O(n) while maintaining an acceptable backup path for every node pair with high probability. More precisely, our approaches which are based on the enhanced and rotational partial sampling schemes, would be capable of increasing said probability to about 65 % and 85%, respectively. For many network applications, this is sufficiently high such that the increased scalability outweighs such a drawback. In addition, it is not desirable to absolutely identify an outstanding backup path for every node pair in reality, due to the variable link quality. Index Terms—Partial sampling, overlay network, backup path, scalability. 1
Simple Random Walks on Radio Networks (Simple Random Walks on HyperGraphs)
, 2009
"... In recent years, protocols that are based on the properties of random walks on graphs have found many applications in communication and information networks, such as wireless networks, peertopeer networks and the Web. For wireless networks (and other networks), graphs are actually not the correc ..."
Abstract
 Add to MetaCart
In recent years, protocols that are based on the properties of random walks on graphs have found many applications in communication and information networks, such as wireless networks, peertopeer networks and the Web. For wireless networks (and other networks), graphs are actually not the correct model of the communication; instead hypergraphs better capture the communication over a wireless shared channel. Motivated by this example, we study in this paper random walks on hypergraphs. First, we formalize the random walk process on hypergraphs and generalize key notions from random walks on graphs. We then give the novel definition of radio cover time, namely, the expected time of a random walk to be heard (as opposed to visit) by all nodes. We then provide some basic bounds on the radio cover, in particular, we show that while on graphs the radio cover time is O(mn), in hypergraphs it is O(mnr) where n, m and r are the number of nodes, the number of edges and the rank of the hypergraph, respectively. In addition, we define radio hitting times and give a polynomial algorithm to compute them. We conclude the paper with results on specific hypergraphs that model wireless networks in one and two dimensions. Random walks are a natural and thoroughly studied approach to randomized graph exploration. A simple random walk is a stochastic process that starts at one node of a graph and at each step moves from the current node