The annealing algorithm
Tools for Distributed Application Management
Computer - Distributed computing systems: separate resources acting as one
Understanding DCE
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
The benefits of CORBA-based network management
Communications of the ACM
Making distributed applications manageable through instrumentation
Journal of Systems and Software
Optimizing Management Functions in Distributed Systems
Journal of Network and Systems Management
Performance and Efficiency in DistributedEnterprise Management
Journal of Network and Systems Management
Exploiting Code Mobility in Decentralized and Flexible Network Management
MA '97 Proceedings of the First International Workshop on Mobile Agents
Optimising the execution of management functions in distributed systems
Optimising the execution of management functions in distributed systems
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Data Outsourcing Simplified: Generating Data Connectors from Confidentiality and Access Policies
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Hi-index | 0.00 |
With the increased availability and complexity of distributed systems comes a greater need for solutions to assist in the management of distributed system components. Despite the significant contributions made towards the development of management tools that monitor and control distributed systems, little has been done to address issues such as optimising the execution of management functions with respect to system and management requirements. This paper models the problem of determining efficient management configurations as a 0-1 ILP optimisation problem. Possible location of managed objects and management agents are mapped into the variables of the problem, and resource constraints and user and management requirements are mapped into the cost function and numerical constraints of the 0-1 ILP problem. A Branch and Bound based algorithm with modified bounding and search methods is proposed, and its complexity and scalability examined. Experiments to illustrate the validity of the proposed model are also described. Finally, we describe possible applications and future research directions.