Optimal load sharing in soft real-time systems: An on-line algorithm using likelihood ratio estimates

Edwin K.P. Chong, Peter Jeffrey Ramadge

Research output: Contribution to journalConference articlepeer-review

2 Scopus citations

Abstract

The likelihood ratio method is studied as a possible approach for sensitivity analysis of discrete event systems. A load sharing problem is considered for a multi-queue system in which customers have soft real-time constraints--if the waiting time of a customer exceeds a given random amount (called the laxity of the customer), then the customer is considered lost. A recursive optimization algorithm is formulated using likelihood ratio estimates to minimize the steady-state probability of loss with respect to the load sharing parameters, and almost sure convergence of the algorithm is proved. The algorithm can be used for on-line optimization of the real-time system, and does not require a priori knowledge of the arrival rate of customers to the system or the service time and laxity distributions. To illustrate the results, simulation examples are presented.

Original languageEnglish (US)
Pages (from-to)652-657
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
Volume2
StatePublished - Dec 1 1990
EventProceedings of the 29th IEEE Conference on Decision and Control Part 6 (of 6) - Honolulu, HI, USA
Duration: Dec 5 1990Dec 7 1990

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Fingerprint Dive into the research topics of 'Optimal load sharing in soft real-time systems: An on-line algorithm using likelihood ratio estimates'. Together they form a unique fingerprint.

Cite this