Approximation algorithms for directed Steiner problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
Design and evaluation of a wide-area event notification service
ACM Transactions on Computer Systems (TOCS)
Highly-resilient, energy-efficient multipath routing in wireless sensor networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Probability and statistics with reliability, queuing and computer science applications
Probability and statistics with reliability, queuing and computer science applications
Towards Fault-Tolerant and Secure Agentry
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
Security Issues and Requirements for Internet-Scale Publish-Subscribe Systems
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
Efficient Dissemination of Personalized Information Using Content-Based Multicast
IEEE Transactions on Mobile Computing
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
A survey of proposals for an alternative group communication service
IEEE Network: The Magazine of Global Internetworking
Wireless telemedicine and m-health: technologies, applications and research issues
International Journal of Sensor Networks
The effect of leaders on the consistency of group behaviour
International Journal of Sensor Networks
Security and Communication Networks
| Hi-index | 0.00 |
This paper examines an approach to guarantee service integrity in insecure publish/subscribe systems using overlay multicast. The proposed mechanism constructs a delivery tree laid over both the underlying network and the predicate (subscription) graph. It uses message replication and voting to simulate a secure delivery tree in an insecure environment. We provide an algorithm to construct a minimum-cost delivery tree, analyse its performance, develop a formal model to estimate the cost of delivery of a single message and propose heuristics to lower the computational complexity of our basic algorithm.