Semantic-Based, Scalable, Decentralized and Dynamic Resource Discovery for Internet-Based Distributed System

Resource Discovery (RD) is a key issue in Internet-based distributed sytems such as grid. RD is about locating an appropriate resource/service type that matches the user's application requirements. This is very important, as resource reservation and task scheduling are based on it. Unfortunately, RD in grid is very challenging as resources and users are distributed, resources are heterogeneous in their platforms, status of the resources is dynamic (resources can join or leave the system without any prior notice) and most recently the introduction of a new type of grid called intergrid (grid of grids) with the use of multi middlewares. Such situation requires an RD system that has rich interoperability, scalability, decentralization and dynamism features. However, existing grid RD systems have difficulties to attain these features. Not only that, they lack the review and evaluation studies, which may highlight the gap in achieving the required features. Therefore, this work discusses the problem associated with intergrid RD from two perspectives. First, reviewing and classifying the current grid RD systems in such a way that may be useful for discussing and comparing them. Second, propose a novel RD framework that has the aforementioned required RD features. In the former, we mainly focus on the studies that aim to achieve interoperability in the first place, which are known as RD systems that use semantic information (semantic technology). In particular, we classify such systems based on their qualitative use of the semantic information. We evaluate the classified studies based on their degree of accomplishment of interoperability and the other RD requirements, and draw the future research direction of this field. Meanwhile in the latter, we name the new framework as semantic-based scalable decentralized dynamic RD. The framework further contains two main components which are service description, and service registration and discovery models. The earlier consists of a set of ontologies and services. Ontologies are used as a data model for service description, whereas the services are to accomplish the description process. The service registration is also based on ontology, where nodes of the service (service providers) are classified to some classes according to the ontology concepts, which means each class represents a concept in the ontology. Each class has a head, which is elected among its own class I nodes/members. Head plays the role of a registry in its class and communicates with I the other heads of the classes in a peer to peer manner during the discovery process. We further introduce two intelligent agents to automate the discovery process which are Request Agent (RA) and Description Agent (DA). Eaclj. node is supposed to have both agents. DA describes the service capabilities based on the ontology, and RA I carries the service requests based on the ontology as well. We design a service search I algorithm for the RA that starts the service look up from the class of request origin first, then to the other classes. We finally evaluate the performance of our framework ~ith extensive simulation experiments, the result of which confirms the effectiveness of the proposed system in satisfying the required RD features (interoperability, scalability, decentralization and dynamism). In short, our main contributions are outlined new key taxonomy for the semantic-based grid RD studies; an interoperable semantic description RD component model for intergrid services metadata representation; a semantic distributed registry architecture for indexing service metadata; and an agent-qased service search and selection algorithm. Vll

Utility-Based Mechanism for Structural Self-Organization in Service-Oriented MAS

