WO2008110074A1 - A method and device for relieving congestion of credit resources - Google Patents

A method and device for relieving congestion of credit resources Download PDF

Info

Publication number
WO2008110074A1
WO2008110074A1 PCT/CN2008/000496 CN2008000496W WO2008110074A1 WO 2008110074 A1 WO2008110074 A1 WO 2008110074A1 CN 2008000496 W CN2008000496 W CN 2008000496W WO 2008110074 A1 WO2008110074 A1 WO 2008110074A1
Authority
WO
WIPO (PCT)
Prior art keywords
credit
ldr
action
congestion
resources
Prior art date
Application number
PCT/CN2008/000496
Other languages
French (fr)
Chinese (zh)
Inventor
Xueliang Wang
Original Assignee
Huawei Technologies Co., Ltd.
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 Huawei Technologies Co., Ltd. filed Critical Huawei Technologies Co., Ltd.
Publication of WO2008110074A1 publication Critical patent/WO2008110074A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W36/00Hand-off or reselection arrangements
    • H04W36/16Performing reselection for specific purposes
    • H04W36/22Performing reselection for specific purposes for handling the traffic

Definitions

  • Embodiments of the present invention provide a method and apparatus for relieving congestion of a credit resource, thereby realizing cancellation of a credit resource congestion condition.
  • the congestion judgment formula for the uplink credit resources for the local cell group is
  • the congestion decision formula for the uplink credit resources of the local cell is (C U +Di Consumejocal ceil ) ⁇ 7/ Thr > ⁇ Capacity Credit Jocal cell ⁇ ⁇ Used Credit Jocal cell.
  • the user who is required to be selected must be a steady-state user, and is not a DRNC/emergency/CMB/robbed user, not a gold-plated PS user.
  • the business type of the selected user must be in the CS domain.
  • the user to be selected must be a steady state user and not for DRNC/emergency/CMB/robbed users, not for gold eight VPS users.
  • the service type of the selected user must be in the PS domain and not in the H user.
  • the user to which the selected RAB belongs is required to be a steady-state user, and is not a DRNC/emergency/CMB/robbed user; the selected RAB is not HSUPA/HSDPARAB, not a gold medal/WPS RAB, business Session and stream services of type PS domain. Because the maximum rate and guaranteed rate of the non-BE service of the PS service can be negotiated, the maximum rate is not required to be greater than the guaranteed rate.
  • the embodiment of the present invention first performs a congestion decision on a credit resource.
  • the load reforming LDR action is selected, and the RAB is selected according to the selected LDR. Or user.
  • the selected LDR action is then performed on the selected RAB or the credit resource currently occupied by the user. Therefore, the embodiment of the present invention can relieve the congestion of credit resources.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

A method and device for relieving congestion of credit resources which actualize relieving the congestion status of the credit resources are provided. The present invention method includes: judging the congestion of the credit resources; when judging the credit resources are in congestion, selecting a load reshuffling LDR action, and selecting RABs or users according to the selected LDR action; and performing the selected LDR action for the credit resources occupied currently by the selected RABs or users, so as to relieve the congestion of the credit resources. The present invention device for relieving the congestion of the credit resources includes: a congestion judging module, a LDR action selecting mudule, a RAB selecting module and a LDR action performing module.

Description

一种解除信用度资源拥塞的方法及装置 本申请要求于 2007 年 3 月 14 日提交中国专利局、 申请号为 200710086835.3、 发明名称为 "一种解除信用度资源拥塞的方法及装置" 的中 国专利申请的优先权, 其全部内容通过引用结合在本申请中。  The invention relates to a Chinese patent application for resolving credit resource congestion on March 14, 2007, and the Chinese Patent Application No. 200710086835.3, entitled "A Method and Apparatus for Relieving Credit Resource Congestion" Priority is hereby incorporated by reference in its entirety.
技术领域 Technical field
本发明涉及通信领域, 特别是涉及一种解除信用度资源拥塞的方法及装 置。 背景技术  The present invention relates to the field of communications, and in particular, to a method and apparatus for relieving congestion of credit resources. Background technique
差异化服务已成为当今主流运营商的普遍需求, 当前有多种针对差异化 服务的技术。 在拥塞控制方面有: Uu 口功率初级拥塞控制、 Uu 口功率过载 拥塞控制、 等效用户数初级拥塞控制、 Iub口带宽初级拥塞控制、 码资源初级 拥塞控制等。 所谓初级拥塞控制也称负载重整(LDR: Load Reshuffling ), 该 算法指的是在负载达到一定门限之后, 为了使后续用户能顺利使用小区资源, 对小区内的已有用户进行资源的调整和再分配的过程。 初级拥塞的触发源可 归为两类, 一类是硬资源, 包括 Iub带宽资源、 码资源、 信用度资源; 另一类 为软资源, 包括 Uu口功率资源, 等效用户数资源。  Differentiated services have become a common demand of today's mainstream operators, and there are currently many technologies for differentiated services. In terms of congestion control, there are: Uu port power primary congestion control, Uu port power overload congestion control, equivalent user number primary congestion control, Iub port bandwidth primary congestion control, and code resource primary congestion control. The so-called primary congestion control is also called load reshuffling (LDR). The algorithm refers to the adjustment of the resources of existing users in the cell in order to enable subsequent users to use the cell resources smoothly after the load reaches a certain threshold. The process of redistribution. The trigger sources of primary congestion can be classified into two types, one is hard resources, including Iub bandwidth resources, code resources, and credit resources; the other is soft resources, including Uu port power resources and equivalent user resources.
发明人在发明过程中发现, 现有技术没有解除信用度资源拥塞的方案。 发明内容  The inventor found in the process of the invention that the prior art does not have a solution for resolving credit resource congestion. Summary of the invention
本发明实施例提供一种解除信用度资源拥塞的方法及装置, 实现对信用 度资源拥塞状况的解除。  Embodiments of the present invention provide a method and apparatus for relieving congestion of a credit resource, thereby realizing cancellation of a credit resource congestion condition.
本发明实施例的方法包括下列步骤: 对信用度资源进行拥塞判决; 当判 定信用度资源拥塞时, 选取负载重整 LDR动作, 并根据选定的 LDR动作选 取 RAB或用户; 以及对选定的 RAB或用户当前所占用的信用度资源执行选 定的 LDR动作, 以解除信用度资源的拥塞。 The method of the embodiment of the present invention includes the following steps: performing a congestion decision on a credit resource; when determining that the credit resource is congested, selecting a load reforming LDR action, and selecting according to the selected LDR action Take the RAB or the user; and perform the selected LDR action on the selected RAB or the credit resource currently occupied by the user to relieve the congestion of the credit resource.
本发明实施例的解除信用度资源拥塞的装置, 包括: 拥塞判决模块, 用 于对信用度资源进行拥塞判决; LDR动作选取模块, 用于在拥塞判决模块判 定信用度资源拥塞时, 选取负载重整 LDR动作; RAB选取模块, 用于根据 LDR动作选取模块选定的 LDR动作选取 RAB或用户; LDR动作执行模块, 用于对 RAB选^ Jf莫块选定的 RAB或用户当前所占用的信用度资源执行 LDR 动作选取模块选定的 LDR动作。  The device for resolving credit resource congestion in the embodiment of the present invention includes: a congestion determination module, configured to perform congestion determination on a credit resource; and an LDR action selection module, configured to select a load reforming LDR action when the congestion determination module determines that the credit resource is congested The RAB selection module is configured to select the RAB or the user according to the LDR action selected by the LDR action selection module; the LDR action execution module is configured to perform the LDR on the selected RAB of the RAB selection or the credit resource currently occupied by the user. The LDR action selected by the action selection module.
本发明实施例首先对信用度资源进行拥塞判决。 当判定信用度资源拥塞 时, 选取负载重整 LDR动作, 并根据选定的 LDR动作选取 RAB或用户。 之 后对选定的 RAB或用户当前所占用的信用度资源执行选定的 LDR动作。 所 以本发明实施例可解除信用度资源的拥塞。 附图说明  The embodiment of the invention first performs a congestion decision on the credit resource. When it is determined that the credit resource is congested, the load reorganization LDR action is selected, and the RAB or the user is selected according to the selected LDR action. The selected LDR action is then performed on the selected RAB or the credit resource currently occupied by the user. Therefore, the embodiment of the present invention can relieve the congestion of credit resources. DRAWINGS
图 1为本发明实施例的方法步骤流程图;  1 is a flow chart of steps of a method according to an embodiment of the present invention;
图 2为本发明实施例的装置结构示意图。 具体实施方式  FIG. 2 is a schematic structural diagram of a device according to an embodiment of the present invention. detailed description
为了实现对信用度资源拥塞的解除, 以空余出预留门限的信用度资源, 用以后续用户的接入, 本发明实施例提供了一种解除信用度资源拥塞的方法, 参见图 1所示, 包括下列主要步骤:  In order to achieve the cancellation of the credit resource congestion, the credit resource of the reserved threshold is used for the access of the subsequent user. The embodiment of the present invention provides a method for resolving the credit resource congestion. Referring to FIG. 1 , the following The main steps:
Sl、 对信用度资源进行拥塞判决。  Sl. Congestion judgment on credit resources.
判决信用度资源拥塞的情况分三个级别, 两个方向。 三个级别为 NodeB (基站)、本地小区组, 本地小区, 两个方向为上行和下行。 即六种判决情况, 分别是: NodeB上行信用度资源拥塞、 NodeB下行信用度资源拥塞、 本地小 区组上行信用度资源拥塞、 本地小区组下行信用度资源拥塞、 本地小区上行 信用度资源拥塞, 以及本地小区下行信用度资源拥塞。 上述各判决情况可单 独或同时存在, 之间没有依赖和互斥关系。 当同时存在时, 同一方向上的两 种判决情况的判决结杲不一致时, 则判定信用度资源拥塞, 进行后续步骤。 Judging the congestion of credit resources is divided into three levels, two directions. The three levels are NodeB (base station), local cell group, and local cell, and the two directions are uplink and downlink. That is, the six kinds of judgments are: NodeB uplink credit resource congestion, NodeB downlink credit resource congestion, local cell group uplink credit resource congestion, local cell group downlink credit resource congestion, local cell uplink credit resource congestion, and local cell downlink credit resources congestion. The above judgments can be single There are no dependencies and mutually exclusive relationships between them. When the simultaneous judgments of the two judgment cases in the same direction are inconsistent, the credit resource is determined to be congested, and the subsequent steps are performed.
在具体实现中, 可配置三个 RNC (无线网络控制器)级别的开关, 分别 是 NodeB信用度资源拥塞控制开关、 本地小区组信用度资源拥塞控制开关、 本地小区信用度资源拥塞控制开关。 只有信用度资源拥塞控制开关打开时, 才进行相应级别的信用度资源拥塞的判决。 设置该开关的目的是为了灵活控 制 RNC对三种级别信用资源拥塞控制的取舍,因为 NodeB上报的各级别信用 度资源大小可能与实际情况不符, 也可能因为运营商不选择该功能等等。  In a specific implementation, three RNC (Radio Network Controller) level switches can be configured, which are a NodeB credit resource congestion control switch, a local cell group credit resource congestion control switch, and a local cell credit resource congestion control switch. Only when the credit resource congestion control switch is turned on, the judgment of the corresponding level of credit resource congestion is performed. The purpose of setting this switch is to flexibly control the RNC's choice of three levels of credit resource congestion control, because the level of credit resources reported by the NodeB may not match the actual situation, or the operator may not select this function.
由于信用度资源可能是上下行独立分配, 也可能是上下行共享。 因此针 对这两种信用度资源的分配方式, 上述六种判决情况有各自的判决公式。  Since the credit resources may be independent allocation of uplink and downlink, it may also be uplink and downlink sharing. Therefore, for the distribution of these two credit resources, the above six judgments have their own judgment formulas.
其中, 对于下行, HSDPA (高速下行分组接入)的信用度资源是预留的, 因此判决公式不涉及 HSDPA的信用度资源; 对于上行, 引入 HSUPA (高速 上行分组接入)后, E-DCH是有消费规则的, 因此其资源参与判决与用户选 择。  For the downlink, the credit resources of HSDPA (High Speed Downlink Packet Access) are reserved, so the decision formula does not involve the credit resources of HSDPA. For the uplink, after the introduction of HSUPA (High Speed Uplink Packet Access), the E-DCH is Consumption rules, so its resources participate in judgments and user choices.
上下行独立分配信用度资源(即上行信用度资源和下行信用度资源分开) 的相关判决公式如下:  The relevant judgment formulas for the independent allocation of credit resources (ie, the uplink credit resources and the downlink credit resources are separated) are as follows:
上下行信道独立分配信用度资源时, 针对 NodeB进行上行信用度资源的 拥塞判决公式为 ( UL Consume, NodeB Ui Thr > ^UL Capacity Credit, NodeB - 0/ Used Credit, NodeB。 When the uplink and downlink channels independently allocate credit resources, the congestion decision formula for the uplink credit resources of the NodeB is ( UL Consume, NodeB Ui Thr > ^UL Capacity Credit, NodeB - 0/ Used Credit, NodeB.
上下行信道独立分配信用度资源时, 针对本地小区组进行上行信用度资 源的拥塞判决公式为  When the uplink and downlink channels independently allocate credit resources, the congestion judgment formula for the uplink credit resources for the local cell group is
t L Consume, local cell group Wl Thr ^UL Capacity Credit Jocal cell group ^UL Used Credit Jo al cell group °  t L Consume, local cell group Wl Thr ^UL Capacity Credit Jocal cell group ^UL Used Credit Jo al cell group °
上下行信道独立分配信用度资源时, 针对本地小区进行上行信用度资源 的拥塞判决公式为 Consume Jocal cell )t// Thr > ^UL Capacity Credit Jocal cell ~" ^UL Used Credit Jocal cell。  When the uplink and downlink channels independently allocate credit resources, the congestion judgment formula for the uplink credit resources of the local cell is Consume Jocal cell )t / / Thr > ^ UL Capacity Credit Jocal cell ~ " ^ UL Used Credit Jocal cell.
上下行信道独立分配信用度资源时, 针对 NodeB进行下行信用度资源的 拥塞判决公式为 ( DL Consume tNodeB Dl Thr > ^DL Capacity Credit, NodeB " ^DL Used Credit, NodeB。 When the uplink and downlink channels independently allocate credit resources, the congestion decision formula for the downlink credit resources of the NodeB is ( DL Consume t NodeB Dl Thr > ^DL Capacity Credit, NodeB " ^ DL Used Credit, NodeB.
上下行信道独立分配信用度资源时, 针对本地小区组进行下行信用度资 源的拥塞判决公式为When the uplink and downlink channels independently allocate credit resources, perform downlink credits for the local cell group. The source congestion decision formula is
Figure imgf000006_0001
Used Credit Jocal cell group。
Figure imgf000006_0001
Used Credit Jocal cell group.
上下行信道独立分配信用度资源时, 针对本地小区进行下行信用度资源 的拥塞判决公式为 (CDi Consume Jocal cell Thr > C。L Capacity Credit Jocal cell ~ ^DL Used Credit, local cell ° 上下行共享信用度资源 (即上行信用度资源和下行信用度资源不分开) 的相关判决公式如下: When the uplink and downlink channels independently allocate credit resources, the congestion judgment formula for the downlink credit resources of the local cell is (C Di Consume Jocal cell Thr > C. L Capacity Credit Jocal cell ~ ^DL Used Credit, local cell ° uplink and downlink shared credit resources (The relevant judgment formulas for the uplink credit resources and the downlink credit resources are not separated) are as follows:
上下行信道共享信用度资源时, 针对 NodeB进行上行信用度资源的拥塞 判决公式为 (C +D Consume, NodeB Thr > ^Capacity Credit NodeB ~~ ^Used Credit, NodeB。 When the uplink and downlink channels share the credit resources, the congestion judgment formula for the uplink credit resources of the NodeB is (C +D Consume, NodeB Thr > ^Capacity Credit NodeB ~~ ^Used Credit, NodeB.
上下行信道共享信用度资源时, 针对本地小区组进行上行信用度资源的 拥塞判决公式为 When the uplink and downlink channels share the credit resources, the congestion judgment formula for the uplink credit resources for the local cell group is
Figure imgf000006_0002
Credit Jocal cell group - C Used Credit, local cell group °
Figure imgf000006_0002
Credit Jocal cell group - C Used Credit, local cell group °
上下行信道共享信用度资源时, 针对本地小区进行上行信用度资源的拥 塞判决公式为 (CU +Di Consumejocal ceil )ΐ7/ Thr > ^Capacity Credit Jocal cell ― ^Used Credit Jocal cell。 When the uplink and downlink channels share the credit resources, the congestion decision formula for the uplink credit resources of the local cell is (C U +Di Consumejocal ceil )ΐ7/ Thr > ^Capacity Credit Jocal cell ― ^Used Credit Jocal cell.
上下行信道共享信用度资源时, 针对 NodeB进行下行信用度资源的拥塞 判决公式为 (C^+ Consume NodeB Thr > C capacity Credit NodeB ~ ^Used Credit, NodeB °  When the uplink and downlink channels share the credit resources, the congestion judgment formula for the downlink credit resources for the NodeB is (C^+ Consume NodeB Thr > C capacity Credit NodeB ~ ^Used Credit, NodeB °
上下行信道共享信用度资源时, 针对本地小区组进行下行信用度资源的 拥塞判决公式为 When the uplink and downlink channels share the credit resources, the congestion judgment formula for the downlink credit resources for the local cell group is
Figure imgf000006_0003
Credit Jocal ceil group。
Figure imgf000006_0003
Credit Jocal ceil group.
上下行信道共享信用度资源时, 针对本地小区进行下行信用度资源的拥 塞判决公式为 ( +D Consumejocal cell ) Dl Thr > ^Capacity Credit Jocal cell一 ^Used Credit Jocal cell ° When the uplink and downlink channels share the credit resources, the congestion judgment formula for the downlink credit resources of the local cell is ( +D Consumejocal cell) Dl Thr > ^Capacity Credit Jocal cell_^Used Credit Jocal cell °
上述各个公式中, c.^^ ^,,.表示总的信用度资源, c. w.表示已使用 的信用度资源, (c* c~ ^表示根据信用度资源预留门限和消费法则可判决 拥塞的预留信用度的大小。其中,总的信用度资源和消费法则是 NodeB ^^的; 已使用的信用度资源是由 RNC计算维护的; 信用度资源预留门限是配置的, 信用度资源预留门限的取值是扩频因子, 例如: 欲预留 64K BE业务(尽力而 为业务, 或称尽力型业务)对等的信用度资源, 则配置预留门限为扩频因子In each of the above formulas, c.^^ ^,,. represents the total credit resource, cw represents the used credit resource, ( c * c ~ ^ represents the reserved credit that can be judged according to the credit resource reservation threshold and the consumption rule. The total credit resource and consumption rule are NodeB ^^; the used credit resources are maintained by the RNC; the credit resource reservation threshold is configured, and the credit resource reservation threshold is spread. Factor, for example: want to reserve 64K BE service (do your best) For the business, or the best-effort type of service, the peer-to-peer credit resource is configured with the reserved threshold as the spreading factor.
32, 预留扩频因子与预留信用度资源之间的消费法则取相应级别专用信道首 链路的消费法则。 32. The consumption rule between the reserved spreading factor and the reserved credit resource takes the consumption rule of the first-level dedicated channel first link.
52、 当判定信用度资源拥塞时, 选取 LDR动作。  52. When it is determined that the credit resource is congested, the LDR action is selected.
无论判定是 NodeB的信用度资源拥塞, 还是本地小区组的信用度资源拥 塞, 还是本地小区的信用度资源拥塞, 备选的 LDR动作均包括: 上行 /下行 BE业务降速、 CS (电路交换)异系统切换、 PS (分组交换)异系统切换、 上 行 /下行不可控实时业务 Qos (服务盾量)重协商。 但不考虑执行异频切换动 作, 原因是避免用户因为信用度资源拥塞在异频邻区间切换的乒乓。  Regardless of whether the decision is the congestion of the credit resources of the NodeB, the congestion of the credit resources of the local cell group, or the congestion of the credit resources of the local cell, the alternative LDR actions include: Uplink/downlink BE service slowdown, CS (circuit switched) different system handover , PS (Packet Switching), different system switching, uplink/downlink uncontrollable real-time service Qos (service shield) renegotiation. However, the inter-frequency handover operation is not considered, because the user avoids the ping-pong that the user switches in the inter-frequency neighbor interval because the credit resource is congested.
上述备选的 LDR动作之间存在优先级, 按优先级由高到低的顺序依次为 BE业务降速、 CS异系统切换、 PS异系统切换, 以及不可控实时业务 Qos重 协商。  There is a priority between the above-mentioned alternative LDR actions, which are BE service deceleration, CS different system handover, PS different system handover, and uncontrollable real-time service Qos re-negotiation in descending order of priority.
53、 根据选定的 LDR动作选取用户或 RAB。  53. Select a user or RAB according to the selected LDR action.
对应步骤 S2中所述的每种备选 LDR动作, 存在不同的选取用户或 RAB 的方式。 根据当前选定的 LDR动作未能选出合适的用户或 RAB时, 则按照 步骤 S2中所述的备选 LDR动作的优先级由高到低的顺序选取下一 LDR动作, 并相应选取用户或 RAB, 直至选定用户或 RAB。  There are different ways of selecting users or RABs for each of the alternative LDR actions described in step S2. If the user or the RAB is not selected according to the currently selected LDR action, the next LDR action is selected according to the priority of the candidate LDR actions described in step S2, and the user or the corresponding user is selected. RAB, until the selected user or RAB.
当前选定的 LDR动作为 BE业务降速, 则按照下述内容选取 RAB:  If the currently selected LDR action is a BE service slowdown, the RAB is selected as follows:
对小区中对应方向上 "BE业务降速"惩罚状态为否的所有 RAB (即未被 BE业务降速动作选择过的 RAB ), 按照其 PK值(即 RAB的优先级, PK值 越小表示优先级越高)进行排序, PK值相同时按照用户被选进行 LDR的次 数由小到大的顺序; 在排好序的 RAB列表中由前向后选取 N个 RAB, 所述 N小于等于一次 BE业务降速最大 RAB数 M。  For all RABs that have a penalty status of "BE service deceleration" in the corresponding direction in the cell (that is, the RAB that has not been selected by the BE service deceleration action), according to its PK value (ie, the priority of the RAB, the smaller the PK value) The higher the priority is, the sorting is performed. When the PK values are the same, the number of times the LDR is selected by the user is from small to large. In the sorted RAB list, N RABs are selected from the front to the back, and the N is less than or equal to once. The BE service slows down the maximum RAB number M.
另夕卜,要求被选择的 RAB所属的用户必须为稳态用户,并且不为 DRNC/ 紧急 /CMB/被抢用户; 要求被选择的 RAB不为 HSUPA/HSDPARAB, 不为金 牌/ WPS RAB (金牌 RAB是指高优先级的 RAB, 拥有金牌 RAB的用户为金 牌用户; WPS RAB是指高优先级的 RAB, 拥有 WPS RAB的用户为 WPS用 户), 当前速率大于保证速率, 业务类型为 PS域的交互和背景业务。 In addition, the user to which the selected RAB belongs must be a steady-state user and not a DRNC/emergency/CMB/robbed user; the selected RAB is not HSUPA/HSDPARAB, not gold/WPS RAB (gold medal) RAB refers to high priority RAB, users with gold RAB are gold users; WPS RAB refers to high priority RAB, and users with WPS RAB are used for WPS The current rate is greater than the guaranteed rate, and the service type is the PS domain interaction and background service.
当前选定的 LDR动作为 CS异系统切换, 则按照下述内容选取用户: 对小区中 CS异系统切换惩罚状态为否的所有用户 (即未被 CS异系统切 换动作选择过的用户),按照其 PK值进行排序, PK值相同时按照用户被选进 行 LDR的次数由小到大的顺序;在排好序的用户列表中由前向后选取 N个用 户; 所述 N小于等于一次 CS异系统切换最大用户数^1。  If the currently selected LDR action is a CS-specific system switch, the user is selected according to the following content: all users who have a penalty state of the CS-specific system handover in the cell (ie, a user that has not been selected by the CS different system switching action), according to The PK values are sorted. When the PK values are the same, the number of times the LDRs are selected by the user is from small to large; in the ranked user list, N users are selected from front to back; the N is less than or equal to one CS difference. The system switches the maximum number of users ^1.
另外, 要求被选择的用户必须为稳态用户, 并且不为 DRNC/紧急 /CMB/ 被抢用户, 不为金牌八 PS用户。 被选择的用户的业务类型必须是 CS域的。  In addition, the user who is required to be selected must be a steady-state user, and is not a DRNC/emergency/CMB/robbed user, not a gold-plated PS user. The business type of the selected user must be in the CS domain.
当前选定的 LDR动作为 PS异系统切换, 则按照下述内容选取用户: 对小区中 PS异系统切换惩罚状态为否的所有用户 (即未被 PS异系统切 换动作选择过的用户),按照其 PK值进行排序, PK值相同时按照用户被选进 行 LDR的次数由小到大的顺序;在排好序的用户列表中由前向后选取 N个用 户, 所述 N小于等于一次 PS异系统切换最大用户数 M。  If the currently selected LDR action is a PS-specific system switch, the user is selected according to the following content: All users who have a P-specific system handover penalty state in the cell are not selected, that is, users that have not been selected by the PS different system switching action, according to The PK values are sorted. When the PK values are the same, the number of times the LDR is selected by the user is from small to large; in the ranked user list, N users are selected from the front to the back, and the N is less than or equal to one PS. The system switches the maximum number of users M.
另外, 要求被选择的用户必须为稳态用户, 并且不为 DRNC/紧急 /CMB/ 被抢用户, 不为金牌八 VPS用户。 被选择的用户的业务类型必须是 PS域的, 并且不为 H用户。  In addition, the user to be selected must be a steady state user and not for DRNC/emergency/CMB/robbed users, not for gold eight VPS users. The service type of the selected user must be in the PS domain and not in the H user.
当前选定的 LDR动作为不可控实时业务 Qos重协商,则按照下述内容选 取用户 /RAB:  If the currently selected LDR action is an uncontrollable real-time service Qos renegotiation, select the user /RAB as follows:
对小区中对应方向上 Qos重协商惩罚状态为否的所有 RAB (即未被 Qos 重协商动作选择过的 RAB ), 按照其 PK值进行排序, PK值相同时按照用户 被选进行 LDR的次数由小到大的顺序; 在排好序的 RAB列表中由前向后选 取 N个 RAB, 所述 N小于等于一次重协商最大 RAB ¾ M。  All RABs whose QoS re-negotiating penalty status is NO in the corresponding direction in the cell (that is, the RAB that has not been selected by the Qos re-negotiation action) are sorted according to their PK values. When the PK values are the same, the number of times the LDR is selected by the user is determined. Small to large order; N RABs are selected from the front to the back in the ranked RAB list, the N being less than or equal to one renegotiation maximum RAB 3⁄4 M.
另夕卜,要求被选择的 RAB所属的用户必须为稳态用户,并且不为 DRNC/ 紧急 /CMB/被抢用户; 要求被选择的 RAB不为 HSUPA/HSDPARAB, 不为金 牌/ WPS RAB, 业务类型为 PS域的会话和流业务。 因为 PS业务非 BE业务的 最大速率和保证速率均可协商, 不要求最大速率一定大于保证速率。  In addition, the user to which the selected RAB belongs is required to be a steady-state user, and is not a DRNC/emergency/CMB/robbed user; the selected RAB is not HSUPA/HSDPARAB, not a gold medal/WPS RAB, business Session and stream services of type PS domain. Because the maximum rate and guaranteed rate of the non-BE service of the PS service can be negotiated, the maximum rate is not required to be greater than the guaranteed rate.
S4、 对选定的用户或 RAB当前所占用的信用度资源执行选定的 LDR动 作, 以解除信用度资源的拥塞。 S4. Perform a selected LDR move on the credit resource currently occupied by the selected user or the RAB. To relieve the congestion of credit resources.
执行当前选定的 LDR动作后, 若未能解除信用度资源的拥塞, 则按照步 骤 S2中所述的备选 LDR动作之间优先级由高到低的顺序, 选取下一 LDR动 作, 并继续执行步骤 S3和 S4, 直至解除了信用度资源的拥塞。  After performing the currently selected LDR action, if the credit resource congestion is not released, the next LDR action is selected according to the order of priority between the candidate LDR actions described in step S2, and the execution continues. Steps S3 and S4, until the congestion of the credit resource is released.
本发明实施例还提供了一种解除信用度资源拥塞的装置, 参见图 2所示, 其包括: 拥塞判决模块、 LDR动作选取模块、 RAB选取模块, 以及 LDR动 作执行模块。  The embodiment of the present invention further provides a device for resolving credit resource congestion. Referring to FIG. 2, the method includes: a congestion decision module, an LDR action selection module, an RAB selection module, and an LDR action execution module.
所述拥塞判决模块, 用于对信用度资源进行拥塞判决。 其至少进行下列 判决之一: NodeB上行信用度资源拥塞的判决; NodeB下行信用度资源拥塞 的判决; 本地小区组上行信用度资源拥塞的判决; 本地小区组下行信用度资 源拥塞的判决; 本地小区上行信用度资源拥塞的判决; 本地小区下行信用度 资源拥塞。  The congestion decision module is configured to perform a congestion decision on a credit resource. At least one of the following decisions is made: a decision of the NodeB uplink credit resource congestion; a decision of the NodeB downlink credit resource congestion; a decision of the local cell group uplink credit resource congestion; a local cell group downlink credit resource congestion decision; a local cell uplink credit resource congestion The judgment of the local cell downlink credit resources is congested.
所述 LDR动作选取模块, 用于在拥塞判决模块判定信用度资源拥塞时, 选取负载重整 LDR动作。 备选的 LDR动作按优先级由高到低的顺序依次为 BE业务降速、 CS异系统切换、 PS异系统切换, 以及不可控实时业务 Qos重 协商。  The LDR action selection module is configured to select a load reorganization LDR action when the congestion determination module determines that the credit resource is congested. The alternative LDR actions are in order of priority from high to low, such as BE service slowdown, CS different system switching, PS different system switching, and uncontrolled real-time service Qos renegotiation.
所述 RAB选取模块, 用于根据 LDR动作选取模块选定的 LDR动作选取 用户或 RAB。当 RAB选 莫块根据 LDR动作选 莫块当前选定的 LDR动作 未能选出合适的用户或 RAB时, 触发 LDR动作选取模块按照备选 LDR动作 的优先级由高到氐的顺序选取下一 LDR动作。  The RAB selection module is configured to select a user or an RAB according to the LDR action selected by the LDR action selection module. When the RAB selection block fails to select an appropriate user or RAB according to the currently selected LDR action of the LDR action selection block, the trigger LDR action selection module selects the next order according to the priority of the alternate LDR action from high to 氐. LDR action.
所述 LDR动作执行模块,用于对 RAB选取模块选定的用户或 RAB当前 所占用的信用度资源执行 LDR动作选^ ^莫块选定的 LDR动作。 当所述 LDR 动作执行模块执行了 LDR动作选取模块当前选定的 LDR动作后, 若拥塞判 决模块判定未能解除信用度资源的拥塞, 则 LDR动作执行模块触发 LDR动 作选取模块按照备选 LDR动作的优先级由高到低的顺序选取下一 LDR动作。  The LDR action execution module is configured to perform an LDR action selected by the selected user of the RAB selection module or the credit resource currently occupied by the RAB. After the LDR action execution module performs the LDR action currently selected by the LDR action selection module, if the congestion decision module determines that the credit resource congestion is not resolved, the LDR action execution module triggers the LDR action selection module to perform the alternate LDR action. The next LDR action is selected in descending order of priority.
综上所述, 本发明实施例首先对信用度资源进行拥塞判决。 当判定信用 度资源拥塞时, 选取负载重整 LDR动作, 并根据选定的 LDR 作选取 RAB 或用户。之后对选定的 RAB或用户当前所占用的信用度资源执行选定的 LDR 动作。 所以本发明实施例可解除信用度资源的拥塞。 In summary, the embodiment of the present invention first performs a congestion decision on a credit resource. When it is determined that the credit resource is congested, the load reforming LDR action is selected, and the RAB is selected according to the selected LDR. Or user. The selected LDR action is then performed on the selected RAB or the credit resource currently occupied by the user. Therefore, the embodiment of the present invention can relieve the congestion of credit resources.
通过对 NodeB、 本地小区组、 本地小区三个级别的信用度资源的维护, 获得小区信用度资源的负载情况, 并根据配置的小区信用度门限参数和 RNC 级别的信用度拥塞控制开关, 在需要的情况下对相应的拥塞负载进行控制, 适当减少低优先级用户对信用度资源的占用, 重配信用度资源。 尽可能为后 续用户预留适当的资源, 避免由于大量用户集中到某一个 NODEB/小区组 /小 区导致的呼损率上升, 提供一定的系统容量。 发明的精神和范围。 这样, 倘若本发明的这些修改和变型属于本发明权利要 求及其等同技术的范围之内, 则本发明也意图包含这些改动和变型在内。  Obtaining the load status of the cell credit resource by maintaining the three levels of credit resources of the NodeB, the local cell group, and the local cell, and according to the configured cell credit threshold parameter and the RNC level credit congestion control switch, if necessary, The corresponding congestion load is controlled to appropriately reduce the occupation of credit resources by low-priority users and re-equalize credit resources. As far as possible, reserve appropriate resources for subsequent users to avoid a call loss rate increase due to a large number of users concentrated in a certain NODEB/cell group/small area, and provide a certain system capacity. The spirit and scope of the invention. Thus, it is intended that the present invention cover the modifications and variations of the inventions

Claims

权 利 要 求 Rights request
1、 一种解除信用度资源拥塞的方法, 其特征在于, 包括下列步骤: 对信用度资源进行拥塞判决; A method for relieving congestion of a credit resource, comprising the steps of: performing a congestion judgment on a credit resource;
当判定信用度资源拥塞时,选取负载重整 LDR动作, 并根据选定的 LDR 动作选取无线接入承载 RAB或用户; 以及  When it is determined that the credit resource is congested, the load reconfiguration LDR action is selected, and the radio access bearer RAB or the user is selected according to the selected LDR action;
对选定的 RAB或用户当前所占用的信用度资源执行选定的 LDR动作, 以解除信用度资源的拥塞。  The selected LDR action is performed on the selected RAB or the credit resource currently occupied by the user to relieve the congestion of the credit resource.
2、 如权利要求 1所述的方法, 其特征在于, 所述对信用度资源进行拥塞 判决, 至少进行下列判决之一:  2. The method according to claim 1, wherein the congestion judgment is performed on the credit resource, and at least one of the following judgments is performed:
基站上行信用度资源拥塞的判决; 基站下行信用度资源拥塞的判决; 本 地小区组上行信用度资源拥塞的判决; 本地小区组下行信用度资溏拥塞的判 决; 本地小区上行信用度资源拥塞的判决; 本地小区下行信用度资源拥塞判 决。  Decision of base station uplink credit resource congestion; decision of base station downlink credit resource congestion; decision of local cell group uplink credit resource congestion; decision of local cell group downlink credit congested congestion; local cell uplink credit resource congestion decision; local cell downlink credit Resource congestion judgment.
3、 如权利要求 1或 2所述的方法, 其特征在于, 所述对信用度资源进行 拥塞判决中,  The method according to claim 1 or 2, wherein in the congestion judgment on the credit resource,
上下行信道独立分配信用度资源时, 针对基站进行上行信用度资源的拥 塞判决公式为 (CUL consume, Nodee)ui Thr > CUL capacity Credit,NodeB ― ^UL Used Credit,NodeB, When the uplink and downlink channels independently allocate credit resources, the congestion decision formula for the uplink credit resources of the base station is (C UL consume, Nodee) ui Thr > C UL capacity Credit, NodeB ― ^UL Used Credit, NodeB,
上下行信道独立分配信用度资源时, 针对本地小区组进行上行信用度资 源的拥塞判决公式为  When the uplink and downlink channels independently allocate credit resources, the congestion judgment formula for the uplink credit resources for the local cell group is
Consume ocal celt group) Ui Thr > ^UL Capacity Credit, local cell group ^UL Used Credit, local cell group, 上下行信道独立分配信用度资源时, 针对本地小区进行上行信用度资源 的拥塞判决公式为(cyi Consume JLocal cell Thr > ^UL Capacity Credit Jocal cell ― ^UL Used Credit, local cell, 上下行信道独立分配信用度资源时, 针对基站进行下行信用度资源的拥 塞判决公式为(CD Consume, NodeB Thr > CDL capacity Credit, NodeB ― ^DL Used Credit, NodeB, Consume ocal celt group) Ui Thr > ^UL Capacity Credit, local cell group ^UL Used Credit, local cell group, when the uplink and downlink channels independently allocate credit resources, the congestion judgment formula for the uplink credit resources of the local cell is (c yi Consume JLocal cell Thr > ^UL Capacity Credit Jocal cell ― ^UL Used Credit, local cell, when the uplink and downlink channels independently allocate credit resources, the congestion decision formula for the downlink credit resources of the base station is (C D Consume, NodeB Thr > C DL capacity Credit, NodeB —— ^DL Used Credit, NodeB,
上下行信道独立分配信用度资源时, 针对本地小区组进行下行信用度资 源的拥塞判决公式为 When the uplink and downlink channels independently allocate credit resources, perform downlink credits for the local cell group. The source congestion decision formula is
Consume , local cell group Thr > Capacity Credit, local cell group一 ^DL Used Credit, local cell group, 上下行信道独立分配信用度资源时, 针对本地小区进行下行信用度资源 的拥塞判决公式为(CDi Consume ocal cell Thr > ^DL Capacity Credit, local cell ― ^DL Used Credit Jocal cell, 上下行信道共享信用度资源时 , 针对基站进行上行信用度资源的拥塞判 决公式为(CUi+J¾ Consume NodeB Thr > ^Capacity Credit, NodeB ~~ ^Used Credit, NodeB, Consume, local cell group Thr > Capacity Credit, local cell group- DL Used Credit, local cell group, when the uplink and downlink channels independently allocate credit resources, the congestion decision formula for the downlink credit resources of the local cell is (C Di Consume ocal cell Thr > ^DL Used Credit, local cell ― ^DL Used Credit Jocal cell, when the upstream and downstream channels share credit resources, the congestion decision formula for the uplink credit resources of the base station is (C Ui+J3⁄4 Consume NodeB Thr > ^Capacity Credit, NodeB ~~ ^Used Credit, NodeB,
上下行信道共享信用度资源时, 针对本地小区组进行上行信用度资源的 拥 塞 判 决 公 式 为
Figure imgf000012_0001
Credit Jocal cell group,
When the uplink and downlink channels share the credit resources, the congestion judgment formula for the uplink credit resources for the local cell group is
Figure imgf000012_0001
Credit Jocal cell group,
上下行信道共享信用度资源时, 针对本地小区进行上行信用度资源的拥 塞判决公式为 (CW Consume Jocal cet ){Jl Thr > ^Capacity Credit Jocal cell一 ^Used Credit Jocal cell, When the uplink and downlink channels share the credit resources, the congestion decision formula for the uplink credit resources of the local cell is (C W Consume Jocal cet ) {Jl Thr > ^Capacity Credit Jocal cell_^Used Credit Jocal cell,
上下行信道共享信用度资源时, 针对基站进行下行信用度资源的拥塞判 决公式为 (C Consume, NodeB Thr > ^Capacity Credit、NodeB一 ^Used Credit, NodeB '  When the uplink and downlink channels share the credit resources, the congestion judgment formula for the downlink credit resources of the base station is (C Consume, NodeB Thr > ^Capacity Credit, NodeB_Used Credit, NodeB '
上下行信道共享信用度资源时 , 针对本地小区组进行下行信用度资源的 拥 塞 判 决 公 式 为 PuL+DL Consume Jocal cell group )。, Thr > C Capacity Credit Jocal cell group ^Vsed Credit Jocal cell group ,  When the uplink and downlink channels share the credit resources, the congestion determination formula for the downlink credit resources for the local cell group is PuL+DL Consume Jocal cell group). , Thr > C Capacity Credit Jocal cell group ^Vsed Credit Jocal cell group ,
上下行信道共享信用度资源时, 针对本地小区进行下行信用度资源的拥 塞判决公式为
Figure imgf000012_0002
Credit Jocal cell,
When the uplink and downlink channels share the credit resources, the congestion judgment formula for the downlink credit resources of the local cell is
Figure imgf000012_0002
Credit Jocal cell,
上述公式中, ^。 .表示总的信用度资源大小; c.Used Credit*表示已使用 的信用度资源大小; (
Figure imgf000012_0003
表示预留信用度资源大小。
In the above formula, ^. . Indicates the total credit resource size; c. Used Credit * indicates the size of the used credit resource;
Figure imgf000012_0003
Indicates the size of the reserved credit resource.
4、 如权利要求 1所述的方法, 其特征在于, 根据备选的 LDR动作按优 先级由高到低的顺序选取 LDR动作; 其中, 所述备选的 LDR动作按优先级 顺序依次为尽力型业务降速、 电路交换异系统切换、 分组交换异系统切换, 以及不可控实时业务服务质量重协商。  4. The method according to claim 1, wherein the LDR action is selected in descending order of priority according to an alternative LDR action; wherein the candidate LDR action is in order of priority in order of priority Type service slowdown, circuit switched heterosystem switching, packet switched heterosystem switching, and uncontrolled real-time service quality of service renegotiation.
5、 如权利要求 4所述的方法, 其特征在于, 当选定的 LDR动作为尽力 型业务降速或不可控实时业务服务质量重协商时, 所述根据选定的 LDR动作 选取 RAB, 包括下列步骤: 5. The method of claim 4, wherein when the selected LDR action is a best effort When the type of service is slowed down or the uncontrolled real-time service quality is re-negotiated, the selecting the RAB according to the selected LDR action includes the following steps:
对当前选定的 LDR动作的惩罚状态为否的所有 RAB,按照其 PK值进行 排序, PK值相同时按照用户被选进行 LDR的次数由小到大的顺序; 在排好 序的 RAB列表中由前向后选取 N个 RAB, 所述 N小于等于当前选定的 LDR 动作的最大 RAB数。  All RABs with a penalty status of the currently selected LDR action are sorted according to their PK values. When the PK values are the same, the number of times the LDR is selected by the user is from small to large; in the sorted RAB list. N RABs are selected from front to back, and the N is less than or equal to the maximum number of RABs of the currently selected LDR action.
6、 如权利要求 4所述的方法, 其特征在于, 当选定的 LDR动作为电路 交换异系统切换或分组交换异系统切换时, 所述根据选定的 LDR动作选取用 户, 包括下列步骤:  6. The method according to claim 4, wherein when the selected LDR action is a circuit switched different system switch or a packet switched different system switch, the selecting the user according to the selected LDR action comprises the following steps:
对当前选定的 LDR动作的惩罚状态为否的所有 RAB,按照其 PK值进行 排序, PK值相同时按照用户被选进行 LDR的次数由小到大的顺序; 在排好 序的用户列表中由前向后选取 N个用户, 所述 N小于等于当前选定的 LDR 动作的最大用户数。  All RABs with a penalty state of the currently selected LDR action are sorted according to their PK values. When the PK values are the same, the number of times the LDR is selected by the user is from small to large; in the sorted user list. N users are selected from front to back, and the N is less than or equal to the maximum number of users of the currently selected LDR action.
7、 如权利要求 4所述的方法, 其特征在于, 根据当前选定的 LDR动作 未能选出合适的 RAB,则按照备选 LDR动作的优先级由高到低的顺序选取下 一 LDR动作。  7. The method according to claim 4, wherein, according to the currently selected LDR action, the appropriate RAB is not selected, and the next LDR action is selected according to the priority of the candidate LDR action from high to low. .
8、 如权利要求 4所述的方法, 其特征在于, 执行当前选定的 LDR动作 后, 若未能解除信用度资源的拥塞, 则按照备选 LDR动作的优先级由高到低 的顺序选取下一 LDR动作。  8. The method according to claim 4, wherein, after performing the currently selected LDR action, if the credit resource congestion is not released, the priority of the candidate LDR action is selected in descending order of priority. An LDR action.
9、 一种解除信用度资源拥塞的装置, 其特征在于, 包括:  9. A device for relieving congestion of credit resources, comprising:
拥塞判决模块, 用于对信用度资源进行拥塞判决;  a congestion decision module, configured to perform congestion judgment on credit resources;
LDR动作选取模块, 用于在拥塞判决模块判定信用度资源拥塞时, 选取 负载重整 LDR动作;  The LDR action selection module is configured to select a load reforming LDR action when the congestion determination module determines that the credit resource is congested;
RAB选取模块,用于根据 LDR动作选取模块选定的 LDR动作选取 RAB 或用户;  The RAB selection module is configured to select the RAB or the user according to the LDR action selected by the LDR action selection module;
LDR动作执行模块, 用于对 RAB选^莫块选定的 RAB或用户当前所占 用的信用度资源执行 LDR动作选取模块选定的 LDR动作。 The LDR action execution module is configured to perform an LDR action selected by the LDR action selection module on the selected RAB of the RAB selection block or the credit resource currently occupied by the user.
10、 如权利要求 9所述的装置, 其特征在于, 所述拥塞判决模块至少进 行下列判决之一: 基站上行信用度资源拥塞的判决; 基站下行信用度资源拥 塞的判决; 本地小区组上行信用度资源拥塞的判决; 本地小区组下行信用度 资源拥塞的判决; 本地小区上行信用度资源拥塞的判决; 本地小区下行信用 度资源拥塞。 10. The apparatus according to claim 9, wherein the congestion determination module performs at least one of the following: a decision of a base station uplink credit resource congestion; a base station downlink credit resource congestion decision; a local cell group uplink credit resource congestion The decision of the local cell group downlink credit resource congestion; the local cell uplink credit resource congestion decision; the local cell downlink credit resource congestion.
11、 如权利要求 9所述的装置, 其特征在于, 所述 LDR动作选取模块备 选的 LDR动作按优先级由高到低的顺序依次为: 尽力型业务降速、 电路交换 异系统切换、 分组交换异系统切换, 以及不可控实时业务服务质量重协商。  11. The apparatus according to claim 9, wherein the LDR actions of the LDR action selection module are in descending order of priority: descending service speed reduction, circuit switching different system switching, Packet switched hetero-system switching, and uncontrolled real-time service quality of service renegotiation.
12、 如权利要求 11所述的装置, 其特征在于, 所述 LDR动作执行模块 执行了 LDR动作选取模块当前选定的 LDR动作后, 若拥塞判决模块判定未 能解除信用度资源的拥塞, 则 LDR动作执行模块触发 LDR动作选取模块按 照备选 LDR动作的优先级由高到低的顺序选取下一 LDR动作。  12. The apparatus according to claim 11, wherein the LDR action execution module executes the LDR action currently selected by the LDR action selection module, and if the congestion decision module determines that the credit resource congestion is not resolved, the LDR The action execution module triggers the LDR action selection module to select the next LDR action according to the order of priority of the alternate LDR action from high to low.
13、 如权利要求 11所述的装置, 其特征在于, RAB选取模块根据 LDR 动作选^ ^莫块当前选定的 LDR动作未能选出合适的 RAB或用户,则触发 LDR 动作选取模块按照备选 LDR动作的优先级由高到低的顺序选取下一 LDR动 作。  13. The apparatus according to claim 11, wherein the RAB selection module fails to select an appropriate RAB or user according to the LDR action selected by the LDR action, and triggers the LDR action selection module to prepare The priority of the LDR action is selected from the highest to the lowest order to select the next LDR action.
PCT/CN2008/000496 2007-03-14 2008-03-13 A method and device for relieving congestion of credit resources WO2008110074A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2007100868353A CN101022673B (en) 2007-03-14 2007-03-14 Method and device for removing credit degree resource congestion
CN200710086835.3 2007-03-14

Publications (1)

Publication Number Publication Date
WO2008110074A1 true WO2008110074A1 (en) 2008-09-18

Family

ID=38710293

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2008/000496 WO2008110074A1 (en) 2007-03-14 2008-03-13 A method and device for relieving congestion of credit resources

Country Status (2)

Country Link
CN (1) CN101022673B (en)
WO (1) WO2008110074A1 (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101022673B (en) * 2007-03-14 2010-08-25 华为技术有限公司 Method and device for removing credit degree resource congestion
CN104703223B (en) * 2015-04-02 2017-12-26 四川理工学院 The method that the PUC algorithms integrated based on fusion load alleviate cell load congestion

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050030893A1 (en) * 2003-07-21 2005-02-10 Dropps Frank R. Method and system for detecting congestion and over subscription in a fibre channel network
CN1780465A (en) * 2004-11-18 2006-05-31 华为技术有限公司 Overload congestion controlling method
CN1859754A (en) * 2005-12-05 2006-11-08 华为技术有限公司 Blind switching method in cell load control
CN1889719A (en) * 2006-07-31 2007-01-03 华为技术有限公司 Cell ability judging method, system and radio network controller
CN101022673A (en) * 2007-03-14 2007-08-22 华为技术有限公司 Method and device for removing credit degree resource congestion

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20050030893A1 (en) * 2003-07-21 2005-02-10 Dropps Frank R. Method and system for detecting congestion and over subscription in a fibre channel network
CN1780465A (en) * 2004-11-18 2006-05-31 华为技术有限公司 Overload congestion controlling method
CN1859754A (en) * 2005-12-05 2006-11-08 华为技术有限公司 Blind switching method in cell load control
CN1889719A (en) * 2006-07-31 2007-01-03 华为技术有限公司 Cell ability judging method, system and radio network controller
CN101022673A (en) * 2007-03-14 2007-08-22 华为技术有限公司 Method and device for removing credit degree resource congestion

Also Published As

Publication number Publication date
CN101022673B (en) 2010-08-25
CN101022673A (en) 2007-08-22

Similar Documents

Publication Publication Date Title
US10667278B2 (en) Managing wireless resources
EP1695581B1 (en) Method and device for managing resources shared by different operators in a communication system
EP3471355B1 (en) Communication network congestion control using allocation and retention priority
TWI270304B (en) Method and system for managing radio resources in a time-slotted communication system
US7853266B2 (en) Method and device for management of an overload in a cell of a radio communication network, corresponding uses, computer program and storage means
Kwan et al. On pre-emption and congestion control for LTE systems
Cheng et al. DiffServ resource allocation for fast handoff in wireless mobile Internet
CN106332088B (en) Frequency spectrum sharing method based on user fairness among different operators
Wang et al. Admission control for non-preprovisioned service flow in wireless metropolitan area networks
WO2011032454A1 (en) Method and equipment for allocating resource of shared network
JP5410296B2 (en) Power overload control method useful for high speed downlink packet access
Qian et al. A novel radio admission control scheme for multiclass services in LTE systems
CN100514938C (en) Method and system for controlling Iub interface band width resource in wireless network
TW200803541A (en) Wireless communication method and apparatus for selecting a channel type for a call
De Bernardi et al. Load control strategies for mixed services in WCDMA
KR20090076675A (en) Method and apparatus for congestion control in communication system
US7209750B2 (en) Communication system, communication unit and method of power saving therein
WO2008110074A1 (en) A method and device for relieving congestion of credit resources
Moorman et al. Real-time prioritized call admission control in a base station scheduler
Shen et al. Resource Allocation Schemes in Integrated Heterogeneous Wireless and Mobile Networks.
AlQahtani et al. Dynamic radio resource allocation for 3G and beyond mobile wireless networks
Singh Performance aspects of enhanced radio resource management with qos differentiation in umts network
WO2008101366A1 (en) A packet dispatching method in wireless communication system
Elnaggar et al. A Call Admission Control Protocol for Multimedia Cellular Networks.
Jain et al. Hybrid mixed handover for call blocking probability analysis in wireless ATM network

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 08714949

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 08714949

Country of ref document: EP

Kind code of ref document: A1