BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Publish/Subscribe for Large-Scale Social Interaction: Design\, Ana
 lysis and Resource Provisioning - Vinay Setty\, University of Oslo
DTSTART:20140331T080000Z
DTEND:20140331T090000Z
UID:TALK51771@talks.cam.ac.uk
CONTACT:Microsoft Research Cambridge Talks Admins
DESCRIPTION:Publish/subscribe (pub/sub) is a popular communication paradig
 m in the design of large-scale distributed systems. We are witnessing an i
 ncreasingly widespread use of the pub/sub for wide array of applications b
 oth in industry and academia and yet there is a lack of detailed study of 
 a large-scale real-world pub/sub system. In our work we present an overvie
 w of a pub/sub system used to drive social interaction at Spotify. We then
  present a detailed analysis of the traces from real deployment of Spotify
  pub/sub. Inspired by the peer-assisted solution used by Spotify to stream
  music\, we explore a similar solution to disseminate messages of Spotify 
 pub/sub to the users. The task of distributing the workload among user pee
 rs and datacentre servers prompts a fundamental problem: How to select a s
 ubset of pub/sub workload to be served by datacenter servers in a manner t
 o maximize satisfaction requirements of users under resource constraints?\
 n\nIn our recent work\, we provide\, to the best of our knowledge\, the fi
 rst formal treatment of the above problem by introducing two metrics that 
 capture subscriber satisfaction in the presence of limited resources. This
  allows us to formulate the problem as two new flavors of maximum coverage
  optimization problems. Unfortunately\, both variants of the problem prove
  to be NP-hard. By subsequently providing formal approximation bounds and 
 heuristics\, we show\, however\, that efficient approximations can be atta
 ined. We validate our approach using real-world traces from Spotify and sh
 ow that our solutions can be executed periodically in real-time in order t
 o adapt to workload variations.\n\nFurther\, we try to answers to the foll
 owing three fundamental questions: Given a pub/sub workload\, (1) what is 
 the minimum amount of resources needed to satisfy all the subscribers\, (2
 ) what is a cost-effective way to allocate resources for the given workloa
 d\, and (3) what is the cost of hosting it on a\npublic Infrastructure-as-
 a-Service (IaaS) provider like Amazon EC2.
LOCATION:Auditorium\, Microsoft Research Ltd\, 21 Station Road\, Cambridge
 \, CB1 2FB
END:VEVENT
END:VCALENDAR
