International Journal of Autonomic Computing http://www.inderscience.com/browse/index.php?journalID=110&year=2010&vol=1&issue=4 Inderscience Publishers Ltd en-uk International Journal of Autonomic Computing 1741-8569 1741-8577 © 2010 Inderscience Publishers Ltd editor@inderscience.com https://www.inderscience.com/images/files/coverImgs/ijac_scoverijac.jpg http://www.inderscience.com/browse/index.php?journalID=110&year=2010&vol=1&issue=4 http://www.inderscience.com/link.php?id=37511 The scheduling process in large scale distributed systems (LSDS) became more important due to increases in the number of users and applications. This paper presents a dynamic meta-scheduling architecture model for LSDS based on monitoring. The dynamic scheduling process tries to perform task allocation on the fly as the application executes. The monitoring has an important role in this process because it can offer a full view of nodes in distributed systems. The proposed architecture is an agent framework and contains a grid monitoring service, an execution service and a discovery service. The performance of the used monitoring system, MonALISA, is very important for dynamic scheduling because it ensures the real-time process. The experimental results validate our architecture and scheduling model. Dynamic meta-scheduling architecture based on monitoring in distributed systems
Florin Pop, Ciprian Dobre, Corina Stratan, Alexandru Costan, Valentin Cristea
International Journal of Autonomic Computing, Vol. 1, No. 4 (2010) pp. 328 - 349
The scheduling process in large scale distributed systems (LSDS) became more important due to increases in the number of users and applications. This paper presents a dynamic meta-scheduling architecture model for LSDS based on monitoring. The dynamic scheduling process tries to perform task allocation on the fly as the application executes. The monitoring has an important role in this process because it can offer a full view of nodes in distributed systems. The proposed architecture is an agent framework and contains a grid monitoring service, an execution service and a discovery service. The performance of the used monitoring system, MonALISA, is very important for dynamic scheduling because it ensures the real-time process. The experimental results validate our architecture and scheduling model.

]]> 10.1504/IJAC.2010.037511 International Journal of Autonomic Computing, Vol. 1, No. 4 (2010) pp. 328 - 349 Florin Pop Ciprian Dobre Corina Stratan Alexandru Costan Valentin Cristea Faculty of Automatic Control and Computer Science, Computer Science Department, University POLITEHNICA of Bucharest, Splaiul Independentei, No. 313, Sector 6, Bucharest, 060042, Romania. ' Faculty of Automatic Control and Computer Science, Computer Science Department, University POLITEHNICA of Bucharest, Splaiul Independentei, No. 313, Sector 6, Bucharest, 060042, Romania. ' Faculty of Automatic Control and Computer Science, Computer Science Department, University POLITEHNICA of Bucharest, Splaiul Independentei, No. 313, Sector 6, Bucharest, 060042, Romania. ' Faculty of Automatic Control and Computer Science, Computer Science Department, University POLITEHNICA of Bucharest, Splaiul Independentei, No. 313, Sector 6, Bucharest, 060042, Romania. ' Faculty of Automatic Control and Computer Science, Computer Science Department, University POLITEHNICA of Bucharest, Splaiul Independentei, No. 313, Sector 6, Bucharest, 060042, Romania grid scheduling monitoring resource allocation large scale distributed systems dynamic scheduling metascheduling task allocation modelling agent-based systems multi-agent systems MAS. 2010-12-15T23:20:50-05:00 1 4 328 349 2010-12-15T23:20:50-05:00 http://www.inderscience.com/link.php?id=37512 Distributed management of complex large-scale infrastructures, such as power distribution systems, is challenging. Sustainability of these systems can be achieved by enabling stabilisation in global resource utilisation. This paper proposes the Energy Plan Overlay Self-stabilisation system (EPOS), for this purpose. EPOS is an agent-based approach that performs self-stabilisation over a tree overlay, as an instance of a hierarchical virtual organisation. The global goal of stabilisation emerges through local knowledge, local decisions and local interactions among software agents organised in a tree. Two fitness functions are proposed to stabilise global resource utilisation. The first proactively keeps deviations minimised and the second reactively reverses deviations. Extensive experimentation reveals that EPOS outperforms a system that utilises resources in a greedy manner. Finally, this paper also investigates and evaluates factors that influence the effectiveness of EPOS. Local agent-based self-stabilisation in global resource utilisation
Evangelos Pournaras, Martijn Warnier, Frances M.T. Brazier
International Journal of Autonomic Computing, Vol. 1, No. 4 (2010) pp. 350 - 373
Distributed management of complex large-scale infrastructures, such as power distribution systems, is challenging. Sustainability of these systems can be achieved by enabling stabilisation in global resource utilisation. This paper proposes the Energy Plan Overlay Self-stabilisation system (EPOS), for this purpose. EPOS is an agent-based approach that performs self-stabilisation over a tree overlay, as an instance of a hierarchical virtual organisation. The global goal of stabilisation emerges through local knowledge, local decisions and local interactions among software agents organised in a tree. Two fitness functions are proposed to stabilise global resource utilisation. The first proactively keeps deviations minimised and the second reactively reverses deviations. Extensive experimentation reveals that EPOS outperforms a system that utilises resources in a greedy manner. Finally, this paper also investigates and evaluates factors that influence the effectiveness of EPOS.

]]> 10.1504/IJAC.2010.037512 International Journal of Autonomic Computing, Vol. 1, No. 4 (2010) pp. 350 - 373 Evangelos Pournaras Martijn Warnier Frances M.T. Brazier Systems Engineering Section, Department of Multi-actor Systems, Faculty of Technology, Policy and Management, Delft University of Technology, P.O. Box 5015, NL-2600GA, Delft, The Netherlands. ' Systems Engineering Section, Department of Multi-actor Systems, Faculty of Technology, Policy and Management, Delft University of Technology, P.O. Box 5015, NL-2600GA, Delft, The Netherlands. ' Systems Engineering Section, Department of Multi-actor Systems, Faculty of Technology, Policy and Management, Delft University of Technology, P.O. Box 5015, NL-2600GA, Delft, The Netherlands software agents adaptation tree overlay resource utilisation stabilisation energy management thermostatic devices agent-based systems multi-agent systems MAS distributed management large-scale infrastructures power distribution. 2010-12-15T23:20:50-05:00 1 4 350 373 2010-12-15T23:20:50-05:00 http://www.inderscience.com/link.php?id=37513 The use of economic models to handle resource allocation in the grid is a reality. Auction mechanisms are used in grid and distributed testbeds to elicitate user's preferences while improving the performance of the system. Existing implementations rely on single auction mechanisms to allocate resources whilst grids are heterogeneous in nature. Many different applications cohabitate having different workflow requirements such as bag of tasks executions or real time interaction that cannot be dealt efficiently by a single mechanism. In that scenario it would be more realistic to allocate resources using the most suitable mechanism for each situation, enabling also its configuration, deployment and management at runtime. Therefore, the paper presents the design principles, architecture and implementation of a configurable auction server (CAS). The auction server offers support for the deployment, configuration and execution of different auction mechanisms, facilitating the task of market mechanism developers and enabling the execution of distributed marketplaces according to local demand. A self-* auction server: design principles, architecture and implementation
X. Vilajosana, J.M. Marques, A. Juan, D. Lazaro, R. Krishnaswamy, L. Navarro
International Journal of Autonomic Computing, Vol. 1, No. 4 (2010) pp. 374 - 390
The use of economic models to handle resource allocation in the grid is a reality. Auction mechanisms are used in grid and distributed testbeds to elicitate user's preferences while improving the performance of the system. Existing implementations rely on single auction mechanisms to allocate resources whilst grids are heterogeneous in nature. Many different applications cohabitate having different workflow requirements such as bag of tasks executions or real time interaction that cannot be dealt efficiently by a single mechanism. In that scenario it would be more realistic to allocate resources using the most suitable mechanism for each situation, enabling also its configuration, deployment and management at runtime. Therefore, the paper presents the design principles, architecture and implementation of a configurable auction server (CAS). The auction server offers support for the deployment, configuration and execution of different auction mechanisms, facilitating the task of market mechanism developers and enabling the execution of distributed marketplaces according to local demand.

]]> 10.1504/IJAC.2010.037513 International Journal of Autonomic Computing, Vol. 1, No. 4 (2010) pp. 374 - 390 X. Vilajosana J.M. Marques A. Juan D. Lazaro R. Krishnaswamy L. Navarro Estudis Informatica, Multimedia i Telecomunicacio, University Oberta de Catalunya, Rambla Poblenou 156 08018 Barcelona, Spain. ' Estudis Informatica, Multimedia i Telecomunicacio, University Oberta de Catalunya, Rambla Poblenou 156 08018 Barcelona, Spain. ' Estudis Informatica, Multimedia i Telecomunicacio, University Oberta de Catalunya, Rambla Poblenou 156 08018 Barcelona, Spain. ' Estudis Informatica, Multimedia i Telecomunicacio, University Oberta de Catalunya, Rambla Poblenou 156 08018 Barcelona, Spain. ' Orange – France Telecom Labs, France Telecom R&D, 38 Rue du General Leclerc, 92130 Issy les Moulineaux, France. ' Department of Computer Architecture, Universitat Politecnica de Catalunya, C/Jordi Girona 1-4 08034 Barcelona, Spain self-configuration self-deployment economic resource allocation grid computing economic models auction mechanisms configurable auction servers distributed marketplaces market mechanisms. 2010-12-15T23:20:50-05:00 1 4 374 390 2010-12-15T23:20:50-05:00 http://www.inderscience.com/link.php?id=37514 Pervasive services have attracted numerous attentions from both industries and academia. Its very high adaptability demand makes autonomic computing (AC), and in particular, personal autonomic computing (PAC), an ideal enabling technology. Some generic AC frameworks have been proposed in the literature but without considering the dynamic deployment and re-configuration of pervasive service components in a self-controlled manner. Further, very little attention has been paid to providing autonomic pervasive services in mobile wireless environments. This paper addresses above issues. In particular, a service component self-deployment algorithm using partitioning techniques is proposed and evaluated; a simple service re-configuration algorithm is also presented; and a service self-healing mechanism is proposed. In addition, an AC environment is proposed and its major building blocks being discussed. This AC environment serves as the container of the proposed service component self-deployment, self-configuration and self-healing mechanisms. A prototype of the system has been designed and implemented. Experiment results have shown the effectiveness of the proposed mechanisms. Dynamic algorithms for autonomic pervasive services in mobile wireless environments
Shumao Ou, Kun Yang, Hong Zhu
International Journal of Autonomic Computing, Vol. 1, No. 4 (2010) pp. 391 - 407
Pervasive services have attracted numerous attentions from both industries and academia. Its very high adaptability demand makes autonomic computing (AC), and in particular, personal autonomic computing (PAC), an ideal enabling technology. Some generic AC frameworks have been proposed in the literature but without considering the dynamic deployment and re-configuration of pervasive service components in a self-controlled manner. Further, very little attention has been paid to providing autonomic pervasive services in mobile wireless environments. This paper addresses above issues. In particular, a service component self-deployment algorithm using partitioning techniques is proposed and evaluated; a simple service re-configuration algorithm is also presented; and a service self-healing mechanism is proposed. In addition, an AC environment is proposed and its major building blocks being discussed. This AC environment serves as the container of the proposed service component self-deployment, self-configuration and self-healing mechanisms. A prototype of the system has been designed and implemented. Experiment results have shown the effectiveness of the proposed mechanisms.

]]> 10.1504/IJAC.2010.037514 International Journal of Autonomic Computing, Vol. 1, No. 4 (2010) pp. 391 - 407 Shumao Ou Kun Yang Hong Zhu School of Technology, Oxford Brookes University, Wheatley, Oxford OX33 1HX, UK. ' University of Essex, Colchester CO4 3SQ UK. ' School of Technology, Oxford Brookes University, Wheatley, Oxford OX33 1HX, UK autonomic computing self-deployment self-configuration self-healing pervasive services mobile networks wireless networks. 2010-12-15T23:20:50-05:00 1 4 391 407 2010-12-15T23:20:50-05:00 http://www.inderscience.com/link.php?id=37515 We propose a backup system based on a stackable mirroring file system, general-purpose mirroring file system (GMFS). This file system mirrors data in real-time on the file system layer. It uses the typical network file system (NFS) and backs up data to one or more NFS servers. Therefore, an existing empty resource can be used. It is necessary to backup data to two or more servers in case a backup server fails. Moreover, the throughput of read and write operations has been improved by adopting a method of calling a system function inside NFS. Experimental results shows that the throughput of read and write operations of GMFS is 2.4 times faster than that of conventional mirroring file systems. In addition, even when the number of backup servers increases, the decrease in throughput is small. Implementation of a stackable file system for real-time network backup
Satoshi Nishimura, Mutsuo Sano, Katsuo Ikeda
International Journal of Autonomic Computing, Vol. 1, No. 4 (2010) pp. 408 - 424
We propose a backup system based on a stackable mirroring file system, general-purpose mirroring file system (GMFS). This file system mirrors data in real-time on the file system layer. It uses the typical network file system (NFS) and backs up data to one or more NFS servers. Therefore, an existing empty resource can be used. It is necessary to backup data to two or more servers in case a backup server fails. Moreover, the throughput of read and write operations has been improved by adopting a method of calling a system function inside NFS. Experimental results shows that the throughput of read and write operations of GMFS is 2.4 times faster than that of conventional mirroring file systems. In addition, even when the number of backup servers increases, the decrease in throughput is small.

]]> 10.1504/IJAC.2010.037515 International Journal of Autonomic Computing, Vol. 1, No. 4 (2010) pp. 408 - 424 Satoshi Nishimura Mutsuo Sano Katsuo Ikeda Graduate School of Information Science and Technology, Osaka Institute of Technology, 1-79-1, Kitayama, Hirakata-shi, Osaka, Japan. ' Faculty of Information Science and Technology, Osaka Institute of Technology, 1-79-1, Kitayama, Hirakata-shi, Osaka, Japan. ' Faculty of Information Science and Technology, Osaka Institute of Technology, 1-79-1, Kitayama, Hirakata-shi, Osaka, Japan file systems real-time backup network mirroring replication Linux network file systems NFS stackable mirroring files. 2010-12-15T23:20:50-05:00 1 4 408 424 2010-12-15T23:20:50-05:00 http://www.inderscience.com/link.php?id=37516 Data transfer in distributed environment is prone to frequent failures resulting from back-end system level problems, like connectivity failure which is technically untraceable by users. Error messages are not logged efficiently, and sometimes are not relevant/useful from users' point-of-view. Our study explores the possibility of efficient error detection and reporting system for such environments. Prior knowledge about the environment and awareness of the actual reason behind a failure would enable higher level planners to make better and accurate decisions. It is necessary to have well defined error detection and error reporting methods to increase the usability and serviceability of existing data transfer protocols and data management systems. We investigate the applicability of early error detection and error classification techniques and propose an error reporting framework and a failure-aware data transfer life cycle to improve arrangement of data transfer operations and to enhance decision making of data transfer schedulers. Error detection and error classification: failure awareness in data transfer scheduling
Mehmet Balman, Tevfik Kosar
International Journal of Autonomic Computing, Vol. 1, No. 4 (2010) pp. 425 - 446
Data transfer in distributed environment is prone to frequent failures resulting from back-end system level problems, like connectivity failure which is technically untraceable by users. Error messages are not logged efficiently, and sometimes are not relevant/useful from users' point-of-view. Our study explores the possibility of efficient error detection and reporting system for such environments. Prior knowledge about the environment and awareness of the actual reason behind a failure would enable higher level planners to make better and accurate decisions. It is necessary to have well defined error detection and error reporting methods to increase the usability and serviceability of existing data transfer protocols and data management systems. We investigate the applicability of early error detection and error classification techniques and propose an error reporting framework and a failure-aware data transfer life cycle to improve arrangement of data transfer operations and to enhance decision making of data transfer schedulers.

]]> 10.1504/IJAC.2010.037516 International Journal of Autonomic Computing, Vol. 1, No. 4 (2010) pp. 425 - 446 Mehmet Balman Tevfik Kosar Computational Research Division, Lawrence Berkeley National Laboratory, Berkeley, CA 94720, USA. ' Department of Computer Science, Center for Computation & Technology, Louisiana State University, Baton Rouge, LA 70803, USA error detection error classification network exploration data movement distributed repositories failure awareness data transfer scheduling bulk data transfer error reporting decision making. 2010-12-15T23:20:50-05:00 1 4 425 446 2010-12-15T23:20:50-05:00 http://www.inderscience.com/link.php?id=37517 JXTA defines a set of six core protocols specifically suited for ad hoc, pervasive, multi-hop, peer-to-peer (P2P) computing. These protocols allow peers to cooperate and form autonomous peer groups. This paper presents a satisfactory method that provides security services to the core protocols: privacy, authenticity, integrity and non-repudiation. The presented mechanisms are fully distributed and based on a pure peer-to-peer model, not requiring the arbitration of a trusted third party or a previously established trust relationship between peers, which is one of the main challenges under this kind of environments. XML-based security for JXTA core protocols
Joan Arnedo-Moreno, Jordi Herrera-Joancomarti
International Journal of Autonomic Computing, Vol. 1, No. 4 (2010) pp. 447 - 469
JXTA defines a set of six core protocols specifically suited for ad hoc, pervasive, multi-hop, peer-to-peer (P2P) computing. These protocols allow peers to cooperate and form autonomous peer groups. This paper presents a satisfactory method that provides security services to the core protocols: privacy, authenticity, integrity and non-repudiation. The presented mechanisms are fully distributed and based on a pure peer-to-peer model, not requiring the arbitration of a trusted third party or a previously established trust relationship between peers, which is one of the main challenges under this kind of environments.

]]> 10.1504/IJAC.2010.037517 International Journal of Autonomic Computing, Vol. 1, No. 4 (2010) pp. 447 - 469 Joan Arnedo-Moreno Jordi Herrera-Joancomarti Estudis d'Informatica, Multimedia i Telecomunicacio, Universitat Oberta de Catalunya, Rb. Poblenou 156 08018 Barcelona, Spain. ' Escola Tecnica Superior d'Enginyeria, Universitat Autonoma de Barcelona, Campus de Bellaterra, Spain peer-to-peer P2P computing security peer group JXTA XMLdsig XMLenc peer resolver protocol PRP XML ad hoc computing pervasive computing multi-hop computing privacy authenticity integrity non-repudiation. 2010-12-15T23:20:50-05:00 1 4 447 469 2010-12-15T23:20:50-05:00