کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
464992 | 697462 | 2011 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Closed-form waiting time approximations for polling systems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Closed-form waiting time approximations for polling systems Closed-form waiting time approximations for polling systems](/preview/png/464992.png)
چکیده انگلیسی
A typical polling system consists of a number of queues, attended by a single server in a fixed order. The vast majority of papers on polling systems focus on Poisson arrivals, whereas very few results are available for general arrivals. The current study is the first one presenting simple closed-form approximations for the mean waiting times in polling systems with renewal arrival processes, performing well for all workloads. The approximations are constructed using heavy traffic limits and newly developed light traffic limits. The closed-form approximations may prove to be extremely useful for system design and optimisation in application areas as diverse as telecommunications, maintenance, manufacturing and transportation.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Performance Evaluation - Volume 68, Issue 3, March 2011, Pages 290–306
Journal: Performance Evaluation - Volume 68, Issue 3, March 2011, Pages 290–306
نویسندگان
M.A.A. Boon, E.M.M. Winands, I.J.B.F. Adan, A.C.C. van Wijk,