a distributed infrastructure supporting personalized
play

A distributed infrastructure supporting personalized services for - PowerPoint PPT Presentation

A distributed infrastructure supporting personalized services for the Mobile Web Claudia Canali Michele Colajanni Riccardo Lancellotti University of Modena and Reggio Emilia Philip S. Yu IBM T.J. Watson Research center The Mobile Web


  1. A distributed infrastructure supporting personalized services for the Mobile Web Claudia Canali Michele Colajanni Riccardo Lancellotti University of Modena and Reggio Emilia Philip S. Yu IBM T.J. Watson Research center

  2. The Mobile Web scenario The Mobile Web scenario Mobile clients Personalized services Web-based services tailored to Client device User preferences Personalization User context User preferences stored in a user profile User profile contains sensitive information We should guarantee the privacy of the user profile WiMob - Oct, 9-10 2007 - White Plains 2

  3. Performance vs. Privacy Need for high performance Computationally expensive Web-based services Use of highly distributed infrastructure Need for privacy High security levels for the nodes of the infrastructure Centralized, controlled infrastructure Using a highly distributed infrastructure may be unfeasible (every node should be secure) Fully centralized and fully distributed infrastructures are not viable WiMob - Oct, 9-10 2007 - White Plains 3

  4. Intermediate infrastructure Core node Powerful (cluster) High security level Edge nods Highly distributed Security level are relaxed Observation: Different mobile services Different privacy requirements Request dispatching Privacy awareness Do not forget performance WiMob - Oct, 9-10 2007 - White Plains 4

  5. Request dispatching process Web resource Multiple Web resource components Privacy Each component has a different privacy requirement Strong = must be processed on core node Light = should be processed on core node None = can be processed anywhere Performance Considers CPU utilization Load sharing: avoids overload WiMob - Oct, 9-10 2007 - White Plains 5

  6. The request dispatching process WiMob - Oct, 9-10 2007 - White Plains 6

  7. Performance and Privacy-aware dispatching Algorithm idea: Use of a threshold If utilization is below the threshold assign components according to privacy requirements If utilization of a node is beyond the threshold, less components are assigned to that node For performance reasons we can relax privacy requirements Dispatching mismatch Should minimize dispatching mismatch while preserving adequate performance WiMob - Oct, 9-10 2007 - White Plains 7

  8. Other algorithms Performance-oriented Does not consider privacy while dispatching requests Privacy-oriented Does not consider performance WiMob - Oct, 9-10 2007 - White Plains 8

  9. Experimental testbed Personalized Web portal RSS feed aggregation Banner insertion Content adaptation Different workload mixes Components with Light privacy (PL-components) PL-components=10%, 40%, 70% System 16 servers 1 core node, 4 edge nodes WAN emulation Based on netem packet scheduler Network delay + BW limitation WiMob - Oct, 9-10 2007 - White Plains 9

  10. Experimental results: Performance PL=10% PL=40% PL=70% WiMob - Oct, 9-10 2007 - White Plains 10

  11. Experimental results: Privacy Dispatching mismatch for the algorithms Algorithm PL=10% PL=40% PL=70% Performance and Privacy 2,5% 4,6% 14,7% Performance -oriented 11,5% 25,2% 43,8% Privacy-oriented 0,0% 0,0% 0,0% The performance and privacy algorithm preserves privacy better than the performance oriented alternative WiMob - Oct, 9-10 2007 - White Plains 11

  12. Summary of experiments Resp. PL=70% time Mismatch Performance-oriented 10 50 High mismatch 9 Privacy-oriented 8 40 Poor performance 7 Resp. time [s] Performance and Privacy 6 30 Mismatch [%] 5 Combines the goals of performance and 4 20 privacy 3 2 10 1 0 0 Priv Perf P&P WiMob - Oct, 9-10 2007 - White Plains 12

  13. Impact of WAN effects Distributed infrastructure PL=40% Impact of Network delay Performance degradation Same impact on every algorithm WiMob - Oct, 9-10 2007 - White Plains 13

  14. Conclusion Performance vs. Privacy trade-off Performance and privacy can be successfully combined through Intermediate infrastructure based on heterogeneous nodes Performance and Privacy-aware request dispatching algorithms Experimental results: Better performance than privacy-oriented algorithms Better privacy than performance-oriented algorithms WiMob - Oct, 9-10 2007 - White Plains 14

  15. Future research directions More complex performance and security models Multiple privacy classes Multiple security levels More sophisticate algorithms Load balancing instead of Load sharing Algorithms that consider the computational cost of each Web service WiMob - Oct, 9-10 2007 - White Plains 15

  16. A distributed infrastructure supporting personalized services for the Mobile Web Claudia Canali Michele Colajanni Riccardo Lancellotti University of Modena and Reggio Emilia Philip S. Yu IBM T.J. Watson Research center WiMob - Oct, 9-10 2007 - White Plains 16

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend