A loop-free extended Bellman-Ford routing protocol without bouncing effect
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The Vision of Autonomic Computing
Computer
P2P '01 Proceedings of the First International Conference on Peer-to-Peer Computing
Software—Practice & Experience
Fundamentals of Distributed Computing: A Practical Tour of Vector Clock Systems
IEEE Distributed Systems Online
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Computer
Facilitating gossip programming with the GossipKit framework
DAIS'08 Proceedings of the 8th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
FlashMob: distributed adaptive self-assembly
Proceedings of the 6th International Symposium on Software Engineering for Adaptive and Self-Managing Systems
Managing multi-cloud systems with CloudMF
Proceedings of the Second Nordic Symposium on Cloud Computing & Internet Technologies
| Hi-index | 0.00 |
Component-based platforms are widely used to develop and deploy distributed pervasive system that exhibit a high degree of dynamicity, concurrency, distribution, heterogeneity, and volatility. This paper deals with the problem of ensuring safe yet efficient dynamic adaptation in a distributed and volatile environment. Most current platforms provide capabilities for dynamic local adaptation to adapt these systems to their evolving execution context, but are still limited in their ability to handle distributed adaptations. Thus, a remaining challenge is to safely propagate reconfiguration policies of component-based systems to ensure consistency of the architecture configuration models over a dynamic and distributed system. In this paper we implement a specific algorithm relying on the models at runtime paradigm to manage platform independent models of the current system architecture and its deployed configuration, and to propagate reconfiguration policies. We evaluate a combination of gossip-based algorithms and vector clock techniques that are able to propagate these policies safely in order to preserve consistency of architecture configuration models among all computation nodes of the system. This evaluation is done with a test-bed system running on a large size grid network.