TW200824381A - Resource allocation apparatus, method, application program, and computer readable medium thereof - Google Patents

Resource allocation apparatus, method, application program, and computer readable medium thereof Download PDF

Info

Publication number
TW200824381A
TW200824381A TW095143328A TW95143328A TW200824381A TW 200824381 A TW200824381 A TW 200824381A TW 095143328 A TW095143328 A TW 095143328A TW 95143328 A TW95143328 A TW 95143328A TW 200824381 A TW200824381 A TW 200824381A
Authority
TW
Taiwan
Prior art keywords
resource allocation
data
possible transmission
resource
combinations
Prior art date
Application number
TW095143328A
Other languages
Chinese (zh)
Other versions
TWI333361B (en
Inventor
Wen-Hsing Kuo
Yu-Ting Yao
Yi-Hsueh Tsai
Chih-Chiang Hsieh
Te-Huang Liu
Wanjiun Liao
Original Assignee
Inst Information Industry
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Inst Information Industry filed Critical Inst Information Industry
Priority to TW095143328A priority Critical patent/TWI333361B/en
Priority to US11/680,224 priority patent/US8281008B2/en
Publication of TW200824381A publication Critical patent/TW200824381A/en
Application granted granted Critical
Publication of TWI333361B publication Critical patent/TWI333361B/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/60Network streaming of media packets
    • H04L65/75Media network packet handling
    • H04L65/765Media network packet handling intermediate
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/60Network streaming of media packets
    • H04L65/75Media network packet handling
    • H04L65/752Media network packet handling adapting media to network capabilities
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/80Responding to QoS
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00Network arrangements, protocols or services for supporting real-time applications in data packet communication
    • H04L65/60Network streaming of media packets
    • H04L65/61Network streaming of media packets for supporting one-way streaming services, e.g. Internet radio
    • H04L65/612Network streaming of media packets for supporting one-way streaming services, e.g. Internet radio for unicast

Abstract

A resource allocation apparatus, method, application program, and computer readable medium thereof are provided. A plurality of data streams are transmitted to a plurality of receiving ends via a network resource, wherein each of the receiving ends has a subscribing status. Each of the data streams comprises a plurality of data layers. First, required data are sent to the receiving ends. Then, an efficiency ratio of each of the possible transmission combinations is dynamically calculated. Finally, data layers comprised in the possible transmission combination that has the greatest efficiency ratio are transmitted to the receiving ends. Efficiency ratios are calculated according to the whole network resource, the channels of the receiving ends, and the characters of the data streams. By the aforementioned arrangement, data layers received by the receiving ends can be adjusted dynamically. Thus, the efficiency of the network resource can be increased.

Description

200824381 23 L33、l43 :第三資料層 4 L24 L34、l44 ••第四資料層 無案若有姆_,請揭示魏顯*發明翻^化學式·200824381 23 L33, l43: The third data layer 4 L24 L34, l44 • The fourth data layer If there is a case _, please reveal Wei Xian * invention turn ^ chemical formula ·

九、發明說明: ⑩ 【發明所屬之技術領域】 本發明係關於_錄咨、店 可讀取記錄媒體勒置、方法、顧程式及其電腦 資料串流至複數個各自1由—網路㈣以傳送複數個 裝置、方法、應用程式及ii 狀態之接收端之資源分配 八夂具電腦可讀取記錄媒體。 【先前技術】 200824381 Γ不便’其傳輸品質更是不穩定,具有機動性和 ΐΐΐ的無線鱗於是興起。以傳輸距_言,無_路可區分 $無線區域轉(Wireless LAN,肌娜、無_t_(wkdess ^mpohtan Area Network,WMAN)以及無線廣域網路(wirdess =mrGfk,wwan) °產官科紛紛對不_無線網路制 ^不同的傳輸協定’例如’適用於肌颜的無線保真標準(術如Nine, invention description: 10 [Technical field of invention] The present invention relates to _ recording, store readable recording media, method, program and computer data stream to a plurality of respective ones - network (four) A computer-readable recording medium is distributed to a resource that transmits a plurality of devices, methods, applications, and receivers of the ii state. [Prior Art] 200824381 Γ Inconvenience ‘The transmission quality is more unstable, and the wireless scale with mobility and flaws is on the rise. With transmission distance _, no _ road can be distinguished by wireless area (Wireless LAN, 肌, _t_(wkdess ^mpohtan Area Network, WMAN) and wireless wide area network (wirdess = mrGfk, wwan) ° For the non-wireless network system, different transmission protocols 'for example' apply to the wireless fidelity standard of the muscles.

Wi_Fi)、適躲職必之微波存取全球互通群播 唯 or dwide Interoperability for Microwave Access,WiMAX)標 =及適祕WWAN之帛三代織軌肋(Thkd Generati〇n, 3G) 〇Wi_Fi), the microwave access global interoperability broadcast for the exclusive use of the only or dwide Interoperability for Microwave Access, WiMAX) = and the appropriate three-generation weaving ribs (Thkd Generati〇n, 3G)

