A design framework for Internet-scale event observation and notification
ESEC '97/FSE-5 Proceedings of the 6th European SOFTWARE ENGINEERING conference held jointly with the 5th ACM SIGSOFT international symposium on Foundations of software engineering
Distributed virtual environments and VRML: an event-based architecture
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Adapting publish/subscribe middleware to achieve Gnutella-like functionality
Proceedings of the 2001 ACM symposium on Applied computing
Design and evaluation of a wide-area event notification service
ACM Transactions on Computer Systems (TOCS)
The JEDI Event-Based Infrastructure and Its Application to the Development of the OPSS WFMS
IEEE Transactions on Software Engineering
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
A Hierarchical Proxy Architecture for Internet-Scale Event Services
WETICE '99 Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises
Supporting Disconnectedness-Transparent Information Delivery for Mobile and Invisible Computing
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
Efficient Content-Based Event Dispatching in the Presence of Topological Reconfiguration
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Herald: Achieving a Global Event Notification Service
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
An Efficient Multicast Protocol for Content-Based Publish-Subscribe Systems
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Epidemic Algorithms for Reliable Content-Based Publish-Subscribe: An Evaluation
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Self-organizing publish/subscribe
DSM '05 Proceedings of the 2nd international doctoral symposium on Middleware
REDS: a reconfigurable dispatching system
Proceedings of the 6th international workshop on Software engineering and middleware
On adopting Content-Based Routing in service-oriented architectures
Information and Software Technology
P/S-CoM: Building correct by design Publish/Subscribe architectural styles with safe reconfiguration
Journal of Systems and Software
Overview of the reliability aspects in the publish/subscribe middleware
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
Avoiding mobility-related message flooding in content-based publish/subscribe
Proceedings of the First International Workshop on Algorithms and Models for Distributed Event Processing
Fault tolerance mechanism of agent-based distributed event system
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
Consistent reconfiguration for publish/subscribe architecture styles
VECoS'07 Proceedings of the First international conference on Verification and Evaluation of Computer and Communication Systems
Formal design of structural and dynamic features of publish/subscribe architectural styles
ECSA'07 Proceedings of the First European conference on Software Architecture
An efficient privacy preserving Pub-Sub system for ubiquitous computing
International Journal of Ad Hoc and Ubiquitous Computing
Survey On reliability in publish/subscribe services
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The publish-subscribe model provides strong decoupling among the components of a distributed application. This makes it amenable to highly dynamic environments. Nevertheless, publish-subscribe systems exploiting a distributed event dispatcher are typically not able to rearrange dynamically their operations to adapt to changes which impact the topology of the dispatching infrastructure. This paper presents a description and analysis of a novel algorithm to deal with this kind of reconfiguration. The strength of this algorithm is its ability to minimize the portion of the system affected by the reconfiguration by exploiting a novel concept we refer to as the reconfiguration path. Simulations compare our approach with two others and show a significant reduction (up to 76%) in the overhead caused by reconfiguration.