Laurent Massoulié

Publications (18)0 Total impact

• Conference Proceeding: Content Search through Comparisons.

  Amin Karbasi, Stratis Ioannidis, Laurent Massoulié
  Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II; 01/2011
• Source

  Available from: ucsb.edu

  Conference Proceeding: On the stability and optimality of universal swarms.

  Xia Zhou, Stratis Ioannidis, Laurent Massoulié
  SIGMETRICS 2011, Proceedings of the 2011 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, San Jose, CA, USA, 07-11 June 2011 (Co-located with FCRC 2011); 01/2011
• Source

  Available from: epfl.ch

  Conference Proceeding: Incentivizing peer-assisted services: a fluid shapley value approach.

  Vishal Misra, Stratis Ioannidis, Augustin Chaintreau, Laurent Massoulié
  SIGMETRICS 2010, Proceedings of the 2010 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, New York, New York, USA, 14-18 June 2010; 01/2010
• Source

  Available from: SSRN

  Conference Proceeding: Reciprocity and Barter in Peer-to-Peer Systems.

  Daniel Sadoc Menasché, Laurent Massoulié, Donald F. Towsley
  INFOCOM 2010. 29th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 15-19 March 2010, San Diego, CA, USA; 01/2010
• Source

  Available from: thlab.net

  Conference Proceeding: Distributed caching over heterogeneous mobile networks.

  Stratis Ioannidis, Laurent Massoulié, Augustin Chaintreau
  SIGMETRICS 2010, Proceedings of the 2010 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, New York, New York, USA, 14-18 June 2010; 01/2010
• Source

  Available from: psu.edu

  Conference Proceeding: Greening the internet with nano data centers.

  Vytautas Valancius, Nikolaos Laoutaris, Laurent Massoulié, Christophe Diot, Pablo Rodriguez
  Proceedings of the 2009 ACM Conference on Emerging Networking Experiments and Technology, CoNEXT 2009, Rome, Italy, December 1-4, 2009; 01/2009
• Article: Distributing content updates over a mobile social network.

  Stratis Ioannidis, Augustin Chaintreau, Laurent Massoulié
  Mobile Computing and Communications Review. 01/2009; 13:44-47.
• Source

  Available from: psu.edu

  Conference Proceeding: Epidemic live streaming: optimal performance trade-offs.

  Thomas Bonald, Laurent Massoulié, Fabien Mathieu, Diego Perino, Andrew Twigg
  Proceedings of the 2008 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2008, Annapolis, MD, USA, June 2-6, 2008; 01/2008
• Source

  Available from: psu.edu

  Article: ECHOS: edge capacity hosting overlays of nano data centers.

  Nikolaos Laoutaris, Pablo Rodriguez, Laurent Massoulié
  Computer Communication Review. 01/2008; 38:51-54.
• Conference Proceeding: Randomized Decentralized Broadcasting Algorithms.

  Laurent Massoulié, Andrew Twigg, Christos Gkantsidis, Pablo Rodriguez
  INFOCOM 2007. 26th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 6-12 May 2007, Anchorage, Alaska, USA; 01/2007
• Article: Push-to-Peer Video-on-Demand System: Design and Evaluation.

  Kyoungwon Suh, Christophe Diot, Jim Kurose, Laurent Massoulié, Christoph Neumann, Donald F. Towsley, Matteo Varvello
  IEEE Journal on Selected Areas in Communications. 01/2007; 25:1706-1716.
• Source

  Available from: cmu.edu

  Conference Proceeding: The diameter of opportunistic mobile networks.

  Augustin Chaintreau, Abderrahmen Mtibaa, Laurent Massoulié, Christophe Diot
  Proceedings of the 2007 ACM Conference on Emerging Network Experiment and Technology, CoNEXT 2007, New York, NY, USA, December 10-13, 2007; 01/2007
• Conference Proceeding: Thresholds for virus spread on networks.

  Moez Draief, Ayalvadi J. Ganesh, Laurent Massoulié
  Proceedings of the 1st International Conference on Performance Evaluation Methodolgies and Tools, VALUETOOLS 2006, Pisa, Italy, October 11-13, 2006; 01/2006
• Source

  Available from: psu.edu

  Article: A queueing analysis of max-min fairness, proportional fairness and balanced fairness.

  Thomas Bonald, Laurent Massoulié, Alexandre Proutiére, Jorma T. Virtamo
  Queueing Syst. 01/2006; 53:65-84.
• Conference Proceeding: The effect of network topology on the spread of epidemics.

  Ayalvadi J. Ganesh, Laurent Massoulié, Donald F. Towsley
  INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 13-17 March 2005, Miami, FL, USA; 01/2005
• Conference Proceeding: Impact of fairness on Internet performance.

  Thomas Bonald, Laurent Massoulié
  Proceedings of the Joint International Conference on Measurements and Modeling of Computer Systems, SIGMETRICS 2001, June 16-20, 2001, Cambridge, MA, USA; 01/2001
• Chapter: Content Search through Comparisons

  Amin Karbasi, Stratis Ioannidis, Laurent Massoulié
  [show abstract] [hide abstract]
  ABSTRACT: We study the problem of navigating through a database of similar objects using comparisons under heterogeneous demand, a problem closely related to small-world network design. We show that, under heterogeneous demand, the small-world network design problem is NP-hard. Given the above negative result, we propose a novel mechanism for small-world network design and provide an upper bound on its performance under heterogeneous demand. The above mechanism has a natural equivalent in the context of content search through comparisons, again under heterogeneous demand; we use this to establish both upper and lower bounds on content search through comparisons.
  01/1970: pages 601-612;
• Source

  Available from: citeseerx.ist.psu.edu

  Article: Rate-optimal schemes for Peer-to-Peer live streaming

  Laurent Massoulié, Andrew Twigg
  [show abstract] [hide abstract]
  ABSTRACT: In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several network models and for each model we identify schemes that achieve successful diffusion of data at optimal rates.For edge-capacitated networks, we show optimality of the so-called “random-useful” packet forwarding algorithm. As a byproduct, we obtain a novel proof of a famous theorem of Edmonds, characterising the broadcast capacity of a capacitated graph.For node-capacitated networks, assuming a complete communication graph, we show optimality of the so-called “most-deprived” neighbour selection scheme combined with random useful packet selection. We then show that optimality is preserved when each peer can exchange data with a limited number of neighbours, when neighbourhoods are dynamically adapted according to a particular scheme.Finally, we consider the case of multiple information sources, each creating distinct information to be disseminated to a specific set of receivers. In this context, we prove optimality of the so-called “bundled most-deprived neighbour random useful packet” selection.
  Performance Evaluation.