BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Random Medium Access Control algorithms\, an asymptotic approach -
  Alexandre Proutiere (Microsoft)
DTSTART:20071121T140000Z
DTEND:20071121T150000Z
UID:TALK8608@talks.cam.ac.uk
CONTACT:Speaker to be confirmed
DESCRIPTION:Random Medium-Access-Control (MAC) algorithms have played an i
 ncreasingly\nimportant role in the development of wired and wireless Local
  Area Networks\n(LANs) and yet  the performance of even  the\nsimplest of 
 these algorithms\, such as slotted-ALOHA\, is still not clearly\nunderstoo
 d.  In this talk\, we provide a general and accurate method to\nanalyze ne
 tworks where interfering users share a resource\nusing a random MAC algori
 thm. The method is based on mean-field theory and\nit is shown to be asymp
 totically exact when the number of users grows large\;\nwe further explain
  why it also provides extremely accurate performance\nestimates even for s
 mall systems. We apply the method to solve two open\nproblems: (a) We addr
 ess the stability region of buffered ALOHA systems. (b)\nWe quantify the p
 erformance of adaptive MAC algorithms\, such as the\nexponential back-off 
 algorithm\, in a system\nwhere saturated users interact through partial in
 terference (by partial\, we\nmean that a user does not necessarily interfe
 re with all other users).\n
LOCATION:MR12\, CMS\, Wilberforce Road\, Cambridge\, CB3 0WB
END:VEVENT
END:VCALENDAR