然而相較於有線網路,無線網路所能提供的頻寬較為有限, #此^使用無線網路傳輸大量資料時,如多媒體檔案,往往需要 =吩層編碼(layered _ding)再進行傳輸之技術。分層編碼之 ^特徵如第1 ®所示。分層編碼技術係將多媒體資料串流ι〇ι 为成許多較小的多媒體串流,亦即數個資料層1〇3,各資料層1〇3 係為多媒體資料串流之晝面之不同精細資料層。詳言之,資料層 ,气含資料層l〇3a、職、i〇3c及103d,其中資料層1〇3a所1 貢,為最粗糙之資料,而資料層1〇3b、1〇3c、1〇3(1分別為較 3之資料。詳言之,若僅有雜層臟,則使用者僅能看到最 =的畫面;若再加上資料層1G3b,則使用者能看到稍微清晰之 旦1^併以此類推。是故,藉由組合不同數目的資料層,可產生不 =品質之晝面。因此,傳送端U可視客戶端131、133、135之通 f質傳送不同數目之資料層。例如,客戶端133之通道1〇2品 1取好’故可接收所有的資料層1〇3a、1〇3b、1〇3e、1〇3d;客戶 端^35之通道1〇4品質次之,故接收資料層1〇允、1〇孙、; =客戶端131之通道loo品質更差,故健收資料層隐、腿。 不同客戶端131、133、135依自身的通道狀況或網路品質 各種數量組合的資料層,以得到不同的晝面顯示品質,藉此 提尚多媒體服務之彈性。 6 200824381 麻!前大部分的無線網路標準皆支援群播_也蜂力能,群播 ίΐΐϊ端可向特料組中的傳送端訂閱不_節目,即前述之 j 。以WiMAX為例,利用其高速傳送與範圍廣大的特性, =要使用同群組(multicast group)中最低速率的叢'發性設定播 ursty profile),則該群組之所有使用者就可以接收苴 = 播對象可以是數十甚絲百個朗者^ ^巾',< 二 之技術更麟重要。 W居編碼 次料具有分層編碼鋪,依不同通道狀況傳送各個 ^ ΐί端’但WiMAX規格中並未討論關於群播技術的Ϊ 或協定所占之頻寬比率進行分析。是故,當 吊’無法準確地判斷問題所在。 見 另一方面,由於所有客戶端之流量均彙聚至一條 將網路資_依先到先得之方式分配,會使許多客戶^ ^ ^數,頻寬,制完整資訊’而其他客戶端連基訊益 取中=錄分配不盡,。更甚者,當網路在傳遞以 =吊出現不可控制之如’若無法騎有客戶端 頻 官理’便會影響其他客戶端的資料存取速度。 百放頻見 綜亡所述,由於目前的網路傳送技術在進行直播、群播 亚ί無任何現存的方針來調配給予各使用者、各服務串^ 。是故訂賴路資源分配管理之機制,使頻寬、流量及= f〆刀配合情合理’並依各種狀況動_整,義提升網路資诉乂 配的整體效能,乃是業界減需要努力解決的目標。 …刀 【發明内容】 資料ft明5之=的在於提供—種藉由一網路資源傳送複數個 二^串流至硬數個各自具有一訂閱狀態之接收端之資源 衣置。此貧源分配裝置包含一產生模組、一計算模組、—選取 7 200824381 能,送組cum” :中 j;: 等接收端。計算模組係用以對各該可能 卢ί二度及—資源消耗量,以及用以對各該滿意 所接:i模組係用以傳送選取“ 個資^明^另^的在於提供一種藉由一網路資源傳送複數 方各^ 生複數個可能傳i組合,下::?料=等訂閱狀態產 二二=:送組合計算- 計算-效用比H 滿思度及相對應之資源消耗量 用比值最大者相對應資源;選取該等效 選取組合所包含之資料層至組合’·以及傳送 之接收端之資源分配方貝 計算模組、一選取模組以及 】:、::產生杈組、- 列步驟:令產生模組根據該等方法包含下 :該;^ 資料層中之至少-層’至二層中之;==該一等 8 200824381 該^接收端;令計算模組對各該可能傳送組合計算一滿意度及 二,源消耗量,以及用以對各該滿意度及相對應之資源消耗量 计异一效用比值’其中資源消耗量小於網路資源;令選取模組 選取該等效用比值最大者相對應之可能傳送組合為一選取組 合,以及令傳送模組傳送選取組合所包含之資料層至其相對應 之接收端。 ' ' 本發明之另一目的在於提供一種内儲於一資源分配裝置之 應用程式,使資源分配裝置執行一資源分配方法。資源分配裝 置包,一產生模組、一計算模組、一選取模組以及一傳送模 組。育源分配方法藉由一網路資源傳送複數個資料串流至複數 個各自具有一訂閱狀態之接收端,資源分配方法包含下列步 驟·々產生模組根據該等訂閱狀態產生複數個可能傳送组合, ^中’各該資料串流包含複數個資料層,各該訂雜態與各該 貝料串流之該等資料層相關,各該可能傳送組合包含該等資料 層中之至少—層,至少—層中之每—層分別對應到至少一該等 接收端L令計算模組對各該可能傳送組合計算一滿意度及一資 源,耗I,以及用以對各該滿意度及相對應之資源消耗量計算 效用比值,其中資源消耗量小於網路資源;令選取模組選取 該等效用比值最大者相對應之可能傳$組合為—選取組合;以 及令傳送模組傳送選取組合所包含之資料層至其相對應之接 收端。 本發明之又一目的在於提供一種電腦可讀取媒體,用以儲存 =應^、叙式,應用程式使一資源分配裝置執行一資源分配方 法。貧源艺=裝置包含一產生模組、一計算模組、一選取模組 以及傳送模組。資源分配方法藉由一網路資源傳送複數個 ^流至複數個各自具有—訂赚態之接收端,資源分配方法 下列步驟令產生模組根據該等訂閱狀態產生複數個可能 傳送組合,其中,各該資料串流包含複數個資 各 狀態與各該資料串流之該等資料層相關,各該可 9 200824381 含該等資料層中之至少-層’至少一層中之每一層分別對應 至-該2接收端,令計算模組對各該可能傳送組合計瞀二志 思度及一資源消耗量,以及用以對各該滿意度及相對 消耗量計算-效㈣值,其中資_耗量小於網路f源;人^ 取模組選取該等效用比值最大者相對應之可能傳送組合 選取組合;以及令傳送模組傳送選取組合所包含之 相對應之接收端。 ' /、However, compared to wired networks, wireless networks can provide a limited bandwidth. When using wireless networks to transmit large amounts of data, such as multimedia files, it is often necessary to use layered _ding for transmission. technology. The feature of layered coding is shown in Figure 1®. Hierarchical coding technology streams multimedia data into many smaller multimedia streams, that is, several data layers 1〇3, and each data layer 1〇3 is different from the multimedia data stream. Fine data layer. In detail, the data layer, the gas-containing data layer l〇3a, occupation, i〇3c and 103d, of which the data layer 1〇3a 1 tribute, is the coarsest data, and the data layer 1〇3b, 1〇3c, 1〇3 (1 is the data of 3 respectively. In detail, if only the impurity layer is dirty, the user can only see the most = picture; if the data layer 1G3b is added, the user can see a little Clearly, 1^ and so on. Therefore, by combining different numbers of data layers, it is possible to produce a face that is not = quality. Therefore, the transmission end U can be different from the client 131, 133, 135. The data layer of the number. For example, the channel 1〇2 of the client 133 is taken well, so all the data layers 1〇3a, 1〇3b, 1〇3e, 1〇3d can be received; the channel 1 of the client ^35 〇4 quality second, so the receiving data layer 1 〇, 1 〇 孙,; = client 131 channel loo quality is worse, so the health data layer hidden, legs. Different clients 131, 133, 135 according to their own The data layer of various combinations of channel conditions or network quality to obtain different face display quality, thereby enhancing the flexibility of multimedia services. 6 200824381 Ma! The wireless network standard supports group broadcasting. _Beepower can also subscribe to the transmitters in the special group to not subscribe to the program, which is the aforementioned j. Take WiMAX as an example, use its high-speed transmission and wide range. The characteristic, = to use the lowest rate of the cluster group in the multicast group to broadcast the ursty profile, then all users of the group can receive 苴 = broadcast objects can be dozens of hundreds Longer ^^巾', < The technology of the second is more important. The W-coded sub-material has a layered coded shop that transmits each ^ ΐ 端 end depending on the channel conditions. However, the WiMAX specification does not discuss the bandwidth ratio of the 群 or protocol of the multicast technology. Therefore, when hanging, it is impossible to accurately determine the problem. On the other hand, since all client traffic is aggregated to a network that is allocated on a first-come, first-served basis, many customers will have ^^^number, bandwidth, and complete information' while other clients connect The basic information of the basic information is not enough. What's more, when the network is transmitting, it is uncontrollable, such as 'If you can't ride the client's frequency, it will affect the data access speed of other clients. According to the comprehensive review, the current network transmission technology is deployed in live broadcast and group broadcast. There is no existing policy to allocate users and service strings. It is the mechanism for the allocation and management of the resources of the Lai Road, so that the bandwidth, the flow rate and the slashing of the squad are reasonable and the overall effectiveness of the network stipulations is improved. The goal of the solution. ... knives [Summary] The data ft 5 is provided by a network resource to transmit a plurality of streams to a hard number of resource devices each having a subscription state. The lean source distribution device comprises a generating module, a computing module, selecting 7 200824381, sending group cum": medium j;: receiving end. The computing module is used for each possible - resource consumption, and to be satisfied with each of the following: i module is used to transmit the selection of "single money ^ ^ ^ ^ is to provide a kind of network to transfer multiple parties through a network resource Pass i combination, the following::? material = equal subscription status production two two =: send combination calculation - calculation - utility ratio H full thinking and corresponding resource consumption with the largest ratio corresponding to the resource; select the equivalent selection The data layer included in the combination is combined with the resource allocation square module of the combination '· and the receiving end of the transmission, a selection module and the following:::: generating a group, - column step: making the module according to the methods Including: the following; ^ at least in the data layer to the second layer; == the first class 8 200824381 the ^ receiving end; let the computing module calculate a satisfaction and two for each of the possible transmission combinations, the source Consumption, and the amount of resource consumption for each satisfaction and corresponding The heterogeneous utility ratio 'where the resource consumption is less than the network resource; the selection module selects the possible transmission combination corresponding to the largest equivalent ratio as a selected combination, and causes the transmission module to transmit the data layer included in the selected combination to Its corresponding receiving end. Another object of the present invention is to provide an application stored in a resource allocation device for causing a resource allocation device to perform a resource allocation method. A resource allocation device package, a generation module, a calculation module, a selection module, and a transmission module. The resource allocation method transmits a plurality of data streams to a plurality of receiving ends each having a subscription status by using a network resource, and the resource allocation method comprises the following steps: the generating module generates a plurality of possible transmission combinations according to the subscription status. Each of the data streams includes a plurality of data layers, each of which is associated with the data layers of each of the data streams, each of the possible transmission combinations including at least one of the data layers. At least - each of the layers corresponds to at least one of the receiving ends L, so that the computing module calculates a satisfaction and a resource for each of the possible transmission combinations, consumes I, and is used for each satisfaction and corresponding Calculating the utility ratio of the resource consumption, wherein the resource consumption is less than the network resource; and the selection module selects the possible combination of the largest equivalent ratio to be selected as the selection combination; and the transmission module transmits the selected combination. The data layer to its corresponding receiving end. It is still another object of the present invention to provide a computer readable medium for storing a resource allocation method for causing a resource allocation device to perform a resource allocation method. The poor source art device comprises a production module, a calculation module, a selection module and a transmission module. The resource allocation method transmits a plurality of streams to a plurality of receiving ends each having a subscription state, and the resource allocation method comprises the following steps: the generating module generates a plurality of possible transmission combinations according to the subscription status, wherein Each of the data streams includes a plurality of statuses associated with the data layers of the data stream, each of the at least one of the at least one layer of the data layers corresponding to each of the layers The 2 receiving end enables the computing module to calculate the ambition and resource consumption for each of the possible transmission combinations, and calculate the value-effective (four) value for each of the satisfaction and the relative consumption, wherein the amount of consumption It is smaller than the network f source; the person select module selects the possible combination of the corresponding combination of the largest equivalent ratio; and causes the transmitting module to transmit the corresponding receiving end included in the selected combination. ' /,

本發明根據整體的網路資源、接收端之網路通道狀況、資 串流之特性(頻道特性),動態地調整傳送至接收端的資料串汽之次 料層,使整體網路的效用函數最大化。本發明利用有限的纟^路J 源使網路資訊達到最有效的分配,避免無線廣播的資源浪費,、衾 到系統的高彈性與資源的高效益。 、 、$ 在參閱圖式及隨後描述之實施方式後,該技術領域具有通常 知識者便可瞭解本發明之其他目的,以及本發明之技術手段及實 施態樣。 ' 【實施方式】 本發明之第一實施例如第2A圖、第2B圖及第2C圖所示。 φ 第2A圖係為描繪本發明之一資源分配裝置21,此資源分配裝 置21藉由一網路資源傳送複數個資料串流2〇至複數個各自具 有一訂閱狀悲22之接收端23。各該資料串流20包含複數個資料 層,各該訂閱狀態22與各該資料串流20之該等資料層相關。有 、 關資料串流20、其資料層,以及訂閱狀態22等,將於稍後說明。 此資源分配裝置21包含一產生模組211、一計算模組213、 一選取模組215以及一傳送模組217以完成上述之資源分配,其 具體達成之方式,將於稍後說明。於此實施例中,此資源分配 裝置21係設置於一基地台25内,其設置可藉由軟體、硬體或韋刃 體之方式,安裝於基地台25之硬碟、記憶體或外接控制器上。 200824381 要強調的是,本發明之資源分配裝置21並不一定要設置於基地 台25内,僅需設置於可使資源分配裝置21於基地台25傳送資料 串流前執行之處即可。 第一實施例係應用資源分配裝置21於一網際網路協定電視 (Internet Protocol Television,IPTV)系統2,故複數個資料串流2〇The invention dynamically adjusts the secondary layer of the data stream transmitted to the receiving end according to the overall network resource, the network channel status of the receiving end, and the characteristics of the stream stream (channel characteristics), so that the utility function of the overall network is maximized. Chemical. The invention utilizes a limited source of J to achieve the most efficient allocation of network information, avoiding waste of resources of wireless broadcasting, and high flexibility of the system and high efficiency of resources. The other objects of the present invention, as well as the technical means and embodiments of the present invention, will be apparent to those skilled in the art in view of the appended claims. [Embodiment] A first embodiment of the present invention is shown in Figs. 2A, 2B, and 2C. φ 2A is a resource allocation device 21 of the present invention. The resource allocation device 21 transmits a plurality of data streams 2 to a plurality of receiving terminals 23 each having a subscription status 22 by a network resource. Each of the data streams 20 includes a plurality of data layers, each of which is associated with the data layers of each of the data streams 20. The data stream 20, its data layer, and the subscription status 22 will be described later. The resource allocation device 21 includes a generation module 211, a calculation module 213, a selection module 215, and a transmission module 217 to complete the resource allocation described above. The specific implementation manner will be described later. In this embodiment, the resource allocation device 21 is disposed in a base station 25, and is configured to be mounted on the hard disk, the memory or the external control of the base station 25 by means of a software, a hardware or a blade. On the device. 200824381 It is emphasized that the resource allocation device 21 of the present invention does not have to be installed in the base station 25, and only needs to be disposed at a place where the resource distribution device 21 can be executed before the base station 25 transmits the data stream. The first embodiment is an application resource allocation device 21 in an Internet Protocol Television (IPTV) system 2, so a plurality of data streams 2〇

