Abstract
In this paper, queueing network-based models are proposed to predict the performance of composite Web services and make them run in an optimal way with limited resources. The models are necessary constituents of reliable Web service composition. They are flexible enough to evaluate the performance indices of the composite Web services simply by solving some equations rather than doing a lot of exhausting experiments. Research shows that our models provide an effective way for both running the services optimally with certain resources and estimating the growth needs accurately.
This work is supported by the National Natural Science Foundation of China under Grant No. 60228006, and the National Hi-tech R&D Program of China under Grant No. 2002AA116020.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hoschek, W.: The Web Service Discovery Architecture. In: Proceedings of the 2002 ACM/IEEE conference on Supercomputing, Baltimore, Marylan (2002)
Lam, S., Chan, K.H.: Computer Capacity Planning: Theory and Practice. Academic Press, London (1987)
Internet Engineering Task Force, http://www.ietf.org
Balsamo, S.: Product Form Queueing Network. Performance Evaluation, P377-401 (2000)
Buzen, J.P.: Queuing Network Models of Multiprogramming. Ph.D. Thesis, Harvard University, Cambridge, MA (1971)
Wodtke, D., Weikum, G.: A formal foundation for distributed workflow execution based on state charts. In: Proceedings of the 6th distributed International Conference on Database Theory, Delphi, Greece (1997)
Chakraborty, D., Perich, F., Joshi, A., Finin, T., Yesha, Y.: A Reactive Service Composition Architecture for Pervasive Computing Environments. In: 7th Personal Wireless Communications Conference (PWC 2002), Singapore (2002)
Limthanmaphon, B., Zhang, Y.: Web Service Composition with Case-Based Reasoning. In: Proc. of the Fourteenth Australasian Database Conference (ADC 2003), Adelaide, Australia, Febraury 2003, Australian Computer Society (2003)
Banatallah, B., Dumas, M., Fauvet, M.C., Paik, H.Y.: Self-Coordinate and Self-Traced Composite Services with Dynamic Provider Selection. Technical Report, UNSW-CSE- 0108 (2001)
Banatallah, B., Dumas, M., Fauvet, M.C., Rabhi, F.A.: Towards Patterns of Web Services Compostion. Technique report, UNSE-CSE-TR-01111 (2001)
Bhatti, N., Friedrich, R.: Web Server support for tiered services. IEEE Network, 64–71 (September/October 1999)
Kant, K., Won, Y.: Server Capacity planning for Web Traffic Workload. IEEE Transactions on Knowledge and Data Engineering 11(5) (September 1999)
Chen, X., Mohapatra, P., Chen, H.: An Admission Control Scheme for Predictable Server Response Time for Web Accesses. In: Proceedings of 10th WWW Conference, Hong Kong (May 2001)
Buzen, J.P.: Computational algorithms for closed queueing networks with exponential servers. Comm. of the ACM 16(9), 527–531 (1973)
Lazowska, E., Zahorjan, J., Graham, S., Sevcik, K.: Quantitative System Performance: Computer System Analysis Using Queueing Network Models. Prentice-Hall, Englewood Cliffs (1984)
Hamadi, R., Benatallah, B.: A Petri Net-based Model for Web Service Composition. In: Proceedings of the Fourteenth Australasian Database Conference (ADC 2003), Adelaide, Australia, Australian Computer Society (February 2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peng, D., Yuan, Y., Yue, K., Wang, X., Zhou, A. (2004). Capacity Planning for Composite Web Services Using Queueing Network-Based Models. In: Li, Q., Wang, G., Feng, L. (eds) Advances in Web-Age Information Management. WAIM 2004. Lecture Notes in Computer Science, vol 3129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27772-9_44
Download citation
DOI: https://doi.org/10.1007/978-3-540-27772-9_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22418-1
Online ISBN: 978-3-540-27772-9
eBook Packages: Springer Book Archive