BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/58
DTSTAMP:20230914T125908Z
SUMMARY:Optimal Policies for Large Queueing Networks Through Diffusion Limi
ts
DESCRIPTION:Speaker: Adam Shwartz\nElectrical Engineering\, Technion\nIsrae
l Institute of Technology\nHaifa\, 32000\nIsrael\nhttp://w\n\nAbstract: \n
Queueing networks are ubiquitous\, serving as models of computer networks\
, service stations\, dams\, etc. Their performance depends on their struct
ure\, parameters and on the service rules. In general\, finding good servi
ce rules is a difficult problem. We give some examples to motivate the stu
dy of queueing networks\, and in particular large networks. We show how to
approximate large networks by simpler models of diffusions. Two examples
will then illustrate how the asymptotic analysis can lead to practical con
clusions about service rules\, when the model is not known completely---in
this case\, service rates of the various servers are not known. The first
example shows that\, when attempting to minimize the time in the system\,
it suffices to take a surprisingly small sample of service times of a sub
set of servers. The second example deals with the issue of fairness toward
s servers\, and yields a rule which does not depend on the values of servi
ce rates\, and is easy to implement as well as robust with respect to some
model assumptions (joint work with Rami Atar and Yair Shaki).\n
URL:https://www.tcs.tifr.res.in/web/events/58
DTSTART;VALUE=DATE:20100108
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR