首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Queue lengths and workloads in polling systems
Authors:OJ Boxma  O Kella  KM Kosiński
Institution:aDepartment of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands;bEurandom, Eindhoven University of Technology, The Netherlands;cKorteweg-de Vries Institute for Mathematics, University of Amsterdam, The Netherlands;dDepartment of Statistics, The Hebrew University of Jerusalem, Jerusalem 91905, Israel
Abstract:For a single-server multi-station polling system, we focus on the generating function and Laplace–Stieltjes transform of the time-stationary joint queue length and workload distributions, respectively, under no further assumptions on the service discipline. We express these quantities as expressions involving the generating functions of the joint queue length distribution at visit beginnings and visit completions at the various stations. The latter is known for a broad variety of cases. Finally, we identify a workload decomposition result.
Keywords:Polling system  Queue length  Steady-state distribution
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号