• 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. ...
    • Conference Object  

      Confidential gossip 

      Georgiou, Chryssis; Gilbert, S.; Kowalski, D. R. (2011)
      Epidemic gossip has proven a reliable and efficient technique for sharing information in a distributed network. Much of the reliability and efficiency derives from processes collaborating, sharing the work of distributing ...
    • 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 ...