A hs-dsch capacity allocation method

A capacity allocation and user technology, applied in network traffic/resource management, electrical components, wireless communication, etc., can solve problems such as different quality of HS-DSCH shared channel air interface, different cache volume, different service signing rate, etc.

Inactive Publication Date: 2011-12-28
POTEVIO INFORMATION TECH CO LTD
View PDF4 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In the process of flow control, NodeB allocates shared resources and schedules data in units of users. The transmission of these data has the following characteristics: 1. Different users may perform different services, so the service QoS requirements and service signing rates may be different ;2. The air interface quality of the HS-DSCH shared channel of different users is different; 3. The buffering amount of different user data in NODEB is not the same
[0005] The aforementioned capacity application and allocation mechanism is carried out for all UEs under each CmCH-PI. RNC cannot know the credit status of different users, so the data sent by RNC may not be the user data required by NODEB, resulting in data accumulation. and waste of air interface resources
NODEB cannot control the flow of different users according to the UE's wireless channel quality and data transmission conditions. In some cases, the NODEB may want the RNC to reduce / stop the downlink data transmission of the specific UE, but the existing flow control mechanism may cause the data sent by the RNC to be not necessarily the data of the UE that the NodeB wants to schedule

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A hs-dsch capacity allocation method
  • A hs-dsch capacity allocation method
  • A hs-dsch capacity allocation method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0018] In order to make the purpose, technical means and advantages of the present invention clearer, the present invention will be further described in detail below in conjunction with the accompanying drawings.

[0019] figure 2 It is a specific flowchart of the capacity allocation method in the present invention. like figure 2 As shown, the method includes:

[0020] Step 201, when NODEB performs capacity allocation of any CmCH-PI, it determines the number of users that need to perform capacity allocation separately, the corresponding user identification (H-RNTI) and their respective credits among all users corresponding to the CmCH-PI .

[0021] As mentioned in the background technology above, when the air interface quality of a certain UE is not good or the downlink data of a certain UE has accumulated in the NODEB cache and reaches a certain threshold, the NODEB may want the RNC to reduce / stop the specific The downlink data transmission of the UE, instead of adoptin...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides a method for carrying out capacity assignment on an HS-DSCH (high-speed downlink shared channel), which comprises the following steps that: when carrying out capacity assignment on any common transport channel priority indicator (CmCH-PI), a Node B determines the number of users (required to be subjected to capacity assignment separately) in all users corresponding to the CmCH-PI, corresponding user identifiers H-RNTI (HS-DSCH radio network transaction identifier) and the credit rating of each user; and the Node B sends a capacity assignment frame to an RNC (radio network controller), wherein the capacity assignment frame carries the determined number of users and the H-RNTI and credit rating of each user (required to be subjected to capacity assignment separately), and the HS-DSCH total credit rating field in the capacity assignment frame carries the total credit ratings of the users (except the users required to be subjected to capacity assignment separately) in all the users corresponding to the CmCH-PI. By using the method disclosed by the invention, the Node B can inform the RNC of the corresponding credit rating information of the users (required to be subjected to capacity assignment separately), so that the RNC can carry out issuing on downlink data according to the corresponding credit rating information, thereby realizing the flow control on different user data in a same CmCH-PI.

Description

technical field [0001] The invention relates to the flow control technology in the mobile communication system, in particular to a method for allocating HS-DSCH capacity in the enhanced CELL_FACH state. Background technique [0002] For users carried on HS-DSCH, NODEB needs to allocate and schedule resources on a user-by-user basis based on the user's wireless channel quality and shared physical resources. Therefore, RNC and NODEB need to control the flow of downlink data of different users. [0003] The flow control mechanism defined in the current protocol is to apply for and allocate capacity for each common transport channel priority (CmCH-PI). There may be data of multiple users on the same priority, and MAC-c Flow is shared by multiple users, that is to say, one CmCH-PI corresponds to multiple users. When performing capacity application and allocation, NODEB reports a capacity allocation frame to the RNC, which carries the total credits of all users corresponding to o...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): H04W28/10H04W72/04
Inventor 李维成童树鸿赵昊昱边远
Owner POTEVIO INFORMATION TECH CO LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products