5,737 research outputs found
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 ïŹrst 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
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
GLive: The Gradient overlay as a market maker for mesh-based P2P live streaming
Peer-to-Peer (P2P) live video streaming over the Internet is becoming increasingly popular, but it is still plagued
by problems of high playback latency and intermittent playback streams. This paper presents GLive, a distributed
market-based solution that builds a mesh overlay for P2P
live streaming. The mesh overlay is constructed such that (i) nodes with increasing upload bandwidth are located closer to the media source, and (ii) nodes with similar upload bandwidth become neighbours. We introduce a market-based approach that matches nodes willing and able to
share the stream with one another. However, market-based
approaches converge slowly on random overlay networks, and we improve the rate of convergence by adapting our market-based algorithm to exploit the clustering of nodes
with similar upload bandwidths in our mesh overlay. We address the problem of free-riding through nodes preferentially uploading more of the stream to the best uploaders. We compare GLive with our previous tree-based streaming protocol, Sepidar, and NewCoolstreaming in simulation, and our results show significantly improved playback continuity and playback latency
Studies of the black swamp snake, Seminatrix pygaea (Cope), with descriptions of two new subspecies
http://deepblue.lib.umich.edu/bitstream/2027.42/56321/1/MP076.pd
Semileptonic decays in the limit of a heavy daughter quark
The rate of the semileptonic decay b to c l v is calculated with order
alphas^2 accuracy, as an expansion around the limit of equal masses of the b
and c quarks. Recent results obtained around the limit of the c-quark much
lighter than b are confirmed. Details of the new expansion method are
described.Comment: 7 pages, 5 figure
High-fidelity linear optical quantum computing with polarization encoding
We show that the KLM scheme [Knill, Laflamme and Milburn, Nature {\bf 409},
46] can be implemented using polarization encoding, thus reducing the number of
path modes required by half. One of the main advantages of this new
implementation is that it naturally incorporates a loss detection mechanism
that makes the probability of a gate introducing a non-detected error, when
non-ideal detectors are considered, dependent only on the detector dark-count
rate and independent of its efficiency. Since very low dark-count rate
detectors are currently available, a high-fidelity gate (probability of error
of order conditional on the gate being successful) can be implemented
using polarization encoding. The detector efficiency determines the overall
success probability of the gate but does not affect its fidelity. This can be
applied to the efficient construction of optical cluster states with very high
fidelity for quantum computing.Comment: 12 pages, 7 figures. Improved construction of high-fidelity entangled
ancilla; references adde
- âŠ