田緒俊 邱曉暉

摘要：隨著科技的發(fā)展，網(wǎng)絡(luò)在人們的日常生活中起到越來越重要的作用，人們希望新的網(wǎng)絡(luò)不僅具有更大的容量，還能支持更多的業(yè)務(wù)。文章介紹了現(xiàn)有的一些比較經(jīng)典的實(shí)時(shí)業(yè)務(wù)分組調(diào)度算法，包括：多載波比例公平算法，修正的最大加權(quán)時(shí)延優(yōu)先調(diào)度算法以及指數(shù)比例公平調(diào)度算法等。論文對(duì)這些算法進(jìn)行研究分析，并在此基礎(chǔ)上提出了改進(jìn)的算法策略FTPWTI算法，通過仿真驗(yàn)證，得出了預(yù)期的結(jié)果。

關(guān)鍵詞：無線網(wǎng)絡(luò)；實(shí)時(shí)；分組調(diào)度；吞吐量；公平性

中圖分類號(hào)：TP393文獻(xiàn)標(biāo)識(shí)碼：A文章編號(hào)：1009-3044(2012)01-0130-03

Research on the Packet Scheduling Algorithms of Wireless Network Real-time Service

TIAN Xu-jun ,QIU Xiao-hui

(Nanjing University of Posts and Telecommunications Telecommunication and Information Engineering,Nanjing 201203, China)

Abstract：With the development of science and technology, the network plays a more and more important role in peoples daily life. It is hoped that the new network not only has a greater capacity, but also can support more services. The article introduces some classical packet scheduling algorithms, including: MPF algorithm, M-LWDF algorithm and EXP/PF algorithm. The article has done some study on the algorithm and introduced a new algorithm named FTPWTI. Through the simulation, the article obtained the desired results.

Key words: wireless network; real time; packet scheduling; throughput; fairness

M-LWDF算法，即Modified Larged Wait Delay First算法，稱為修正的最大加權(quán)時(shí)延優(yōu)先調(diào)度算法。在此算法中，提出一種“分組超時(shí)率”的概念，把它作為衡量無線分組調(diào)度算法性能的主要指標(biāo)，定義為：

5總結(jié)

本文主要是針對(duì)網(wǎng)絡(luò)層性能的提高，對(duì)分組調(diào)度算法進(jìn)行研究。在每個(gè)時(shí)隙中，調(diào)度算法根據(jù)每個(gè)用戶的隊(duì)首分組等待時(shí)間和信道條件的共同影響進(jìn)行調(diào)度判決。通過仿真證明，論文中提出的改進(jìn)算法在性能上獲得了明顯改善。

參考文獻(xiàn)：

[1]林闖,單志廣,任豐原.計(jì)算機(jī)網(wǎng)絡(luò)的服務(wù)質(zhì)量(QoS)[M].北京:清華大學(xué)出版社,2004.

[2]劉乃安.無線網(wǎng)絡(luò)技術(shù)原理與應(yīng)用[M].北京:電子科技大學(xué)出版社,2004.

[3] AParekh. A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks [ J ]. PhD dissertation, Massachu? setts Institute of Technology, 1992 (1) :344 - 357.

[4] J. C, R. Bennett and H. Zhang. WF2Q: Worst- case fair weighted fair queueing [ J ], Proc. IEEE INFOCOM, 1996(1) :24 -28.

[5] X. Liu.“Opportunistic Scheduling in Wireless Communication Networks”. PhD thesis, Purdue University, 2002.

[6]吳宇,魏急波,習(xí)勇.一種針對(duì)混合的實(shí)時(shí)/非實(shí)時(shí)業(yè)務(wù)的無線調(diào)度算法[J].《計(jì)算機(jī)應(yīng)用》,2008(2):389-393.

[7] Song Jian, Li Le - ming. Packet scheduling algorithms in wireless networks [J].Journal of China Institute of Communication, 2003 (24) : 42 -48.

[8]吳偉陵.移動(dòng)通信中的關(guān)鍵技術(shù)[M].北京:北京郵電大學(xué)出版社,2000.