University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Flows and matchings for P2P systems

Flows and matchings for P2P systems

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Stochastic Processes in Communication Sciences

In a first part of the talk, we consider the so-called live streaming problem, which consists in broadcasting a stream of information to a collection of network nodes, and we attempt to achieve this objective while minimizing network costs. To this end, we propose the so-called “Implicit primal-dual” scheme, whose simplicity makes it an interesting practical candidate. We characterize its behaviour at a fluid time scale, and obtain desirable properties when the scheme is combined with random linear 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 arbitrary random times. In this context, we consider a simple user policy for managing which content to keep. We use the general framework of loss networks to model the resulting performance, and obtain optimality results on the ability of our scheme to enable users to serve each others’ requests.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity