University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > On the stability of flow-aware CSMA

On the stability of flow-aware CSMA

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

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

Abstract: We consider a wireless network where each flow (instead of each link) runs its own CSMA (Carrier Sense Multiple Access) algorithm. Specifically, each flow attempts to access the radio channel after some random time and transmits a packet if the channel is sensed idle. We prove that, unlike the standard CSMA algorithm, this simple distributed access scheme is optimal in the sense that the network is stable for all traffic intensities in the capacity region of the network.

Biography: Dr. Thomas Bonald is an Associate Professor in the Network and Computer Science Department at Telecom ParisTech. He got his Ph.D in Applied Mathematics from Ecole Polytechnique in 1999, under the supervision of Fran├žois Baccelli. He joined Telecom ParisTech in 2009 after ten years at France Telecom research labs. His research has mainly been on the performance evaluation and design of traffic controls for multiservice networks. He has published extensively in journals and conferences gaining a best paper award with Alexandre Proutiere at ACM Sigmetrics/Performance 2004, and filled 6 patents on packet scheduling and load balancing algorithms. He is a member of the editorial boards of Queueing Systems and IEEE /ACM Transactions on Networking, and many conference programme committees in the networking field, including IEEE Infocom and ACM Sigmetrics. He was TPC co-chair for ACM Sigmetrics/Performance 2009. His current research is focused on optical networks and autonomous wireless networks.

This talk is part of the Microsoft Research Cambridge, public talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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