A decentralized quickest response algorithm for grid service discovery

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.