BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Optimization and Incentives Seminar
SUMMARY:Insensitivity results for the limit of a multi-cla
ss queueing network - Neil Walton\, University of
Cambridge\, Statistical Laboratory.
DTSTART;TZID=Europe/London:20091102T143000
DTEND;TZID=Europe/London:20091102T153000
UID:TALK20905AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/20905
DESCRIPTION:We model a multi-class queueing network as a simpl
e model of document transfer across a packet switc
hing network. We assume the size of documents is l
arge and also that packets are processed through t
he network. A natural limit to take is one where t
he size of documents tends to infinity\, where the
rate packets are processes through the network te
nds to infinity and where also the time until docu
ments are fully transfered stays positive and fini
te. The queueing system resulting from this limit
is one studied by Bonald and Proutiere because it
satisfies a certain insensitivity property. That i
s to say that the stationary distribution of the r
esulting queueing system depends on the distributi
on of document sizes only through their mean docum
ent size.\n\nBy formally proving the convergence o
f a series of multi-class queueing networks to thi
s insensitive queueing systems we are able to dire
ctly prove quite general insensitivity results for
these queueing systems.
LOCATION:MR12\, CMS\, Wilberforce Road\, Cambridge\, CB3 0W
B
CONTACT:Neil Walton
END:VEVENT
END:VCALENDAR