DocumentCode :
3668749
Title :
TRAINS: A throughput-efficient uniform total order broadcast algorithm
Author :
Michel Simatic;Arthur Foltz;Damien Graux;Nicolas Hascoët;Stéphanie Ouillon;Nathan Reboud;Tiezhen Wang
Author_Institution :
fYear :
2015
fDate :
7/1/2015 12:00:00 AM
Firstpage :
1
Lastpage :
8
Abstract :
Within data centers, many applications rely on a uniform total order broadcast algorithm to achieve load-balancing or fault-tolerance. In this context, achieving high throughput for uniform total order broadcast algorithms is an important issue: It contributes to optimize data center resources usage and to reduce its energy consumption. This paper presents Trains, a throughput-efficient uniform total order broadcast algorithm. The paper estimates TRAINS performance. It evaluates the prediction-oriented throughput efficiency (POTE) - i.e. the theoretical ratio between bytes delivered and bytes transmitted on the network. TRAINS POTE improves the POTE of the best algorithm of the literature. For 5 processes, the POTE improvement reaches a peak of 250% for 10 bytes messages. Experimental evaluation confirms TRAINS high throughput capabilities. The trade-off of this throughput improvement is the alteration of the latency. The worst alteration is in the case of 2 processes: 125%.
Keywords :
"Throughput","Protocols","Context","Prediction algorithms","Receivers","System recovery","Local area networks"
Publisher :
ieee
Conference_Titel :
Protocol Engineering (ICPE) and International Conference on New Technologies of Distributed Systems (NTDS), 2015 International Conference on
Electronic_ISBN :
2162-190X
Type :
conf
DOI :
10.1109/NOTERE.2015.7293477
Filename :
7293477
Link To Document :
بازگشت