KSII Transactions on Internet and Information Systems (TIIS)

Korean Society for Internet Information (한국인터넷정보학회)
권호 표지
DOI QR코드

DOI QR Code

Service Composition Based on Niching Particle Swarm Optimization in Service Overlay Networks

  • Liao, Jianxin (State Key Lab of Networking and Switching Technology, Beijing University of Posts and Telecommunications) ;
  • Liu, Yang (State Key Lab of Networking and Switching Technology, Beijing University of Posts and Telecommunications) ;
  • Wang, Jingyu (State Key Lab of Networking and Switching Technology, Beijing University of Posts and Telecommunications) ;
  • Zhu, Xiaomin (State Key Lab of Networking and Switching Technology, Beijing University of Posts and Telecommunications)
  • Received : 2011.10.28
  • Accepted : 2012.02.04
  • Published : 2012.04.30
Download PDF
⟨ Previous Next ⟩

Abstract

Service oriented architecture (SOA) lends itself to model the application components to coarse-grained services in such a way that the composition of different services could be feasible. Service composition fulfills numerous service requirements by constructing composite applications with various services. As it is the case in many real-world applications, different users have diverse QoS demands issuing for composite applications. In this paper, we present a service composition framework for a typical service overlay network (SON) considering both multiple QoS constraints and load balancing factors. Moreover, a service selection algorithm based on niching technique and particle swarm optimization (PSO) is proposed for the service composition problem. It supports optimization problems with multiple constraints and objective functions, whether linear or nonlinear. Simulation results show that the proposed algorithm results in an acceptable level of efficiency regarding the service composition objective under different circumstances.

Keywords

