Filters








1,119 Hits in 4.5 sec

Modeling gossip-based content dissemination and search in distributed networking

Siyu Tang, Eva Jaho, Ioannis Stavrakakis, Ioannis Koukoutsidis, Piet Van Mieghem
<span title="">2011</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/mnyvgmlsc5a5xi7554ow77exfu" style="color: black;">Computer Communications</a> </i> &nbsp;
Different node behaviors, with respect to their degree of cooperation and compliance with the gossiping process, are also incorporated.  ...  When using random gossiping, communication with multiple peers in one gossiping round is allowed.  ...  The work of the National and Kapodistrian University of Athens has been supported in part by SOCIALNETS (FP7-IST-217141).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.comcom.2010.10.001">doi:10.1016/j.comcom.2010.10.001</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ta2aejw2ljcgvcphx7vuckj4l4">fatcat:ta2aejw2ljcgvcphx7vuckj4l4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809054606/https://www.nas.ewi.tudelft.nl/people/Piet/papers/ComputerCommunication2011_Gossip_Content_Dissemination.pdf?origin=publication_detail" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/81/64/8164c0b9c9836d3509bcf7fb1580436212fab1e3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.comcom.2010.10.001"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Gossip in a Smartphone Peer-to-Peer Network [article]

Calvin Newport
<span title="2017-05-26">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We then turn our attention to the easier case where the topology graph is stable, and describe and analyze a new gossip algorithm that provides a substantial performance improvement for many parameters  ...  We begin by describing and analyzing new randomized gossip algorithms in this model under the harsh assumption of a network topology that can change completely in every round.  ...  Label the balls 1, 2, ..., k and the bins 1, 2, ..., k ′ . Let b 1 be bin in which ball 1 is thrown. We now calculate the expected number of other balls to land in b 1 .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1705.09609v1">arXiv:1705.09609v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6kcq4rohbrbitmldzg4c324nna">fatcat:6kcq4rohbrbitmldzg4c324nna</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191012035233/https://arxiv.org/pdf/1705.09609v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/dd/49/dd49c49e286467be14dc90bd2ae689e8bd1f3958.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1705.09609v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Self-Stabilizing Repeated Balls-into-Bins

LucaBecchetti Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta
<span title="">2015</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tewj77cuufbzbgbk265bb462ga" style="color: black;">Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures - SPAA &#39;15</a> </i> &nbsp;
This process corresponds to a non-reversible Markov chain and our aim is to study its self-stabilization properties with respect to the maximum (bin) load and some related performance measures.  ...  Then, in every subsequent round, one ball is chosen according to some fixed strategy (random, FIFO, etc) from each non-empty bin, and re-assigned to one of the n bins uniformly at random.  ...  Acknowledgments We would like to thank Riccardo Silvestri for helpful discussions and important hints.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2755573.2755584">doi:10.1145/2755573.2755584</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/spaa/BecchettiCNPP15.html">dblp:conf/spaa/BecchettiCNPP15</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tq2atreyovcuvlzybcwnq2vmne">fatcat:tq2atreyovcuvlzybcwnq2vmne</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830030502/http://www.mat.uniroma2.it/~pasquale/papers/bcnpp_spaa15.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/53/89/538932d77e3a2aa846ae70dec41d9557a22c89b5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2755573.2755584"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Self-stabilizing repeated balls-into-bins

