Measuring bottleneck link speed in packet-switched networks
Performance Evaluation
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Service overlay networks: SLAs, QoS, and bandwidth provisioning
IEEE/ACM Transactions on Networking (TON)
QoS-Aware Middleware for Web Services Composition
IEEE Transactions on Software Engineering
Efficient algorithms for Web services selection with end-to-end QoS constraints
ACM Transactions on the Web (TWEB)
Semantics-based automatic composition of geospatial Web service chains
Computers & Geosciences
Dynamic Service Composition in Pervasive Computing
IEEE Transactions on Parallel and Distributed Systems
Quality-of-service oriented web service composition algorithm and planning architecture
Journal of Systems and Software
Reconfigurable Service Composition and Categorization for Power-Aware Mobile Computing
IEEE Transactions on Parallel and Distributed Systems
ICTAI '08 Proceedings of the 2008 20th IEEE International Conference on Tools with Artificial Intelligence - Volume 01
Effective Web Service Composition in Diverse and Large-Scale Service Networks
IEEE Transactions on Services Computing
Dynamic Web Service Selection for Reliable Web Service Composition
IEEE Transactions on Services Computing
An optimal QoS-based Web service selection scheme
Information Sciences: an International Journal
HTN planning for Web Service composition using SHOP2
Web Semantics: Science, Services and Agents on the World Wide Web
Semantic-Based Mashup of Composite Applications
IEEE Transactions on Services Computing
TQoS: Transactional and QoS-Aware Selection Algorithm for Automatic Web Service Composition
IEEE Transactions on Services Computing
Niching without niching parameters: particle swarm optimization using a ring topology
IEEE Transactions on Evolutionary Computation
QoS-enabled and self-adaptive connectors for Web Services composition and coordination
Computer Languages, Systems and Structures
Efficient Multi-objective Services Selection Algorithm Based on Particle Swarm Optimization
APSCC '10 Proceedings of the 2010 IEEE Asia-Pacific Services Computing Conference
Seeking Quality of Web Service Composition in a Semantic Dimension
IEEE Transactions on Knowledge and Data Engineering
A relaxable service selection algorithm for QoS-based web service composition
Information and Software Technology
Distributed multimedia service composition with statistical QoS assurances
IEEE Transactions on Multimedia
Self-organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients
IEEE Transactions on Evolutionary Computation
Semantics-based dynamic service composition
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Service composition (SC) generates various composite applications quickly by using a novel service interaction model. Before composing services together, the most important thing is to find optimal candidate service instances compliant with non-functional requirements. Particle swarm optimization (PSO) is known as an effective and efficient algorithm, which is widely used in this process. However, the premature convergence and diversity loss of PSO always results in suboptimal solutions. In this paper, we propose an accurate sub-swarms particle swarm optimization (ASPSO) algorithm by adopting parallel and serial niching techniques. The ASPSO algorithm locates optimal solutions by using sub-swarms searching grid cells in which the density of feasible solutions is high. Simulation results demonstrate that the proposed algorithm improves the accuracy of the standard PSO algorithm in searching the optimal solution of service selection problem.