Fluid Limits for Processor-Sharing Queues with Impatience

Mathematics of Operations Research - Tập 33 Số 2 - Trang 375-402 - 2008
H. Christian Gromoll1, Philippe Robert2, Bert Zwart3
1Department of Mathematics, University of Virginia, Charlottesville, Virginia 22903, USA#TAB#
2INRIA-Rocquencourt, RAP Project, Domaine de Voluceau, BP 105, 78153 Le Chesnay, France#TAB#
3Georgia Institute of Technology, Stewart School of ISyE, 765 Ferst Drive, Atlanta, Georgia 30332, USA#TAB#

Tóm tắt

We investigate a processor-sharing queue with renewal arrivals and generally distributed service times. Impatient jobs may abandon the queue or renege before completing service. The random time representing a job's patience has a general distribution and may be dependent on its initial service time requirement. A scaling procedure that gives rise to a fluid model with nontrivial yet tractable steady state behavior is presented. This fluid model captures many essential features of the underlying stochastic model, and it is used to analyze the impact of impatience in processor-sharing queues.

Từ khóa


Tài liệu tham khảo

10.1287/opre.5.5.650

Billingsley P., 1986, Probability and Measure, 2

10.1145/378420.378438

10.1016/S1389-1286(03)00200-7

10.1287/mnsc.45.3.444

Bramson M., 2005, 13th INFORMS Appl. Probab. Conf.

10.1016/0166-5316(94)90053-1

10.1109/90.909020

10.1214/aoap/1015345295

10.1287/msom.5.2.79.16071

10.1145/1140277.1140289

10.1214/105051607000000014

10.1239/aap/1086957584

10.1007/978-1-4612-4342-7

10.1007/BF01158692

Kallenberg O., 1986, Random Measures

10.1214/105051604000000224

10.1007/BF03179724

Kruk Ł., 2003, Ann. Univ. Marie Curie-Skłodowska, Sect. AI Inform, 1, 37

10.1214/105051605000000809

10.1109/INFCOM.1999.752159

10.1109/90.879343

10.1287/moor.1050.0181

10.1023/A:1019138827659

10.1287/moor.4.2.162

10.2307/1427473

10.1007/978-1-4757-2545-2

10.1023/A:1021804515162

Thông tin
Thông tin xuất bản

Mathematics of Operations Research

Tập 33 Số 2

375-402

Thông tin tác giả