Structural relations established among agents influence the performance of decentralized service discovery process in multiagent systems. Moreover, distributed systems should be able to adapt their structural relations to changes in environmental conditions. In this article, we present a service-oriented multiagent systems, where agents initially self-organize their structural relations based on the similarity of their services. During the service discovery process, agents integrate a mechanism that facilitates the self-organization of their structural relations to adapt the structure of the system to the service demand. This mechanism facilitates the task of decentralized service discovery and improves its performance. Each agent has local knowledge about its direct neighbors and the queries received during discovery processes. With this information, an agent is able to analyze its structural relations and decide when it is more appropriate to modify its direct neighbors and select the most suitable acquaintances to replace them. The experimental evaluation shows how this self-organization mechanism improves the overall performance of the service discovery process in the system when the service demand changesThis work is partially supported by the Spanish Ministry of Science and Innovation through grants CSD2007-0022 (CONSOLIDER-INGENIO 2010), TIN2012-36586-C03-01, TIN2012-36586-C03-01, TIN2012-36586-C03-02, PROMETEOII/2013/019, and FPU grant AP-2008-00601 awarded to E. Del Val.Del Val Noguera, E.; Rebollo Pedruelo, M.; Vasirani, M.; Fernández, A. (2014). Utility-Based Mechanism for Structural Self-Organization in Service-Oriented MAS. ACM Transactions on Autonomous and Adaptive Systems. 9(3):1-24. https://doi.org/10.1145/2651423S12493Sherief Abdallah and Victor Lesser. 2007. Multiagent reinforcement learning and self-organization in a network of agents. In Proceedings of the 6th International Conference on Autonomous Agents and Multiagent Systems. 172--179.Lada A. Adamic and Bernardo A. Huberman. 2002. Zipf’s law and the Internet. Glottometrics 3, 143--150.Muntasir Al-Asfoor, Brendan Neville, and Maria Fasli. 2012. Heuristic resource search in a self-organised distributed multi agent system. In Proceedings of the 6th International Workshop on Self-Organizing Systems. 84--89.Mathieu Aquin, Salman Elahi, and Enrico Motta. 2010. Personal monitoring of Web information exchange: Towards Web lifelogging. In Proceedings of the Web Science Conference.Ulrich Basters and Matthias Klusch. 2006. RS2D: Fast adaptive search for semantic Web services in unstructured p2p networks. In Proceedings of the International Semantic Web Conference. 87--100.Umesh Bellur and Roshan Kulkarni. 2007. Improved matchmaking algorithm for semantic Web services based on bipartite graph matching. In Proceedings of the International Semantic Web Conference. 86--93.Devis Bianchini, Valeria De Antonellis, and Michele Melchiori. 2009. Service-based semantic search in p2p systems. In Proceedings of the European Conference on Web Services. 7--16.Bartosz Biskupski, Jim Dowling, and Jan Sacha. 2007. Properties and mechanisms of self-organizing MANET and P2P systems. ACM Transactions on Autonomous and Adaptive Systems 2, 1, 1--34.Alberto Blanc, Yi-Kai Liu, and Amin Vahdat. 2005. Designing incentives for peer-to-peer routing. In Proceedings of the 24th Annual Joint Conference of the IEEE Computer and Communications Societies. 374--385.Michael Bowling and Manuela Veloso. 2002. Multiagent learning using a variable learning rate. Artificial Intelligence 136, 215--250.Frances M. T. Brazier, Jeffrey O. Kephart, H. Van Dyke Parunak, and Michael N. Huhns. 2009. Agents and service-oriented computing for autonomic computing: A research agenda. IEEE Internet Computing 13, 3, 82--87.Tyson Condie, Sepandar D. Kamvar, and Hector Garcia-Molina. 2004. Adaptive peer-to-peer topologies. In Proceedings of the 4th International Conference on Peer-to-Peer Computing. 53--62.Arturo Crespo and Hector Garcia-Molina. 2002. Routing indices for peer-to-peer systems. In Proceedings of the 22nd International Conference on Distributed Computing Systems. 23--32.Elena Del Val, Natalia Criado, Carlos Carrascosa, Vicente Julian, Miguel Rebollo, Estefania Argente, and Vicente Botti. 2010. THOMAS: A service-oriented framework for virtual organizations. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS’10). 1631--1632.Elena Del Val, Miguel Rebollo, and Vicente Botti. 2011. Introducing homophily to improve semantic service search in a self-adaptive system. In Proceedings of the 10th International Conference on Autonomous Agents and Multiagent Systems. 1241--1242.Elena Del Val, Miguel Rebollo, and Vicente Botti. 2012a. Enhancing decentralized service discovery in open service-oriented multi-agent systems. Autonomous Agents and Multi-Agent Systems 28, 1, 1--30.Elena Del Val, Miguel Rebollo, and Vicente Botti. 2012b. Promoting cooperation in service-oriented MAS through social plasticity and incentives. Journal of Systems and Software 86, 2, 520--537.Gianni Di Caro, Frederick Ducatelle, and Luca Maria Gambardella. 2005. AntHocNet: An adaptive nature-inspired algorithm for routing in mobile ad hoc networks. European Transactions on Telecommunications 16, 443--455.Ding Ding, Lei Liu, and Hartmut Schmeck. 2010. Service discovery in self-organizing service-oriented environments. In Proceedings of the 2010 IEEE Asia-Pacific Services Computing Conference. 717--724.Sergey N. Dorogovtsev and Jose F. F. Mendes. 2003. Evolution of Networks: From Biological Nets to the Internet and WWW. Oxford University Press.Giovanna Di Marzo Serugendo, Marie-Pierre Gleizes, and Anthony Karageorgos. 2011. Self-Organizing Software: From Natural to Artificial Adaptation. Natural Computing Series.Erik Einhorn and Andreas Mitschele-Thiel. 2008. RLTE: Reinforcement learning for traffic-engineering. In Proceedings of the 2nd International Conference on Autonomous Infrastructure, Management, and Security. 120--133.Nelson Fernandez, Carlos Maldonado, and Carlos Gershenson. 2014. Information measures of complexity, emergence, self-organization, homeostasis, and autopoiesis. In Guided Self-Organization: Inception. Emergence, Complexity and Computation, Vol. 9. Springer, 19--51. DOI: http://dx.doi.org/10.1007/978-3-642-53734-9_2Jose Luis Fernandez-Marquez, Josep Lluis Arcos, and Giovanna Di Marzo Serugendo. 2012. A decentralized approach for detecting dynamically changing diffuse event sources in noisy WSN environments. Applied Artificial Intelligence 26, 4, 376--397. DOI: http://dx.doi.org/10.1080/08839514.2012.653659Agostino Forestiero, Carlo Mastroianni, and Michela Meo. 2009. Self-Chord: A bio-inspired algorithm for structured P2P systems. In Proceedings of the 9th IEEE/ACM International Symposium on Cluster, Cloud, and Grid Computing. 44--51.Matthew E. Gaston and Marie des Jardins. 2005. Agent-organized networks for multi-agent production and exchange. In Proceedings of the 20th AAAI Conference on Artificial Intelligence. 77--82.Nathan Griffiths and Michael Luck. 2010. Changing neighbours: Improving tag-based cooperation. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems. 249--256.Peter Haase, Ronny Siebes, and Frank van Harmelen. 2008. Expertise-based peer selection in peer-to-peer networks. Knowledge and Information Systems 15, 1, 75--107.Philip N. Howard, Lee Rainee, and Steve Jones. 2001. Days and nights on the Internet. American Behavioural Scientist, 383--404.Bernardo A. Huberman and Lada A. Adamic. 2000. The nature of markets in the WWW. Quarterly Journal of Electronic Commerce 1, 5--12.Michael N. Huhns et al. 2005. Research directions for service-oriented multiagent systems. IEEE Internet Computing 9, 6, 65--70.Tomoko Itao, Tatsuya Suda, Tetsuya Nakamura, Miyuki Imada, Masato Matsuo, and Tomonori Aoyama. 2001. Jack-in-the-Net: Adaptive networking architecture for service emergence. In Proceedings of the Asian-Pacific Conference on Communications. 9.Emily M. Jin, Michelle Girvan, and Mark E. J. Newman. 2001. Structure of growing social networks. Physical Review E 64, 4, 046132.Sachin Kamboj and Keith S. Decker. 2007. Organizational self-design in semi-dynamic environments. In Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems. 335--337.Rahamatullah Khondoker, S. M. Taslim Arif, Nathan Kerr, and Dennis Schwerdel. 2011. Self-organizing communication services in future network architectures. In Proceedings of the 5th International Workshop on Self-Organizing Systems.Matthias Klusch, Benedikt Fries, and Katia Sycara. 2009. OWLS-MX: A hybrid Semantic Web service matchmaker for OWL-S services. Web Semantics Science Services and Agents on the World Wide Web 7, 2, 121--133.Dionisis Kontominas, Paraskevi Raftopoulou, Christos Tryfonopoulos, and Euripides G. M. Petrakis. 2013. DS4: A distributed social and semantic search system. Advances in Information Retrieval 7814, 832--836.Ramachandra Kota, Nicholas Gibbins, and Nicholas R. Jennings. 2012. Decentralized approaches for self-adaptation in agent organizations. ACM Transactions on Autonomous and Adaptive Systems 7, 1, Article No. 1.Paul Lazarsfeld. 1954. Friendship as a social process: A substantive and methodological analysis. In Freedom and Control in Modern Society. Van Nostrand, New York, NY.Paulo Leito. 2013. Towards self-organized service-oriented multi-agent systems. In Service Orientation in Holonic and Multi Agent Manufacturing and Robotics. Studies in Computational Intelligence, Vol. 472. Springer, 41--56.W. Sabrina Lin, Hong Vikcy Zhao, and K. J. Ray Liu. 2009. Incentive cooperation strategies for peer-to-peer live multimedia streaming social networks. IEEE Transactions on Multimedia 11, 3, 396--412.Sheila A. McIlraith, Tran Cao Son, and Honglei Zeng. 2001. Semantic Web services. IEEE Intelligent Systems 16, 2, 46--53.Miller McPherson, Lynn Smith-Lovin, and James Cook. 2001. Birds of a feather: Homophily in social networks. Annual Review of Sociology 27, 415--444.Vivek Nallur and Rami Bahsoon. 2012. A decentralized self-adaptation mechanism for service-based applications in the cloud. IEEE Transactions on Software Engineering 99, 591--612.Aris Ouksel, Yair Babad, and Thomas Tesch. 2004. Matchmaking software agents in B2B markets. In Proceedings of the 37th Annual Hawaii International Conference on System Sciences. 1--9.Massimo Paolucci, Takahiro Kawamura, Terry R. Payne, and Katia P. Sycara. 2002. Semantic matching of Web services capabilities. In Proceedings of the 1st International Semantic Web Conference. 333--347.Leonid Peshkin and Virginia Savova. 2002. Reinforcement learning for adaptive routing. In Proceedings of the 2002 International Conference on Neural Networks (IJCNN’02). 1825--1830.Paraskevi Raftopoulou and Euripides G. M. Petrakis. 2008. iCluster: A self-organizing overlay network for P2P information retrieval. In Proceedings of the 30th European Conference on Advances in Information Retrieval (ECIR’08). 65--76.Sharmila Savarimuthu, Maryam Purvis, Martin Purvis, and Bastin Tony Roy Savarimuthu. 2011. Mechanisms for the self-organization of peer groups in agent societies. In Multi-Agent-Based Simulation XI. Lecture Notes in Computer Science, Vol. 6532. Springer, 93--107.Giovanna Di Marzo Serugendo, Marie-Pierre Gleizes, and Anthony Karageorgos. 2005. Self-organization in multi-agent systems. Knowledge Engineering Review 20, 2, 165--189.Abdul Khalique Shaikh, Saadat M. Alhashmi, and Rajendran Parthiban. 2012. A semantic impact in decentralized resource discovery mechanism for grid computing environments. In Algorithms and Architectures for Parallel Processing. Lecture Notes in Computer Science, Vol. 7440. Springer, 206--216.Qixiang Sun and Hector Garcia-Molina. 2004. SLIC: A selfish link-based incentive mechanism for unstructured peer-to-peer networks. In Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS’04). 506--515.Mirko Viroli and Franco Zambonelli. 2010. A biochemical approach to adaptive service ecosystems. Information Sciences 180, 10, 1876--1892. DOI: http://dx.doi.org/10.1016/j.ins.2009.11.021Li Wang. 2011. SoFA: An expert-driven, self-organization peer-to-peer semantic communities for network resource management. Expert Systems with Applications 38, 1, 94--105.Kevin Werbach. 2000. Syndication—the emerging model for business in the Internet era. Harvard Business Review 78, 3, 84--93, 214.Tom Wolf and Tom Holvoet. 2005. Emergence versus self-organisation: Different concepts but promising when combined. In Engineering Self-Organising Systems. Lecture Notes in Computer Science, Vol. 3464. Springer, 1--15.Haizheng Zhang, W. Bruce Croft, Brian Levine, and Victor Lesser. 2004. A multi-agent approach for peer-to-peer based information retrieval system. In Proceedings of the 3rd International Conference on Autonomous Agents and Multiagent Systems, Vol. 1. 456--463.Ming Zhong. 2006. Popularity-biased random walks for peer-to-peer search under the square-root principle. In Proceedings of the 5th International Workshop on Peer-to-Peer Systems

