�鶹��ýӳ��

Abstract : The performance of a wireless network built over opportunistic contacts between mobile users depends crucially on the users' social behaviour. In our work, we illustrate this dependence by studying the dissemination of dynamic content, such as news or traffic information, over such a mobile social network. In this application, mobile users subscribe to a dynamic-content distribution service and share any updates they receive (e.g., through Bluetooth) whenever they meet.

We make two contributions. First, we show that the service provider can allocate its bandwidth optimally to make the content for users as “fresh” as possible. This optimal allocation depends on the social behaviour of users, and we outline an algorithm for computing it. Second, we show that the above system is highly scalable if the social network formed by the mobile users is an expander graph. Under this condition, even if the total bandwidth dedicated by the service provider remains fixed, the content age at each user will grow slowly (as log(n)) with the user population size n.)

This work was done jointly with Augustin Chaintreau and Laurent Massoulie.

Biography : Stratis Ioannidis was born in Athens, Greece. He received his B.Sc. (2002) in Electrical and Computer engineering from the National Technical University in Athens, Greece, M.Sc. (2004) and Ph.D. (2009) in Computer Science from the University of Toronto, Canada. He is currently a post-doctoral researcher at Thomson, in Paris, France. His research addresses problems arising in highly dynamic, self-organizing networks, such as unstructured peer-to-peer systems and mobile wireless networks.

Live Webcast :