Semantically reliable multicast protocols

Reliable multicast protocols can strongly simplify the design of distributed applications. However it is hard to sustain a high multicast throughput when groups are large and heterogeneous. In an attempt to overcome this limitation, previous work has focused on weakening reliability properties. The authors introduce a novel reliability model that exploits semantic knowledge to decide in which specific conditions messages can be purged without compromising application correctness. This model is based on the concept of message obsolescence: a message becomes obsolete when its content or purpose is overwritten by a subsequent message. We show that message obsolescence can be expressed in a generic way and can be used to configure the system to achieve higher multicast throughput.

[1]  David Clark,et al.  Architectural considerations for a new generation of protocols , 1990, SIGCOMM 1990.

[2]  Mahadev Satyanarayanan,et al.  A SURVEY OF DISTRIBUTED FILE SYSTEMS , 1990 .

[3]  Kenneth P. Briman.  A review of experiences with reliable multicast , 1999 .

[4]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[5]  Ashok Erramilli,et al.  A reliable and efficient multicast for broadband broadcast networks , 1987, Computer Communication Review.

[6]  Kenneth P. Birman,et al.  Scalable message stability detection protocols , 1998 .

[7]  David D. Clark,et al.  Architectural considerations for a new generation of protocols , 1990, SIGCOMM '90.

[8]  M. Raynal,et al.  How to find his way in the jungle of consistency criteria for distributed shared memories (or how to escape from Minos' labyrinth) , 1993, 1993 4th Workshop on Future Trends of Distributed Computing Systems.

[9]  André Schiper,et al.  Stubborn Communication Channels , 1998 .

[10]  Flaviu Cristian,et al.  Applying Simulation to the Design and Performrance Evaluation of Fault-tolerant , 1997 .

[11]  Rico Piantoni,et al.  Implementing the Swiss Exchange trading system , 1997, Proceedings of IEEE 27th International Symposium on Fault Tolerant Computing.

[12]  Kenneth P. Birman,et al.  Bimodal multicast , 1999, TOCS.

[13]  Kenneth P. Birman,et al.  A review of experiences with reliable multicast , 1999, Softw. Pract. Exp..

[14]  Peter J. Denning,et al.  The Working Set Model for Program Behaviour (Reprint). , 1983 .

[15]  Andreas Reuter,et al.  High contention in a stock trading database: a case study , 1988, SIGMOD '88.

[16]  Suchitra Raman,et al.  Generalized Data Naming and Scalable State Announcements for Reliable , 1997 .

[17]  David D. Clark,et al.  Window and Acknowledgement Strategy in TCP , 1982, RFC.

[18]  Mukesh Singhal,et al.  Efficient Δ-causal broadcasting , 1998 .

[19]  Michel Raynal,et al.  Deadline-constrained causal order , 2000, Proceedings Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2000) (Cat. No. PR00607).

[20]  Robbert van Renesse,et al.  Incorporating System Resource Information into Flow Control , 1995 .

[21]  Flaviu Cristian,et al.  Applying simulation to the design and performance evaluation of fault-tolerant systems , 1997, Proceedings of SRDS'97: 16th IEEE Symposium on Reliable Distributed Systems.

[22]  Peter J. Denning,et al.  The working set model for program behavior , 1968, CACM.