Collaborative e-science architecture for Reaction Kinetics research community

This paper presents a novel collaborative e-science architecture (CeSA) to address two challenging issues in e-science that arise from the management of heterogeneous distributed environments: (i) how to provide individual scientists an integrated environment to collaborate with each other in distributed, loosely coupled research communities where each member might be using a disparate range of tools; and (ii) how to provide easy access to a range of computationally intensive resources from a desktop. The Reaction Kinetics research community was used to capture the requirements and in the evaluation of the proposed architecture. The result demonstrated the feasibility of the approach and the potential benefits of the CeSA

Semantic-Based, Scalable, Decentralized and Dynamic Resource Discovery for Internet-Based Distributed System

Resource Discovery (RD) is a key issue in Internet-based distributed sytems such as grid. RD is about locating an appropriate resource/service type that matches the user's application requirements. This is very important, as resource reservation and task scheduling are based on it. Unfortunately, RD in grid is very challenging as resources and users are distributed, resources are heterogeneous in their platforms, status of the resources is dynamic (resources can join or leave the system without any prior notice) and most recently the introduction of a new type of grid called intergrid (grid of grids) with the use of multi middlewares. Such situation requires an RD system that has rich interoperability, scalability, decentralization and dynamism features. However, existing grid RD systems have difficulties to attain these features. Not only that, they lack the review and evaluation studies, which may highlight the gap in achieving the required features. Therefore, this work discusses the problem associated with intergrid RD from two perspectives. First, reviewing and classifying the current grid RD systems in such a way that may be useful for discussing and comparing them. Second, propose a novel RD framework that has the aforementioned required RD features. In the former, we mainly focus on the studies that aim to achieve interoperability in the first place, which are known as RD systems that use semantic information (semantic technology). In particular, we classify such systems based on their qualitative use of the semantic information. We evaluate the classified studies based on their degree of accomplishment of interoperability and the other RD requirements, and draw the future research direction of this field. Meanwhile in the latter, we name the new framework as semantic-based scalable decentralized dynamic RD. The framework further contains two main components which are service description, and service registration and discovery models. The earlier consists of a set of ontologies and services. Ontologies are used as a data model for service description, whereas the services are to accomplish the description process. The service registration is also based on ontology, where nodes of the service (service providers) are classified to some classes according to the ontology concepts, which means each class represents a concept in the ontology. Each class has a head, which is elected among its own class I nodes/members. Head plays the role of a registry in its class and communicates with I the other heads of the classes in a peer to peer manner during the discovery process. We further introduce two intelligent agents to automate the discovery process which are Request Agent (RA) and Description Agent (DA). Eaclj. node is supposed to have both agents. DA describes the service capabilities based on the ontology, and RA I carries the service requests based on the ontology as well. We design a service search I algorithm for the RA that starts the service look up from the class of request origin first, then to the other classes. We finally evaluate the performance of our framework ~ith extensive simulation experiments, the result of which confirms the effectiveness of the proposed system in satisfying the required RD features (interoperability, scalability, decentralization and dynamism). In short, our main contributions are outlined new key taxonomy for the semantic-based grid RD studies; an interoperable semantic description RD component model for intergrid services metadata representation; a semantic distributed registry architecture for indexing service metadata; and an agent-qased service search and selection algorithm. Vll

