10,583 research outputs found
Gozar: NAT-friendly Peer Sampling with One-Hop Distributed NAT Traversal
Gossip-based peer sampling protocols have been widely used as a building block for many large-scale distributed applications. However, Network Address Translation gateways (NATs) cause most existing gossiping protocols to break down, as nodes cannot establish direct connections to nodes behind NATs (private nodes). In addition, most of the existing NAT traversal algorithms for establishing connectivity to private nodes rely on third party servers running at a well-known, public IP addresses. In this paper, we present Gozar, a gossip-based peer sampling service that: (i) provides uniform random samples in the presence of NATs, and (ii) enables direct connectivity to sampled nodes using a fully distributed NAT traversal service, where connection messages require only a single
hop to connect to private nodes. We show in simulation that Gozar preserves the randomness properties of a gossip-based peer sampling service. We show the robustness of Gozar when a large fraction of nodes reside behind NATs and also in
catastrophic failure scenarios. For example, if 80% of nodes are behind NATs, and 80% of the nodes fail, more than 92% of the remaining nodes stay connected. In addition, we compare Gozar with existing NAT-friendly gossip-based peer sampling services, Nylon and ARRG. We show that Gozar is the only system that supports one-hop NAT traversal, and its overhead is roughly half of Nylon’s
Finite-time Convergent Gossiping
Gossip algorithms are widely used in modern distributed systems, with
applications ranging from sensor networks and peer-to-peer networks to mobile
vehicle networks and social networks. A tremendous research effort has been
devoted to analyzing and improving the asymptotic rate of convergence for
gossip algorithms. In this work we study finite-time convergence of
deterministic gossiping. We show that there exists a symmetric gossip algorithm
that converges in finite time if and only if the number of network nodes is a
power of two, while there always exists an asymmetric gossip algorithm with
finite-time convergence, independent of the number of nodes. For nodes,
we prove that a fastest convergence can be reached in node
updates via symmetric gossiping. On the other hand, under asymmetric gossip
among nodes with , it takes at least node
updates for achieving finite-time convergence. It is also shown that the
existence of finite-time convergent gossiping often imposes strong structural
requirements on the underlying interaction graph. Finally, we apply our results
to gossip algorithms in quantum networks, where the goal is to control the
state of a quantum system via pairwise interactions. We show that finite-time
convergence is never possible for such systems.Comment: IEEE/ACM Transactions on Networking, In Pres
Formal analysis techniques for gossiping protocols
We give a survey of formal verification techniques that can be used to corroborate existing experimental results for gossiping protocols in a rigorous manner. We present properties of interest for gossiping protocols and discuss how various formal evaluation techniques can be employed to predict them
Applying Formal Methods to Gossiping Networks with mCRL and Groove
In this paper we explore the practical possibilities of using formal methods to analyze gossiping networks. In particular, we use mCRL and Groove to model the peer sampling service, and analyze it through a series of model transformations to CTMCs and finally MRMs. Our tools compute the expected value of various network quality indicators, such as average path lengths, over all possible system runs. Both transient and steady state analysis are supported. We compare our results with the simulation and emulation results found in [10]
Shuffling with a Croupier: Nat-Aware Peer-Sampling
Despite much recent research on peer-to-peer (P2P) protocols for the Internet, there have been relatively few practical protocols designed to explicitly account for Network Address Translation gateways (NATs). Those P2P protocols that do handle NATs circumvent them using relaying and hole-punching techniques to route packets to nodes residing behind NATs. In this paper, we present Croupier, a peer sampling service (PSS) that provides uniform random samples of nodes in the presence of NATs in the network. It is the first NAT-aware PSS that works without the use of relaying or hole-punching. By removing the need for relaying and hole-punching, we decrease the complexity and overhead of our protocol as well as increase
its robustness to churn and failure. We evaluated Croupier in simulation, and, in comparison with existing NAT-aware PSS’, our results show similar randomness properties, but improved robustness in the presence of both high percentages of nodes behind NATs and massive node failures. Croupier also has substantially lower protocol overhead
Message and time efficient multi-broadcast schemes
We consider message and time efficient broadcasting and multi-broadcasting in
wireless ad-hoc networks, where a subset of nodes, each with a unique rumor,
wish to broadcast their rumors to all destinations while minimizing the total
number of transmissions and total time until all rumors arrive to their
destination. Under centralized settings, we introduce a novel approximation
algorithm that provides almost optimal results with respect to the number of
transmissions and total time, separately. Later on, we show how to efficiently
implement this algorithm under distributed settings, where the nodes have only
local information about their surroundings. In addition, we show multiple
approximation techniques based on the network collision detection capabilities
and explain how to calibrate the algorithms' parameters to produce optimal
results for time and messages.Comment: In Proceedings FOMC 2013, arXiv:1310.459
Gossip Algorithms for Distributed Signal Processing
Gossip algorithms are attractive for in-network processing in sensor networks
because they do not require any specialized routing, there is no bottleneck or
single point of failure, and they are robust to unreliable wireless network
conditions. Recently, there has been a surge of activity in the computer
science, control, signal processing, and information theory communities,
developing faster and more robust gossip algorithms and deriving theoretical
performance guarantees. This article presents an overview of recent work in the
area. We describe convergence rate results, which are related to the number of
transmitted messages and thus the amount of energy consumed in the network for
gossiping. We discuss issues related to gossiping over wireless links,
including the effects of quantization and noise, and we illustrate the use of
gossip algorithms for canonical signal processing tasks including distributed
estimation, source localization, and compression.Comment: Submitted to Proceedings of the IEEE, 29 page
Informational Warfare
Recent empirical and theoretical work suggests that reputation was an important mediator of access to resources in ancestral human environments. Reputations were built and maintained by the collection, analysis, and dissemination of information about the actions and capabilities of group members-that is, by gossiping. Strategic gossiping would have been an excellent strategy for manipulating reputations and thereby competing effectively for resources and for cooperative relationships with group members who could best provide such resources. Coalitions (cliques) may have increased members' abilities to manipulate reputations by gossiping. Because, over evolutionary time, women may have experienced more within-group competition than men, and because female reputations may have been more vulnerable than male reputations to gossip, gossiping may have been a more important strategy for women than men. Consequently, women may have evolved specializations for gossiping alone and in coalitions. We develop and partially test this theory
- …