200922347 九、發明說明： 【發明所屬之技術領域】 本發明關於一種在無線寬頻基地台的延遲與調變感知動觸 寬分配之設備及其方法，特別是一種針對每個不同的無線終 當下與基地台的調變模式，因應不同服務串流的延遲需求，動離 地決定上下行頻寬的分配，保證不同需求的服務串流之延遲，g 公平地分配頻寬給予不同的服務類別之頻寬分配之設備及其方 法。 、 【先前技術】 由於無線環境上的頻寬相當珍責，因此新一代的無線寬類系統 需要基地台對於上下行的頻寬做分配，以支援更高速與長距離'的 傳輸’而非像傳統的Wireless LANs的基地台主要靠競爭 (Con ten t i on )的方式爭搶頻道(Channe 1)的使用權。 目前對於無線寬頻系統基地台的頻寬分配演算法，對於如何保證 及時應用程式(Real-time Application)的品質尚未有一個相當好 的方法。目前主要是用傳統有線網路的頻寬分配方法來加以實 由於在無線環境下傳輸品質受到相當多的干擾，因此傳輸速率實 在是不穩定，而其傳輸速率又將反映在其調變模式與編碼比率 (Modulation and Coding Scheme，MCS)上，因此在做頻寬分配時， 應該將MCS的因素考慮進來，而非單純的考慮要求頻寬，需將其 要求的頻寬對應所用的MCS轉換成所需求的時間槽數目。 在支援不同服務類別的服務串流上，目前的技術或研究主要是針 對不同的服務類別使用不同的頻寬分配演算法，因此一台基地台 上可能需要多種演算法，增加設計複雜度。 雖然利用傳統有線的頻寬分配演算法能夠多少滿足及時應用程式 的品質，然而當整個頻寬擁塞時其表現將會有很大的落差。 在滿足即時應用程式品質的同時，也應同時考慮到各個不同服務 類別間的公平性，目前仍然沒有一個相當好的解決方案。 200922347 相關之先前技術例舉如下： 美國專利[7,127, 255]號 Wireless point to multipoint system: 此篇專利主要提出一個點對多點的無線系統架構，透過基地台 (Base Station)對其所服務的終端機(Terminal)所要求的頻寬做 分配，並分別描述其每個元件及機制，然後由於不同的服務串流 其分別屬於不同的應用程式，當在做頻寬分配時需要考慮到其不 同的特性以維持程式的品質，而在此篇專利並沒有提出適當的頻 寬分配的方法。而本申請案乃是針對在同樣的架構下，對於頻寬 分配的方法，做更周全的分配以維持不同應用程式的品質及公平 f 性。 在其他的專利前案中也有對於不同的要求的服務串流使用不同的 頻寬分配演算法： 美國專利[7, 002, 985]號 Method and apparatus for organizing and scheduling multimedia data transfer over a wireless channel ： 此專利主要將所有的服務串流區分為延遲感知 (delay-sensitive)和非延遲感知（non-delay-sensitive)，而 其^配乃是探討如何對於時槽（time-slot)的分配，主要是依據 乃是先將延遲感知（delay-sensitiv) e的頻寬需求分配完或是當 ί 其最大的時槽（time-slot)已滿載，才更換分配頻寬給予非延遲 感知（non-delay-sensitive)的服務串流。此專利其分配方式將 ，使非延遲感知（non-delay—sensitive)的服務串流遭遇到不公 平的對待。本帽案所提出的方㈣是麟盡可能的滿足兩者。 而此專利主要對於服務串流類別區分原則太過粗糙在同樣是延 遲感知（delay-sensitive)的服務串流，其要求仍然有可能 樣，因此在分配上需要更詳細的考量。 、有J此不 美國專利[7,177, 275]號 Scheduling method and system for communication systems that offer multiple classes of service ： 200922347 此專利將利用一種分配的方法來滿足不同的服務類別，其類別分 為四類：（1) CBR，（2)nrt-VBR，（3)MGR，（4)UPR，其所使用的方 法主要是利用繼承輪替hierarchical round-robin(HRR)及欠缺 輪替 deficit round-robin(DRR)，並優先保證 nrt-VBR 和 MGR 類 別的最小傳輸速率，然後再公平的分配給其他的類別。在此專利 中雖然優先滿足其最小傳輸速率，但是此並不保證能夠維持一定 的延遲，而當延遲過大則對即時應用程式也將是一大損害。本申 請案則以延遲的角度切入，使得能夠滿足即時應用程式的品質。 在文獻方面，目前尚未有根本申請案一樣的頻寬分配演算方法。 以下兩篇皆是利用每個類別内部根據不同的服務類別使用既有在 有線網路下的排程方法來對於頻寬請求做頻寬分配·· [1] K. Wongthavarawat, A. Ganz, “IEEE 802.16 Based Last Mile Broadband Wireless Military Networks with Quality of200922347 IX. Description of the Invention: [Technical Field] The present invention relates to a device and method for delay and modulation sensing dynamic touch distribution in a wireless broadband base station, and in particular, for each different wireless terminal The modulation mode of the base station, in response to the delay demand of different service streams, dynamically determines the allocation of uplink and downlink bandwidth, guarantees the delay of service streams with different demands, and g distributes the bandwidth fairly to different service categories. Widely distributed equipment and methods. [Prior Art] Since the bandwidth in the wireless environment is quite cherished, the new generation of wireless broadband systems requires the base station to allocate bandwidth for uplink and downlink to support higher speed and long distance 'transmission' instead of The base station of the traditional Wireless LANs mainly competes for the right to use the channel (Channe 1) by means of competition. At present, the bandwidth allocation algorithm for the wireless broadband system base station has not been a very good method for how to ensure the quality of the real-time application. At present, the bandwidth allocation method of the traditional wired network is mainly used because the transmission quality in the wireless environment is subject to considerable interference, so the transmission rate is really unstable, and its transmission rate will be reflected in its modulation mode and In the Modulation and Coding Scheme (MCS), the MCS factor should be taken into account when making the bandwidth allocation. Instead of simply considering the required bandwidth, the required bandwidth should be converted to the MCS used. The number of time slots required. On the service stream that supports different service categories, current technology or research mainly uses different bandwidth allocation algorithms for different service categories, so multiple algorithms may be needed on one base station to increase design complexity. Although the traditional wired bandwidth allocation algorithm can satisfy the quality of the timely application, when the entire bandwidth is congested, its performance will have a large gap. While meeting the quality of instant applications, we should also consider the fairness between different service categories. There is still no good solution. 200922347 Related prior art examples are as follows: US Patent [7,127, 255] Wireless point to multipoint system: This patent mainly proposes a point-to-multipoint wireless system architecture, which is served by a base station. The bandwidth required by the terminal is allocated, and each component and mechanism are described separately. Then, because different service streams belong to different applications, it is necessary to consider the difference when doing bandwidth allocation. The characteristics of the program to maintain the quality of the program, and this patent does not propose a proper method of bandwidth allocation. This application is intended to provide a more comprehensive allocation of bandwidth allocation methods to maintain the quality and fairness of different applications under the same architecture. In other patents, there are also different bandwidth allocation algorithms for different service streams: US Patent [7, 002, 985] Method and apparatus for organizing and scheduling multimedia data transfer over a wireless channel : This patent mainly distinguishes all service streams into delay-sensitive and non-delay-sensitive, and its configuration is to discuss how to allocate time-slots. It is based on the fact that the bandwidth requirement of delay-sensitiv e is first allocated or when the maximum time-slot is full, the allocation bandwidth is replaced to give non-delay sensing (non-delay). -sensitive) Service stream. This patent is distributed in such a way that non-delay-sensitive service streams are treated unfairly. The party (4) proposed in this hat case is that Lin is satisfied as much as possible. This patent is mainly too rough for the service stream classification principle. It is also a delay-sensitive service stream. The requirements are still possible, so more detailed considerations are needed in the allocation. The following patents [7, 177, 275] Scheduling method and system for communication systems that offer multiple classes of service : 200922347 This patent will use an allocation method to meet different service categories, the categories are divided into four categories: (1) CBR, (2) nrt-VBR, (3) MGR, (4) UPR, the method used is mainly to use the inheritance rotation of the historical round-robin (HRR) and the lack of rotation round-robin (DRR) ), and prioritize the minimum transmission rate of the nrt-VBR and MGR categories, and then distribute them to other categories fairly. Although the minimum transmission rate is preferentially met in this patent, this does not guarantee that a certain delay can be maintained, and when the delay is too large, it will be a great damage to the instant application. This application cuts in from a delayed perspective, enabling the quality of instant applications to be met. In terms of literature, there is currently no such method as the bandwidth allocation calculation for the basic application. The following two articles use the scheduling method for bandwidth requests in each category based on different service categories to use for the bandwidth request. [1] K. Wongthavarawat, A. Ganz, “ IEEE 802.16 Based Last Mile Broadband Wireless Military Networks with Quality of
Service Support, ” MILCOM，Oct. 2003 : 此篇所列的頻寬分配演算法，主要在根據不同的服務類別内部使 用不同的頻寬分配演算法，而在不同的服務類別之間則是擁有不 同的優先權，而其分配方式完全從最高優先權的開始分配，等到 咼優先權的分完在分給較低優先權的服務類別。此方法只考慮到 上行連接鏈的分配，而容易造成整個系統頻寬表現降級，因為缺 乏對於下行連接鍵頻寬的分配。另一方面，由於在分配上都是從 高優先權的類別開始分配，因此低優先權的類別將會有飢餓的現 象發生，造成不公平的現象。 [2] J. Chen, W. Jiao, H. Wang, A Service Flow Manag6iD6nt Strategy for IEEE802.16 Broadband Wireless Access Systems in TDD Mode，” ICC, May 2005 : 此篇為了解決上篇不公平與只考慮上行連接鏈頻寬所產生的降 級’則多使用一個對應每個服務串流的最大支持傳輸速率 (Maximum Sustained Rate, MSR)當作每個服務類別的 Deficit Counter ’當每個服務類別所分配到的頻寬超過其Deficit 200922347Service Support, ” MILCOM, Oct. 2003: The bandwidth allocation algorithm listed in this article, mainly using different bandwidth allocation algorithms within different service categories, but different between different service categories. Priority, and its allocation is completely assigned from the highest priority, until the priority is assigned to the lower priority service category. This method only considers the allocation of the uplink link, which is easy to cause the whole The system bandwidth performance is degraded because of the lack of allocation for the downlink connection key bandwidth. On the other hand, since the allocation is all from the high priority category, the low priority category will have starvation. Causes unfairness. [2] J. Chen, W. Jiao, H. Wang, A Service Flow Manag6iD6nt Strategy for IEEE802.16 Broadband Wireless Access Systems in TDD Mode,” ICC, May 2005: This article is to solve the previous article. Unfairness and only considering the degradation caused by the uplink link chain bandwidth' uses a maximum supported transmission rate corresponding to each service stream (Maximum Sustai) Ned Rate, MSR) Deficit Counter as each service category when each service category is assigned a bandwidth that exceeds its Deficit 200922347
Counter則就換分配給下一個優先權較高的類別，此方法有一個極 大的問題在於如何設定每個服務串流MSR並沒有明確定義而如何 找到一個適當的MSR不是一件簡單的事情。而其則將上下行連接 鏈同時考慮進來，但是其方法在實際的系統的實行不是那樣的可 行。 以下三篇則利用不同的方法來完成頻寬分配： [3] Y. N. Lin, S. H. Chien, Y. D. Lin, Y. C. Lai, M. Liu, "Dynamic Bandwidth Allocation for 802.16e-2005 MAC," Book Chapter of "Current Technology Developments of WiMax % Systems," edited by Maode Ma, to be published by Springer, 2007 ： ’ 本篇主要利用其所定義的A-Factor比例式的分配頻寬給不同的服 務串流’並且最後加總給其所屬的無線終端機(MobileStation)， 以比例式的分配頻寬並不是那樣的恰當，因為容易造成需要多頻 寬的時候反而給得比較少，反之需要少的時候則有多給的情況。 [4] A. Sayenko, 0. Alanen, J. Karhula, T.Counter is assigned to the next higher priority category. One big problem with this approach is how to set each service stream MSR is not clearly defined and how to find an appropriate MSR is not an easy task. However, it considers the uplink and downlink links at the same time, but the method is not as effective in the actual system implementation. The following three sections use different methods to complete the bandwidth allocation: [3] YN Lin, SH Chien, YD Lin, YC Lai, M. Liu, "Dynamic Bandwidth Allocation for 802.16e-2005 MAC," Book Chapter of "Current Technology Developments of WiMax % Systems," edited by Maode Ma, to be published by Springer, 2007 : ' This article mainly uses its defined A-Factor proportional allocation bandwidth to different service streams' And finally add to the wireless terminal (MobileStation) to which it belongs, the proportional allocation bandwidth is not so appropriate, because it is easy to cause more bandwidth when it is needed, and vice versa. More than the situation. [4] A. Sayenko, 0. Alanen, J. Karhula, T.
Hama 1 ainen，’’ Ensuring the QoS Requirements in 802.16 scheduling," ACM MSWiM * 06, Oct. 2006： 本篇考慮到每個不同無線終端機的調變模式與編碼比率 1 (Modulation and Coding Scheme) ’但是其主要的分配方法仍是 依優先權由尚彳主低的方式來分配，因此會有不公平的情況發生， 且對於及時應用程式的品質維護沒有特別考量，所有類別皆依同 樣的分配方式。 [5] M· Andrews et al·，“Providing Quality of Services over a Shared Wireless link，’’ IEEE Communication Magazine, pp. 150-154， Feb. 2001 : 此篇主要利用在每個服務佇列中的第一個頻寬請求其在佇列中的 等待時間或者是整個佇列中頻寬請求的量來分配頻寬，以這兩個 當作分配的標準並不是那樣的保證即時應用程式的品質。 200922347 【發明内容】 有鑑於先前技術中一般的無線寬頻基地台對於頻寬分配尚缺 少一個整合性並且同時考慮延遲保證的分配方法之缺失，本發明' 同時考慮在無線環境下的調變模式與服務串流的延遲需求，提供 延遲保證與公平的服務。並動態地決定上下行的頻寬大小的分 配。本發明解決目前主要頻寬分配的三個缺點：缺少調變模式的 考里，服務串流延遲保證的不足，以及不同服務類別公平性待遇 之缺失。本發明特徵在於考慮每個不同的無線終端機當下與基地 Ί 台的調變模式，因應不同服務串流的延遲需求，動態地決定上下 行頻寬的分配，保證不同需求的服務串流之延遲，並公平地分配 頻寬給予不同的服務類別。 【實施方式】 為使此領域具通常知識者能夠充分暸解本發明之具體實施方 式，於此特舉一實施例搭配圖式以資說明，其中本方法之一較佳 實施例係透過無線寬頻基地台進行，分段論述如下·· I A.使用本方法之無線寬頻基地台頻寬分配實施方式與運作流程 1.圖1所不是一個無線寬頻基地台頻寬分配方法的實例流程圖。 當一個頻寬請求(Bandwidth Request，BWQ)經由上行(Uplink， UL) 1〇〇或下行(Downlink，DL) 2〇〇抵達基地台，這時延遲轉 ^器（Latency Translator，LT) 300將會對於頻寬請求標上其 最後期限(Deadline)，接著放進所屬的服務類別(Service ^^ss)的佇列(Queue) 4〇〇 中。在訊框產生器(FrameGenerat〇r， )500中，定期的產生訊框，用以承載資料(血乜)與頻寬分 配地圖（_，簡稱地圖，透過天線傳送器（Transmitter)傳送 給各個終端設備。 2·分別屬於某一種服務類別的服務串流sf)都有 200922347 屬於自己的佇列，而根據上行與下行之區別，可進一步分為上 行符列（Uplink Queues. ULQ) 410 與下行作列(Downl ink Queues, DLQ) 420 。 3.在訊框產生器500中，主要由一個頻寬請求轉換器（Bandwidth Request Translator, BRT) 510，上下行次訊框控制器 (Uplink/Downlink Sub-frame Controller, ULSC/DLSC) 520 » 頻寬分配器（BandwidthAllocator, BWA) 530，地圖產生器（MAP Generator，MG) 540所構成。其中頻寬分配器與地圖產生器又 可分為上行頻寬分配器（Uplink Bandwidth Allocator, UBWA) 531和上行地圖產生器（Uplink MAP Generator, UMG) 541與下 行頻寬分配器（Downlink Bandwidth Allocator, DBWA) 532和 下行連接鏈地圖產生器（Downlink MAP Generator，DMG) 542。 Β·延遲轉換器LT 300的内部運作 1. 當有一個BWQ進入基地台時，LT 300會參考其所屬SF的服務 類別’及其最大延遲時間（Maximum Latency，ML)，根據FG的 訊框時間（Frame Duration, FD)，得到此BWQ的最後期限 (Deadline) = [Μ%」’以求得此_需要在多少訊框内被分配 G f寬。如果此_並無蚊其ML，錢細屬雜_無此參 數’則將其最後期限設定為-1。 2. 在別iQ被設定最後期限，則將其放置到所屬的佇列中。如果是 要求分配UL頻寬放在_ 410巾，DL的則放在_ 中。 C.訊框產生器FG 500的内部運作 1. FG 5GG在產生每張赌前料算前，首先 ί: Γϊ ’MS)當下所使用的調變模式與編碼比 C°dlng Scheme) ’計算出此_所請求的 頻寬在訊框中需要的時間槽(sl〇t)數目。 2. 接下來FG 500針對每張訊框透過DLSC/ULSc 52〇計算出况與 200922347 UL在此訊框分別可以分配到的頻寬，DLSC/ULSC 520運作方弋 。首先所有位於ULQ 410和DLQ 420中最後期限等於_ = 酬’根據C.1所計算出其需要多少時間槽數量，分成此 之巧別加總’以優糾算出UL和DL分別至少需保留多少· ，這些最急迫的BWQ，接著如果每個Sf另外有其最小保留Hama 1 ainen, '' Ensuring the QoS Requirements in 802.16 scheduling," ACM MSWiM * 06, Oct. 2006: This section takes into account the Modulation and Coding Scheme of each different wireless terminal. However, the main allocation method is still allocated according to the priority of the low priority, so there will be unfair situations, and there is no special consideration for the quality maintenance of the timely application. All categories are distributed according to the same method. . [5] M· Andrews et al., “Providing Quality of Services over a Shared Wireless link,” IEEE Communication Magazine, pp. 150-154, Feb. 2001: This article focuses on the number of columns in each service. A bandwidth requests its wait time in the queue or the amount of bandwidth request in the entire queue to allocate the bandwidth. The two criteria used as the allocation are not such guarantees the quality of the instant application. 200922347 SUMMARY OF THE INVENTION In view of the lack of integration of a wireless broadband base station in the prior art for bandwidth allocation and the lack of a delay guarantee allocation method, the present invention simultaneously considers modulation modes and services in a wireless environment. The delay requirement of streaming provides delay guarantee and fair service, and dynamically determines the allocation of bandwidth of uplink and downlink. The present invention solves three shortcomings of current main bandwidth allocation: lack of modulation mode, service string Insufficient flow delay guarantee and lack of fairness treatment for different service categories. The invention is characterized by considering each different wireless terminal The modulation mode of the lower and the base stations dynamically determines the allocation of uplink and downlink bandwidths according to the delay requirements of different service streams, guarantees the delay of service streams with different demands, and fairly allocates bandwidth to different service categories. [Embodiment] In order to enable those skilled in the art to fully understand the specific embodiments of the present invention, an embodiment is described in conjunction with the drawings, wherein a preferred embodiment of the method is wireless broadband. The base station is carried out, and the segmentation is as follows: I A. The wireless broadband base station bandwidth allocation implementation method and operation flow using the method 1. FIG. 1 is not an example flow chart of the wireless broadband base station bandwidth allocation method. A bandwidth request (BWQ) arrives at the base station via Uplink (UL) 1〇〇 or Downlink (DL) 2〇〇. At this time, the Latency Translator (LT) 300 will be used for the frequency. The wide request is marked with its deadline (Deadline), and then placed in the queue of the service class (Service ^^ss) to which it belongs. In the frame generator (FrameGenerat〇r, In 500, a frame is generated periodically to carry data (blood sputum) and bandwidth allocation map (_, referred to as map, transmitted to each terminal device through an antenna transmitter (Transmitter). 2. Each belongs to a certain service category The service stream sf) has its own queue of 200922347, and can be further divided into Uplink Queues (ULQ) 410 and Downlink Queues (DLQ) 420 according to the difference between uplink and downlink. 3. In the frame generator 500, mainly consists of a Bandwidth Request Translator (BRT) 510, Uplink/Downlink Sub-frame Controller (ULSC/DLSC) 520 » Frequency A wide splitter (Bandwidth Allocator, BWA) 530, a map generator (MAP Generator, MG) 540. The bandwidth allocator and the map generator can be further divided into an Uplink Bandwidth Allocator (UBWA) 531 and an Uplink MAP Generator (UMG) 541 and a Downlink Bandwidth Allocator (Downlink Bandwidth Allocator, DBWA) 532 and Downlink MAP Generator (DMG) 542.内部·Internal operation of the delay converter LT 300 1. When a BWQ enters the base station, the LT 300 will refer to the service class of its SF and its Maximum Latency (ML), according to the frame time of the FG. (Frame Duration, FD), get the deadline for this BWQ (Deadline) = [Μ%"' to find out how many frames need to be assigned Gf width. If there is no mosquito ML, the money is fine _ no such parameter, then the deadline is set to -1. 2. When the iQ is set to the deadline, it will be placed in the queue. If it is required to allocate UL bandwidth in _ 410 towel, DL is placed in _. C. Framer FG 500 internal operation 1. FG 5GG before generating each bet, first ί: Γϊ 'MS) current modulation mode and coding ratio C°dlng Scheme) The bandwidth requested by this_ is the number of time slots (sl〇t) required in the frame. 2. Next, the FG 500 calculates the status of each frame through DLSC/ULSc 52〇 and the bandwidth that can be allocated by the 200922347 UL in this frame, DLSC/ULSC 520 operation method. First of all, the deadlines in ULQ 410 and DLQ 420 are equal to _ = rewards. According to C.1, how many time slots are needed, and the total number of time slots is divided into two, to calculate the minimum of UL and DL. · These most urgent BWQs, then if each Sf has its smallest retention
Reserved Rate，MRR)參數，則將其轉換成需要的時 間槽數目，在扣掉其佇列中擁有最後底限等於一的BWQ已經優 先被保留的時_數目’再以此和况親分方式作加總、、。經 由以上兩個叶算’能夠得知UL與DL次訊框至少需要多少頻完， 而在整個視框中扣掉這些被優先保留所剩餘的頻寬，則利用 ULQ 410與DLQ 420所有BWQ其最後底限大於一的頻寬請求， 先優先透過C.l的轉換成需要的時間槽數目，以UL和DL的角 度作加總，再利用此最後加總所得數目依比例分配剩下的頻寬 給UL與DL。 3.透過C· 2此時FG 500可以得知在此張訊框中UL與DL次訊框各 應該分別得到多少頻寬，因此下一步驟便是在乩與虬個別對 其所屬的佇列中的BWQ做頻寬分配，所以在BWS 53〇中則區分 為UBWA 531和DBWA 532 ’於此二者之分配方式相同，以下將 用UBWA做介紹。透過UBWA 531，由C. 2計算出，UL次訊框可 以得到之頻寬，並以時間槽數目的形式呈現。接下來對Ulq41〇 裡每個佇列裡的BWQ做分配，先搜尋所有佇列，如果發現其佇 列中有最後期限為一的BWQ，則參考C. 1所計算出該需求頻寬 所轉換的時間槽數目，優先分配其需求的時間槽數目給此佇 列，並移除此最後底限為一的BWQ。當所有彳宁列搜尋完，亦即 處理完所有最後期限等於一的BWQ後，如果還有尚未分配之時 200922347 間槽’便根據每個仔列之其MRR所轉換之時間槽數目做分配， 如果在前一步驟優先分配最後底限為一的BWQ的時間槽數目已 經超過MRR所轉換出的時間槽數目，則不需再額外分配給此符 列’若不足則繼續分配直到MRR被滿足。最後如果還有剩下時 間槽尚未被分配完，則計算每個佇列的平均急迫係數 ’並選出平均急迫係數最大的佇列，優先 分配時間槽給予被挑選中的仔列中第一個BWQ。急迫係數的描 述如下：對應在某個佇列中的第i個BWQi有其對應的最後期限 Deadlinei和其透過c. 1所轉換的時間槽請求數目Ni，以及此佇 列(每個彳宁列對應一個SF)的優先權(Pri〇rity)參數p(數值越 间代表擁有越高的優先權，如果沒有則預設為1)，而其急迫係 數(U-Fact〇r)便是(/ - Factor，= ~^Jine。每個仵列的平均急迫係 數’則是在此佇列中所有BWQ之急迫係數平均。當每一個BWQ 的分配結束後，重新計算每個佇列的平均急迫係數，然後加以 分配時間槽給所挑中的BWQ直到所有時間槽被分完為止。 4·透過UBWA 531和DBWA 532，FG 500即可得到所有UL次訊框和 况次訊框的頻寬分配資訊，因此MG 540便可以藉由UMG 541 和DMG 542產生出其個別的次訊框地圖資訊，並且透過傳送器 發送給各個MS。 FG 500根據基地台系統參數訊框時間，週期性的執行c. i〜C 4 的步驟，當每發送完一個視框，更新位於ULQ 410和DLQ 420 12 200922347 裡所有BWQ的最後期限值’亦即當BWQ的最後期限值大於零則 每發送完一個訊框便將其最後期限值減一。 由上可發現，透過本發明，即可針對每個不同的無線終 端機當下與基地台的調變模式，因應不同服務串流的延遲 需求’動態地決定上下行頻寬的分配，保證不同需求的服 務串流之延遲，並公平地分配頻寬給予不同的服務類別。 本發明已藉上述較佳實施例加以說明，以上所述者，僅 為本發明之較佳實施例，並非用來限定本發明實施之範 Γ 圍。凡依本發明申請專利範圍所述之技術特徵及精神所為 之均等變化與修飾，均應包含於本發明之申請專利範圍内"、。 13 200922347 【圖式簡單說明】 圖1所示是一個無線寬頻基地台頻寬分配方法的實例流程圖。 【主要元件符號說明】 上行 100 下行 200 延遲轉換器 300 佇列 400 上行佇列 410 下行佇列 420 訊框產生器 500 頻寬請求轉換器 510 上下行次訊框控制器 520 頻寬分配器 530 上行頻寬分配器 531 下行頻寬分配器 532 地圖產生器 540 上行地圖產生器 541 下行連接鏈地圖產生器542The Reserved Rate (MRR) parameter is converted into the required number of time slots. In the deduction of the queue, the BWQ with the last floor equal to one has been preferentially reserved. Add up, ,. Through the above two leaf calculations, it can be known that at least how many frequencies are required for the UL and DL subframes, and the remaining bandwidths of the priority reservations are deducted in the entire view frame, and all the BWQs of the ULQ 410 and the DLQ 420 are utilized. The bandwidth request with a lower limit of more than one is firstly converted into the required number of time slots by the conversion of Cl, and is summed by the angles of UL and DL, and then the remaining total amount is proportionally allocated to the remaining bandwidth. UL and DL. 3. Through C· 2, the FG 500 can know how many bandwidths should be obtained in the UL and DL subframes in this frame, so the next step is to select the queues to which they belong. In BWQ, the bandwidth allocation is made, so in BWS 53〇, it is divided into UBWA 531 and DBWA 532 'The two are allocated in the same way. The following will be introduced by UBWA. Through UBWA 531, calculated by C. 2, the UL subframe can obtain the bandwidth and is presented in the form of the number of time slots. Next, the BWQ in each queue of Ulq41 is allocated. First, all the queues are searched. If there is a BWQ with a deadline of one in the queue, the conversion of the required bandwidth is calculated by referring to C.1. The number of time slots, the number of time slots to which priority is allocated is given to this queue, and the BWQ with this last limit of one is removed. When all the search columns are searched, that is, after all BWQs with a deadline equal to one are processed, if there is still no allocation, the 200922347 slots will be allocated according to the number of time slots converted by their MRRs. If the number of time slots in the previous step that preferentially allocates the BWQ with the last limit of one has exceeded the number of time slots converted by the MRR, then no additional allocation to this column is required. If the number is insufficient, the allocation continues until the MRR is satisfied. Finally, if there are still time slots that have not yet been allocated, calculate the average urgency coefficient for each queue and select the queue with the largest average urgency coefficient. The priority time slot is assigned to the first BWQ in the selected babies. . The urgency coefficient is described as follows: the i-th BWQi corresponding to a certain queue has its corresponding deadline Deadlinei and its number of time slots requested by c. 1 is Ni, and this 伫 column (each 彳 column) Corresponding to an SF) Pri〇rity parameter p (the value of the value represents the higher priority, if not, the default is 1), and its urgency coefficient (U-Fact〇r) is (/ - Factor, = ~^Jine. The average urgency coefficient of each ' column is the average of the urgency coefficients of all BWQs in this 。 column. When the allocation of each BWQ is finished, the average urgency coefficient of each 伫 column is recalculated. Then, allocate the time slot to the selected BWQ until all the time slots are divided. 4.·With UBWA 531 and DBWA 532, FG 500 can get the bandwidth allocation information of all UL subframes and condition frames. Therefore, the MG 540 can generate its own sub-frame map information by the UMG 541 and the DMG 542, and transmit it to each MS through the transmitter. The FG 500 periodically executes c. according to the base station system parameter frame time. i~C 4 steps, when each frame is sent, The deadline value of all BWQs in ULQ 410 and DLQ 420 12 200922347 'that is, when the deadline value of BWQ is greater than zero, the deadline value is decremented by one every time a frame is sent. From the above, it can be found that through the present invention For each different wireless terminal, the current modulation mode with the base station, in response to the delay requirements of different service streams, 'dynamically determine the allocation of uplink and downlink bandwidth, to ensure the delay of service streams of different needs, and The present invention has been described with respect to the preferred embodiments of the present invention. The foregoing is a preferred embodiment of the present invention and is not intended to limit the scope of the invention. Equivalent changes and modifications of the technical features and spirits described in the scope of the present invention should be included in the scope of the patent application of the present invention ", 13 200922347 [Simple Description of the Drawings] Figure 1 shows a Example flow chart of wireless broadband base station bandwidth allocation method. [Main component symbol description] Upstream 100 downlink 200 delay converter 300 400 column 400 uplink Column 410 downlink queue 420 frame generator 500 bandwidth request converter 510 uplink and downlink subframe controller 520 bandwidth distributor 530 uplink bandwidth distributor 531 downlink bandwidth distributor 532 map generator 540 uplink map generator 541 Downlink Link Map Generator 542