Algorithms for Web service selection with static and dynamic requirements
Service Oriented Computing and Applications
| Hi-index | 0.00 |
Personalized services are a key feature for the success of the next generation Web that is accessed by heterogeneous and mobile client devices. The need to provide high per- formance and to preserve user data privacy opens a novel dimension in the design of infrastructures and request dis- patching algorithms to support personalized services for the Mobile Web. Performance issues are typically addressed by distributed architectures consisting of multiple nodes. Per- sonalized services that are often based on sensitive user in- formation may introduce constraints on the service location when the nodes of the distributed architecture do not pro- vide the same level of security. In this paper, we propose an infrastructure and related dispatching algorithms that aim to combine performance and privacy requirements. The proposed scheme may efficiently support personalized ser- vices for the Mobile Web especially if compared with exist- ing solutions that separately address performance and pri- vacy issues. Our proposal guarantees that up to the 97% of the requests accessing sensitive user information are as- signed to the most secure nodes with limited penalty conse- quences on the response time.