Scalable group communication system for scalable trust

Authors:
Krzysztof Ostrowski;Kenneth P. Birman
Affiliations:
Cornell University, Ithaca, NY;Cornell University, Ithaca, NY
Venue:
Proceedings of the first ACM workshop on Scalable trusted computing
Year:
2006

Citing 3
Cited 1

The case for reliable concurrent multicasting using shared ACK trees

MULTIMEDIA '96 Proceedings of the fourth ACM international conference on Multimedia
Extensible Web Services Architecture for Notification in Large-Scale Systems

ICWS '06 Proceedings of the IEEE International Conference on Web Services
RMTP: a reliable multicast transport protocol

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3

Can Component/Service-Based Systems Be Proved Correct?

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Programmers of large-scale trusted systems need tools to simplify tasks such as replicating services or data. Group communication systems achieve this via various flavors of reliable multicast, but the existing solutions do not scale in all major dimensions. Typically, they scale poorly in the number of groups; yet we believe that using groups casually could lead to new, easier ways of programming. We propose QSM [1], a new multicast substrate that scales in several dimensions at once. Our approach relies on a novel way of exploiting the overlap between groups.