A distributed infrastructure supporting personalized services for - - PowerPoint PPT Presentation

a distributed infrastructure supporting personalized
SMART_READER_LITE
LIVE PREVIEW

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


slide-1
SLIDE 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

slide-2
SLIDE 2

WiMob - Oct, 9-10 2007 - White Plains 2

The Mobile Web scenario

The Mobile Web scenario Mobile clients Personalized services Web-based services tailored to Client device User preferences User context User preferences stored in a user profile User profile contains sensitive information We should guarantee the privacy of the user profile

Personalization

slide-3
SLIDE 3

WiMob - Oct, 9-10 2007 - White Plains 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

slide-4
SLIDE 4

WiMob - Oct, 9-10 2007 - White Plains 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

slide-5
SLIDE 5

WiMob - Oct, 9-10 2007 - White Plains 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

slide-6
SLIDE 6

WiMob - Oct, 9-10 2007 - White Plains 6

The request dispatching process

slide-7
SLIDE 7

WiMob - Oct, 9-10 2007 - White Plains 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

slide-8
SLIDE 8

WiMob - Oct, 9-10 2007 - White Plains 8

Other algorithms

Performance-oriented Does not consider privacy while dispatching requests Privacy-oriented Does not consider performance

slide-9
SLIDE 9

WiMob - Oct, 9-10 2007 - White Plains 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

slide-10
SLIDE 10

WiMob - Oct, 9-10 2007 - White Plains 10

Experimental results: Performance

PL=10% PL=40% PL=70%

slide-11
SLIDE 11

WiMob - Oct, 9-10 2007 - White Plains 11

Experimental results: Privacy

Dispatching mismatch for the algorithms

PL=10% PL=40% PL=70% 2,5% 4,6% 14,7% 11,5% 25,2% 43,8% 0,0% 0,0% 0,0% Algorithm Performance and Privacy Performance -oriented Privacy-oriented

The performance and privacy algorithm preserves privacy better than the performance oriented alternative

slide-12
SLIDE 12

WiMob - Oct, 9-10 2007 - White Plains 12

Summary of experiments

Performance-oriented High mismatch Privacy-oriented Poor performance Performance and Privacy Combines the goals of performance and privacy

Priv Perf P&P 1 2 3 4 5 6 7 8 9 10 10 20 30 40 50

PL=70%

  • Resp. time [s]

Mismatch [%]

Resp. time Mismatch

slide-13
SLIDE 13

WiMob - Oct, 9-10 2007 - White Plains 13

Impact of WAN effects

Distributed infrastructure Impact of Network delay Performance degradation Same impact on every algorithm

PL=40%

slide-14
SLIDE 14

WiMob - Oct, 9-10 2007 - White Plains 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

slide-15
SLIDE 15

WiMob - Oct, 9-10 2007 - White Plains 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

  • f each Web service
slide-16
SLIDE 16

WiMob - Oct, 9-10 2007 - White Plains 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