Abstract
Web service composition is to integrate component services for providing a value-added new service. With the growing number of component services and their dynamic nature, the centralized composition model can’t manage them efficiently and accurately. In this paper, we proposed a distributed hash table (DHT)-based peer-to-peer (P2P) service composition framework, called ServiceStore. Compared with the central control in centralized model, in our ServiceStore, service selection and composition are distributed to the involved task brokers, requesting nodes and service nodes. Furthermore, a simple parallel service selection approach which can still satisfy global constraints is proposed and implemented in our multi-role cooperation (MRC) protocol. The results of experimental evaluation show that ServiceStore can achieve high scalability and efficiency.
This project supported by Provincial Natural Science Foundation of Hebei Province, China (Grant No. F2009000929).
Chapter PDF
Similar content being viewed by others
References
Frolund, S., Koistinen, J.: Quality of service specification in distributed object systems desig. Distributed Systems Engineering Journal 5(4) (December 1998) (QML, which is a language for the description of QoS using XML)
Gnutella, http://gnutella.wego.com/
PeerSim, http://peersim.sourceforge.net/
Benatallah, B., Dumas, M., Sheng, Q.Z., Ngu, A.H.: Declarative Composition and Peer-to-Peer Provisioning of Dynamic Web Services. In: Proc. Int’l Conf. Data Eng. ICDE, pp. 297–308 (February 2002)
Benatallah, B., Sheng, Q., Dumas, M.: The Self-Serv environment for web services composition. IEEE Internet Computing 7(1), 40–48 (2003)
Business Process Execution Language for Web Services Java Run Time (BPWS4J), http://www.alphaworks.ibm.com/tech/bpws4j
Banaei-Kashani, F., Chen, C.-C., Shahabi, C.: WSPDS: web services peer-to-peer discovery service. In: Proc. of the 5th Int’l Conference on Internet Computing (IC), Las Vegas, Nevada, pp. 733–743 (June 2004)
Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley-Interscience, New York (1988)
Alrifai, M., Risse, T.: Combining Global Optimization with Local Selection for Efficient QoS-aware Service Composition. In: Proc. of the 18th Int’l World Wide Web (WWW), Madrid, Spain (April 2009)
Gu, X., Nahrstedt, K., Yu, B.: SpiderNet: An Integrated Peer-to-Peer Service Composition Framework. In: Proc. of the 13th Int’l Symp. on High-Performance Distributed Computing (HPDC), Honolulu, Hawaii, pp. 110–119. IEEE Computer Society, Los Alamitos (2004)
PeerSim-Pastry, http://code.google.com/p/peersim-pastry/
Raman, B., Katz, R.H.: Load Balancing and Stability Issues in Algorithms for Service Composition. In: Proc. of IEEE INFOCOM 2003, San Francisco, CA (April 2003)
Distributed hash table, http://en.wikipedia.org/wiki/Dist-ributed_hash_table
Rowstron, A., Druschel, P.: Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In: Proc. of the 18th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany (November 2001)
Ardagna, D., Pernici, B.: Global and Local QoS Constraints Guarantee in Web Service Selection. In: 3rd IEEE International Conference on Web Services (ICWS), Orlando, FL, USA, pp. 805–806 (July 2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP International Federation for Information Processing
About this paper
Cite this paper
Jin, J., Zhang, Y., Cao, Y., Pu, X., Li, J. (2010). ServiceStore: A Peer-to-Peer Framework for QoS-Aware Service Composition. In: Ding, C., Shao, Z., Zheng, R. (eds) Network and Parallel Computing. NPC 2010. Lecture Notes in Computer Science, vol 6289. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15672-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-15672-4_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15671-7
Online ISBN: 978-3-642-15672-4
eBook Packages: Computer ScienceComputer Science (R0)