BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Insensitivity results for the limit of a multi-class queueing netw
 ork - Neil Walton\, University of Cambridge\, Statistical Laboratory.
DTSTART:20091102T143000Z
DTEND:20091102T153000Z
UID:TALK20905@talks.cam.ac.uk
CONTACT:Neil Walton
DESCRIPTION:We model a multi-class queueing network as a simple model of d
 ocument transfer across a packet switching network. We assume the size of 
 documents is large and also that packets are processed through the network
 . A natural limit to take is one where the size of documents tends to infi
 nity\, where the rate packets are processes through the network tends to i
 nfinity and where also the time until documents are fully transfered stays
  positive and finite. The queueing system resulting from this limit is one
  studied by Bonald and Proutiere because it satisfies a certain insensitiv
 ity property. That is to say that the stationary distribution of the resul
 ting queueing system depends on the distribution of document sizes only th
 rough their mean document size.\n\nBy formally proving the convergence of 
 a series of multi-class queueing networks to this insensitive queueing sys
 tems we are able to directly prove quite general insensitivity results for
  these queueing systems.
LOCATION:MR12\, CMS\, Wilberforce Road\, Cambridge\, CB3 0WB
END:VEVENT
END:VCALENDAR