In service oriented architecture, services are the basic assemble that aims to assist the building of business application in a more flexible and interoperable manner for enterprise collaboration. To satisfy the needs of service clients and to adapt to changing needs, service composition is performed to compose the various capabilities of available services. With the proliferation of services presenting similar functionalities around the web, the task of service selection for service composition is intricate. It is vital to provide systematic methodology for selecting required web services according to their non-functional characteristics or reliability. In this paper, the simulated annealing algorithm is developed to maximize the non-functional Characteristic reliability of the composite web service and the genetic algorithm is developed and theses two algorithms are compared based on the time complexity and optimality of results.
목차
Abstract 1. Introduction 2. Related Work 3. Service Selection Based on Service Reliability 4. Service Selection Based on Genetic Algorithm 4.1 Encoding of the Chromosomes 4.2 Fitness Function 4.3 Group Selection 4.4 Crossover 4.5 Mutation 4.6 Elitism 4.6 Pseudo Code 4.7 Computational Complexity 5. Service Selection Based on Simulated Annealing 5.1 Initial Solution 5.2 Exploring Neighbor Solutions 5.3 Acceptance Probability 5.4 Pseudo Code 5.5 Computational Complexity 6. Experimental Result 7. Performance Comparison 8. Conclusion Acknowledgement References
보안공학연구지원센터(IJUNESST) [Science & Engineering Research Support Center, Republic of Korea(IJUNESST)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of u- and e- Service, Science and Technology
간기
격월간
pISSN
2005-4246
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of u- and e- Service, Science and Technology Vol.5 No.1