event

Faculty Candidate Seminar

TITLE: New Approximations and Algorithms for Stabilizing Time Varying Queues

SPEAKER: Jamol Pender ABSTRACT: 

We develop two new algorithms for stabilizing time varying queues delay probabilities by expanding the queue length in terms of Hermite polynomials.  The first algorithm uses the mean and variance of the queue length.  The second algorithm uses the mean, variance, and skewness of the queue length.  We show that the skewness helps in stabilizing the queue length at positive target values, especially when the queue is critically loaded.  We illustrate through several simulation studies the added benefit of using higher moments of the queue length distribution.   

Media

No media selected

Summary

Details

Thursday
Jan 31 2013
10:00am - 11:00am

Contact: David Goldberg 

In campus calendar: No

Sidebar Content

No sidebar content

Groups

Status

  • Workflow Status:Published
  • Created By:Anita Race
  • Created:01/30/2013
  • Modified By:Fletcher Moore
  • Modified:10/07/2016

Related Links

  • No related links.

Categories

Keywords

  • No keywords were submitted.