English  |  正體中文  |  简体中文  |  Items with full text/Total items : 64191/96979 (66%)
Visitors : 8510432      Online Users : 9051
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/87973


    Title: LTE網路上行傳輸中以公平性為基礎之封包排程器
    Other Titles: Fairness uplink packet scheduling strategies in LTE networks
    Authors: 劉沛晴;Liu, Pei-Ching
    Contributors: 淡江大學資訊工程學系碩士班
    葛煥昭;Keh, Huan-Chao
    Keywords: 上行鏈路;公平性;排程;LTE;Uplink;Fairness;scheduling;CQI
    Date: 2012
    Issue Date: 2013-04-13 11:54:47 (UTC+8)
    Abstract: 由於行動通信服務的需求越來越多,提升頻寬以及信道服務品質便成為重要考量。加上網路空間以及資訊同步成為新的趨勢,所以在論文中採用 LTE架構設計了排程器,以改善上行鏈路傳輸的排程以提高整體系統效能。最理想的狀況即為排程中的每一個連線都能夠順利接收、傳送封包,在這樣具有公平性的分配之下,同時能夠避免中低優先權的連線出現延遲(Latency)或者飢餓(Starvation)。但是當即將發生延遲或者飢餓的時候,將會利用調整優先權的方式,讓中低優先權的連線能夠有更多機會得到服務。在資源分配的部份分為五種頻寬需求方式,將個別針對延遲以及飢餓狀況進行探討。論文中所提出的 FUPS演算法也將和較常使用的Maximum Rate(Max-Rate)、Round Robin(RR)以及 Proportional Fair(PF)三種演算法做比較。在整體效能以及設定的五種不同頻寬需求之下分別做討論。以達到最高效能為前提,並且具備公平性之下分配資源。
    The scheduler was designed for uplink systems of LTE networks in this thesis. It makes different services correspond to different data streams to provide different QoS (Quality of Service) to various applications. For the broadest scope of coverage and to reduce the cost of terminal and power consumption, priority assignments and resource allocations were taken into consideration when the scheduler was designed. Limiting the users with lower priority settings in the scheduling algorithm is efficacious for regulating the order of resource allocations made to the users. The goal is to achieve the highest system performance by enhancing transmission efficacy and satisfying the fairness of resource allocation at the same time. Finally, the scheduler avoids connection latency and starvation related to lower priority resource allocation.
    Appears in Collections:[資訊工程學系暨研究所] 學位論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML459View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback