کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
492021 | 721060 | 2011 | 11 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Optimal cyclic service of the centralized broadband wireless networks with k-limited discipline Optimal cyclic service of the centralized broadband wireless networks with k-limited discipline](/preview/png/492021.png)
In this paper, a cyclic service system enabling an adequate description of the control mechanism of the centralized broadband wireless networks with k-limited discipline is presented. An arrival rate prediction method combined with the ordinal optimization (OO) theory-based algorithm is proposed to find a good enough k-limited discipline for the cyclic service system so as to achieve the real-time application. First, we employ the Box–Jenkins method for predicting the arrival rate every Δt period, which is the computation time for executing the OO theory-based algorithm on a base station. Then, the predicted arrival rates will serve as the current arrival rates in the OO theory-based algorithm. We have tested the proposed method by comparing with the cases of using the actual arrival rate at t + Δt, which is considered as the ideal case, and the arrival rate at t, which is considered as the case without prediction, in the OO theory-based algorithm. The test results show that the performance of the case without prediction is 15.72% worse than the ideal case, while the proposed method achieves a performance of only 3.94% worse than the ideal case.
Journal: Simulation Modelling Practice and Theory - Volume 19, Issue 1, January 2011, Pages 382–392