Trading space for time in undirected s-t connectivity
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Designing distributed applications with mobile code paradigms
ICSE '97 Proceedings of the 19th international conference on Software engineering
An architecture for a secure service discovery service
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
A taxonomy and survey of grid resource management systems for distributed computing
Software—Practice & Experience
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Semantic Matching of Web Services Capabilities
ISWC '02 Proceedings of the First International Semantic Web Conference on The Semantic Web
Dynamic agent population in agent-based distance vector routing
Second international workshop on Intelligent systems design and application
A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks
Journal of Parallel and Distributed Computing - Special issue on wireless and mobile ad hoc networking and computing
QoS-Aware Discovery of Wide-Area Distributed Services
CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
A Peer-to-Peer Approach to Resource Location in Grid Environments
HPDC '02 Proceedings of the 11th IEEE International Symposium on High Performance Distributed Computing
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Adaptive Probabilistic Search for Peer-to-Peer Networks
P2P '03 Proceedings of the 3rd International Conference on Peer-to-Peer Computing
An architecture for information retrieval over semi-collaborating Peer-to-Peer networks
Proceedings of the 2004 ACM symposium on Applied computing
A Resource Discovery Model based on Multi-Agent Technology in P2P System
IAT '04 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Active Service for Mobile Middleware
World Wide Web
Adaptive Approach for the Regulation of a Mobile Agent Population in a Distributed Network
ISPDC '06 Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing
Model-driven Walks for Resource Discovery in Peer-to-Peer Networks
CIMCA '06 Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce
Flexible Semantic-Based Service Matchmaking and Discovery
World Wide Web
A survey of schema-based matching approaches
Journal on Data Semantics IV
Trust your social network according to satisfaction, reputation and privacy
Proceedings of the Third International Workshop on Reliability, Availability, and Security
| Hi-index | 0.00 |
Service oriented networks are distributed computing infrastructures that provide widely distributed resources. These networks are dynamic and their size and complexity continue to increase and allow to users a ubiquitous access to available resources and services. Therefore, efficient query routing approaches in large and highly distributed service oriented networks are required and need to be adaptive in order to cope with a dynamically changing environment. In this paper, a query routing approach based on mobile agents and random walks with a reinforcement learning technique is presented. By enhancing random walks with a reinforcement learning mechanism centered on users' satisfaction, this approach allows dynamic and self-adaptive location of required resources. Peers incorporate knowledge from past and present queries which will be used during next searches by mobile agents to select their next hops. This approach is analyzed through two query routing techniques using the network simulator ns2.