Performance Analysis of Publish/Subscribe Systems

The Desktop Grid offers solutions to overcome several challenges and to answer increasingly needs of scientific computing. Its technology consists mainly in exploiting resources, geographically dispersed, to treat complex applications needing big power of calculation and/or important storage capacity. However, as resources number increases, the need for scalability, self-organisation, dynamic reconfigurations, decentralisation and performance becomes more and more essential. Since such properties are exhibited by P2P systems, the convergence of grid computing and P2P computing seems natural. In this context, this paper evaluates the scalability and performance of P2P tools for discovering and registering services. Three protocols are used for this purpose: Bonjour, Avahi and Free-Pastry. We have studied the behaviour of theses protocols related to two criteria: the elapsed time for registrations services and the needed time to discover new services. Our aim is to analyse these results in order to choose the best protocol we can use in order to create a decentralised middleware for desktop grid

Incentives in peer-to-peer and grid networking

Today, most peer-to-peer networks are based on the assumptionthat the participating nodes are cooperative. Thisworks if the nodes are indifferent or ignorant about the resourcesthey offer, but limits the usability of peer-to-peernetworks to very few scenarios. It specifically excludes theirusage in any non-cooperative peer-to-peer environment, beit Grid networks or mobile ad-hoc networks. By introducingsoft incentives to offer resources to other nodes, we seean overall performance gain in traditional file-sharing networks.We also see soft incentives promoting the convergenceof peer-to-peer and Grid networks, as they increasethe predictability of the participating nodes, and thereforethe reliability of the services provided by the system as awhole. Reliability is what is required by Grid networks, butmissing in peer-to-peer networks

