Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Fluid approximations for a processor-sharing queue
| |
|
Fluid approximations for a processor-sharing queue
Hong Chen1, 2 , Offer Kella3 and Gideon Weiss4 
| (1) |
Department of Industrial Engineering and Engineering Management, Hong Kong University of Science and Technology, Hong Kong |
| (2) |
Faculty of Commerce and Business Administration, University of British Columbia, Vancouver, B.C., Canada, V6T 1Z2 |
| (3) |
Department of Statistics, The Hebrew University of Jerusalem, Mount Scopus, Jerusalem, 91905, Israel |
| (4) |
Department of Statistics, The University of Haifa, Haifa, 31905, Israel |
Abstract In this paper a fluid approximation, also known as a functional strong law of large numbers (FSLLN) for a GI/G/1 queue under a processor-sharing service discipline is established and its properties are analysed. The fluid limit depends
on the arrival rate, the service time distribution of the initial customers, and the service time distribution of the arriving
customers. This is in contrast to the known result for the GI/G/1 queue under a FIFO service discipline, where the fluid limit is piecewise linear and depends on the service time distribution
only through its mean. The piecewise linear form of the limit can be recovered by an equilibrium type choice of the initial
service distribution.
GI/G/1 queue - processor-sharing discipline - fluid approximation - functional strong law of large numbers
This revised version was published online in June 2006 with corrections to the Cover Date.
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|