Effective multicast programming in large scale distributed systems
β Scribed by Patrick Th. Eugster; Romain Boichat; Rachid Guerraoui; Joe Sventek
- Publisher
- John Wiley and Sons
- Year
- 2001
- Tongue
- English
- Weight
- 274 KB
- Volume
- 13
- Category
- Article
- ISSN
- 1532-0626
- DOI
- 10.1002/cpe.584
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
Many distributed applications have a strong requirement for efficient dissemination of large amounts of information to widely spread consumers in large networks. These include applications in eβcommerce and telecommunication. Publish/subscribe is considered one of the most important interaction styles with which to model communication on a large scale. Producers publish information on a topic and consumers subscribe to the topics they wish to be informed of. The decoupling of producers and consumers in time, space, and flow makes the publish/subscribe paradigm very attractive for large scale distribution, especially in environments like the Internet.
This paper describes the architecture and implementation of DACE (Distributed Asynchronous Computing Environment), a framework for publish/subscribe communication based on an objectβoriented programming abstraction in the form of Distributed Asynchronous Collection (DAC). DACs capture the variants of publish/subscribe, without blurring their respective advantages. The architecture we present is tolerant of network partitions and crash failures. The underlying model is based on the notion of Topic Membership: a weak membership for the parties involved in a topic. We present how Topic Membership enables the realization of a robust and efficient reliable multicast on a large scale. The protocol ensures that, inside a topic, even a subscriber who is temporarily partitioned away eventually receives a published message. Copyright Β© 2001 John Wiley & Sons, Ltd.
π SIMILAR VOLUMES
This paper introduces a pancyclic recursive topology, named the hypercomplete, for building large-scale distributed multicomputer systems. The hypercomplete is maximally fault-tolerant and has a logarithmic diameter. In addition to being pancyclic, the hypercomplete is Hamiltonian-connected. Consequ
With the growing emphasis on distributed applications, sophisticated programming models for handling replication become important. Control replication as an issue has so far been considered in the larger context of distributed systems such as ISIS and Arjuna. We present a programming model called Sh