A Taxonomy of Workflow Management Systems for Grid Computing

With the advent of Grid and application technologies, scientists and engineers are building more and more complex applications to manage and process large data sets, and execute scientific experiments on distributed resources. Such application scenarios require means for composing and executing complex workflows. Therefore, many efforts have been made towards the development of workflow management systems for Grid computing. In this paper, we propose a taxonomy that characterizes and classifies various approaches for building and executing workflows on Grids. We also survey several representative Grid workflow systems developed by various projects world-wide to demonstrate the comprehensiveness of the taxonomy. The taxonomy not only highlights the design and engineering similarities and differences of state-of-the-art in Grid workflow systems, but also identifies the areas that need further research.Comment: 29 pages, 15 figure

Lightweight Blockchain Framework for Location-aware Peer-to-Peer Energy Trading

Peer-to-Peer (P2P) energy trading can facilitate integration of a large number of small-scale producers and consumers into energy markets. Decentralized management of these new market participants is challenging in terms of market settlement, participant reputation and consideration of grid constraints. This paper proposes a blockchain-enabled framework for P2P energy trading among producer and consumer agents in a smart grid. A fully decentralized market settlement mechanism is designed, which does not rely on a centralized entity to settle the market and encourages producers and consumers to negotiate on energy trading with their nearby agents truthfully. To this end, the electrical distance of agents is considered in the pricing mechanism to encourage agents to trade with their neighboring agents. In addition, a reputation factor is considered for each agent, reflecting its past performance in delivering the committed energy. Before starting the negotiation, agents select their trading partners based on their preferences over the reputation and proximity of the trading partners. An Anonymous Proof of Location (A-PoL) algorithm is proposed that allows agents to prove their location without revealing their real identity. The practicality of the proposed framework is illustrated through several case studies, and its security and privacy are analyzed in detail

An Efficient Transport Protocol for delivery of Multimedia An Efficient Transport Protocol for delivery of Multimedia Content in Wireless Grids

A grid computing system is designed for solving complicated scientific and commercial problems effectively,whereas mobile computing is a traditional distributed system having computing capability with mobility and adopting wireless communications. Media and Entertainment fields can take advantage from both paradigms by applying its usage in gaming applications and multimedia data management. Multimedia data has to be stored and retrieved in an efficient and effective manner to put it in use. In this paper, we proposed an application layer protocol for delivery of multimedia data in wireless girds i.e. multimedia grid protocol (MMGP). To make streaming efficient a new video compression algorithm called dWave is designed and embedded in the proposed protocol. This protocol will provide faster, reliable access and render an imperceptible QoS in delivering multimedia in wireless grid environment and tackles the challenging issues such as i) intermittent connectivity, ii) device heterogeneity, iii) weak security and iv) device mobility.Comment: 20 pages, 15 figures, Peer Reviewed Journa