作者: L. Massoulié , A.-M. Kermarrec , A.J. Ganesh
DOI:
关键词:
摘要: Reliable group communication is important for large-scale distributed applications such as information dissemination systems. The challenging issue in this context remains scalability. computation time and amount of data dedicated to the reliability mechanism should remain manageable number nodes a system grows, no bottleneck emerge. Probabilistic algorithms has proven their ability fill gap. In paper, we present theoretical analysis evaluation scalable reliable protocol wide-area scalability relies on its probabilistic flavor. provides guarantee delivery thus makes do with lightweight recovery protocol. A membership service described simulation results show that exhibits very stable behavior presence transient and/or permanent failures.