BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//jEvents 2.0 for Joomla//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/Chicago
BEGIN:STANDARD
DTSTART:20131103T010000
RDATE:20140309T030000
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:America/Chicago CST
END:STANDARD
BEGIN:STANDARD
DTSTART:20141102T010000
RDATE:20150308T030000
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:America/Chicago CST
END:STANDARD
BEGIN:STANDARD
DTSTART:20151101T010000
RDATE:20160313T030000
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:America/Chicago CST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20130430T143000
RDATE:20131103T010000
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:America/Chicago CDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20140309T030000
RDATE:20141102T010000
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:America/Chicago CDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20150308T030000
RDATE:20151101T010000
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:America/Chicago CDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:f58a84194aca195def7e4748780d86c8
CATEGORIES:General EECS Event
SUMMARY:Harsha Honappa, Graduate Student, EE Dept, University of Southern California, "Transitory Queueing Theory"
LOCATION:Tech BME Conference Room (Tech E311)
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:\n\nHarsha Honappa \n\n\nGraduate Student, EE Dept, University of Southe
rn California \n\n\n"Transitory Queueing Theory" \n\n\nAbstract: Queueing
Theory has historically focused on the analysis of stationary and ergodic s
ystems. In the last couple of decades there has been much theoretical
progress in analyzing time-varying systems. In this talk, we make the case
that there are non-stationary and (possibly) non-ergodic systems that even&
nbsp;existing theory does not address adequately. We identify such systems,
demonstrate that discrete event analysis is difficult, if not impossi
ble, and develop well justified approximations to the performance metrics o
f these models.\n\n\nThe systems of interest to us are those that either ha
ve a finite population of customers to serve, or only operate for a finite
interval of time. We call these Transitory Queueing Systems. We i
ntroduce the notion of aTransitory Queueing Model, and the Population Accel
eration (PA) technique, and prove diffusion and fluid approximations t
o a generic transitory model. We demonstrate that the class of models
that fit this paradigm is broad, by studying the so-called ?(i)/GI/1 queue
(a model of queueing we introduce), a multi-server queue with traffic model
ed as a renewal process conditioned on a specific event of interest, and a
model of queueing with scheduled arrivals that display uncertainty in
the realized arrival epochs. We show that, even though these systems are ra
dically different in the pre-limit description, the limiting behavior is (s
urprisingly) similar. Applications of this work include systems in retail,
transportation, hospitals/clinics and even call centers.\n\n\nBio: Harsha H
onnappa is a Ph.D. candidate and Ming Hsieh Institute Scholar in the Depart
ment of Electrical Engineering at USC, where he works with Prof. Rahul Jain
of EE and Prof. Amy R. Ward of the Marshall School of Business. His resear
ch interests include stochastic networks, applied probability, statistics a
nd game theory/network economics. His dissertation work has focused on the
game theoretic modeling of traffic in single-class queueing networks, as we
ll as the development of new analytical techniques for studying non-station
ary and non-ergodic queueing systems.\n\n\n\n \n\n\nHosted by: EECS Pr
of. Vijay Subramanian \n
CONTACT:Lana Kiperman, 846-467-0028, lana@eecs.northwestern.edu
DTSTAMP:20141021T020415Z
DTSTART;TZID=America/Chicago:20140501T143000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR