• Journal of Internet Computing and Services
    ISSN 2287 - 1136 (Online) / ISSN 1598 - 0170 (Print)
    https://jics.or.kr/

Real-Time Link Throughput Management Algorithms for Generalized PF Scheduling in Wireless Mobile Networks


Hee-Jin Joung, Cheol Mun, Jong-Gwan Yook, Journal of Internet Computing and Services, Vol. 12, No. 5, pp. 1-10, Oct. 2011
Full Text:
Keywords: Generalized PF, Wireless mobile networks, Throughput management

Abstract

Wireless mobile networks that exploit generalized PF scheduling can dynamically allocate network resources by using scheduling parameters. There are limitations to predict throughputs by the conventional stochastic approach in general. Moreover the limitations make it difficult to find appropriate scheduling parameters for achieving the demanded throughputs. This paper derives a prediction algorithm that predicts throughputs of the networks by using deterministic approach. A throughput adjust algorithm and a throughput switching algorithm are derived from the prediction algorithm. The performance of the throughput prediction/switching algorithms is evaluated by a simulator based on IEEE 802.16m system.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from November 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[APA Style]
Joung, H., Mun, C., & Yook, J. (2011). Real-Time Link Throughput Management Algorithms for Generalized PF Scheduling in Wireless Mobile Networks. Journal of Internet Computing and Services, 12(5), 1-10.

[IEEE Style]
H. Joung, C. Mun, J. Yook, "Real-Time Link Throughput Management Algorithms for Generalized PF Scheduling in Wireless Mobile Networks," Journal of Internet Computing and Services, vol. 12, no. 5, pp. 1-10, 2011.

[ACM Style]
Hee-Jin Joung, Cheol Mun, and Jong-Gwan Yook. 2011. Real-Time Link Throughput Management Algorithms for Generalized PF Scheduling in Wireless Mobile Networks. Journal of Internet Computing and Services, 12, 5, (2011), 1-10.