Comparative Performance Analysis of Ordering Strategies in Atomic Broadcast Algorithms
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we present the results of a comparative analysis of Atomic Broadcast algorithms. The analysis was done by using an analytical method to compare the performance of five different classes of Atomic Broadcast algorithms. The five classes of Atomic Broadcast algorithms are determined by the mechanisms used by the algorithms to define the delivery order. To evaluate the performance of algorithms, the analysis relies on contention-aware metrics to provide a measure for both their latency and their throughput. The results thus obtained yield interesting insight into the performance tradeoffs of different Atomic Broadcast algorithms, thus providing helpful information to algorithms and systems designers.
- 社団法人電子情報通信学会の論文
- 2003-12-01
著者
-
Defago Xavier
School Of Information Science Japan Advanced Institute Of Science And Technology
-
Defago X
Japan Advanced Inst. Sci. And Technol. Ishikawa Jpn
-
Urban Peter
Facultad De Informatica Universidad Politecnica De Madrid
-
Urban Peter
Information & Systems" Presto Japan Science And Technology Agency
-
Defago Xavier
School Of Information Science Jaist
-
SCHIPER Andre
Faculty of Information and Communication Sciences, Swiss Federal Institute of Technology in Lausanne
-
Schiper Andre
School Of Information & Communication Sciences Swiss Federal Institute Of Technology In Lausanne
関連論文
- Anonymous stabilizing leader election using a network sequencer
- An SNMP based failure detection service
- ED FD: Improving the phi accrual failure detector
- Self-stabilizing algorithm for circle formation by disoriented oblivious mobile robots
- Concurrency in Microprotocol Frameworks
- Definition and specification of accrual failure detectors
- On Accrual Failure Detectors
- The φ Accrual Failure Detector
- Flexible Failure Detection with к-FD
- A lazy routing protocol for large-scale mobile ad hoc networks
- Specification of Replication Techniques,Semi-Passive Replication,and Lazy Consensus
- Collision prevention using group communication for asynchronous cooperative mobile robots
- Locality-preserving distributed path reservation protocol for asynchronous cooperative mobile robots
- Tight bound on the gathering of two oblivious mobile robots with inconsistent compasses
- Gathering asychronous mobile robots with inaccurate compasses
- Eventually consistent compasses for robust gathering of asynchronous mobile robots with limited visibility
- A sowing routing protocol for dense mobile ad hoc networks
- Comparative Performance Analysis of Ordering Strategies in Atomic Broadcast Algorithms
- Total Order Broadcast and Multicast Algorithms : Taxonomy and Survey
- Distributed Algorithm for Circle Formation of Disoriented Mobile Robots
- Dynamic Scheduling Real-Time Task Using Primary-Backup Overloading Strategy for Multiprocessor Systems
- Fault-tolerant flocking in a k-bounded asynchronous system
- Performance comparison of a rotating coordinator and a leader based consensus algorithm
- Performance Comparison of a Rotating Coordinator and a Leader Based Consensus Algorithm