Scalability approaches for causal multicast: a survey

详细信息    查看全文

• 作者：Rubén de Juan-Marín ; Hendrik Decker ; José Enrique Armendáriz-Íñigo…
• 刊名：Computing
• 出版年：2016
• 出版时间：September 2016
• 年：2016
• 卷：98
• 期：9
• 页码：923-947
• 全文大小：768 KB
• 刊物类别：Mathematics and Statistics
• 刊物主题：Mathematics
  Computational Mathematics and Numerical Analysis
  
• 出版者：Springer Wien
• ISSN：1436-5057
• 卷排序：98

文摘

Many distributed services need to be scalable: internet search, electronic commerce, e-government\(\ldots \) In order to achieve scalability those applications rely on replicated components. Because of the dynamics of growth and volatility of customer markets, applications need to be hosted by adaptive systems. In particular, the scalability of the reliable multicast mechanisms used for supporting the consistency of replicas is of crucial importance. Reliable multicast may propagate updates in a pre-defined order (e.g., FIFO, total or causal). Since total order needs more communication rounds than causal order, the latter appears to be the preferable candidate for achieving multicast scalability, although the consistency guarantees based on causal order are weaker than those of total order. This paper provides a historical survey of different scalability approaches for reliable causal multicast protocols.KeywordsMulticast protocolCausal multicastVersion vectorVector clockInterconnectionScalability