作者: Hong Chen , Offer Kella , Gideon Weiss
关键词: G/G/1 queue 、 Fluid limit 、 M/G/k queue 、 Queue 、 Bulk queue 、 Pollaczek–Khinchine formula 、 Mathematical optimization 、 M/G/1 queue 、 Mathematics 、 Fork–join queue
摘要: In this paper a fluid approximation, also known as functional strong law of large numbers (FSLLN) for GI/G/1 queue under processor-sharing service discipline is established and its properties are analysed. The limit depends on the arrival rate, time distribution initial customers, arriving customers. This in contrast to result FIFO discipline, where piecewise linear only through mean. form can be recovered by an equilibrium type choice distribution.