000052369 001__ 52369
000052369 005__ 20190316233445.0
000052369 02470 $$2DAR$$a4321
000052369 037__ $$aARTICLE
000052369 245__ $$aLightweight Probabilistic Broadcast
000052369 269__ $$a2003
000052369 260__ $$c2003
000052369 336__ $$aJournal Articles
000052369 520__ $$aThe growing interest in peer-to-peer applications has underlined the importance of scalability in modern distributed systems. Not surprisingly, much research effort has been invested in gossip-based broadcast protocols. These trade the traditional strong reliability guarantees against very good ``scalability'' properties. Scalability is in that context usually expressed in terms of throughput, but there is only little work on how to reduce the overhead of membership management at large scale. This paper presents Lightweight Probabilistic Broadcast (lpbcast), a novel gossip-based broadcast algorithm which preserves the inherent throughput scalability of traditional gossip-based algorithms and adds a notion of membership management scalability: every process only knows a random subset of fixed size of the processes in the system. We formally analyze our broadcast algorithm in terms of scalability with respect to the size of individual views, and compare the analytical results both with simulations and concrete measurements.
000052369 700__ $$0241768$$g101307$$aEugster, P.
000052369 700__ $$0240335$$g105326$$aGuerraoui, R.
000052369 700__ $$0241769$$g126983$$aHandurukande, S.
000052369 700__ $$g128437$$aKouznetsov, P.$$0241770
000052369 700__ $$aKerrmarec, A.-M.
000052369 773__ $$j21$$tACM Transactions on Computer Systems$$k4$$q341-374
000052369 8564_ $$uhttps://infoscience.epfl.ch/record/52369/files/IC_TECH_REPORT_200102.pdf$$zn/a$$s440154
000052369 909C0 $$xU10407$$0252114$$pDCL
000052369 909CO $$ooai:infoscience.tind.io:52369$$qGLOBAL_SET$$pIC$$particle
000052369 937__ $$aLPD-ARTICLE-2001-001
000052369 937__ $$aLPD-REPORT-2001-002
000052369 970__ $$a200102/IC
000052369 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000052369 980__ $$aARTICLE