係指數位電視内容,亦即各數位電視台(圖未示出)之節目資料 串流,假d又本貫施例之複數個資料串流2〇包含四個資料串流 201、203、205、207。電視台在送出所有的各個資料串流2〇 前,會先將四個資料串流2(H、203、205、207的每一個分成複 數個資料層。舉例而言,第一資料串流2〇1被切割成四個資料 層Ln、L1Z、Ln、Lu,其中之複數個資料層中的一第一資料層 Lu係為弟一資料串流201之影像資料最粗糙:之部份,第二資料 層1^係為第一資料串流2〇1之影像資料之一細部資訊,第三資 料層Ln係為第一資料串流2〇1之影像資料之一更細部資訊了第 四資料層LH係為第一資料串流2〇1之最細部資訊。資料層、 Ln、Ln、Lm之間之關係為··將資料層Li2附加於資料層[η可 得到較僅使用資料層Lu清晰之影像;同理,若再附加資料層 Ln於1^及1^2,則可得更清晰之影像;以此類推。本實施例中曰, 採同樣之技術將資料串流203被分成LZ1、1^22至1^24,將資料串 流205被分成Lw、Lu至LB,以及將資料串·流2〇7被分成、 L42至L44j>要強調的是,本實施例之資料串流的數量及各資料 串流之資料層數目僅為舉例而已,並非用來限制本發明之範 圍。再者,各資料串流所包含之資料層數目亦不需相同。本實 Ϊ例料妙串ί分_數個資料層之方式與先前技術相 ^在實際運作上’亦可採用別種方式將資 =料並非=層。換言之’將—資料串流分成複數個 一貝料層之技術亚非用來限制本發明之範圍。 曰態?ί指作為訂閱者之各接收端23各自訂閱之節 目内谷'貝訊。亦即’-弟—接收端231具有一訂閱狀態221、一 200824381 第二接收端233具有一訂閱狀態223、一第三接收端235具有一 訂閱狀態225以及一第四接收端237具有一訂閱狀態227。舉例 而言,第一接收端231之訂閱狀態221為第一資料串流201之第 一資料層L„與第二資料層L12 ;第二接收端233之訂閱狀態223 為第四資料串流207之第一資料層Lw、第二資料層l42、第三資 料層La與第四資料層L44 ;第三接收端235之訂閱狀態225為第 二資料串流203第一資料層LZ1 ;以及第四接收端237之訂閱狀 態227為第三資料串流205之第一資料層L31、第二資料層1^32與 第三資料層L33。 ⑩ 網路資源係為一網路頻寬,意指基地台25與接收端231、 233、235、237之傳送通道之總頻寬。於本實施例中,總頻寬 為35Gbps (gigabits per second)。然而於其他實施例中,網路資 源亦可定義為一存取時間。無論將網路資源定義為何,其必為 一有限值。於此實施例中,傳送方式係利用無線網路之群播 (multicast),以將資料串流2(U、203、205、207傳給特定群組 中的接收23 ’且係猎由一微波存取全球互通The index television content, that is, the program data stream of each digital television station (not shown), the false data stream and the plurality of data streams of the present embodiment include four data streams 201, 203, 205, 207. Before the TV station sends out all the data streams, it will first divide the four data streams 2 (each of H, 203, 205, and 207 into multiple data layers. For example, the first data stream 2〇 1 is cut into four data layers Ln, L1Z, Ln, Lu, and a first data layer of the plurality of data layers is the roughest part of the image data of the data stream 201: part, second The data layer 1 is a detail information of the image data of the first data stream 2〇1, and the third data layer Ln is one of the image data of the first data stream 2〇1. LH is the most detailed information of the first data stream 2〇1. The relationship between the data layer, Ln, Ln, and Lm is ··Adding the data layer Li2 to the data layer [η can be obtained more clearly than the data layer Lu In the same way, if the data layer Ln is added to 1^ and 1^2, a clearer image can be obtained; and so on. In this embodiment, the data stream 203 is divided into LZ1 by the same technique. , 1^22 to 1^24, the data stream 205 is divided into Lw, Lu to LB, and the data string stream 2〇7 is divided, L42 to L44j> It is to be noted that the number of data streams and the number of data layers of each data stream in this embodiment are only examples, and are not intended to limit the scope of the present invention. Furthermore, the number of data layers included in each data stream is also It doesn't need to be the same. The actual example of this example is _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ The technique of sub-dividing into a plurality of layers is used to limit the scope of the present invention. 曰 ? ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί ί 231 has a subscription status 221, a 200824381. The second receiving end 233 has a subscription status 223, a third receiving end 235 has a subscription status 225, and a fourth receiving end 237 has a subscription status 227. For example, the first The subscription status 221 of the receiving end 231 is the first data layer L„ of the first data stream 201 and the second data layer L12; the subscription status 223 of the second receiving end 233 is the first data layer Lw of the fourth data stream 207. Second data layer l42, third capital Layer La and fourth data layer L44; subscription state 225 of third receiving end 235 is second data stream 203 first data layer LZ1; and subscription state 227 of fourth receiving end 237 is third data stream 205 A data layer L31, a second data layer 1^32 and a third data layer L33. 10 The network resource is a network bandwidth, which means a transmission channel between the base station 25 and the receiving ends 231, 233, 235, 237. In the present embodiment, the total bandwidth is 35 Gbps (gigabits per second). However, in other embodiments, the network resource may also be defined as an access time. Regardless of the definition of the network resource, it must be a finite value. In this embodiment, the transmission method utilizes a multicast of a wireless network to transmit the data stream 2 (U, 203, 205, 207 to the reception 23 in a specific group) and is hunted by a microwave. Access to global interoperability

Interoperability for Microwave Access,WiMAX)技術進行傳送。 首先,傳送模組217會根據訂閱狀態221、223、225、227傳 φ 送相對應之一必要資料層至相對應之接收端23卜233、235、237。 本實施例定義此必要資料層係為訂閱狀態221、223、225、227所 包^之資料層,亦即,只要是接收端231、233、235、237所訂閱 之資料,即為相對應之接收端之必要資料層。要強調的是,於 其他實施例中,必要資料層之定義亦有所不同。譬如,必要資料 層可為單一資料串流之資料層,舉例而言,接收端231、233、 235、237之訂閱狀態可分別為第一資料串流2〇1iLii、Lii及 L12、Ln及L12AL13、L",接收端231、233、235、237可收到不 同清晰,度之同一電視台的同一電視内容。又例如,可以僅包 含每個資料串流2(H、203、205、207之第一資料層L„、L21、L31、 Lm。若必要資料層為第一資料層1^、L2i、L3i、L4i,其可使所有 12 200824381 接收端23得到資料串流2(H、203、205、207之主要資訊,即使於 通道狀況不佳的情況下,僅接收到此必要資料層之接收端仍可大 略獲知資料串流20所欲傳達之訊息。一般而言,此必要資料層係 採用一隶f艾速度傳送,且此必要資料層係壓縮為最高容錯率之狀 態,以減少通訊品質之影響。Interoperability for Microwave Access, WiMAX) technology for delivery. First, the transmitting module 217 sends a corresponding data layer to the corresponding receiving end 23, 233, 235, 237 according to the subscription status 221, 223, 225, 227. This embodiment defines that the necessary data layer is the data layer of the subscription status 221, 223, 225, 227, that is, as long as the data subscribed by the receiving end 231, 233, 235, 237 is corresponding. The necessary data layer at the receiving end. It should be emphasized that in other embodiments, the definition of the necessary data layers is also different. For example, the necessary data layer may be a data layer of a single data stream. For example, the subscription status of the receiving ends 231, 233, 235, and 237 may be the first data stream 2〇1iLii, Lii and L12, Ln, and L12AL13, respectively. , L", the receiving ends 231, 233, 235, 237 can receive the same television content of the same television station with different clarity. For another example, only the first data layer L„, L21, L31, Lm of each data stream 2 (H, 203, 205, 207) may be included. If the necessary data layer is the first data layer 1^, L2i, L3i, L4i, which enables all 12 200824381 receiving end 23 to obtain the main information of data stream 2 (H, 203, 205, 207), even if the channel is in poor condition, only the receiving end of the necessary data layer can still receive Generally, the information stream 20 is to be conveyed. Generally speaking, the necessary data layer is transmitted by a speed, and the necessary data layer is compressed to the state of the highest fault tolerance to reduce the influence of communication quality.

—回到本實施例之必要資料層為訂閱狀態之内容之情形。接 著產生模組211便根據該等訂閱狀態221、223、225、227及接 收端23卜233、235、237之通道狀況回報產生複數個可能傳送 、、且a以第一接收化231之§丁閱狀態221為例,根據訂閱狀離 22卜第-接收端231已接收了必要資料層£11紅12, 接收之部分為LD及L〗4。同理,根據訂閱狀態225,第三接收端 235尚未接收之部分為L22、L23及La;而根據訂閱狀態227,第 四接收端237尚未接收L34。然而,基地台25判斷接 31、 233、235、237之通道狀況中,第三接收端235較差,僅接 收第二資料層La其他接收端231、235、237之通道狀況 j故可能:組$如下表所示,共有u種可能傳送組 合,其中…」代表不傳送。- Return to the case where the necessary data layer of the embodiment is the content of the subscription status. Then, the generating module 211 generates a plurality of possible transmissions according to the channel status reports of the subscription statuses 221, 223, 225, 227 and the receiving end 23, 233, 235, 237, and a is the first receiving 231. For example, in the read state 221, the necessary data layer £11 red 12 has been received according to the subscription status, and the received portions are LD and L4. Similarly, according to the subscription status 225, the portions that the third receiving end 235 has not received are L22, L23, and La; and according to the subscription status 227, the fourth receiving end 237 has not received L34. However, the base station 25 determines that the channel status of the connection 31, 233, 235, and 237 is poor, and the third receiving end 235 is inferior, and only receives the channel status of the other receiving ends 231, 235, and 237 of the second data layer La. As shown in the following table, there are a total of possible combinations of transmissions, where ..." means no transmission.

13 訂閱狀態 第一可能傳 送組合 第二可能傳 送組合 第三可能傳 送組合 第四可能傳 第一接收端 …—· -13 Subscription status First possible transmission combination Second possible transmission combination Third possible transmission combination Fourth possible transmission First receiving end ...—·

Lh 及 L12Lh and L12

L l13 及 l14 一接啤端 ^41 x L42 ^^^43^X44 第三接收t L21 ------ -— 第四接收端 L31、L32及 L33 L22 — J--—---^ L34 13 200824381 送組合 第五可能傳 送組合 l13 --- L22 -一- 第六可能傳 送組合 Ll3 — L34 第七可能傳 送組合 L13 及 Li4 --- L22 — 第八可能傳 送組合 l13 及 l14 --- --- L34 第九可能傳 送組合 — L22 L34 第十可能傳 送組合 Ll3 --- L22 L34 第十一可能 傳送組合 L13 及 L14 ~- 丨 --- L22 L34 、計^模組213先對各個可能傳送組合計算一滿意度及一資 ,消耗量。各該可能傳送組合之滿意度係藉由Σ:!»心此式算 ^。於上述式子中,&為各該可能傳送組合所包含之至少一層 Φ 資料層之索引,%係為各該可能傳送組合所包含之至少一資料 層之數目,ζ·為各該可能傳送組合之索引,4係為各該可能傳送 組合之各該至少一資料層之一權重,4係為各該可能傳送組合 之各該至少一資料層所對應之接收端23之數目。其中,權重< 係為一預先設定之參數,與資料層之一峰值訊號雜訊比(peak signal to noise ratio, PSNR)有關。於其他實施例中,權重4亦 可由一平均意見分數(mean 0pini〇n sc〇re,M〇s)、一節目影像 資料晝素取樣比例、一節目影像資料畫質或其組合決定。再 者’圮之值係關於各該接收端23之一接收能力,具體而言,為 接收端之通道狀況之訊號雜訊比(signal t〇 n〇ise rati〇, SNR)。於 其他貝例中’〜之值亦可由一突發脈衝屬性(burst pr〇nie)、 200824381 一編解碼訊息(codec information)或其組合所決定,其中突笋脈 衝屬性係適用於WiMAX之傳輸服務,編解碼訊息係適用 他網路傳輸服務。 ;L l13 and l14 one beer end ^41 x L42 ^^^43^X44 third receiving t L21 ------ -- fourth receiving end L31, L32 and L33 L22 — J------^ L34 13 200824381 Send combination fifth possible transmission combination l13 --- L22 - one - sixth possible transmission combination Ll3 - L34 seventh possible transmission combination L13 and Li4 --- L22 - eighth possible transmission combination l13 and l14 --- --- L34 ninth possible transmission combination - L22 L34 tenth possible transmission combination Ll3 --- L22 L34 eleventh possible transmission combination L13 and L14 ~- 丨--- L22 L34, meter ^ 213 first for each possible The transmission combination calculates a satisfaction and a capital and consumption. The satisfaction of each of the possible delivery combinations is calculated by Σ:!»心. In the above formula, & is an index of at least one Φ data layer included in each of the possible transmission combinations, and % is the number of at least one data layer included in each of the possible transmission combinations, 为· for each possible transmission The index of the combination, 4 is the weight of each of the at least one data layer of each of the possible transmission combinations, and 4 is the number of the receiving ends 23 corresponding to each of the at least one data layer of each of the possible transmission combinations. Wherein, the weight < is a preset parameter, which is related to a peak signal to noise ratio (PSNR) of the data layer. In other embodiments, the weight 4 can also be determined by an average opinion score (mean 0pini〇n sc〇re, M〇s), a program image data pixel sampling ratio, a program image data quality, or a combination thereof. The value of the 圮 is related to the receiving capability of each of the receiving terminals 23, specifically, the signal to noise ratio (SNR) of the channel condition of the receiving end. In other cases, the value of '~ can also be determined by a burst attribute (burst pr〇nie), 200824381 a codec information or a combination thereof, wherein the sudden pulse attribute is applicable to the transmission service of WiMAX. The codec message is suitable for his network transmission service. ;

以第十一可能傳送組合為例,為4,代表含有四個資料 層(L!3、L〗4、La、L34),這四個資料層的每一個都有相對應'之 一個權重。本實施例中,不論是哪個資料串流,第一資料^ 權重為60%,第二資料層之權重為25%,第三資料層之權士為 10%,而第四資料層之權重為5%。因此,第十一可^傳送組合 之四個資料層L!3、LM、L22、所對應之權重分別為1〇%、5%、 25%、5%。另一方面,這四個資料層^广^广^广^彳的每 二個亦有一相對應之接收端數目4。由於本實施例考慮之因素 較為簡單,故此數值皆為丨。若假設第四接收端237訂閱^ =流201而非第三資料串流205 ’則此時&會被^取代,則 弟十一種可能組合之資料層相對應之接收端數目為2。、 貧源消耗量⑻代表了各個可能傳送組合之消耗資源量, ϋ頻寬有關,對本實施例之第-資料串流2G1而言,第 祖L料層L"、L21、L31、“1之消耗資源量皆為4GbPs,第二資 ;\12、1^22、1^2、1^2之消耗資源量皆為301^,第三資料層 T 13、/3 L、1)、L13之消耗育源量為2Gbps’第四資料層lh、L24、 界3U^Bfpf源量為lGbps。若於另—實施例中定義網路資 原',取¥間’則此網路資源則為一時槽⑽數。 耗量f依求得之各該滿意度及相對應之資源消 下1 傳,組合之效用比值,所根據之關係式如 當每增加-個接& 能傳送組合之效用比值’ 達到資料串流傳輸i用最^ 了如何使用-定的資源繼 、取挺組215係用以選取該等效用比值《最大者相對應之 15 200824381 U傳送組合為-選取組合,亦即採用某 達到之最大效用。選取以傳工 :考該纽用比值最大者姆應之可能傳独次ς 消耗1是否小於當時的網路資源,換句話說,當現下二U ,不夠提供給選取組合所需的資源消,^分配事置貝 Ϊ選取效用比值次之的可能傳送組合,且此效 合之資源消耗量小於當時的網路資源。本實施例 基地〇傳达必要資料層至接收端23卜233、235、2 ^網路賴為14Gbps,資源雜量 =人 23;(;傳輸種第流2〇3之第二資料層 次极傳賴組217便根據通道狀況將選取組合所包含之 η ίίί對應之編碼壓縮’以不同容錯率和不同傳輸速率 收:二接,23 ’亦即將第二資料層L22傳輸至第 ^玄。一般而g,通道狀況較佳者,其容錯率低且傳 輸速率快,通道狀況較差者,其容錯率高且傳輸速率慢。 接著產生模組211可再次根據已傳送之最大效用選取組合 =收端23之通道狀況回報產生另一複數個可能傳送組合。計 ^模組213JT對此另-複數個可能傳送組合中的各者計算一滿 ^ f t ΐ源消耗量,並依求得之各該滿意度及相對應之資源 螭耗1計鼻各該可能傳送組合之效用比值。 难、、,選取模組215可再選取該等效肢值最大者減應之可能 傳送組合為一選取組合。之後,傳送模組217便將此最大效用 之廷取組合所包含之資料層進行壓縮編碼後,傳送至其相對應 之接收端23。 資源分配裝置21可不斷進行產生、計算、選取及傳送之動 作,直至最後選取之可能傳送組合之資源消耗量小於或等於當 16 200824381 =供給之網路資源,換句話說,當剩餘的網路資源不足以供 ί 或是網路資源以供應完 J。貝私配裝置21便不再進行㈣分配,停止㈣串流之傳 、本發明之第二實施例如第3圖所示,係為一 法,其稭麟㈣傳送魏個資料m數個各 :訂閱狀態之接收端。各該資料串流包含複數個資=自^ =狀與各該㈣串流之該等#料層相各I : 合包含該等資料層中之至少-層,而至少組Taking the eleventh possible transmission combination as an example, it is 4, which represents four data layers (L!3, L, 4, La, L34), and each of the four data layers has a corresponding weight. In this embodiment, regardless of which data stream, the first data ^ weight is 60%, the second data layer weight is 25%, the third data layer is 10%, and the fourth data layer weight is 5%. Therefore, the weights of the four data layers L!3, LM, and L22 of the eleventh transmission combination are 1%, 5%, 25%, and 5%, respectively. On the other hand, each of the four data layers has a corresponding number of receiving ends of four. Since the factors considered in this embodiment are relatively simple, the values are all 丨. If it is assumed that the fourth receiving end 237 subscribes to the ^=stream 201 instead of the third data stream 205', then & will be replaced by ^, then the number of receiving ends corresponding to the data layers of the eleven possible combinations is two. The lean source consumption (8) represents the amount of consumed resources of each possible transmission combination, and is related to the bandwidth. For the first data stream 2G1 of this embodiment, the first ancestor L layer L", L21, L31, "1 The consumption of resources is 4GbPs, the second resource; the consumption resources of \12, 1^22, 1^2, and 1^2 are all 301^, and the third data layer T 13 , /3 L, 1), L13 The source of consumption is 2 Gbps. The fourth data layer lh, L24, and the boundary of 3U^Bfpf are 1 Gbps. If the network resource is defined in another embodiment, the network resource is one time. The number of slots (10). The consumption f is determined by the satisfaction and the corresponding resources are eliminated, and the combined utility ratio is based on the relationship ratio, such as the ratio of the utility of each combination. 'To achieve the data stream transmission i use the most ^ how to use - the set of resources, take the group 215 to select the equivalent ratio "the largest corresponds to the 15 200824381 U transmission combination is - select combination, that is, The most effective effect of a certain one. Select to pass the work: test the maximum ratio of the newcomer, M. Ying, may pass the single time. Consumption 1 is less than the time. Road resources, in other words, when the next two U, is not enough to provide the resources needed to select the combination, ^ allocates the possible transmission combination of the second choice utility ratio, and the resource consumption of this effect is less than the current Network resources. In this embodiment, the base transmits the necessary data layer to the receiving end 23 233, 235, 2 ^ network depends on 14 Gbps, resource noise = person 23; (; transmission type stream 2 〇 2 second The data hierarchy is based on the channel status. The encoding compression of the selected η ί 包含 包含 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以 以In general, g, the channel condition is better, the fault tolerance rate is low and the transmission rate is fast, and the channel condition is poor, the fault tolerance rate is high and the transmission rate is slow. Then the generation module 211 can select the combination according to the maximum utility transmitted again. = The channel status report of the receiver 23 generates another plurality of possible transmission combinations. The module 213JT calculates a full ft source consumption for each of the other multiple possible transmission combinations, and obtains the desired Each satisfaction The corresponding resource consumption 1 counts the possible utility ratio of each of the possible combinations. Difficult, the selection module 215 can select the possible transmission combination of the largest equivalent limb reduction to a selected combination. The module 217 compresses and encodes the data layer included in the maximum utility combination, and transmits it to its corresponding receiving end 23. The resource allocation device 21 can continuously generate, calculate, select, and transmit until The resource consumption of the last possible possible transmission combination is less than or equal to 16 200824381 = supply network resources, in other words, when the remaining network resources are insufficient for ί or network resources to supply J. The private distribution device 21 will no longer perform (4) distribution, stop (four) streaming, and the second embodiment of the present invention, as shown in FIG. 3, is a method in which the straw (four) transmits Wei data m: The receiving end of the subscription status. Each of the data streams includes a plurality of resources = from the ^ = shape and each of the (four) streams of the # layer layers, each of which comprises at least a layer of the data layers, and at least the group

少-該等接收端。本實施例係用於二基 ,用WiMAX通訊協定進行無線網路 ;= =直一路通訊協定,同時,傳以 ㈣首先,第f實施例執行步驟301 ’根據各該訂閱狀態傳送相 之-必要⑽層至補應之接收端,該等資料層包含各 =料層。具體而言,本實施例之每—接收端所接收之必要g 層為其相對應之訂閱狀態中所記錄之該些資料層。接 并; 303,根據該等訂閱狀態產生複數個可能傳送組合。 於步驟305中,對各該可能傳送組合計算一滿音产及一次 量。具體而言,步驟305係根據Σ:(心心此g算滿J $ j為各該可能傳送組合所包含之至少一層資料層之索引,二 係為各該可能傳送組合所包含之至少一資料層之數目纟為各二 傳送組合之索引,4係為各該可能傳送組合之各該2少二 資料層之一權重,4係為各該可能傳送組合之各該至^一^^ 層所對應之接收端之數目。上述之權重WH系與一PSNR相關^ 上述4之值係關於各該接收端之一接收能力,亦即接收能力係 關於一各該接收端鄉對應之通道狀況,通道狀況係關於一之 SNR。於其他實施例中,可利用一MOS、一節目影像資料書素 17 200824381Less - these receivers. This embodiment is for a two-base, wireless network using WiMAX communication protocol; = = direct one-way communication protocol, at the same time, passed (four) First, the f-th embodiment performs step 301 'transfer according to each of the subscription states - necessary (10) Layer to the receiving end of the replenishment, the data layers contain each material layer. Specifically, the necessary g layer received by each receiving end of the embodiment is the data layer recorded in the corresponding subscription state. And 303, generating a plurality of possible transmission combinations according to the subscription status. In step 305, a full sound production and a quantity are calculated for each of the possible transmission combinations. Specifically, step 305 is based on: (the heart is the index of at least one data layer included in the possible transmission combination, and the second is the at least one data layer included in each of the possible transmission combinations. The number is the index of each of the two transport combinations, and 4 is the weight of each of the 2 and 2 data layers of each of the possible transport combinations, and 4 is the corresponding to each of the possible transport combinations. The number of receiving ends, the weight WH is related to a PSNR. The value of the above 4 is related to the receiving capability of each of the receiving ends, that is, the receiving capability is related to the channel status corresponding to each receiving end, and the channel status. The SNR is related to one. In other embodiments, a MOS, a program image data can be utilized 17 200824381

-或其組合綠定。 _性與1解碼訊息其中之用比i驟,度及相對應之資源消耗量計算一效 11 # 步驟:尽 ,及,其中式為各該可能傳送組合之效用比 係各該可能傳送組合之滿意度,以及域為各該 =傳达、、且s之雜資源量’其中消耗資源量與頻寬或時槽數 相關。 然後執行步驟309,選取該等效用比值曷最大者相對應之 可能傳送組合為一選取組合。最後,在步驟311中,傳送^取 組合所包含之資料層至其相對應之接收端。 除了第3圖顯示的步驟以外,第二實施例係能執行在第一實施 j中所述之所有操作或功能。熟習此項技術人士可直接瞭解第二 實,例如何基於上述第一實施例以執行此等操作及功能。因此, 此等操作及功能的描述係屬冗餘,於此不再重覆。- or a combination of green. _ Sex and 1 decoded message, which is calculated by using the ratio, the degree, and the corresponding resource consumption. 11 #Steps: and, where, the utility of each of the possible transmission combinations is the possible transmission combination. Satisfaction, as well as the domain for each = communication, and s miscellaneous resources 'where the amount of resources consumed is related to the bandwidth or the number of slots. Then, in step 309, the possible combination of the equivalent ratios 曷 is selected as a selected combination. Finally, in step 311, the data layer included in the combination is transmitted to its corresponding receiving end. The second embodiment is capable of performing all of the operations or functions described in the first embodiment j, except for the steps shown in FIG. Those skilled in the art will be able to directly understand the second embodiment, how to perform such operations and functions based on the first embodiment described above. Therefore, the description of such operations and functions is redundant and will not be repeated here.

本發明之第三實施例係為另外一種藉由一網路資源傳送複 數個資料串流至複數個各自具有一訂閱狀態之接收端之資源 分配方法’此方法係應用於第一實施例之資源分配裝置21。本 實施例係透過一 WiMAX技術進行無線網路群播傳送。 首先執行步驟301,令傳送模組217根據各該訂閱狀態傳送相 對應之一必要資料層至相對應之接收端,該等資料層包含必要資 料層。接著執行步驟303,令產生模組211根據該等訂閱狀態產 生複數個可能傳送組合。於步驟305中,令計算模組213對各該 可能傳送組合計算一滿意度及一資源消耗量,此處之計算方式 與前述之實施例相同,故不贅述。步驟307係令計算模組213 對各該滿意度及相對應之資源消耗量計算一效用比值,其中資 200824381 $屬S ϋ網2源:此處之計算方式亦與前述之實施例相 用比值田後執行步驟309,令選取模組215選取該等效 :對應之接::送模組2π傳送選取組合所包含之資料層至其 之所外’第三實施例係能執行在第—實施例中所述 :熟習此項技術人士可直接瞭解第三實施例如 及ir的2^—以執行此等操作及功能。因此,此等操作 及功此的描述係屬冗餘,於此不再重覆。 置安j由應用程式來具體實現,亦即資源分配裝 式以執行前述之方法。而這些應用程式亦可 碟:以§:2體^電腦可讀取,可以是軟碟、硬碟、光 易思及具有姉I能之館取之浦庫或熟悉此技術者可輕 此,送’但本發明並不限於 之適用於—至多層的即時或非即時串流編 W 4視視訊、影音等)之其他實施態樣。 資料 流之資 串流資源、接收端之網路通道狀況、 到系統的高彈性與資源的高效益 上述之 糾金从ΛΑ ^到有’编77配,避免無線廣播的資源浪費,達 月之技術特徵,並非用來限制本發明之範 4擇本叙 ,易,之改變或均等性之安排均屬於本發^&=匕,術者 本赉明之權利範圍應以申請專利範圍為準。 、乾圍, 19 200824381 【圖式簡單說明】 第1圖係為習知之語音辨識裝置之示意圖; 第2A圖係為本發明之第—杂 第2B_本發明之第; 及 以 第2C圖係為本發㈣—實―_‘二 第3圖係為本發明之第二實施例之流程圖。 【主要元件符號說明】 100、102、104 :通道 101 :多媒體資料串流 103、103a、103b、l〇3c、103d :資料層 105、107、109 :通道 11 :傳送端 131、133、135 :客戶端The third embodiment of the present invention is another resource allocation method for transmitting a plurality of data streams to a plurality of receiving ends each having a subscription state by using a network resource. This method is applied to the resources of the first embodiment. Distribution device 21. This embodiment performs wireless network multicast transmission through a WiMAX technology. First, step 301 is executed to enable the transmission module 217 to transmit a corresponding necessary data layer to the corresponding receiving end according to each of the subscription states, and the data layers include the necessary information layer. Then, step 303 is executed to enable the generating module 211 to generate a plurality of possible transmission combinations according to the subscription status. In step 305, the calculation module 213 calculates a satisfaction degree and a resource consumption amount for each of the possible transmission combinations. The calculation method here is the same as the foregoing embodiment, and therefore will not be described again. Step 307 is to cause the calculation module 213 to calculate a utility ratio for each of the satisfaction and the corresponding resource consumption, wherein the resource 200824381$ belongs to the S network 2 source: the calculation method here is also compared with the foregoing embodiment. Step 309 is performed to enable the selection module 215 to select the equivalent: the corresponding connection: the delivery module 2π transmits the data layer included in the selected combination to the other side. The third embodiment can be executed in the first implementation. For example, those skilled in the art can directly understand the third embodiment, such as ir, and the ir to perform such operations and functions. Therefore, the description of such operations and operations is redundant and will not be repeated here. The security is implemented by the application, that is, the resource allocation device to perform the aforementioned method. These applications can also be used to read: §: 2 body ^ computer readable, can be floppy disk, hard disk, light easy to think and have a library of 姊 I can take the library or familiar with this technology can be light, Sending 'but the invention is not limited to other implementations of - to multi-layer instant or non-instant streaming, W 4 video, video, etc.). The streaming resources of the data stream, the network channel status of the receiving end, the high flexibility of the system and the high efficiency of the resources, the above-mentioned gold corrections from the ΛΑ ^ to the 'code 77 allocation, to avoid the waste of wireless broadcasting resources, reaching the moon The technical features are not intended to limit the scope of the invention, and the changes or the equivalents of the inventions belong to the present invention. The scope of the claims of the present invention shall be determined by the scope of the patent application. 19 200824381 [Simplified illustration of the drawings] Fig. 1 is a schematic diagram of a conventional speech recognition device; Fig. 2A is a second embodiment of the invention - the second embodiment of the invention; and the second embodiment The present invention is a flow chart of a second embodiment of the present invention. [Description of main component symbols] 100, 102, 104: Channel 101: multimedia data stream 103, 103a, 103b, l3c, 103d: data layer 105, 107, 109: channel 11: transmitting terminals 131, 133, 135: Client

2:網際網路協定電視系統 20 :資料串流 201 :第一資料串流 203 ··第二資料串流 205 :第三資料串流 207 :第四資料串流 21 :資源分配裝置 200824381 211 :產生模組 213 :計算模組 215 :選取模組 217 :傳送模組 22、22卜 223、225、227 :訂閱狀態 23 :接收端 231 :第一接收端 233 :第二接收端 235 :第三接收端 237 :第四接收端 25 :基地台2: Internet Protocol Television System 20: Data Stream 201: First Data Stream 203 · Second Data Stream 205: Third Data Stream 207: Fourth Data Stream 21: Resource Allocation Device 200824381 211: The generating module 213: the computing module 215: the selecting module 217: the transmitting module 22, 22, 223, 225, 227: the subscription state 23: the receiving end 231: the first receiving end 233: the second receiving end 235: the third Receiving end 237: fourth receiving end 25: base station

Ln、!^、!^、!^ :第一資料層 L12、L22、L32、L42:第二資料層 L13、L23、L33、L43 :第三資料層 L14、L24、L34、L44:第四資料層 21Ln,! ^,! ^,! ^ : First data layer L12, L22, L32, L42: Second data layer L13, L23, L33, L43: Third data layer L14, L24, L34, L44: Fourth data layer 21

Claims (1)

200824381 十、申請專利範圍: 1· -種藉由-網路資源傳送複數個資料串流至複數個各自具 有盯閱狀悲、之接收端之資源分配裝置,包含·· 一產生极組,用以根據該等訂閱狀態產生複數個可能 傳达組合,其中,各該資料串流包含複數個資料層,各該 c閱狀與各該資料串流之該等資料層相關,各該可能傳 ⑩ 魏合包含該等資料層中之至少-層,該至少-層中之每 -層分賴應到至少―該等接收端; 一計算模組,用以對各該可能傳送組合計算一滿意度 及一資源消耗量,以及用以對各該滿意度及相對應之該資 源肩耗1冲异一效用比值,其中該資源消耗量小於該網路 資源;200824381 X. The scope of application for patents: 1 - A resource distribution device that transmits a plurality of data streams to a plurality of receiving ends that are stalked by a network resource, including a generating group, Generating a plurality of possible communication combinations according to the subscription status, wherein each of the data streams includes a plurality of data layers, each of which is associated with the data layers of each of the data streams, each of which may be transmitted Weihe includes at least a layer of the data layers, each of the at least one layers being assigned to at least the receiving ends; a computing module for calculating a satisfaction level for each of the possible transmission combinations And a resource consumption amount, and a ratio of the utility of the resource for each satisfaction and corresponding resource consumption, wherein the resource consumption is less than the network resource; %取模組’用以選取該等效用比值最大者相對應之 可能傳送組合為一選取組合;以及 一傳送模組’用以傳送該選取組合所包含之資料層至 其相對應之接收端。 2·如凊求項1所述之資源分配裝置,其中該計算模組係根據 下列關係式計算各該可能傳送組合之該效用比值·· 尺=The % module is used to select the possible transmission combination corresponding to the largest equivalent ratio as a selected combination; and a transmission module' is used to transmit the data layer included in the selected combination to its corresponding receiving end. 2. The resource allocation device of claim 1, wherein the computing module calculates the utility ratio of each of the possible delivery combinations according to the following relationship: &amp;,其中z•為各該可能傳送組合之索引,A:為各 該可能傳送組合所包含之至少—層資料層之索引, A為各該 1 200824381 :能傳送組㈣效_,Σχ)係細可 合之該滿意度,^係為各該可能傳送組合所包含之至= 資料層之數目,4係為各該可能傳送組合之各該1少—^ 層之-權重,4係為各該可能傳送組合之各—二 層所對應之接收端之數目,以及&amp;係為各該可能傳送^ 之該消耗資源量。 ϋ _ 3.如請求項!所述之資源分配裝置,其中該傳送模組更用以 根據各該訂閱狀態傳送相對應之—必要資料層至相對應之接 收端’該等資料層包含該必要資料層。 4. 如請求項2所述之資源分配裝置,其中該權重⑽關於一 峰值Λ號雜訊比(peak Signal t〇 n〇ise rati〇, PS服)與一平均 意見分數(mean opinion score,MOS)其中之一或其組合。 5. 如請求項2所述之資源分配裝置,其中該接收端之數目4之 _ 值係關於各該接收端之一接收能力。 6·如请求項5所述之資源分配裝置,其中該接收能力係關於 一通道狀況。 7·如請求項6所述之資源分配裝置,其中該通道狀況係關於 一 sfl號雜訊比(signai t0 n〇ise rati〇, snR)與一突發脈衝屬性 (burst profile)其中之一或其組合。 8·如請求項2所述之資源分配裝置,其中該資源消耗量及係 關於一頻寬與一時槽(time slot)數其中之一。 2 200824381 9·如請求項1所述之資源分配裝置,其中該裝置係用於無線 網路直播(unicast)、群播扣此以却與廣播扣⑽如㈣其中之 〇 10. 如請求項1所述之資源分配裝置,其中該裝置係用於一基 地台。 11. 如請求項1所述之資源分配裝置,其中該裝置係透過一微 波存取全球互通(Worldwide Interoperability for Microwave Access,WiMAX)技術進行傳送。 12· —種藉由一網路資源傳送複數個資料串流至複數個各自具 有一訂閱狀態之接收端之資源分配方法,包含下列步驟: 根據該等訂閱狀態產生複數個可能傳送組合,其中, 各該資料串流包含複數個資料層,各該訂閱狀態與各該資 料串流之該等資料層相關,各該可能傳送組合包含該等資 料層中之至少一層,該至少一層中之每一層分別對應到至 少一該等接收端; 對各該可能傳送組合計算一滿意度及一資源消耗量; 對各該滿意度及相對應之該資源消耗量計算一效用比 值’其中該資源消耗量小於該網路資源; 選取該等效用比值最大者相對應之可能傳送組合為一 選取組合;以及 傳送該選取組合所包含之資料層至其相對應之接收 3 200824381 13·如請求項12所述之資源分配方法,纟中對各該滿意度及相 對應之該資源消耗量計算-效用比值之步驟係根據下列關 係式計算:卜ΙΣΧ%,其中ζ•為各該可能傳送組合之 索引’ Α為各該可能傳送組合所包含之至少一層資料層之索 引’ A為各該可能傳送組合之該效用比值,Σ:!&gt;〖χ心係各 _ 該可能傳送組合之該滿意度,%係為各該可能傳送組合所 包含之至少一資料層之數目係為各該可能傳送組合之各 該至少一資料層之一權重,4係為各該可能傳送組合之各 该至少一資料層所對應之接收端之數目,以及取係為各該 可能傳送組合之該消耗資源量。 14·如請求項12所述之資源分配方法,更包含根據各該訂閱狀 態傳送相對應之一必要資料層至相對應之接收端,該等資料層 • 包含該必要資料層。 15·如請求項13所述之資源分配方法,其中該權重%係關於一 PSNR與一 MOS其中之一或其組合。 16·如請求項13所述之資源分配方法,其中該接收端之數目4 之值係關於各該接收端之一接收能力。 Π·如請求項16所述之資源分配方法,其中該接收能力係關於 一通道狀況。 18·如請求項17所述之資源分配方法,其中該通道狀況係關於 4 200824381 一 SNR與一突發脈衝屬性其中之一或其組合。 19·如請求項13所述之資源分配方法,其中該資源消耗量及 係關於一頻寬與一時槽數其中之一。 20·如請求項12所述之資源分配方法,其中該方法係用於無線 網路直播、群播與廣播其中之一。 '' 21.如請求項12所述之資源分配方法,其中該方法係用於一基 地台。 籲 22·如請求項12所述之資源分配方法,其中該方法係透過_ WiMAX技術進行傳送。 23· —種令一資源分配裝置藉由一網路資源傳送複數個資料串 流至複數個各自具有一訂閱狀態之接收端之資源分配方 法,該資源分配裝置包含一產生模組、一計算模組、一選 取模組以及一傳送模組,該資源分配方法包含下列步驟: _ 令該產生模組根據該等訂閱狀態產生複數個可能傳送 組合,其中,各該資料串流包含複數個資料層,各該訂閱 狀態與各該資料串流之該等資料層相關,各該可能傳送組 合包含該等資料層中之至少—層,該至少―層中之每—層 分別對應到至少一該等接收端; 令該計算模組對各該可能傳送組合計算一滿意度及一 資源祕量’以及用以對各該滿意度及相對應之該資源消 耗量計算-效用比值,其中該資源消耗量小於該網路資源; 5 200824381 令該選取模組選取該等效用比值最大者相對應之可能 傳送組合為一選取組合;以及 令該傳送模組傳送該選取組合所包含之資料層至其相 對應之接收端。 24·如明求項23所述之資源分配方法,其中該計算模組係根據 下列關係式計算各該可能傳送組合之該效用比值··&amp;, where z• is the index of each of the possible transmission combinations, A: is the index of at least the layer data layer included in each of the possible transmission combinations, A is each of the 1 200824381: can transmit group (four) effect _, Σχ) The satisfaction is fine, and the number of data layers included in each of the possible transmission combinations is 4, and the number of each of the possible transmission combinations is 1 - the weight of the layer - 4 is Each of the possible transmission combinations - the number of receiving ends corresponding to the second layer, and &amp; is the amount of the consumed resources of each of the possible transmissions. ϋ _ 3. As requested! The resource allocation device, wherein the transmission module is further configured to transmit a corresponding-required data layer to a corresponding receiving end according to each of the subscription states, wherein the data layers include the necessary data layer. 4. The resource allocation device of claim 2, wherein the weight (10) is about a peak signal tick ratio (speaking signal) and a mean opinion score (mean opinion score, MOS) ) one or a combination thereof. 5. The resource allocating device of claim 2, wherein the number of _ values of the receiving end is about one of the receiving capabilities of each of the receiving ends. 6. The resource allocation device of claim 5, wherein the receiving capability is related to a channel condition. 7. The resource allocation device of claim 6, wherein the channel status is related to one of a sfl number of noise ratios (signai t0 n〇ise rati〇, snR) and a burst profile (burst profile) or Its combination. 8. The resource allocation device of claim 2, wherein the resource consumption amount is one of a bandwidth and a number of time slots. 2. The resource allocation device of claim 1, wherein the device is used for wireless network broadcast (unicast), group broadcast button, and broadcast button (10) as in (4) among them 10. The resource allocation device, wherein the device is for a base station. 11. The resource allocation device of claim 1, wherein the device transmits via a Worldwide Interoperability for Microwave Access (WiMAX) technology. a resource allocation method for transmitting a plurality of data streams to a plurality of receiving ends each having a subscription state by a network resource, comprising the steps of: generating a plurality of possible transmission combinations according to the subscription status, wherein Each of the data streams includes a plurality of data layers, each of the subscription states being associated with the data layers of each of the data streams, each of the possible transmission combinations including at least one of the data layers, each of the at least one layer Corresponding to at least one of the receiving ends respectively; calculating a satisfaction level and a resource consumption amount for each of the possible transmission combinations; calculating a utility ratio for each of the satisfaction levels and the corresponding resource consumption amount, wherein the resource consumption amount is less than The network resource; selecting the possible transmission combination corresponding to the largest equivalent ratio as a selected combination; and transmitting the data layer included in the selected combination to its corresponding receiving 3 200824381 13 · as described in claim 12 Resource allocation method, the step of calculating the ratio-utility ratio for each of the satisfaction and the corresponding resource consumption is based on Relational calculation: ΙΣΧ%, where ζ• is the index of each of the possible transmission combinations Α is the index of at least one data layer included in each of the possible transmission combinations' A is the utility ratio of each of the possible transmission combinations, Σ The number of at least one data layer included in each of the possible transmission combinations is the number of each of the at least one data layer of each of the possible transmission combinations. One of the weights, 4 is the number of receiving ends corresponding to each of the at least one data layer of each of the possible transmission combinations, and the amount of the consumed resources for each of the possible transmission combinations. The resource allocation method of claim 12, further comprising transmitting a corresponding one of the necessary data layers to the corresponding receiving end according to each of the subscription states, wherein the data layer comprises the necessary data layer. The resource allocation method of claim 13, wherein the weight % is related to one or a combination of a PSNR and a MOS. The resource allocation method according to claim 13, wherein the value of the number 4 of the receiving ends is related to the receiving capability of each of the receiving ends. The resource allocation method of claim 16, wherein the receiving capability is related to a channel condition. 18. The resource allocation method of claim 17, wherein the channel condition is one of or a combination of an SNR and a burst characteristic of 4 200824381. The resource allocation method according to claim 13, wherein the resource consumption amount is one of a bandwidth and a time slot number. 20. The resource allocation method of claim 12, wherein the method is for one of wireless network live broadcast, group broadcast, and broadcast. The resource allocation method of claim 12, wherein the method is for a base station. The resource allocation method of claim 12, wherein the method is transmitted by _WiMAX technology. a resource allocation device for transmitting a plurality of data streams to a plurality of receiving ends each having a subscription state by a network resource, the resource allocation device comprising a generating module, a computing module The resource allocation method comprises the following steps: _ causing the generating module to generate a plurality of possible transmission combinations according to the subscription status, wherein each data stream comprises a plurality of data layers Each of the subscription states is associated with the data layers of each of the data streams, each of the possible transmission combinations including at least one of the data layers, each of the at least one layers corresponding to at least one of the layers a receiving end; causing the computing module to calculate a satisfaction level and a resource secret amount for each of the possible transmission combinations and calculating a ratio-utility ratio for each of the satisfaction and the corresponding resource consumption amount, wherein the resource consumption amount Less than the network resource; 5 200824381 Let the selection module select the possible transmission combination corresponding to the largest equivalent ratio as a selection combination; The transmitting module transmits the data layer included in the selected combination to its corresponding receiving end. The resource allocation method according to claim 23, wherein the calculation module calculates the utility ratio of each of the possible transmission combinations according to the following relationship: 尽—1Σμ(, ,其中;·為各該可能傳送組合之索引,灸為各 該^能傳送組合所包含之至少一層資料層之索引,福各該 I能傳送組合之該效用比值,Σ:χ)係各該可能傳送組 合之該滿意度,Μ係為各該可能傳送組合所包含之至少一 貧料層之數目,4係為各該可能傳送組合之各該至少一資料 層之-權重,4係為各該可能傳送組合之各該至少一資料 層所對應之接_之數目,以及_為各該可能傳送組合 之該消耗資源量。 Α如請求項23所述之資源分配方法,更包含令該傳送模組根 據各該訂祕軸對應之一必要:# 至姆應之接收 ^之步驟’其中該等資料層包含該必要資料層。 26.=1項24所述之資源分配方法,其中_紅係關於一 烈胤與―M〇s其中之-或其組合。 2^求項24所狀瓣_,射㈣ 之值係關於各該接收端之一接收能力。 6 200824381 28·如請求項27所述之資源分配方法,其中該接收能力係關於 一通道狀況。 29·如請求項28所述之資源分配方法,其中該通道狀況係關於 一 SNR與一突發脈衝屬性其中之一或其組合。 30.如請求項24所述之資源分配方法,其中該資源消耗量岛 係關於一頻寬與一時槽數其中之一。 31·如請求項23所述之資源分配方法,其中該方法係用於無線 網路直播、群播與廣播其中之一。 32·如請求項23所述之資源分配方法,其中該資源分配裝置係 用於一基地台。 33·如請求項23所述之資源分配方法,其中該方法係透過一 WiMAX技術進行傳送。 34.—種内儲於一資源分配裝置之應用程式,使該資源分配裝 置執行一資源分配方法,該資源分配裝置包含一產生模 組、一計算模組、一選取模組以及一傳送模組,該資源分 配方法藉由一網路資源傳送複數個資料串流至複數個各自 具有一訂閱狀態之接收端,該資源分配方法包含下列步驟: 々該產生拉組根據該等訂閱狀態產生複數個可能傳送 組合,其中,各該資料串流包含複數個資料層,各該訂閱 狀態與各該資料串流之該等資料層相關,各該可能傳送組 合包含該等資料層中之至少一層,該至少一層中之每一層 7 200824381 分別對應到至少一該等接收端; 令該計异模組對各該可能傳送組合計算一滿意度及一 貢源消耗量,以及用以對各該滿意度及相對應之該資源消 耗罝計异一效用比值,其中該資源消耗量小於該網路資源; 令該選取模組選取該等效用比值最大者相對應之可能 傳送組合為一選取組合;以及 令該傳送模組傳送該選取組合所包含之資料層至其相 對應之接收端。 35·如請求項34所述之應用程式,其中該計算模組係根據下列 關係式計算各該可能傳送組合之該效用比值: 火’其中ζ·為各該可能傳送組合之索引々為各 該可能傳送組合所包含之至少一層資料層之索引,《為各該 可月b傳送組合之該效用比值,係各該可能傳送組 合之該滿意度,%係為各該可能傳送組合所包含之至少一 資料層之數目,係為各該可能傳送組合之各該至少一資料 層之權重,4係為各該可能傳送組合之各該至少一資料 層所對應之接收端之數目,以及取係為各該可能傳送組合 之該消耗資源量。 36.如明求項34所述之應用程式,其中該資源分配方法更包含 令該傳送模組根據各該訂閱狀態傳送相對應之一必要資料層 至相對應之接收端之步驟,其中該等資料層包含該必要資料 8 200824381 層。 37·如請求項35所述之應用程式,其中該權重4係關於一 PSNR 與一 M〇s其中之一或其組合。 38·如請求項35所述之應用程式,其中該接收端之數目4之值 係關於各該接收端之一接收能力。 39.如請求項38所述之應用程式,其中該接收能力係關於一通 道狀況。 • 40·如請求項39所述之應用程式,其中該通道狀況係關於一 SNR與一突發脈衝屬性其中之一或其組合。 41 ·如請求項35所述之應用程式,其中該資源消耗量取係關於 一頻寬與一時槽數其中之一。 42·如請求項34所述之應用程式’其中該程式係用於無線網路 直播、群播與廣播其中之一。 43·如請求項34所述之應用程式,其中該資源分配裝置係用於 着 一基地台。 44·如請求項34所述之應用程式,其中該程式係透過一 WiMAX技術進行傳送。 45· —種電腦可讀取媒體,用以儲存一應用程式,該應用程式 使-貪源分配裝置執行-資源分配方法,該資源分配裝置 包含-產生模組、-計算模組、一選取模組以及一傳送模 μ ’該㈣分配方法藉由—網路:#源傳送複數個資料串流 9 200824381 至複數個各自具有—訂赚H之接收端,該聽分配方法 包含下列步驟: 令該產生模組根據該等訂閱狀態產生複數個可能傳送 組合,其中,各該資料串流包含複數個資料層,各該訂閱 狀態與各該資料串流之該等資料層相關,各該可能傳送組 合包含該等資料層中之至少一層,該至少一層中之每一層 刀別對應到至少一該等接收端;——————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————————满意度) the satisfaction of each of the possible delivery combinations, the number of at least one of the poor layers included in each of the possible delivery combinations, and 4 being the weight of each of the at least one data layer of each of the possible delivery combinations 4 is the number of connections corresponding to each of the at least one data layer of each of the possible transmission combinations, and _ is the amount of consumed resources of each of the possible transmission combinations. For example, the resource allocation method described in claim 23 further includes the step of: causing the transmitting module to correspond to one of the corresponding binding axes: #到姆应的步骤^的步骤' wherein the data layers include the necessary data layer . 26. The method of resource allocation according to item 24, wherein the _ red system is related to a scorpion and a ―M〇s- or a combination thereof. 2^ The value of the valence _, the shot (four) of the item 24 is the receiving capability of one of the receiving ends. The resource allocation method of claim 27, wherein the receiving capability is related to a channel condition. The resource allocation method of claim 28, wherein the channel condition is related to one or a combination of an SNR and a burst attribute. The resource allocation method of claim 24, wherein the resource consumption island is one of a bandwidth and a time slot number. The resource allocation method of claim 23, wherein the method is one of a wireless network live broadcast, a multicast broadcast, and a broadcast. The resource allocation method of claim 23, wherein the resource allocation device is for a base station. 33. The resource allocation method of claim 23, wherein the method is transmitted via a WiMAX technology. 34. An application stored in a resource allocation device, the resource allocation device performing a resource allocation method, the resource allocation device comprising a generation module, a calculation module, a selection module, and a transmission module The resource allocation method transmits a plurality of data streams to a plurality of receiving ends each having a subscription status by using a network resource, and the resource allocation method includes the following steps: the generating the pull group generates a plurality of the plurality according to the subscription status. a possible combination of transmissions, wherein each of the data streams includes a plurality of data layers, each of the subscription states being associated with the data layers of each of the data streams, each of the possible transmission combinations including at least one of the data layers, Each of the at least one layer 7 200824381 corresponds to at least one of the receiving ends; the counting module calculates a satisfaction and a tribute source consumption for each of the possible transmission combinations, and is used for each satisfaction and Corresponding to the resource consumption, a different utility ratio, wherein the resource consumption is less than the network resource; and the selection module selects the same The transfer may correspond to a maximum ratio combination by selecting a combination thereof; and enabling the transmitting module transmits the data layer comprising a combination of selected relative to a corresponding terminal of receiver. 35. The application of claim 34, wherein the computing module calculates the utility ratio for each of the possible delivery combinations according to the following relationship: Fire's index is the index of each of the possible delivery combinations It is possible to transmit an index of at least one data layer included in the combination, "the utility ratio for each of the monthly transferable combinations is the satisfaction of each of the possible delivery combinations, and the % is at least included in each of the possible transmission combinations. The number of data layers is the weight of each of the at least one data layer of each of the possible transmission combinations, and 4 is the number of receiving ends corresponding to each of the at least one data layer of each of the possible transmission combinations, and The amount of consumed resources of each of the possible transmission combinations. 36. The application of claim 34, wherein the resource allocation method further comprises the step of causing the transmitting module to transmit a corresponding one of the necessary data layers to the corresponding receiving end according to each of the subscription states, wherein the The data layer contains the necessary information 8 200824381 layers. 37. The application of claim 35, wherein the weight 4 is related to one or a combination of a PSNR and a M〇s. 38. The application of claim 35, wherein the value of the number of the receiving ends is one of the receiving capabilities of each of the receiving ends. 39. The application of claim 38, wherein the receiving capability is related to a channel condition. 40. The application of claim 39, wherein the channel condition is for one or a combination of an SNR and a burst attribute. 41. The application of claim 35, wherein the resource consumption is one of a bandwidth and a time slot. 42. The application of claim 34 wherein the program is for one of a wireless network live broadcast, a multicast broadcast, and a broadcast. 43. The application of claim 34, wherein the resource allocation device is for a base station. 44. The application of claim 34, wherein the program is transmitted via a WiMAX technology. 45. A computer readable medium for storing an application, the application causing a resource allocation device to perform a resource allocation method, the resource allocation device comprising a generation module, a calculation module, and a selection module The group and a transmission module [the (4) allocation method by the network: # source transmits a plurality of data streams 9 200824381 to a plurality of receiving ends each having a subscription fee H, the listening allocation method comprising the following steps: The generating module generates a plurality of possible transmission combinations according to the subscription status, wherein each of the data streams includes a plurality of data layers, and each of the subscription states is associated with the data layers of each data stream, and each of the possible transmission combinations Include at least one of the data layers, each of the at least one layer corresponding to at least one of the receiving ends; 令該計算模組對各該可能傳送組合計算一滿意度及一 資^祕量,以及用以對各該滿意度及相對應之該ί源消 耗量計算-效航值’其巾該=#_耗量小於酬路資源; 令該選取模組選取該等效用比值最大者相對應之可能 傳送組合為一選取組合;以及 b 令該傳送模組傳送該選取組合所包含之資料層至其相 對應之接收端。 ' 46.如請求項45所述之電腦可讀取媒體’其中該計算模組係根 據下關係式計算各該可能傳送組合之該效用比值: 《上=1(*火,其中,·為各該可能傳送組合之索引,灸為各 該可能傳送組合所包含之至少一層資料層之索引^為各該 可能傳送組合之該效用比值,係各該可能傳^ 合之該滿意度,祕為各該可能傳送組合所包含之至少— 資料層之數目,MH系為各該可能傳送組合之各該至少料 200824381 層之-權重,^係為各該可能傳送組合之各該至少一 層所對應之接收端之數目’以及&amp;係為錢可能傳送組人 之該消耗資源量。 ^ 47.如請求項45所述之電腦可讀取媒體,其中該資源分配方法 更包含令該傳送模組根據各該訂閱狀態傳送相對應之一必要 貢料層至相對應之接收端之步驟,其中該等資料層包含該必 資料層。 48·如請求項#所述之電腦可讀取媒體,其中該權重乂係關於 PSNR與—平均意見分數MOS其中之-或其組合。 49·如請求項46所述之電腦可讀取媒體,其中該接收端之數目 &lt;之值係關於各該接收端之一接收能力。 5〇·如明求項49所述之電腦可讀取媒體,其中該接收能力係關 於一通道狀況。 51.如μ求項5G所述之電腦可讀取媒體,其中該通道狀況係關 於一 SNR與—突發脈衝屬性其巾之-或其組合。 52 *^0 士主-j&gt; •明,項46所述之電腦可讀取媒體,其中該資源消耗量 A係關於_頻寬與—時槽數其中之一。 5 3 * jjg λ ^ $ 5所述之電腦可讀取媒體,其中該媒體係用於無 線網路直播、群播與廣播其中之一。 54· 言奮jg」《 〆、45所述之電腦可讀取媒體,其中該資源分配裝置 係用於一基地台。 200824381 55.如請求項45所述之電腦可讀取媒體,其中該媒體係透過一 W1MAX技術進行傳送。Having the computing module calculate a satisfaction level and a secret amount for each of the possible transmission combinations, and calculate the utility value for each of the satisfaction and the corresponding quotient consumption amount. _ consumption is less than the remuneration resource; the selection module selects the possible transmission combination corresponding to the largest equivalent ratio as a selected combination; and b causes the transmission module to transmit the data layer included in the selected combination to its phase Corresponding receiver. 46. The computer readable medium of claim 45, wherein the computing module calculates the utility ratio of each of the possible delivery combinations according to the following relationship: "Up=1 (* fire, wherein, for each The index of the possible transmission combination, the index of the at least one data layer included in each of the possible transmission combinations, the utility ratio of each of the possible transmission combinations, the satisfaction of each of the possible transmissions, and the secret At least the number of data layers included in the possible transmission combination, MH is the weight of each of the at least 200824381 layers of each of the possible transmission combinations, and is the reception corresponding to each of the at least one layer of each of the possible transmission combinations. The number of terminals 'and & is the amount of money that the money may transmit to the group. ^ 47. The computer readable medium of claim 45, wherein the resource allocation method further comprises: The subscription status conveys a step corresponding to one of the necessary tribute layers to the corresponding receiving end, wherein the data layer includes the mandatory data layer. 48. The computer readable medium as claimed in claim # The system is related to the PSNR and the average opinion score MOS, or a combination thereof. 49. The computer readable medium of claim 46, wherein the number of the receiving ends is a value for each of the receiving ends The computer readable medium of claim 49, wherein the receiving capability is related to a channel condition. 51. The computer readable medium as described in μ, 5G, wherein the channel The status is related to an SNR and a burst attribute, or a combination thereof. 52 *^0 士主-j&gt; • The computer readable medium described in item 46, wherein the resource consumption A is related to One of the _ bandwidth and the number of time slots. 5 3 * jjg λ ^ $ 5 The computer readable medium, wherein the medium is used for one of wireless live broadcast, group broadcast and broadcast. </ RTI> <RTIgt; </ RTI> <RTIgt; </ RTI> <RTIgt; </ RTI> <RTIgt; </ RTI> <RTIgt; </ RTI> <RTIgt; </ RTI> <RTIgt; A W1MAX technology is transmitted. 1212
TW095143328A 2006-11-23 2006-11-23 Resource allocation apparatus, method, application program, and computer readable medium thereof TWI333361B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
TW095143328A TWI333361B (en) 2006-11-23 2006-11-23 Resource allocation apparatus, method, application program, and computer readable medium thereof
US11/680,224 US8281008B2 (en) 2006-11-23 2007-02-28 Resource allocation apparatus, method, and computer readable medium thereof

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
TW095143328A TWI333361B (en) 2006-11-23 2006-11-23 Resource allocation apparatus, method, application program, and computer readable medium thereof

Publications (2)

Publication Number Publication Date
TW200824381A true TW200824381A (en) 2008-06-01
TWI333361B TWI333361B (en) 2010-11-11

Family

ID=39465051

Family Applications (1)

Application Number Title Priority Date Filing Date
TW095143328A TWI333361B (en) 2006-11-23 2006-11-23 Resource allocation apparatus, method, application program, and computer readable medium thereof

Country Status (2)

Country Link
US (1) US8281008B2 (en)
TW (1) TWI333361B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105187849B (en) * 2015-08-14 2018-06-12 合肥工业大学 A kind of method based on the distribution of the telescopic video multicast resource of D2D and cellular network

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5408244A (en) * 1991-01-14 1995-04-18 Norton Company Radome wall design having broadband and mm-wave characteristics
US6542481B2 (en) * 1998-06-01 2003-04-01 Tantivy Communications, Inc. Dynamic bandwidth allocation for multiple access communication using session queues
KR100288381B1 (en) * 1999-03-15 2001-04-16 윤종용 method for optimizing channel power allocation in B-CDMA WLL system
IL153298A0 (en) * 2000-06-20 2003-07-06 Nds Ltd Unicast/multicast architecture
US6891810B2 (en) * 2001-01-19 2005-05-10 Raze Technologies, Inc. Wireless access system and associated method using multiple modulation formats in TDD frames according to subscriber service type
FI114265B (en) * 2001-03-26 2004-09-15 First Hop Oy Methods and arrangements for realizing effective data transmission over a speed-limited communication link
KR100561867B1 (en) * 2003-03-07 2006-03-17 삼성전자주식회사 Apparatus and method for processing audio signal, and computer-readable recording media for storing computer program
WO2006135289A1 (en) * 2005-06-17 2006-12-21 Telefonaktiebolaget Lm Ericsson (Publ) Communication resource management
US7609614B2 (en) * 2005-10-20 2009-10-27 Trellis Phase Communications, Lp Uplink modulation and receiver structures for asymmetric OFDMA systems

Also Published As

Publication number Publication date
US20080126544A1 (en) 2008-05-29
TWI333361B (en) 2010-11-11
US8281008B2 (en) 2012-10-02

Similar Documents

Publication Publication Date Title
US7093028B1 (en) User and content aware object-based data stream transmission methods and arrangements
Bolot et al. Scalable feedback control for multicast video distribution in the internet
US8036125B2 (en) Apparatus and method for transmitting multimedia stream using virtual machines based on a number of transmissions at a data rate
US20210306405A1 (en) Apparatus and method for constant quality optimization for adaptive streaming
US9148386B2 (en) Managing bandwidth allocation among flows through assignment of drop priority
US20080077702A1 (en) Dynamic server stream allocation
US8395990B2 (en) Method and apparatus for streaming scalable multimedia data streams
CN102783170A (en) Bit rate adjustment in an adaptive streaming system
CN101075957A (en) Method for controlling AVS fluid-medium transmission
KR20040069360A (en) Targeted scalable video multicast based on client bandwidth or capability
WO2009043291A1 (en) A method, a system and a stratrgy and control server for implementing stream media service
WO2012072276A1 (en) Transport bit-rate adaptation in a multi-user multi-media conference system
Shaha et al. Multimedia content adaptation for QoS management over heterogeneous networks
US8374141B2 (en) Method and apparatus for allocating channel bandwidth in wireless internet protocol television systems
TW200824381A (en) Resource allocation apparatus, method, application program, and computer readable medium thereof
Wang et al. Wireless multicast for zoomable video streaming
Tang et al. Combining layer coding and bandwidth allocation for video distribution on content delivery networks
Yang et al. High performance adaptive video streaming using NDN WLAN multicast
Hsu et al. Optimal coding of multilayer and multiversion video streams
Zagar et al. Applications classification and QoS requirements
Lin et al. Video multicast with heterogeneous user interests in multi-rate wireless networks
Yang et al. Hybrid unicast and multicast video streaming using H. 264 SVC and FLUTE for set-top box users
CN105933241A (en) Network congestion adaption device and method in multimedia streaming transmission system
Liu et al. A SNR-based multi-channel multicast scheme for popular video in wireless networks
Wang et al. A QoE-aware video quality guarantee mechanism in 5g network

Legal Events

Date Code Title Description
MM4A Annulment or lapse of patent due to non-payment of fees