Abstract
Traditional web service orchestration is always implemented by business process work flow or I/O matching, just taking What services provide and How to provide. But this method will invoke some problems including too many composite results, inefficiency, and useless service composition without taking account of When and Where services are provided. Based on divide-and-conquer rule, this paper provides a clustering algorithm based on spatial & temporal aspects which are used to describe spatial and temporal attributes of services, so When and Where are provided for service composition. After composite services cluster by cluster, the whole complex service is created and is sure to satisfy the time and space constraints. Testing cases illustrate that complex traveling services can be created and is optimized to meet users’ requests.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Khalaf, R., Keller, A., Leymann, F.: Business processes for web services: principles and applications. IBM Systems Journal 45(2), 425–446 (2006), http://www.research.ibm.com/journal/sj/452/khalaf.html
WS-CDL, Web Services Choreography Description Language Version 1.0, [online], http://www.w3.org/TR/2004/WD-ws-cdl-10-20040427/
Newcomer, E., Lomow, G.: Understanding SOA with Web Services, pp. 280–282. Addison Wesley, Reading (2004)
Majed, M.: BPMS, Business process management-major challenges, Business Process Management, 411–412 (2002)
Rojas-Vega, E., Kemp, Z.: An Object-Oriented Data Model for Spatio-Temporal Data[A]. In: Proc of the Ninth Annual Symposium on Geographic Information Systems[C], Vancouver, Canada (1995)
MacQueen, J.B.: Some Methods for classification and Analysis of Multivariate Observations. In: Proceedings of 5-th Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, vol. 1, pp. 281–297. University of California Press (1996)
Bezdek, J.C.: Pattern Recognition with Fuzzy Objective Function Algoritms. Plenum Press, New York (1981)
Johnson, S.C.: Hierarchical Clustering Schemes. Psychometrika 2, 241–254 (1976)
Dempster, A.P., Laird, N.M., Rubin, D.B.: Maximum Likelihood from Incomplete Data via theEM algorithm. Journal of the Royal Statistical Society, Series B 39(1), 1–38 (1977)
Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design Patterns, Elements of Reusable Object-Oriented Software, pp. 163–174. Pearson Education (1995)
Corrmen, T.H: Introduction To Algorithms, pp. 257–355. The Mit Press, Cambridge (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hao, Y., Junliang, C., Xiangwu, M., Bingyu, Q. (2007). Dynamically Traveling Web Service Clustering Based on Spatial and Temporal Aspects. In: Hainaut, JL., et al. Advances in Conceptual Modeling – Foundations and Applications. ER 2007. Lecture Notes in Computer Science, vol 4802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76292-8_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-76292-8_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76291-1
Online ISBN: 978-3-540-76292-8
eBook Packages: Computer ScienceComputer Science (R0)