L. Becchetti, A. Clementi, E. Natale, F. Pasquale, G. Posta
<span title="2017-12-18">2017</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/c5flcyc6ozdv3p2dehbhbc7pqy" style="color: black;">Distributed computing</a> </i> &nbsp;
This process corresponds to a non-reversible Markov chain and our aim is to study its self-stabilization properties with respect to the maximum (bin) load and some related performance measures.  ...  Then, in every subsequent round, one ball is chosen according to some fixed strategy (random, FIFO, etc) from each non-empty bin, and re-assigned to one of the n bins uniformly at random.  ...  Acknowledgments We would like to thank Riccardo Silvestri for helpful discussions and important hints.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00446-017-0320-4">doi:10.1007/s00446-017-0320-4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/3db3zbpmunen3ivllreulgxwyy">fatcat:3db3zbpmunen3ivllreulgxwyy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170830030502/http://www.mat.uniroma2.it/~pasquale/papers/bcnpp_spaa15.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/53/89/538932d77e3a2aa846ae70dec41d9557a22c89b5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00446-017-0320-4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Self-Stabilizing Repeated Balls-into-Bins [article]

Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Gustavo Posta
<span title="2016-05-24">2016</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This implies that the process is self-stabilizing and that every ball traverses all bins in O(n ^2 n) rounds, w.h.p.  ...  In every subsequent round, from each non-empty bin one ball is chosen according to some fixed strategy (random, FIFO, etc), and re-assigned to one of the n bins uniformly at random.  ...  Acknowledgments We would like to thank Riccardo Silvestri for helpful discussions and important hints.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1501.04822v3">arXiv:1501.04822v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7wuz2jbnz5eupi64hn5jrttpxi">fatcat:7wuz2jbnz5eupi64hn5jrttpxi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200823153050/https://arxiv.org/pdf/1501.04822v3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/94/ed/94eded72846643894b9fc959c8beee0a21212534.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1501.04822v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

RaWMS -

Ziv Bar-Yossef, Roy Friedman, Gabriel Kliot
<span title="">2006</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/c4l4x7lntbdcrigp6kd7u2itqq" style="color: black;">Proceedings of the seventh ACM international symposium on Mobile ad hoc networking and computing - MobiHoc &#39;06</a> </i> &nbsp;
In addition, RaWMS is compared with a number of other known methods such as flooding and gossip-based techniques.  ...  The service provides each node with a partial uniformly chosen view of network nodes.  ...  The second ball is placed into an empty bin with probability n−1 n and into a non empty bin with probability 1 n .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1132905.1132932">doi:10.1145/1132905.1132932</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/mobihoc/Bar-YossefFK06.html">dblp:conf/mobihoc/Bar-YossefFK06</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rg2a5akvwjaavlucz3h4i7zrcy">fatcat:rg2a5akvwjaavlucz3h4i7zrcy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809105247/http://www.csl.mtu.edu/cs5461/www/Reading/Yossef-MobiHoc06.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/1e/11/1e11a7cd2a7fbe2644fb18e70687e18db737c850.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1132905.1132932"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Gossip-based Search in Multipeer Communication Networks [article]

Eva Jaho, Ioannis Koukoutsidis, Siyu Tang, Ioannis Stavrakakis, Piet Van Mieghem
<span title="2009-07-15">2009</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We derive mathematical models for the search process based on the balls and bins model, as well as known approximations for the rumour-spreading problem. All models are validated with simulations.  ...  We study a gossip-based algorithm for searching data objects in a multipeer communication network. All of the nodes in the network are able to communicate with each other.  ...  The generalized balls and bins problem is defined as follows: In a population of n bins, suppose we randomly distribute r groups of k balls, such that in each group, no two balls go in the same bin and  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0907.2563v1">arXiv:0907.2563v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nayz4rxvzbbujeuwfoge4w5wua">fatcat:nayz4rxvzbbujeuwfoge4w5wua</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200930092338/https://arxiv.org/pdf/0907.2563v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/87/a1/87a120ce6e6ff01c818e647c82c66bed9c7a4f5c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/0907.2563v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Stabilizing consensus with the power of two choices

