Adaptive algorithms for efficient content management in social - - PowerPoint PPT Presentation

adaptive algorithms for efficient content management in
SMART_READER_LITE
LIVE PREVIEW

Adaptive algorithms for efficient content management in social - - PowerPoint PPT Presentation

Adaptive algorithms for efficient content management in social networks Claudia Canali Michele Colajanni Riccardo Lancellotti University of Modena and Reggio Emilia IEEE CIT 2010 1 Future Web Scenarios Community-based services


slide-1
SLIDE 1

IEEE CIT 2010 1

Adaptive algorithms for efficient content management in social networks

Claudia Canali Michele Colajanni Riccardo Lancellotti University of Modena and Reggio Emilia

slide-2
SLIDE 2

IEEE CIT 2010 2

Future Web Scenarios

  • Community-based services

– Social networking: support for user interaction be

the killer of future Web

– Rich-media content – Presence of Mobile User access

  • Workload evolution in the next four years

– Computational demand will grow faster than CPU

power (Moore's Law)

slide-3
SLIDE 3

IEEE CIT 2010 3

Motivations for content management

  • Content management

– Content replication – Caching – CDN delivery – Resource pre-generation

  • → Need to identify the

Hot set of popular resources

– Variability in workload characteristics – Rapid variations in access patterns – Workload dynamics related to social interactions

  • → Need for algorithms providing early and fast

detection of popular resources.

  • → Stable performance are not an optional
slide-4
SLIDE 4

IEEE CIT 2010 4

Hot set identification

  • The algorithm must identify the most popular

resources (Hot set)

– Hot set is evaluated periodically with interval ∆t – Hot set resources will receive the highest number of

accesses in the interval [t, t+∆t]

  • Predictive-based algorithm

– Evaluates past access patterns

and uses a simple predictor to forecast future accesses

  • Social-based algorithm

– Evaluates number of incoming social links – High connection degree

popular resources →

  • Combination of approaches

→ must merge heterogeneous information

slide-5
SLIDE 5

IEEE CIT 2010 5

Proposed algorithms

  • Proposal: novel algorithms that merge

access pattern prediction and social information

– Rank-age – Linear-adaptive – Rank-adaptive

  • Use of adaptive techniques that takes into

account workload characteristics

  • Comparison with existing solutions

– social- and predictive-based

slide-6
SLIDE 6

IEEE CIT 2010 6

Rank-Age algorithm

  • Social- and predictive-based information have

different probability distribution Use of rank merging →

  • Weighting different information:

– Predictive information are more reliable for older

resources

– Social-based information may be used otherwise

  • Resource age is used to determine the weight in

rank-merging

slide-7
SLIDE 7

IEEE CIT 2010 7

Linear-Adaptive algorithm

  • Social-based and predictive based information

have different probability distribution use of adaptive technique to estimate the weight →

  • f each information

need to normalize different values →

  • The weighting function takes into account median

and quartile information about social information and predicted accesses for the whole working set

slide-8
SLIDE 8

IEEE CIT 2010 8

Rank-adaptive algorithm

  • Use of rank merging

handles different → probability distribution

  • Use of a feedback on the popularity estimation

errors in previous interval to compute the weight used in rank merging

slide-9
SLIDE 9

IEEE CIT 2010 9

Experimental setup

  • Simulation based on Omnet++ framework

– User population up to 20000 units – Average of 100 requests/sec – 12 hours of simulated time – ∆t=20minutes – Main metric: accuracy=|HS(t) ∩ HS*(t)|/|HS*(t)|

Parameter Range Default Hot fraction [%] 5%-30% 20% Upload percentage [%] 1%-20% 5% User/resource popularity correlation 0.6-0.8 0.7

slide-10
SLIDE 10

IEEE CIT 2010 10

Performance evaluation

  • Predictive and social-

aware algorithms can be improved

  • Adaptive algorithms
  • utperforms other

solutions

  • Rank-age algorithm

provides poor performance because it tends to prefer younger resources even when they are not popular → Need to evaluate performance stability

slide-11
SLIDE 11

IEEE CIT 2010 11

Sensitivity to workload dynamics

  • Prediction is highly

sensitive to upload percentage

  • Social-aware

algorithm is not sensitive to workload dynamics

  • Rank-age algorithm

provides poor performance when many young resources are present

  • Adaptive algorithms

provide stable performance

slide-12
SLIDE 12

IEEE CIT 2010 12

Sensitivity to social parameters

  • Prediction is not

affected by social phenomena

  • Social-aware is highly

sensitive to the correlation between user and resource popularity

  • Rank-age relies on

social-aware algorithm and shares its drawback

  • Adaptive algorithms

provide very stable performance

slide-13
SLIDE 13

IEEE CIT 2010 13

Conclusions

  • Content management will be fundamental for

future social network applications

– Need to identify the Hot set – Must cope with novel challenges (social

interaction, short resource lifespan, ...)

– Need for high accuracy and stable performance – Can rely on heterogeneous information, but we

must combine them

  • Proposal of different algorithms that combine

heterogeneous information

– Adaptive techniques allow to exploit the benefits

  • f predictive and social-aware information

– Non-adaptive approach result in poor and highly

variable performance

slide-14
SLIDE 14

IEEE CIT 2010 14

Adaptive algorithms for efficient content management in social networks

Claudia Canali Michele Colajanni Riccardo Lancellotti University of Modena and Reggio Emilia

slide-15
SLIDE 15

IEEE CIT 2010 15

Expected growth of computational demands

slide-16
SLIDE 16

IEEE CIT 2010 16

Blue

slide-17
SLIDE 17

IEEE CIT 2010 17

Predictive-Social algorithms

  • Merging social-aware and

predictive information

– prP(t)

predictive →

– prS(t)

social →

– δ(t)

weight →

  • That is:

– pr(t)=δ(t) prP(t) + (1-δ(t)) prS(t) – δ(t)=QWM(PS(t))/(QWM(PS(t)) + QWM(PP(t)))

slide-18
SLIDE 18

IEEE CIT 2010 18

Predictive algorithms

  • History of past accesses to resource r

represented as a time series:

– Dr(t)={dr(t), dr(t-∆t), ..., dr(t-(n-1)∆t)} – dr(t) is number of accesses to resource r in

interval [t-∆t, t], dr(t-∆t) refer to [t-2∆t, t-∆t], ...

  • Use of an EWMA model for prediction:

– dr*(t,t+∆t)=γdr*(t,t+∆t)+(1- )

γ dr(t)

=2/n, where n is the time series length γ

  • Other prediction models are possible
slide-19
SLIDE 19

IEEE CIT 2010 19

Social-aware algorithms

  • Social network can be

represented as a directed graph

– Reverse contact represent the

popularity of a user within the social network

– User navigation exploits social

links

– Strong correlation between user

popularity and popularity of uploaded resources

→ Popular users are likely to publish popular content

slide-20
SLIDE 20

IEEE CIT 2010 20

Predictive-Social algorithms

  • Most innovative class of algorithms

– Merges information from two sources: – Prediction – Social information

  • Need for a reliable way to merge two

completely different sets of data

– Different value ranges – Different probability distributions

  • Use of a robust weighting function

– Two-sided quartile weighted median – Given distribution P(t): – QWM(P(t))=(Q25(P(t))+2Q50(P(t))+Q75(P(t)))/4

slide-21
SLIDE 21

IEEE CIT 2010 21

Red

slide-22
SLIDE 22

IEEE CIT 2010 22

Green

slide-23
SLIDE 23

IEEE CIT 2010 23

Black