A decentralized quickest response algorithm for grid service discovery

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.

REFERENCES

• 1: Ian Foster , Carl Kesselman, The grid: blueprint for a new computing infrastructure, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1998
• 2: Andrew S. Tanenbaum , Maarten van Steen, Distributed Systems: Principles and Paradigms (2nd Edition), Prentice-Hall, Inc., Upper Saddle River, NJ, 2006
• 3: Globus. Available at http://www-unix.globus.org
• 4: Tony Bourke, Server load balancing, O'Reilly & Associates, Inc., Sebastopol, CA, 2001
• 5: E. Guttman , C. Perkins , J. Veizades , M. Day, Service Location Protocol, Version 2, RFC Editor, 1999
• 6: Steven E. Czerwinski , Ben Y. Zhao , Todd D. Hodes , Anthony D. Joseph , Randy H. Katz, An architecture for a secure service discovery service, Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, p.24-35, August 15-19, 1999, Seattle, Washington, United States [doi>10.1145/313451.313462]
• 7: Ellen W. Zegura , Mostafa H. Ammar , Zongming Fei , Samrat Bhattacharjee, Application-layer anycasting: a server selection architecture and use in a replicated Web service, IEEE/ACM Transactions on Networking (TON), v.8 n.4, p.455-466, Aug. 2000 [doi>10.1109/90.865074]
• 8: Stemm, M., Seshan, S., and Katz, R. A Network Measurement Architecture for Adaptive Applications. Proceedings of IEEE Infocom 2000. Tel Aviv, Israel. 2000.
• 9: Junwei Cao , Daniel P. Spooner , Stephen A. Jarvis , Subhash Saini , Graham R. Nudd, Agent-Based Grid Load Balancing Using Performance-Driven Task Scheduling, Proceedings of the 17th International Symposium on Parallel and Distributed Processing, p.49.2, April 22-26, 2003
• 10: Zhu, C., Liu, L., Zhang, W., Xu, Z. N., and Yang, D. S. Using Service Taxonomy to Facilitate Efficient Decentralized Grid Service Discovery. Proceeding of 3rd International Conference on Grid and Cooperative Computing (GCC 2004). Wuhan, China, 2004.
• 11: Qi Xia , Ruijun Yang , Weinong Wang , De Yang, Fully Decentralized DHT based Approach to Grid Service Discovery using Overlay Networks, Proceedings of the The Fifth International Conference on Computer and Information Technology, p.1140-1045, September 21-23, 2005 [doi>10.1109/CIT.2005.122]
• 12: Eddy Caron , Frederic Desprez , Cedric Tedeschi, Dynamic Prefix Tree for Service Discovery within Large Scale Grids, Proceedings of the Sixth IEEE International Conference on Peer-to-Peer Computing, p.106-116, September 06-June 08, 2006 [doi>10.1109/P2P.2006.16]
• 13: Cheng Zhu , Zhong Liu , Weiming Zhang , Weidong Xiao , Jincai Huang, An Efficient Decentralized Grid Service Discovery Approach based on Service Ontology, Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence, p.570-573, September 20-24, 2004 [doi>10.1109/WI.2004.22]

INDEX TERMS

Primary Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING
      D.2.m Miscellaneous

General Terms:
Algorithms

Keywords:
decentralization, grid computing, network latency, service discovery