@conference {spm+02,
	title = {Optimistic total order in wide area networks},
	booktitle = {Proceedings of 21st IEEE International Symposium on Reliable Distributed Systems (SRDS)},
	year = {2002},
	month = {October},
	publisher = {IEEE},
	organization = {IEEE},
	type = {{Proceedings Paper}},
	address = {Osaka},
	abstract = {<p>Total order multicast greatly simplifies the implementa- tion of fault-tolerant services using the replicated state ma- chine approach. The additional latency of total ordering can be masked by taking advantage of spontaneous order- ing observed in LANs: A tentative delivery allows the ap- plication to proceed in parallel with the ordering protocol. The effectiveness of the technique rests on the optimistic as- sumption that a large share of correctly ordered tentative deliveries offsets the cost of undoing the effect of mistakes. This paper proposes a simple technique which enables the usage of optimistic delivery also in WANs with much larger transmission delays where the optimistic assumption does not normally hold. Our proposal exploits local clocks and the stability of network delays to reduce the mistakes in the ordering of tentative deliveries. An experimental evalu- ation of a modified sequencer-based protocol is presented, illustrating the usefulness of the approach in fault-tolerant database management.</p>
},
	doi = {10.1109/RELDIS.2002.1180188},
	attachments = {https://haslab.uminho.pt/sites/default/files/rco/files/spmo02.pdf},
	author = {Ant{\'o}nio Luis Sousa and Jos{\'e} Orlando Pereira and Francisco Moura and Rui Oliveira}
}