BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Flows and matchings for P2P systems - Massoulie\, L (THLAB)
DTSTART:20100115T153000Z
DTEND:20100115T163000Z
UID:TALK22654@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:In a first part of the talk\, we consider the so-called live s
 treaming problem\, which consists in broadcasting a stream of information 
 to a collection of network nodes\, and we attempt to achieve this objectiv
 e while minimizing network costs. To this end\, we propose the so-called "
 Implicit primal-dual" scheme\, whose simplicity makes it an interesting pr
 actical candidate. We characterize its behaviour at a fluid time scale\, a
 nd obtain desirable properties when the scheme is combined with random lin
 ear coding. In a second part of the talk\, we consider the so-called Video
 -on-demand problem\, in which users request access to content items at arb
 itrary random times. In this context\, we consider a simple user policy fo
 r managing which content to keep. We use the general framework of loss net
 works to model the resulting performance\, and obtain optimality results o
 n the ability of our scheme to enable users to serve each others' requests
 .
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR