Efficient service cache management in mobile P2P networks
Service oriented computing is growing as the prominent technology both in the technical and business perspectives. Due to the rapid growth in the volume of service repositories and services, obtaining the appropriate service is becoming tedious in the current scenario. Though advanced techniques are proposed to handle these challenges in conventional environments, still it is in its critical stage in the resource constrained scenarios, particularly in wireless mobile environments. The work presented in this paper proposes a Service Cache Management (SCM) for Mobile Peer-to-Peer (MP2P) networks to facilitate the efficient retrieval of services. We used a communication structure called Distributed Spanning Tree (DST), in which nodes of MP2P are made to form a forest of spanning trees in a distributed fashion. Using the DST structure, fast service cache and retrieval can be achieved within MP2P. Further to enhance the effectiveness of the proposed system, the DST network is optimized with Ant Colony Optimization (ACO), to identify the simplest path between nodes of each layer on the DST. The merits of the proposed techniques are demonstrated in terms of reduced time requirement for cached service search, increased availability, enhanced consistency, scalability and improved hit ratios.
service cache distributed spanning tree ant colony optimization consistency scalability hit ratio service computing mobile peer to peer omnet++