000114627 001__ 114627
000114627 005__ 20190316234104.0
000114627 02470 $$2ISI$$a000250368200060
000114627 037__ $$aCONF
000114627 245__ $$aModeling and validating the performance of atomic broadcast algorithms in high-latency networks
000114627 269__ $$a2007
000114627 260__ $$bSpringer$$c2007
000114627 336__ $$aConference Papers
000114627 490__ $$aLecture Notes in Computer Science$$v4641
000114627 520__ $$aThe performance of consensus and atomic broadcast algorithms using failure detectors is often affected by a trade-off between the number of communication steps and the number of messages needed to reach a decision. In this paper, we model the performance of three consensus and atomic broadcast algorithms using failure detectors in the oft-neglected setting of wide area networks and validate this model by experimentally evaluating the algorithms in several different setups.
000114627 6531_ $$aAtomic broadcast
000114627 6531_ $$aperformance evaluation
000114627 6531_ $$awide area network
000114627 6531_ $$ahigh latency
000114627 6531_ $$awide area network model
000114627 6531_ $$afailure detector
000114627 700__ $$aEkwall, Richard
000114627 700__ $$g106377$$0241767$$aSchiper, André
000114627 7112_ $$dAugust 2007$$cRennes, France$$aEuro-Par 2007
000114627 773__ $$tProc. Euro-Par 2007, Parallel Processing$$q574-586
000114627 8564_ $$uhttp://europar2007.irisa.fr/$$zURL
000114627 8564_ $$uhttps://infoscience.epfl.ch/record/114627/files/Ekwall_WANAbcast_Infoscience.pdf$$zn/a$$s215375
000114627 909C0 $$xU10411$$0252206$$pLSR
000114627 909CO $$ooai:infoscience.tind.io:114627$$qGLOBAL_SET$$pconf$$pIC
000114627 937__ $$aLSR-CONF-2007-002
000114627 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000114627 980__ $$aCONF