Browsing by Subject "Gossip"

Now showing items 1-5 of 5

    • Article  

      Asynchronous gossip 

      Georgiou, Chryssis; Gilbert, S.; Guerraoui, R.; Kowalski, D. R. (2013)
      We study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. We show that an adaptive adversary can significantly hamper the spreading of a rumor, while an oblivious adversary cannot. ...
    • Article  

      Efficient gossip and robust distributed computation 

      Georgiou, Chryssis; Kowalski, D. R.; Shvartsman, A. A. (2005)
      This paper presents an efficient deterministic gossip algorithm for p synchronous, crash-prone, message-passing processors. The algorithm has time complexity T=O(log2p) and message complexity M=O(p1+ε), for any ε>0. This ...
    • Article  

      Meeting the deadline: On the complexity of fault-tolerant continuous gossip 

      Georgiou, Chryssis; Gilbert, S.; Kowalski, D. R. (2011)
      In this paper we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ...
    • Conference Object  

      Meeting the deadline: On the complexity of fault-tolerant Continuous Gossip 

      Georgiou, Chryssis; Gilbert, S.; Kowalski, D. R. (2010)
      In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ...
    • Conference Object  

      On the complexity of asynchronous gossip 

      Georgiou, Chryssis; Gilbert, S.; Guerraoui, R.; Kowalski, D. R. (2008)
      In this paper, we study the complexity of gossip in an asynchronous, message-passing fault-prone distributed system. In short, we show that an adaptive adversary can significantly hamper the spreading of a rumor, while an ...