• DocumentCode
    1830992
  • Title

    GO: Platform support for gossip applications

  • Author

    Vigfusson, Ymir ; Birman, Ken ; Huang, Qi ; Nataraj, Deepak P.

  • Author_Institution
    Dept. of Comput. Sci., Cornell Univ., Ithaca, NY, USA
  • fYear
    2009
  • fDate
    9-11 Sept. 2009
  • Firstpage
    222
  • Lastpage
    231
  • Abstract
    Gossip-based protocols are increasingly popular in large-scale distributed applications that disseminate updates to replicated or cached content. GO (gossip objects) is a pernode gossip platform that we developed in support of this class of protocols. In addition to making it easy to develop new gossip protocols and applications, GO allows nodes to join multiple gossip groups without losing the appealing fixed bandwidth guarantee of gossip protocols, and the platform optimizes rumor delivery latency in a principled manner. Our heuristic is based on the observations that multiple rumors can often be squeezed into a single IP packet, and that indirect routing of rumors can speed up delivery. We formalize these observations and develop a theoretical analysis of this heuristic. We have also implemented GO, and study the effectiveness of the heuristic by comparing it to the more standard random dissemination gossip strategy via simulation. We also evaluate GO on a trace from a popular distributed application.
  • Keywords
    IP networks; distributed processing; protocols; telecommunication network routing; distributed application; gossip application; gossip object; gossip protocol; indirect rumor routing; pernode gossip platform; random dissemination gossip; rumor delivery latency; single IP packet; Application software; Bandwidth; Broadcasting; Computer science; Delay; Large-scale systems; Multicast protocols; Peer to peer computing; Robustness; Routing; epidemic broadcast; gossip; multicast;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Peer-to-Peer Computing, 2009. P2P '09. IEEE Ninth International Conference on
  • Conference_Location
    Seattle, WA
  • Print_ISBN
    978-1-4244-5066-4
  • Electronic_ISBN
    978-1-4244-5067-1
  • Type

    conf

  • DOI
    10.1109/P2P.2009.5284509
  • Filename
    5284509