A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
This paper presents a new theorem called the reordering theorem for the problem of gossiping by telephone. ... The reordering theorem also provides a solution to the problem of gossiping with minimum cost, which has been unsolved in the literature for more than fifteen years, * ... First, the reordering theorem is a succinct encapsulation of a wide range of results for gossiping by telephone. ...doi:10.1016/0012-365x(94)00302-y fatcat:c2smmm5wmbhdhfvt3wmmsi5fvm
gossip schemes. ... The author proves a structural theorem concerning schemes of calls that achieve gossiping. ...
We construct two classes of k-fault-tolerant gossip schemes (sequences of calls) and found two upper bounds of τ(n,k), which improve the previously known results. ... Assuming that the calls can take place simultaneously, it is also of interest to find k-fault-tolerant gossip schemes, which can spread the full information in minimal time. ... The gossip schemes, which provide k-fault-tolerance, are called k-fault-tolerant gossip schemes. Denote the minimal number of calls in the k-fault-tolerant minimal gossip scheme by τ (n, k). ...arXiv:1304.5633v1 fatcat:kcbpj5roqvasdigbuvgiqx6k6a
Proof, Let A be a scheme achieving f(n, I(). ... reverse the order of these m calls we have a scheme in which after m calls cverbody knows person x's information. ...doi:10.1016/0012-365x(80)90116-8 fatcat:y3txloivnnbd7h4oo2jylx3jli
Summary: “Broadcasting and gossiping are fundamental tasks in network communication. ... We emphasize the unifying thread in most results from the research in fault-tolerant communication: the trade-offs between efficiency of communication schemes and their fault-tolerance.” ...
This scheme resists manipulation because no party can control the generator's seed. ... Furthermore, nodes can easily exclude or reorder transactions without detection. ...arXiv:1606.07490v1 fatcat:givlzynzu5gfvaij5hvy7d3bui
We are assuming a gossip scheme in which each replica gossips with all the others, but only about the updates that it processed and that the recipient may not know. ... For example, our scheme places less load on servers than schemes such as the ISIS multicast  in which every update causes a message to be received at every server. ...doi:10.1145/138873.138877 fatcat:xs3hykdjdfcapn3r4o6flil2ke
BBTU involves two steps: 1) balance binary tree construction based on a prefetching algorithm in order to support interactivity; 2) unstructured video dissemination over network based on gossip protocol ... of BBTU The proposed prefetching scheme is illustrated in figure 2. ... The node which finishes sending its prefetching video segments is deleted from Que; 6) Assuming the time for X's jump is t jump, then X's joining time in QJtime is replaced by t jump -g and QJtime reorders ...doi:10.1109/icc.2008.345 dblp:conf/icc/XuMFH08 fatcat:bjxlzuaau5gjxcas46l5xai3mq
2006 5th International Conference on Information Processing in Sensor Networks
The system simultaneously computes random projections of the sensor data and disseminates them throughout the network using a simple gossiping algorithm. ... Though there is no overhead for complex routing schemes, the tradeoff is that gossip algorithms may require more computational iterations than an approach using more complex routing. ... Thus, geographic gossip provides a practical means of computing projection coefficients at roughly a factor of n 1/2 additional communication complexity over a scheme based on specialized routes. ...doi:10.1109/ipsn.2006.244056 fatcat:olexozzv6vcdzn644vzflyf3oy
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 ... 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. ... A related scheme was proposed concurrently by Jung et al. ...doi:10.1109/jproc.2010.2052531 fatcat:ssu7tyrodbgwhaoiogfdcyqesm
This scheme greatly reduces the chance of getting the same encoded block from the network. ... Each block has a numerical sequence number, which receivers can use to correctly reorder blocks for playback. Because there's a playback deadline for each block, data delivery must be timely. ...doi:10.1109/mmul.2007.30 fatcat:ntvwlb6uffectid3ypauc7zwka
Gossiping the watermarks enables asynchronous transaction processing and acknowledging transaction visibility in batches in the concurrency control and replication protocols, which improves efficiency ... the visibility of transactions, and we address both concerns using a multi-version protocol that tracks visibility using version watermarks and arrives at correct visibility decisions using efficient gossip ... Our Asynchronous Concurrency Control scheme is based on watermark gossip, and is able to process conflicting transactions in parallel. ...doi:10.14778/3342263.3342627 fatcat:x5tfeolyajesdgwlp5f4re65ta
The system simultaneously computes random projections of the sensor data and disseminates them throughout the network using a simple gossiping algorithm. ... Reordering the coefficients in decreasing magnitude so that |θ (1) | ≥ |θ (2) | ≥ · · · ≥ |θ (n) |, the best m-term approximation of x in Ψ is given by x (m) = m i=1 θ (i) ψ (i) . ... Using a more practical geographic gossip algorithm to compute k projection coefficients requires O kn 3/2 / √ log n transmissions. ...doi:10.1145/1127777.1127789 dblp:conf/ipsn/RabbatHSN06 fatcat:7ansdljk3fahfbsehalhds2mvu
In this paper we introduce Creek, a low-latency, eventually consistent replication scheme that also enables execution of strongly consistent operations (akin to ACID transactions). ... In the TPC-C benchmark, Creek offers up to 2.5 times lower latency in returning client responses compared to the state-of-the-art speculative SMR scheme, while maintaining high accuracy of the speculative ... Then the tail of the toBeExecuted list will undergo reordering. ...arXiv:1907.00748v2 fatcat:4yszgbqg4jfj3a5ogvfwotbb7i
Using our scheme, each process can ensure that during a computation it always maintains the best possible information about every other process. ... Our solution to the gossip problem has several applications in the analysis of distributed systems. ... Establishing the correctness of the time-stamping scheme of  is rather complicated and a protocol that uses a simpler time-stamping scheme was introduced in  . ...doi:10.1016/s0304-3975(01)00329-2 fatcat:aigtadsa75hhndrwoaxbjvtpoy
« Previous Showing results 1 — 15 out of 750 results