A scalable and adaptive distributed service discovery mechanism in SOC environments

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Current researches on service discovery mainly pursue fast response and high recall, but little work focuses on scalability and adaptability of large-scale distributed service registries in SOC. This paper proposes a solution using an agent based distributed service discovery mechanism. Firstly an unstructured P2P based registry system is proposed in which each peer is an autonomous registry center and services are organized and managed according to domain ontology within these registry centers. Secondly, an ant-like multi-agent service discovery method is proposed. Search agents and guide agents cooperate to discover services. Search agents simulate the behaviors of ants to travel the network and discover services. Guide agents are responsible to manage a service routing table consisting of pheromone and hop count, instructing search agents' routing. Experimental results show that the suggested mechanism is scalable and adaptive in a large-scale dynamic SOC environment. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Zheng, X., Luo, J., & Song, A. (2008). A scalable and adaptive distributed service discovery mechanism in SOC environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5245 LNCS, pp. 349–360). Springer Verlag. https://doi.org/10.1007/978-3-540-88140-7_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free