Dynamic Optimization of Web Services Composition using Scale-Free Network

  • Yang Zhang
  • Yan Ma
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 218)


The process of Web services composition at present is static and predetermined, which could not meet dynamic user requirements and change online environment. Aimed at this problem, we propose a dynamic optimization strategy for Web services composition using Scale-free Network with Partheno-Genetic algorithm based on Flow Tree (SNPGFT). In SNPGFT, the process of Web services composition would be described as a scale free based on flow tree which would be depth-first traversal, and Web services of sequential relationship would be treated with partheno-genetic algorithm to form a bran-new flow of composition. By means of experiments on SNPGFT and common partheno-genetic algorithm, we show that using SNPGFT can improve the effectiveness and feasibility of Web services composition.


Web services composition Scale-free network Flow tree Partheno-genetic algorithm 


  1. 1.
    Gao CM, Cai ML, Chen HW (2007) QoS-aware service composition based on tree-coded genetic algorithm. In: Proceedings of the 31st annual international computer soft ware and applications conference, vol 67. Beijing, China, pp 361–367Google Scholar
  2. 2.
    Li H, Cui L, Wang H (2009) Method of constructing smart flow application based on Web services. J Commun 30(5):128–135Google Scholar
  3. 3.
    Song L, Zhang C, Li Q, Wang W (2009) SOA-based approach for composable simulation. J Syst Simul 21(12):3626–3630Google Scholar
  4. 4.
    Erdos P, Renyi A (1960) On the evolution of random graphs. Publ Math Inst Hung Acad Sci (S1103-467x) 5(1):17–60Google Scholar
  5. 5.
    Watts D, Strogatz S (1998) Collective dynamics of small world networks. Nature (S0028-0836) 393(4): 440–442Google Scholar
  6. 6.
    Newman MJ, Watts D (1999) Renormalization group analysis of the small-world network model. Phys Lett A (S0375-960) 263(5): 341–346Google Scholar
  7. 7.
    Barabási A, Albert R (1999) Emergence of scaling in random networks. Science (S0036-8075) 286(5439): 509–512Google Scholar
  8. 8.
    Albert R, Jeong H, Barabási A (1999) Diameter of the world wide Web. Nature (S0028-0836) 401(9): 130–131Google Scholar
  9. 9.
    Chen J, Zhou Y, Xie Y (2009) Distribution network optimal planning based on improved partheno-genetic algorithm. In: Proceedings of the 2009 international workshop on information security and application (IWISA 2009), vol 67, pp 649–652Google Scholar
  10. 10.
    Li M, Zhun T, Tong T (2001) Comparison between partheno-genetic algorithm and traditional genetic algorithm. Syst Eng 19(1):61–95Google Scholar
  11. 11.
    Zhang Y, Fang B, Xu C (2010) Preference ontology-oriented metric model for trustworthy Web services. J Chin Comput Syst 36:018–023Google Scholar
  12. 12.
    Zhang Y, Fang B, Xu C (2009) Trustworthy metrics model for Web services using genetric neural network. Appl Res Comput 29(1):215–217MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag London 2013

Authors and Affiliations

  1. 1.College of Computer and Information ScienceChongqing Normal UniversityChongqingChina

Personalised recommendations