|Title:||QoS-based web service optimization in cloud computing environment|
Hong Kong Polytechnic University -- Dissertations
|Department:||Department of Computing|
|Pages:||vii, 73 leaves : illustrations ; 30 cm|
|Abstract:||Thanks to the emergence and widespread of Service-oriented Architecture(SOA),Web service technology has got its attention around the Internet Community. However, single simple web service face the challenge of being unable to satisfy users' complex requirements in runtime environment as the amounts of web services become larger and larger. Therefore a lot of optimization solution has been proposed aimed to address the web service composition issue. Whereas most of them are of low efficiency and can not handle large-scale level web service. The dissertation has introduced a new kind of colony intelligent algorithm to address the web service composition, which is called Wolf Colony Algorithm. Furthermore, A distributed version of WCA in cloud computing environment has been proposed to handle large-scale web service composition problem. The experimental results show that the WCA outperforms in contrast to traditional heuristic algorithm such as particle swarm algorithm and genetic algorithm. And by implementing the WCA in hadoop framework, the efficiency has been improved greatly.|
Files in This Item:
|b27577284.pdf||For PolyU Staff & Students||3.5 MB||Adobe PDF||View/Open|
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item: