Responsive image
博碩士論文 etd-0724103-151459 詳細資訊
Title page for etd-0724103-151459
論文名稱
Title
GPRS系統排程演算法之研究
A Study of Scheduling Algorithm for GPRS
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
64
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2003-07-04
繳交日期
Date of Submission
2003-07-24
關鍵字
Keywords
排程演算法、鏈結適應、v行動通訊網路
QoS, scheduling algorithm, GPRS
統計
Statistics
本論文已被瀏覽 5645 次,被下載 16
The thesis/dissertation has been browsed 5645 times, has been downloaded 16 times.
中文摘要
GPRS是近來行動通訊的熱門話題之一。而為了滿足未來多媒體傳輸的不同服務品質要求,GPRS系統定義了conversational,interactive,streaming及background四種類型的QoS。行動通訊網路在傳送多媒體資料的時候,需要一適當的排程演算法控制無線資源的分配,使每筆傳送資料皆可以符合GPRS系統QoS的要求。
本研究先由GPRS各訊務類型的特性探討,然後針對每個訊務類型提出較適合的傳送方式。最後再配合鏈結適應的技術,將所有的傳送方式整合,發展出新的適合GPRS QoS要求的排程演算法。除此之外,我們也介紹FIFO排程演算法以及priority的排程演算法,以便做一比較。
最後用OPNET的模擬軟體,模擬FIFO、priority及發展排程演算法。並根據QoS的需求,討論各排程演算法對延遲時間、封包損失率以及流通量的影響,並比較各排程演算法的優缺點。而模擬結果顯示,我們所發展出來的排程演算法最能夠滿足GPRS的QoS要求。而且在interactive類型的效能,新的排程演算法比其他排程演算法好。
Abstract
GPRS is one of popular topics for mobile communication. To satisfy the Quality of Service (QoS) requirement for multimedia transmission, the QoS is divided into four classes, which are conversational, interactive, streaming and background class. When mobile communication network transmits the multimedia data, it needs a proper scheduling algorithm to assign the radio resource and make every data meet the requirement of the QoS in GPRS system.
In this thesis, we discuss the properties of every traffic class. For each traffic class, we propose a transmission method. The proposed methods are integrated with the link adaptation to develop a scheduling algorithm to suit the QoS requirement in the GPRS system. In addition, we introduce the FIFO scheduling algorithm and the scheduling algorithm that has priority. Our methods are then compared with those existing algorithms.
We use OPNET simulation system to study the FIFO scheduling algorithm, the priority-scheduling algorithm and our new scheduling algorithms. The effects on the delay time, packet loss ratio and throughput for every scheduling algorithm are analyzed and compared. The simulations show that the new scheduling algorithm can satisfy all QoS requirements, and the performance of the new scheduling algorithm is better than that of the other scheduling algorithms in the interactive class.
目次 Table of Contents
致  謝 i
摘  要 iii
Abstract iv
目  錄 v
圖 目 錄 vi
表 目 錄 viii
第一章 緒  論 1
第二章 GPRS系統 3
2-1 GPRS系統的架構 3
2-2 無線電介面及Link Adaptation技術 5
2-3 GPRS的邏輯通道及資料傳送的流程 9
第三章 排程演算法 15
3-1 GPRS的QoS及其訊務模式 15
3-2 排程演算法 18
3-3 適合GPRS的排程演算法 20
第四章 GPRS排程演算法之模擬及分析 26
4-1 模擬系統之介紹及GPRS系統的模擬驗證 26
4-2 排程演算法之模擬與分析 28
4-3 排程演算法的比較 52
第五章 結論及未來的研究方向 61
參考文獻 63
參考文獻 References
[1] S. Ni, “GPRS network planning on the Existing GSM system,” IEEE GLOBECOM, vol. 3, pp. 1432-1438, 2000.
[2] Y. Cao and V.O.K. Li, “Scheduling Algorithms in Broad-Band Wireless Networks,” IEEE Proceedinds, vol. 89, pp. 76-87,Jan. 2001.
[3] Q. Pang, A. Bigloo, V.C.M. Leung and C. Scholefield, “Service Scheduling for General Packet Radio Service Classes,” IEEE WCNC., vol. 3, pp. 1229-1233, 1999.
[4] M. Andrews, K. Kumaran, K. Ramanan, A. Stolyar and P. Whiting “Providing Quality of Service over a Shared Wireless Link,” IEEE Communication Magazine, vol. 39, pp. 150-154, Feb. 2001.
[5] O. Yu , and Shashank Khanvilkar, “QoS Provisioning over GPRS Wireless Mobile Links,” IEEE Communications and Networking Conference, vol. 1, pp. 322-326, Mar 2002.
[6] O. Queseth, F. Gessler and M. Frodigh, “Algorithms for Link Adaptation in GPRS,” IEEE VTC., vol. 2, pp. 943-947, 1999.
[7] J. Bade and F.Casadevall “Service disciplines performance for GPRS with link adaptation and heterogeneous traffic,” IEEE PIMRC., vol. 2, pp.925-930, 2002.
[8] J. Cai and D. J. Goodman, “General Packet Radio Service in GSM,” IEEE Communication Magazine, pp.122-131, Jan 1997.
[9] J. Gozalvez and J. Dunlop, “GPRS Link Adaptation Switching Thresholds and Intervals,” IEEE Electronics Letters, vol.36, pp.1311-1312, Jul. 2000
[10] ETSI 3GPP. UMTS; Qos Concept and Architecture (3G TS 23.107 version 3.1.0 Release 1999). Technical Specification ETSI TS 123 107, ETSI, Sophia Antipolis, France, January 2000.
[11] ETSI 3GPP. UMTS; Service Aspects; Service and Service Capabilities (3G TS 22.105 version 3.8.0 Release 1999). Technical Specification ETSI TS 122 105, ETSI, Sophia Antipolis, France, March 2000.
[12] A. Brand and H. Aghvami, Multiple Access Protocols for Mobiles Communications GPRS, UMTS and Beyond, JOHN WILEY & SONS, 2002
[13] B. H. Walke, Mobile Radio Networks, Networking, Protocols and Traffic Performance, Second Edition, JOHN WILEY & SONS, 2002
[14] Y.-B. Lin and I. Chlamtac, Wireless and Mobile Network Architectures, JOHN WILEY & SONS, 2001.
[15] OPNET Technologies Inc., OPNET online library, USA, 2000
[16] H. Jonathan Chao and X. Guo, Quality of Service control in High-Speed Networks, JOHN WILEY & SONS, 2002.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:校內公開,校外永不公開 restricted
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus:永不公開 not available

您的 IP(校外) 位址是 3.233.219.31
論文開放下載的時間是 校外不公開

Your IP address is 3.233.219.31
This thesis will be available to you on Indicate off-campus access is not available.

紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code