A New Stable Peer-to-Peer Protocol with Non-persistent Peers

Recent studies have suggested that the stability of peer-to-peer networks may rely on persistent peers, who dwell on the network after they obtain the entire file. In the absence of such peers, one piece becomes extremely rare in the network, which leads to instability. Technological developments, however, are poised to reduce the incidence of persistent peers, giving rise to a need for a protocol that guarantees stability with non-persistent peers. We propose a novel peer-to-peer protocol, the group suppression protocol, to ensure the stability of peer-to-peer networks under the scenario that all the peers adopt non-persistent behavior. Using a suitable Lyapunov potential function, the group suppression protocol is proven to be stable when the file is broken into two pieces, and detailed experiments demonstrate the stability of the protocol for arbitrary number of pieces. We define and simulate a decentralized version of this protocol for practical applications. Straightforward incorporation of the group suppression protocol into BitTorrent while retaining most of BitTorrent's core mechanisms is also presented. Subsequent simulations show that under certain assumptions, BitTorrent with the official protocol cannot escape from the missing piece syndrome, but BitTorrent with group suppression does.Comment: There are only a couple of minor changes in this version. Simulation tool is specified this time. Some repetitive figures are remove

A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks

In the complete graph on n vertices, when each edge has a weight which is an exponential random variable, Frieze proved that the minimum spanning tree has weight tending to zeta(3)=1/1^3+1/2^3+1/3^3+... as n goes to infinity. We consider spanning trees constrained to have depth bounded by k from a specified root. We prove that if k > log_2 log n+omega(1), where omega(1) is any function going to infinity with n, then the minimum bounded-depth spanning tree still has weight tending to zeta(3) as n -> infinity, and that if k < log_2 log n, then the weight is doubly-exponentially large in log_2 log n - k. It is NP-hard to find the minimum bounded-depth spanning tree, but when k < log_2 log n - omega(1), a simple greedy algorithm is asymptotically optimal, and when k > log_2 log n+omega(1), an algorithm which makes small changes to the minimum (unbounded depth) spanning tree is asymptotically optimal. We prove similar results for minimum bounded-depth Steiner trees, where the tree must connect a specified set of m vertices, and may or may not include other vertices. In particular, when m = const * n, if k > log_2 log n+omega(1), the minimum bounded-depth Steiner tree on the complete graph has asymptotically the same weight as the minimum Steiner tree, and if 1 <= k <= log_2 log n-omega(1), the weight tends to (1-2^{-k}) sqrt{8m/n} [sqrt{2mn}/2^k]^{1/(2^k-1)} in both expectation and probability. The same results hold for minimum bounded-diameter Steiner trees when the diameter bound is 2k; when the diameter bound is increased from 2k to 2k+1, the minimum Steiner tree weight is reduced by a factor of 2^{1/(2^k-1)}.Comment: 30 pages, v2 has minor revision

Modular Graph Functions

In earlier work we studied features of non-holomorphic modular functions associated with Feynman graphs for a conformal scalar field theory on a two-dimensional torus with zero external momenta at all vertices. Such functions, which we will refer to as modular graph functions, arise, for example, in the low energy expansion of genus-one Type II superstring amplitudes. We here introduce a class of single-valued elliptic multiple polylogarithms, which are defined as elliptic functions associated with Feynman graphs with vanishing external momenta at all but two vertices. These functions depend on a coordinate, $\zeta$, on the elliptic curve and reduce to modular graph functions when $\zeta$ is set equal to $1$. We demonstrate that these single-valued elliptic multiple polylogarithms are linear combinations of multiple polylogarithms, and that modular graph functions are sums of single-valued elliptic multiple polylogarithms evaluated at the identity of the elliptic curve, in both cases with rational coefficients. This insight suggests the many interrelations between modular graph functions (a few of which were established in earlier papers) may be obtained as a consequence of identities involving multiple polylogarithms, and explains an earlier observation that the coefficients of the Laurent polynomial at the cusp are given by rational numbers times single-valued multiple zeta values.Comment: 42 pages, significant clarifications added in section 5, minor typos corrected, and references added in version

Card shuffling and diophantine approximation

The ``overlapping-cycles shuffle'' mixes a deck of $n$ cards by moving either the $n$th card or the $(n-k)$th card to the top of the deck, with probability half each. We determine the spectral gap for the location of a single card, which, as a function of $k$ and $n$, has surprising behavior. For example, suppose $k$ is the closest integer to $\alpha n$ for a fixed real $\alpha\in(0,1)$. Then for rational $\alpha$ the spectral gap is $\Theta(n^{-2})$, while for poorly approximable irrational numbers $\alpha$, such as the reciprocal of the golden ratio, the spectral gap is $\Theta(n^{-3/2})$.Comment: Published in at http://dx.doi.org/10.1214/07-AAP484 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

Chemical composition, fibre types and enzymes activates of longissimus thoracis muscle of the one humped camel

Thirty samples of Longissimus thoracis (LT) muscle were collected from 2-3 years old male camels slaughtered according to seasons of the year (winter, summer and autumn). The samples were then subjected to chemical analysis to study the chemical composition, fibre types and metabolic enzymes activities and variations among seasons. The results showed that chemical composition, ultimate pH (pHu) and calor were significantly influenced by season. Enzymes activities of isocitrate dehydrogenase (ICDH) and phosphofructokinase (PFK) were higher during autumn season compared to summer and winter (2.7 and 1.8 uml/min per g muscle, respectively). Quantification of muscle myosin heavy chain isoforms by SOS-PAGE electrophoresis and image analysis indicated higher proportions rn winter for type I muscle fibres and in autumn for type I la muscle fibres. Positive correlation was observed (0.84) between the proportion of fibre type I and lsocitrate Dehydrogenase (ICDH) enzyme activity. These findings indicated that muscle characteristics in camels are highly regulated by season. (Résumé d'auteur

Relativistic Photon Mediated Shocks

A system of equations governing the structure of a steady, relativistic radiation dominated shock is derived, starting from the general form of the transfer equation obeyed by the photon distribution function. Closure is obtained by truncating the system of moment equations at some order. The anisotropy of the photon distribution function inside the shock is shown to increase with increasing shock velocity, approaching nearly perfect beaming at upstream Lorentz factors $\Gamma_{-}>>1$. Solutions of the shock equations are presented for some range of upstream conditions. These solutions are shown to converge as the truncation order is increased.Comment: 5 pages, a shorter version will appear in PR