Parallel server queueing systems in the heavy traffic regime

*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************

Event Details
  • Date/Time:
    • Tuesday March 31, 2009 - Wednesday April 1, 2009
      11:00 am - 11:59 am
  • Location: IC 109
  • Phone:
  • URL:
  • Email:
  • Fee(s):
    $0.00
  • Extras:
Contact
Hayriye Ayhan
ISyE
Contact Hayriye Ayhan
404-894-2300
Summaries

Summary Sentence: Parallel server queueing systems in the heavy traffic regime

Full Summary: Parallel server queueing systems in the heavy traffic regime

TITLE: Parallel server queueing systems in the heavy traffic regime

SPEAKER: David Gamarnik

ABSTRACT:

A parallel server queueing system model is used in a variety of applications including computer networks, call centers and health care management. Understanding the behavior of this system in the heavy traffic setting when the number of servers is large is a very challenging problem. While a lot is known in the special case of exponentially distributed processing times, starting with
the classical work of Halfin and Whitt in 1980, far less is known in the non-exponential case. This is unfortunate since the real life data, for example the number of days spent by patients in a hospital, often suggests distributions far from exponential.

We will present a recent progress in understanding the steady state behavior of a parallel server queueing system when the processing time distribution is arbitrary. Specifically, we establish that the basic performance measures for this queueing model have the same scaling as for the special case of exponential processing times. Then we obtain a surprisingly simple and explicit upper bound on the limiting tail distribution of the queue length. In special cases we establish the tightness of this bound.

Joint work with Petar Momcilovic (University of Michigan) and David Goldberg (MIT).

Additional Information

In Campus Calendar
No
Groups

School of Industrial and Systems Engineering (ISYE)

Invited Audience
No audiences were selected.
Categories
Seminar/Lecture/Colloquium
Keywords
parallel server
Status
  • Created By: Anita Race
  • Workflow Status: Published
  • Created On: Oct 12, 2009 - 4:36pm
  • Last Updated: Oct 7, 2016 - 9:47pm