Benjamin Doerr, Leslie Ann Goldberg, Lorenz Minder, Thomas Sauerwald, Christian Scheideler
<span title="">2011</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/tewj77cuufbzbgbk265bb462ga" style="color: black;">Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures - SPAA &#39;11</a> </i> &nbsp;
Our main result is a simple randomized algorithm called median rule that, with high probability, just needs O(log m log log n + log n) time and work per process to arrive at an almost stable consensus  ...  Without adversarial involvement, just O(log n) time and work is needed for a stable consensus, with high probability.  ...  Assume that the bins and balls are numbered from 1 to n such that all balls with higher numbers are in higher bins and balls in the same bin form consecutive numbers.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1989493.1989516">doi:10.1145/1989493.1989516</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/spaa/DoerrGMSS11.html">dblp:conf/spaa/DoerrGMSS11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7s7slt4ocveldjqhjt3glwrn2e">fatcat:7s7slt4ocveldjqhjt3glwrn2e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808123631/http://www-old.cs.uni-paderborn.de/fileadmin/Informatik/FG-TI/Publikationen/spaa70-scheideler-1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/71/c7/71c7ef3ac436b07af9dc1fb53f06e0be56363f43.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1989493.1989516"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

DRESS codes for the storage cloud: Simple randomized constructions

Sameer Pawar, Nima Noorshams, Salim El Rouayheb, Kannan Ramchandran
<span title="">2011</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ux5tf45dtrgptnezraiii73msm" style="color: black;">2011 IEEE International Symposium on Information Theory Proceedings</a> </i> &nbsp;
We propose a simple and flexible randomized scheme for placing those replicas based on the balls-and-bins model.  ...  This property is essential for largescale systems with high reliability and availability requirements.  ...  Recall that there are n bins and θ distinct balls.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/isit.2011.6033980">doi:10.1109/isit.2011.6033980</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/isit/PawarNRR11.html">dblp:conf/isit/PawarNRR11</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/a7larwlizjbixmp5fpcuv2rco4">fatcat:a7larwlizjbixmp5fpcuv2rco4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170706073111/http://www.ece.iit.edu/%7Esalim/docs/DRESS.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/99/e6/99e6677a5bd04a327078b5dc96f8606b78a0bb5c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/isit.2011.6033980"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

A Distributed Algorithm for Resource Clustering in Large Scale Platforms [chapter]

Olivier Beaumont, Nicolas Bonichon, Philippe Duchon, Lionel Eyraud-Dubois, Hubert Larchevêque
<span title="">2008</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
From an algorithmic point of view, this corresponds to a bin covering problem with an additional distance constraint.  ...  This algorithm takes O((4 D ) log 2 n) rounds and O((4 D )n log n) messages both in expectation and with high probability, where n is the total number of hosts.  ...  Another interesting work is to compare the performance of the distributed algorithm we propose with the gossip-based approach.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-92221-6_41">doi:10.1007/978-3-540-92221-6_41</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zz22th6ozjedhfhqjaze2us4ja">fatcat:zz22th6ozjedhfhqjaze2us4ja</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170923175317/https://hal.inria.fr/inria-00369417/document" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c5/00/c500299c77a7a5f6ee9e50df457492fbd11665fe.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-92221-6_41"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Improving the Scalability of DPWS-Based Networked Infrastructures [article]

Filipe Campos, José Pereira
<span title="2014-07-31">2014</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this report, we address this challenge with a proposal to integrate gossip-based dissemination in DPWS, thus maintaining compatibility with original assumptions of the specification, and avoiding a  ...  In detail, we show how our approach provides an evolutionary and non-intrusive solution to the scalability limitations of DPWS and experimentally evaluate it with an implementation based on the the Web  ...  vs. balls-and-bins gossip variants, to address multiple applications and environments, and furthermore, can be integrated with different membership management strategies, according to the scale and dynamics  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1407.8546v1">arXiv:1407.8546v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/qzvcphijvrc7zly2qo3xws7fze">fatcat:qzvcphijvrc7zly2qo3xws7fze</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200909020752/https://arxiv.org/pdf/1407.8546v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/e7/f1/e7f148f747e9924b2ae294f7e9f51b171f49ca7a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1407.8546v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

HybridNN: Supporting Network Location Service on Generalized Delay Metrics [article]

