Application-Level Causally Ordered Broadcast for Large-Scale Group Communication(Dependable Computing)
スポンサーリンク
概要
- 論文の詳細を見る
Gossip-based reliable broadcast protocols with reasonably weak reliability properties scale well to large groups and degrade system performance gracefully even if node failure or message loss rates increase compared with traditional protocols. However, although many distributed applications require highly steady performance only by allowing causality to be used asynchronously, there is no existing gossip-based protocol offering causally ordered delivery property more lightweight than totally ordered delivery one. This paper presents an application-level broadcast algorithm to guarantee causally-ordered delivery semantics based on peer to peer interaction models for scalability, reasonable reliability and stable throughput. Processes propagate each message with a vector time stamp much like the spread of rumor in society for a fixed number of rounds. Upon receipt of these messages, correct processes immediately deliver the corresponding messages to the application layers in a causal order. Simulation results show that the proposed algorithm outperforms the existing ones in terms of delivery throughput.
- 社団法人電子情報通信学会の論文
- 2005-12-01
著者
-
Kim Cha
Department Of Computer Science And Engineering Korea University
-
Ahn Jin
Department Of Computer Science Kyonggi University
-
HWANG Chong
Department of Computer Science and Engineering, Korea University
-
Hwang Chong
Department Of Computer Science And Engineering Korea University
-
Ahn Jin
Department Of Chemistry Medicinal Science Division Korea Research Institute Of Chemical Technology
関連論文
- An Efficient Procedure for the Preparation of (1S, 3R)- and (1S, 3S)-1-Amino-3-(hydroxymethyl) cyclopentanes
- Application-Level Causally Ordered Broadcast for Large-Scale Group Communication(Dependable Computing)