The MAFT Architecture for Distributed Fault Tolerance
IEEE Transactions on Computers - Fault-Tolerant Computing
Design & analysis of fault tolerant digital systems
Design & analysis of fault tolerant digital systems
Spawn: A Distributed Computational Economy
IEEE Transactions on Software Engineering
Artificial intelligence: a modern approach
Artificial intelligence: a modern approach
IEEE Transactions on Software Engineering
The Coign automatic distributed partitioning system
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
Architecture-based runtime software evolution
Proceedings of the 20th international conference on Software engineering
Proceedings of the 24th International Conference on Software Engineering
Peer-to-Peer Membership Management for Gossip-Based Protocols
IEEE Transactions on Computers
Fault Tolerant Wide-Area Parallel Computing
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Constrained Component Deployment in Wide-Area Networks Using AI Planning Techniques
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
An efficient and reliable group multicast protocol
CASE '95 Proceedings of the Seventh International Workshop on Computer-Aided Software Engineering
A Style-Aware Architectural Middleware for Resource-Constrained, Distributed Systems
IEEE Transactions on Software Engineering
Improving availability in large, distributed component-based systems via redeployment
CD'05 Proceedings of the Third international working conference on Component Deployment
Service lifecycle management infrastructure for smart items
Proceedings of the international workshop on Middleware for sensor networks
An algorithm for task-based application composition
SEA '07 Proceedings of the 11th IASTED International Conference on Software Engineering and Applications
CBay: encheres pour le redéploiement de composants sur l'internet des machines
Proceedings of the 5th French-Speaking Conference on Mobility and Ubiquity Computing
A planning method for component placement in smart item environments using heuristic search
DAIS'07 Proceedings of the 7th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
An architecture-driven software mobility framework
Journal of Systems and Software
On decentralized self-adaptation: lessons from the trenches and challenges for the future
Proceedings of the 2010 ICSE Workshop on Software Engineering for Adaptive and Self-Managing Systems
On interacting control loops in self-adaptive systems
Proceedings of the 6th International Symposium on Software Engineering for Adaptive and Self-Managing Systems
Component deployment optimisation with bayesian learning
Proceedings of the 14th international ACM Sigsoft symposium on Component based software engineering
Improving availability in large, distributed component-based systems via redeployment
CD'05 Proceedings of the Third international working conference on Component Deployment
Entropy-based adaptive range parameter control for evolutionary algorithms
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Meryn: open, SLA-driven, cloud bursting PaaS
Proceedings of the first ACM workshop on Optimization techniques for resources management in clouds
| Hi-index | 0.00 |
In distributed and mobile environments, the connections among the hosts on which a software system is running are often unstable. As a result of connectivity losses, the overall availability of the system decreases. The distribution of software components onto hardware nodes (i.e., the system's deployment architecture) may be ill-suited for the given target hardware en-vironment and may need to be altered to improve the software system's avail-ability. Determining a software system's deployment that will maximize its availability is an exponentially complex problem. Although several polyno-mial-time approximative techniques have been developed recently, these techniques rely on the assumption that the system's deployment architecture and its properties are accessible from a central location. For these reasons, the existing techniques are not applicable to an emerging class of decentralized systems marked by the limited system wide knowledge and lack of central-ized control. In this paper we present an approximative solution for the rede-ployment problem that is suitable for decentralized systems and assess its performance.