Yongquan Fu, Yijie Wang, Ernst Biersack
<span title="2011-08-09">2011</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Experiments on PlanetLab show that HybridNN can provide accurate nearest neighbors that are close to optimal with modest query overhead and maintenance traffic.  ...  For DNNS requests, HybridNN chooses closest neighbors accurately via the inframetric modelling, and scalably by combining delay predictions with direct probes to a pruned set of neighbors.  ...  [22] assign nodes into "bins" based on the ordered sequence of RTT measurements to landmarks, and declare nodes are close to each other in the same bin.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1108.1928v1">arXiv:1108.1928v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6mes6suavverppqnqlkldqdvoy">fatcat:6mes6suavverppqnqlkldqdvoy</a> </span>
<a target="_blank" rel="noopener" href="https://archive.org/download/arxiv-1108.1928/1108.1928.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> File Archive [PDF] </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1108.1928v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Asynchronous gossip

Chryssis Georgiou, Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalski
<span title="2013-04-01">2013</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/r72grtxx6jad5hjzl7fxcunwhi" style="color: black;">Journal of the ACM</a> </i> &nbsp;
We study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system.  ...  The algorithmic techniques proposed in this article can be used for improving the message complexity of distributed algorithms that rely on an all-to-all message exchange paradigm and are designed for  ...  We begin with a simple fact regarding balls-and-bins that is useful in the analysis. Imagine that you have some set of n bins, some n − f of which are "marked" red.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2450142.2450147">doi:10.1145/2450142.2450147</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/fnpwnrypobd57akx24xxyxbdfq">fatcat:fnpwnrypobd57akx24xxyxbdfq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922034305/https://infoscience.epfl.ch/record/188872/files/async_gossip_a11-georgiou.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7f/0f/7f0ffc0b487a986e1c63d5fab78addaf87f6a4c3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2450142.2450147"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

On the complexity of asynchronous gossip

Chryssis Georgiou, Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalski
<span title="">2008</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/t5fzg7fyy5byfdcl2vrzbn43ty" style="color: black;">Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing - PODC &#39;08</a> </i> &nbsp;
We study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system.  ...  The algorithmic techniques proposed in this article can be used for improving the message complexity of distributed algorithms that rely on an all-to-all message exchange paradigm and are designed for  ...  We begin with a simple fact regarding balls-and-bins that is useful in the analysis. Imagine that you have some set of n bins, some n − f of which are "marked" red.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1400751.1400771">doi:10.1145/1400751.1400771</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/podc/GeorgiouGGK08.html">dblp:conf/podc/GeorgiouGGK08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/omqjdgendbchldtdhjqv2deov4">fatcat:omqjdgendbchldtdhjqv2deov4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922034305/https://infoscience.epfl.ch/record/188872/files/async_gossip_a11-georgiou.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7f/0f/7f0ffc0b487a986e1c63d5fab78addaf87f6a4c3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1400751.1400771"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A generic theoretical framework for modeling gossip-based algorithms

Yaacov Fernandess, Antonio Fernández, Maxime Monod
<span title="2007-10-01">2007</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/i24hgue5erh4haqtfyyjvfijdu" style="color: black;">ACM SIGOPS Operating Systems Review</a> </i> &nbsp;
Antonio Fernández has been partially funded by the Spanish Ministry of Education with grant TIN2005-09198-C02-01 and the Comunidad de Madrid with grant S-0505/TIC/000398.  ...  Acknowledgments The authors would like to thank Michel Raynal and Vivek Rai for useful discussions and contributions to the contents of this paper.  ...  Formally, suppose we have n bins and we uniformly at random throw n balls into them.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1317379.1317384">doi:10.1145/1317379.1317384</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ri44omfvlzeh5pnpgs2nyoydne">fatcat:ri44omfvlzeh5pnpgs2nyoydne</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20080221163054/http://infoscience.epfl.ch/record/111721/files/osr.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/be/e4/bee491fb363c78f6e50f0e1cf10260cc3f64e600.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1317379.1317384"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 1,119 results