Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
Correctness of a gossip based membership protocol
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Anonymous Usage of Location-Based Services Through Spatial and Temporal Cloaking
Proceedings of the 1st international conference on Mobile systems, applications and services
A survey on context-aware systems
International Journal of Ad Hoc and Ubiquitous Computing
Proceedings of the 6th ACM conference on Embedded network sensor systems
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Applications such as Facebook, Twitter and Foursquare brought the massification of personal short messages, distributed in (soft) real-time on the Internet to a large number of users. These messages are complemented with rich contextual information such as the identity, time and location of the person sending the message. Such contextual messages raise serious concerns in terms of scalability and delivery delay; this results not only from their huge number but also because the set of user recipients changes for each message (as their interests continuously change), preventing the use of well-know solutions such as pub-sub and multicast trees. This leads to the use of non-scalable broadcast based solutions or point-to-point messaging. We propose Radiator, a middleware to assist application programmers implementing efficient context propagation mechanisms on their applications. Based on each user current context, Radiator continuously adapts each message propagation path and delivery delay, making an efficient use of network bandwidth, arguably the biggest bottleneck in the deployment of large-scale context propagation systems. Our experimental results demonstrate a 20x reduction on consumed bandwidth without affecting the real-time usefulness of the propagated messages.