A decentralized quickest response algorithm for grid service discovery

Authors:
Jianjun Hu;Heqing Guan;Hua Zhong
Affiliations:
Chinese Academy of Sciences, Beijing, P. R. China;Chinese Academy of Sciences, Beijing, P. R. China;Chinese Academy of Sciences, Beijing, P. R. China
Venue:
Proceedings of the 2nd international conference on Scalable information systems
Year:
2007

Citing 9
Cited 0

The grid: blueprint for a new computing infrastructure

The grid: blueprint for a new computing infrastructure
An architecture for a secure service discovery service

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Application-layer anycasting: a server selection architecture and use in a replicated Web service

IEEE/ACM Transactions on Networking (TON)
Server load balancing

Server load balancing
Agent-Based Grid Load Balancing Using Performance-Driven Task Scheduling

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
An Efficient Decentralized Grid Service Discovery Approach based on Service Ontology

WI '04 Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence
Fully Decentralized DHT based Approach to Grid Service Discovery using Overlay Networks

CIT '05 Proceedings of the The Fifth International Conference on Computer and Information Technology
Dynamic Prefix Tree for Service Discovery within Large Scale Grids

P2P '06 Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing
Distributed Systems: Principles and Paradigms (2nd Edition)

Distributed Systems: Principles and Paradigms (2nd Edition)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Computational grid is an emerging computing infrastructure that enables effective access to high performance computing resources. Service discovery is one of the most important research issues of grid computing. However, traditional service discovery algorithms are not suitable for grid environment due to the facts of inherited decentralization and loose coupling of grid application itself. To address this problem, we in the paper analyze the limitation of those traditional algorithms, and present a novel grid oriented service discovery algorithm based on quickest response approach, namely DSDA, which is essentially decentralized. DSDA also takes network latency and processing capability of service nodes into account. Our later experiment justified DSDA's effectiveness in the grid environment.