References

  1. E. Sirin, B. Parsiab, D. Wu, J. Hendler, and D. Nau, "HTN planning for web service composition using SHOP2," J. Web Semantics, vol.1, no.4, pp.377-396, Oct.2004. https://doi.org/10.1016/j.websem.2004.06.005
  2. L. Zeng, A.N.B. Benatallah, M. Dumas, J. Kalagnanam and H. Chang, "QoS-Aware middleware for web services composition," IEEE Trans. Software Eng., vol.30, no.5, pp.311-327, May.2004. https://doi.org/10.1109/TSE.2004.11
  3. X. Gu and K. Nahrstedt, "Distributed multimedia service composition with statistical QoS Assurances," IEEE Trans. Multimedia, vol.8, no.1, pp.141-151, Feb.2006. https://doi.org/10.1109/TMM.2005.861284
  4. S. Kalasapur, M. Kumar, and B.A. Shirazi, "Dynamic service composition in pervasive computing," IEEE Trans. Parallel and Distributed Systems, vol.18, no.7, pp.907-918, Jul.2007. https://doi.org/10.1109/TPDS.2007.1039
  5. E. Park and H. Shin, "Reconfigurable service composition and categorization for power-aware mobile computing," IEEE Trans. Parallel and Distributed Systems, vol.19 no.11, pp.1553-1564, Nov.2008. https://doi.org/10.1109/TPDS.2008.107
  6. I. Estevez-Ayres, P. Basanta-Val, M. Garcia-Valls, J.A. Fisteus, and L. Almeida, "QoS-Aware real-time composition algorithms for service-based applications," IEEE Trans. Industrial Informatics, vol.20, no.6, pp.278-288, 2009.
  7. J. Kennedy and R. Eberhart, "Particle swarm optimization," in Proc. of IEEE International Conference on Neural Networks, vol.4, pp.1942-1948, Nov.1995.
  8. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, New York, 1979.
  9. R. Brits, A.P. Engelbrecht, and F. van den Bergh, "Locating multiple optima using particle swarm optimization," Applied Mathematics and Computation, vol.189, no.2, pp.1859-1883, Jun.2007. https://doi.org/10.1016/j.amc.2006.12.066
  10. D. Parrott and X. Li, "Locating and tracking multiple dynamic optima by a particle swarm model using speciation," IEEE Trans. Evol. Computing, vol.10, no.4, pp.440-458, Aug.2006. https://doi.org/10.1109/TEVC.2005.859468
  11. X. Li, "Niching without niching parameters: particle swarm optimization using a ring topology," IEEE Transaction Evolutionary Computation, vol.14, no.1, pp.150-169, Feb.2010. https://doi.org/10.1109/TEVC.2009.2026270
  12. Y. Shi and R. C. Eberhart, "Parameter selection in particle swarm optimization," in Lecture Notes in Computer Science, Springer-Verlag, vol.1447, pp.591-600, 1998.
  13. Y. Shi and R. C. Eberhart, "A modified particle swarm optimizer", in Proc. of IEEE International Conference on Evolutionary Computation, May.1998.
  14. A. Ratnaweera, S. K. Halgamuge, and H. C. Watson, "Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients," IEEE Trans. Evolutionary Computation, vol.8, no.3, pp. 240-255, Jun.2004. https://doi.org/10.1109/TEVC.2004.826071
  15. Y. Shi and R. C. Eberhart, "Empirical study of particle swarm optimization," in Proc. of IEEE Int. Congr. Evolutionary Computation, vol.3, pp.101-106, 1999.
  16. J. Winick and S. Jamin, "Inet 3.0: Internet topology generator," Tech. Rep. UM-CSE-TR-456-02 (http://irl.eecs.umich.edu/jamin/), 2002.
  17. A. Rowstron and P. Druschel, "Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems," in Proc. of International Conference on Distributed Systems Platforms (Middleware), Nov. 2001.
  18. R. Carter and M. Crovella, "Measuring bottleneck link speed in packet switched networks," Tech. Rep. BU-CS-96-006, Comput. Sci. Dept., Boston Univ., 1996.
  19. J.H. Holland, Adaptation in Natural and Artificial Systems, Ann Arbor, University of Michigan Press, 1975.
  20. J.-P. Li, M. E. Balazs, G. T. Parks, and P. J. Clarkson, "A species conserving genetic algorithm for multimodal function optimization," Evolutionary Computation vol.10, no.3, pp. 207-234, 2002. https://doi.org/10.1162/106365602760234081
  21. W. Wang and B. Li, "Market-based self-optimization for autonomic service overlay networks," IEEE Journal on Selected Areas in Communications, vol.23, no.12, pp.2320-2332, 2005. https://doi.org/10.1109/JSAC.2005.857210
  22. M. Analoui and M. H. Rezvani, "A framework for resource allocation in multi-service multi-rate overlay networks based on microeconomic theory," Journal of Network and Systems Management, vol.19, no.2, pp.178-208, 2011. https://doi.org/10.1007/s10922-010-9164-y
  23. M. H. Rezvani and M. Analoui, "Strategic behavior modeling of multi-service overlay multicast networks based on auction mechanism design," Journal of Parallel and Distributed Computing, vol.71, no.8, pp.1125-1141, 2011. https://doi.org/10.1016/j.jpdc.2011.04.008
  24. Z. Duan, Z.-L. Zhang, and Y. T. Hou, "Service overlay networks: SLAs, QoS, and bandwidth provisioning," ACM Trans. Networking, vol.11, no.6, pp.870-883, 2003. https://doi.org/10.1109/TNET.2003.820436

Cited by

  1. Clustering and Recommendation for Semantic Web Service in Time Series vol.8, pp.8, 2012, https://doi.org/10.3837/tiis.2014.08.010
  2. Resilient Routing Overlay Network Construction with Super-Relay Nodes vol.11, pp.4, 2012, https://doi.org/10.3837/tiis.2017.04.005
  3. Color Revolution: A Novel Operator for Imperialist Competitive Algorithm in Solving Cloud Computing Service Composition Problem vol.13, pp.2, 2012, https://doi.org/10.3390/sym13020177