Preservation of ordering in a network of brokers
Cássio M. M. Pereira, César A. C. Teixeira, Daniel C. Lobato, Maria G. Pimentel · 2009
Some distributed applications, such as online collaborative whiteboards, chat systems, multiplayer games and others, have a need for causal and total ordering. Those applications exploit computer networks in order to connect publishers and subscribers of events, generally using a Publish/Subscribe middleware for that purpose. However, most state of the art pub-sub middlewares focus on best-effort services, without providing event ordering guarantees. This paper presents an overview of our proposed solution, which uses the Distributed Shared Memory model to provide causal and total ordering of events in subject-based pub-sub middlewares. We also present a proof of concept for our architecture, an online collaborative Whiteboard.