FASICA Framework: Service Selection Using K-d Tree and Cache

摘要

The selection of services is a key part of Service Oriented Architecture (SOA). Services are primarily selected based on function, but Quality of Service (QoS) is an important factor when choosing among several services with the same function. But current service selection approaches often takes time to unnecessarily recompute requests. Furthermore, if the same service is chosen as having the "best" QoS for multiple selections, this may result in that service having too much load. We thus propose the FASICA (FAst service selection for Similar constraints with CAche) Framework which chooses a service with satisfactory QoS as quickly as possible. The key points are (1) to use a cache which stores previous search results, (2) to use K-Nearest Neighbor (K-NN) algorithm with K-d tree when a satisfactory service does not exist in the cache, and (3) to distribute the service request according to a distribution policy. Results of simulations show that our framework can rapidly select a service compared to a conventional approach.