WO2012034289A1 - Method and system for managing channel identifier allocation - Google Patents

Method and system for managing channel identifier allocation Download PDF

Info

Publication number
WO2012034289A1
WO2012034289A1 PCT/CN2010/077065 CN2010077065W WO2012034289A1 WO 2012034289 A1 WO2012034289 A1 WO 2012034289A1 CN 2010077065 W CN2010077065 W CN 2010077065W WO 2012034289 A1 WO2012034289 A1 WO 2012034289A1
Authority
WO
WIPO (PCT)
Prior art keywords
cid
rnc
idle
module
occupied
Prior art date
Application number
PCT/CN2010/077065
Other languages
French (fr)
Chinese (zh)
Inventor
王嘉
董小虎
况正谦
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Priority to PCT/CN2010/077065 priority Critical patent/WO2012034289A1/en
Publication of WO2012034289A1 publication Critical patent/WO2012034289A1/en

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/16—Central resource management; Negotiation of resources or communication parameters, e.g. negotiating bandwidth or QoS [Quality of Service]
    • H04W28/18—Negotiating wireless communication parameters

Definitions

  • the present invention relates to the field of mobile communications technologies, and in particular, to a channel identifier allocation management method and system.
  • BACKGROUND As shown in FIG. 1 , an interface between two radio network controllers (Radio Network Controller, RNC X, Serving RNC (SRNC for short) and Drift RNC (DRNC for short)) Called the Iur interface.
  • RNC X Radio Network Controller
  • SRNC Serving RNC
  • DRNC Drift RNC
  • the Iur port can be divided into a wireless network layer and a transport network layer.
  • the transport network layer uses the ATM technology
  • the transport network layer can be further divided into a control plane and a user plane.
  • the Alcap protocol is a transport network layer control plane protocol.
  • the SRNC sends an Establish Request (ERQ) message to the DRNC.
  • the DRNC allocates resources. If the resource allocation is successful, the DRNC returns to the SRNC.
  • Establish an Confirmation (ECF) message to confirm that the bearer is successfully established.
  • the RNC at both ends of the Iur interface may simultaneously send an ERQ message to the opposite end.
  • the RNCs at both ends of the Iur share the Asynchronous Transfer Mode (ATM) Adaptation Layer (AAL) 2 resources. If the RNCs at both ends use the same AAL2 channel, they can use the channel identifier. (Channel Identifier, abbreviated as CID)
  • CID Channel Identifier
  • the resources are all from 8 to 255, so that when two RNCs send ERQ messages to the other party at the same time, the same CID on the same channel may be used, and conflicts may occur, causing the bearer establishment failure.
  • the principle of CID allocation is only specified in the ALCAP protocol: (1) If the AAL2 channel carrying the new connection belongs to the AAL2 node, it starts from 8. The CID value is allocated upwards; (2) If the AAL2 channel carrying the new connection is not attributed to the AAL2 node, the CID value is assigned downward from 255.
  • the specific scheme of CID allocation management is not given, so that the CID conflict of the Iur interface cannot be effectively solved.
  • a CID allocation management system including: a first RNC, configured to update a locally saved idle CID when it is learned that a CID is occupied or released, and press the idle CID from a small Sorting in a large order, and when establishing a new connection, sending an ERQ message to the second RNC using the smallest CID in the idle CID; the second RNC is connected to the first RNC through the Iur interface, When it is learned that the CID is occupied or released, the locally saved free CID is updated, the free CIDs are arranged in order from small to large, and when a new connection is established, the maximum CID in the free CID is used. Sending an ERQ message to the first RNC.
  • a method for managing allocation of a CID including: the first RNC sorts the locally stored idle CIDs in order from small to large; the first RNC determines that it needs to be associated with the second RNC. Establishing a radio link connection, and sending a radio link setup request message to the second RNC, where the second RNC is a peer RNC connected to the first RNC through an Iur interface; the first RNC receives the a response message of the asynchronous transfer mode ATM address carrying the second RNC returned by the second RNC; the first RNC allocates a transmission resource according to the ATM address, and uses the smallest CID of the idle CID to the second The RNC sends an ERQ message.
  • the method further includes: the second RNC sorting the locally stored idle CIDs in an order from small to large; the second RNC determines that a wireless link connection needs to be established with the first RNC, to the The first RNC sends a radio link setup request message; the second RNC receives a response message that is sent by the first RNC and carries an ATM address of the first RNC; and the second RNC allocates a transmission resource according to the ATM address, And transmitting an ERQ message to the first RNC using a maximum CID of the freely stored CIDs stored locally.
  • the first RNC and the second RNC learn that a CID is occupied or released
  • the locally saved free CIDs are updated and sorted in ascending order, thereby enabling
  • the first RNC can use the smallest CID in the currently idle CID every time the CID is used
  • the second RNC can use the maximum CID in the currently idle CID every time the CID is used, thereby avoiding the first
  • the CID conflict caused by the RNC and the second RNC sending the ERQ message to the peer using the same CID on the same channel at the same time ensures that the load can be successfully established.
  • FIG. 1 is a schematic diagram of a networking structure of an Iur interface according to the prior art
  • FIG. 2 is a schematic diagram of a protocol stack of an Iur interface according to the prior art
  • FIG. 3 is a schematic diagram of an embodiment of the present invention.
  • 4 is a schematic structural diagram of a first RNC 10 according to an embodiment of the present invention
  • FIG. 5 is a schematic structural diagram of a second RNC 20 according to an embodiment of the present invention.
  • a flowchart of a CID allocation management method according to an embodiment of the present invention is a schematic diagram of a CID sequence allocated by RNC1 and RNC2 according to an embodiment of the present invention.
  • FIG. 8 is a radio link establishment according to an embodiment of the present invention.
  • Flowchart 1; Figure 9 is a flow chart 2 of the wireless link setup in accordance with an embodiment of the present invention. DETAILED DESCRIPTION OF THE INVENTION Embodiments in the present application and features in the embodiments may be combined with each other without conflict.
  • the preferred embodiments of the present invention are described in the following with reference to the accompanying drawings, which are intended to illustrate and illustrate the invention.
  • FIG. 3 is a schematic structural diagram of an allocation management system of a CID according to an embodiment of the present invention.
  • the system mainly includes: a first RNC 10 and a second RNC 20, wherein the first RNC 10 and the second RNC 20
  • the first RNC 10 and the second RNC 20 are peer entities, and the two parties communicate through the Iur interface.
  • the first RNC 10 is configured to update the locally saved idle CID when it is learned that the CID is occupied or released, sort the free CIDs in ascending order, and use the idle when establishing a new connection.
  • the minimum CID in the CID sends an ERQ message to the second RNC 20, and the second RNC 20 is configured to update the locally saved idle CID when the CID is occupied or released, and the free CID is in ascending order.
  • the arrangement is performed, and when a new connection is established, the ERQ message is sent to the first RNC 10 using the largest CID in the free CID.
  • the first RNC 10 and the second RNC 20 update the locally saved idle CIDs, and perform _ ⁇ in order from small to large.
  • FIG. 4 is a schematic structural diagram of a first RNC 10 according to an embodiment of the present invention.
  • the first RNC 10 may include: a first storage module 100, a first acquisition module 102, and a first update module 104.
  • the first sorting module 106 and the first sending module 108 are included in the first RNC 10 in the first RNC 10 in the first RNC 10 in the first RNC 10 in the first RNC 10 in the first RNC 10 is used.
  • the first storage module 100 is configured to save the local idle CID; the first obtaining module 102 is configured to acquire information about the occupied or released CID; and the first update module 104 is configured to use the foregoing according to the occupied or released
  • the information of the CID is updated, and the idle CID saved in the first storage module 100 is updated, and the first sorting module 106 is triggered.
  • the first sorting module 106 is configured to update the stored in the first storage module 100 in order from smallest to largest.
  • the idle CID is sorted; the first sending module 108 is configured to send an ERQ message to the second RNC 20 by using a minimum CID of the idle CIDs stored by the first storage module 100 when establishing a new connection.
  • the first RNC of the embodiment of the present invention may update the stored idle CID when the CID is occupied or released, and sort the updated idle CIDs, so that each time a new connection is established, the first The transmitting module 108 can conveniently use the minimum of the currently available CIDs.
  • the internal idle CID queue of the first RNC 10 that is in the initial state is: 8, 9, 10... , x, ... y, ... 254, 255 where x, y are any two CIDs of a channel ( PATH ) on the Iur port of the first RNC 10, where 8 ⁇ x ⁇ y ⁇ 255.
  • the support is released in a call after X, y is occupied, and regardless of the time sequence of the release, as long as X, y returns to the idle queue, the free CID remains 8, 9, 10. .. , X, . . . y , ...254 , 255 of the team ⁇ 'J J'l page order.
  • the first obtaining module 102 may notify the first update module 104 after the first sending module 108 uses the sending ERQ message of the minimum CID to learn that the minimum CID is occupied.
  • the first update module 104 deletes the minimum CID stored in the first storage module 100.
  • the first obtaining module 102 may obtain the information that the maximum CID has been occupied after receiving the ERQ message sent by the second RNC 20 using the maximum CID, and notify the first An update module 104; the first update module 104 deletes the maximum CID used by the second RNC from the free CID stored by the first storage module 100.
  • the first obtaining module 102 can be occupied.
  • FIG. 5 is a schematic structural diagram of a second RNC 20 according to an embodiment of the present invention.
  • the second RNC 20 may include: a second storage module 200, a second acquisition module 202, and a second update module 204.
  • the second sorting module 206 and the second sending module 208 are examples of the second RNC 20.
  • the second storage module 200 is configured to save the local idle CID; the second obtaining module 202 is configured to acquire information about the occupied or released CID; and the second update module 204 is configured to use the foregoing according to the occupied or released
  • the information of the CID is updated, and the idle CID saved in the second storage module 200 is updated, and the second sorting module 206 is triggered.
  • the second sorting module 206 is configured to update the stored in the second storage module 200 in order from small to large.
  • the idle CID is sorted; the second sending module 208 is configured to send an ERQ message to the first RNC 20 by using a maximum CID of the idle CIDs stored by the second storage module 200 when establishing a new connection.
  • the stored idle CID may be updated when the CID is occupied or released, and the updated idle CIDs are sorted, so that each When a new connection is established, the second sending module 208 can conveniently use the maximum value of the currently idle CID.
  • the second obtaining module 202 may notify the second update module 204 after the second sending module 208 uses the sending ERQ message of the maximum CID to learn that the maximum CID is occupied.
  • the second update module 204 deletes the maximum CID stored in the second storage module 200.
  • the second obtaining module 202 may obtain the information that the minimum CID has been occupied after receiving the request message sent by the first RNC 10 using the minimum CID, and notify the The second update module 204 deletes the minimum CID used by the second RNC from the free CID stored by the second storage module 200.
  • the second obtaining module 202 may obtain the information that the CID occupied by the connection is released when the connection occupying the CID is released, and notify the second update module 204; After receiving the notification from the second obtaining module 202, the module 204 adds the CID occupied by the connection to the free CID stored by the second storage module 200, and triggers the second sorting module 206 to perform the updated idle CID. Sort.
  • FIG. 6 is a flowchart of a CID allocation management method according to an embodiment of the present invention. The method may be implemented by the system as described above. As shown in FIG.
  • the method mainly includes the following steps: Step S602, a first RNC Sorting the locally saved idle CIDs in order from small to large; step S604, the first RNC determines that a radio link connection needs to be established with the second RNC, and sends a radio link setup request message to the second RNC, where
  • the second RNC is the peer RNC connected to the first RNC through the Iur interface; for example, the first RNC is the SRNC of the UE, and needs to establish a bearer for the UE, and then sends the radio to the DRNC of the UE (ie, the second RNC).
  • Step S606 the first RNC receives a response message of the second RNC carrying the ATM address returned by the second RNC;
  • Step S 608 the first RNC allocates the transmission resource according to the ATM address, and uses the idle The smallest CID in the CID sends an ERQ message to the second RNC.
  • the first RNC may delete the minimum CID from the locally saved idle CID; likewise, the second RNC may also minimize the The CID is removed from the locally saved free CID.
  • the foregoing description is performed by using the first RNC as the SRNC to initiate the setup of the bearer.
  • the process for starting the bearer setup by the second RNC as the SRNC is similar to that of the first RNC. Therefore, the method may further include the following steps: Step 1: The second RNC presses the slave , j, in a large order, sorting the locally stored idle CIDs; Step 2, the second RNC determines that a radio link connection needs to be established with the first RNC, and sends a radio link setup request message to the first RNC; The second RNC receives the response message of the ATM address carrying the first RNC returned by the first RNC. Step 4: The second RNC allocates the transmission resource to the ATM address, and uses the largest CID of the idle CID saved locally. The ERQ message is sent to the first RNC.
  • the second RNC may delete the maximum CID from the locally saved idle CID; likewise, the first RNC may also maximize the The CID is removed from the locally saved free CID. Moreover, when the occupied CID in one call is released, the first RNC and the second RNC respectively add the CID to the locally saved free CID, and re-locally save the idle in the order from small to large. CID is sorted.
  • FIG. 7 is a schematic diagram of two RNCs (RNC1 and RNC2) that are connected by Iur in the embodiment of the present invention. As shown in FIG.
  • RNC1 allocates CIDs in order from small to large, that is, each time RNC1 allocates The CID is the minimum value in the current idle CID, and the RNC2 allocates the CIDs in descending order, that is, the CID allocated by the RNC2 each time is the maximum value in the current idle CID, thereby avoiding the CID conflict.
  • RNC1 is taken as SRNC and RNC2 as SRNC as an example. If RNC1 is used as the SRNC in a service, as shown in Figure 8, the flow is set up.
  • Step 801 The RNC 1 sends a radio link setup request message to the RNC 2; Step 802, the RNC 2 replies to the RNC1 with a radio link setup response message, where the response message carries the ATM address of the RNC 2; After receiving the response message of the RNC2, the RNC1 allocates the transmission resource according to the ATM address of the RNC2, and sends an ERQ message, where the CID used by the RNC1 is the minimum value of the current idle CID, for example, 8 (if 8 is already occupied) Then, 9,9 is occupied, then 10, and so on); Step 804, RNC1 and RNC2 delete the CID used in step 803 from the idle CID; the next service repeats the above process.
  • Step 901 RNC2 sends a radio link setup request message to RNC 1; Step 902, RNC1 to RNC2 Responding to the radio link setup response message, where the response message carries the ATM address of the RNC1; Step 903, after receiving the response message of the RNC1, the RNC2 allocates the transmission resource according to the ATM address of the RNC1, and sends the ERQ message, where the ERQ message is used.
  • CID is the maximum value of the currently idle CID, ⁇ column ⁇ port 255 ( ⁇ mouth 255 has been occupied, Bay 'J with 254, 254 is occupied, Bay 'J with 253, with jt ⁇ class 4 dance); 904, RNC1 and RNC2 delete the CID used in step 903 from the idle CID; the next service repeats the above process.
  • the first RNC and the second RNC update the locally saved idle CIDs, and perform the order from small to large.
  • the second RNC can use the maximum CID in the currently idle CID each time the CID is used. Thereby avoiding the first RNC and the second RNC At the same time, the CID conflict caused by sending the ERQ message to the peer using the same CID on the same channel ensures that the bearer can be successfully established.

Landscapes

  • Engineering & Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

A method and system for managing Channel Identifier (CID) allocation are provided by the present invention. The system includes: a first Radio Network Controller (RNC), used for updating the locally stored idle CIDs once learning that a CID is in use or released, for sorting the idle CIDs in the order upwards, and for transmitting an Establishment Request (ERQ) message to a second RNC using the minimum CID of the idle CIDs when establishing a new connection; and the second RNC, which is connected to the first RNC through an Iur interface, used for updating the locally stored idle CIDs once learning that a CID is in use or released, for sorting the idle CIDs in the order upwards, and for transmitting the ERQ message to the first RNC using the maximum CID of the idle CIDs when establishing a new connection. The present invention can avoid the CID conflict, and ensure the success of bearer establishment.

Description

信道标识符的分配管理方法及*** 技术领域 本发明涉及移动通信技术领域， 尤其涉及一种信道标识符的分配管理方 法及***。 背景技术 如图 1所示， 两个无线网络控制器 （ Radio Network Controller , 简称为 RNC X包括服务 RNC( Serving RNC,简称为 SRNC )和漂移 RNC( Drift RNC, 简称为 DRNC ) )之间的接口称为 Iur接口。 其中， SRNC和 DRNC是针对某 特定用户的逻辑和功能上的不同概念， SRNC是指为当前用户提供到核心网 的 Iu连接的 RNC。 同一个 RNC对用户设备 1 ( UE1 ) 来说是 SRNC, 而对 UE2来说可能是 DRNC; 对同一个 UE, 也可以通过重定位将原来的 DRNC 转换为 SRNC。 图 2为 Iur口的协议栈的结构示意图， 如图 2所示， Iur口可分为无线网 络层和传输网络层。 当传输网络层使用 ATM技术时， 传输网络层又可分为 控制面和用户面， 其中， Alcap协议为传输网络层控制面协议。 由 Alcap协议可知， 当 Iur口要建立承载时， SRNC会向 DRNC发送建 立请求 （ Establish Request, 简称为 ERQ ) 消息， DRNC收到 ERQ消息后， 分配资源， 如果资源分配成功， 则 DRNC向 SRNC返回建立确定（Establish Confirm , 简称为 ECF ) 消息， 确认承载建立成功。 由于 SRNC和 DRNC只是针对特定用户的逻辑概念，在实际使用中可能 会出现 Iur口两端的 RNC同时向对端发送 ERQ消息的情况。 Iur两端的 RNC 共享异步传输模式（ Asynchronous Transfer Mode,简称为 ATM )适配层（ ATM Adaption Layer, 简称为 AAL ) 2资源， 如果两端的 RNC使用同一条 AAL2 通道， 而它们可以使用的信道标识符（Channel Identifier, 简称为 CID ) 资源 都是从 8到 255 , 从而使得在两个 RNC同时向对方发送 ERQ消息时， 可能 使用同一条通道上的同一个 CID, 进而发生冲突， 造成承载建立失败。 为了降低 CID冲突的可能性， ALCAP协议中只规定了 CID分配使用的 原则为： （ 1 )如果承载新连接的 AAL2通道归属于 AAL2节点， 则从 8开始 向上分配 CID值； （ 2 ) 如果承载新连接的 AAL2通道不归属于 AAL2节点， 则从 255开始向下分配 CID值。但并没有给出 CID分配管理的具体方案，从 而无法有效地解决 Iur接口的 CID冲突的问题。 发明内容 有鉴于此， 本发明提供了一种 CID的分配管理方法及***方案， 用以解 决现有技术中无法有效地解决 Iur接口的 CID冲突的问题。 根据本发明的一个方面， 提供了一种 CID的分配管理***， 包括： 第一 RNC, 用于在获知有 CID被占用或释放时， 更新本地保存的空闲的 CID, 将 该空闲的 CID按从小到大的顺序进行排序， 并在建立新的连接时， 使用所述 空闲的 CID中的最小 CID向第二 RNC发送 ERQ消息； 第二 RNC, 通过 Iur 接口与所述第一 RNC连接， 用于在获知有 CID被占用或释放时， 更新本地 保存的空闲的 CID, 将该空闲的 CID按从小到大的顺序进行排列， 并在建立 新的连接时，使用所述空闲的 CID中的最大 CID向所述第一 RNC发送 ERQ 消息。 根据本发明的另一个方面， 提供了一种 CID的分配管理方法， 包括： 第 一 RNC按从小到大的顺序对本地保存的空闲的 CID进行排序；第一 RNC确 定需要与第二 RNC之间建立无线链路连接， 向所述第二 RNC发送无线链路 建立请求消息， 其中， 所述第二 RNC为与所述第一 RNC通过 Iur接口连接 的对端 RNC; 第一 RNC接收所述第二 RNC返回的携带所述第二 RNC的异 步传输模式 ATM地址的响应消息； 第一 RNC才艮据所述 ATM地址分配传输 资源， 并使用所述空闲的 CID中的最小 CID向所述第二 RNC发送 ERQ消 息。 上述方法还包括： 所述第二 RNC 按从小到大的顺序对本地保存的空闲 的 CID进行排序；所述第二 RNC确定需要与所述第一 RNC之间建立无线链 路连接， 向所述第一 RNC发送无线链路建立请求消息； 所述第二 RNC接收 所述第一 RNC返回的携带所述第一 RNC的 ATM地址的响应消息； 所述第 二 RNC根据该 ATM地址分配传输资源， 并使用本地保存的所述空闲的 CID 中的最大 CID向所述第一 RNC发送 ERQ消息。 通过本发明， 第一 RNC和第二 RNC在获知有 CID被占用或释放时， 对 本地保存的空闲的 CID进行更新， 并按照从小到大的顺序进行排序， 从而使 得第一 RNC每次在使用 CID时均可以使用到当前空闲的 CID中的最小 CID , 而第二 RNC每次在使用 CID时均可以使用到当前空闲的 CID中的最大 CID , 从而避免了第一 RNC和第二 RNC在同一时刻在同一条通道使用同一个 CID 向对端发送 ERQ消息而导致的 CID冲突， 确保 载能够建立成功。 本发明的其它特征和优点将在随后的说明书中阐述， 并且， 部分地从说 明书中变得显而易见， 或者通过实施本发明而了解。 本发明的目的和其他优 点可通过在所写的说明书、 权利要求书、 以及附图中所特别指出的结构来实 现和获得。 附图说明 附图用来提供对本发明的进一步理解， 并且构成说明书的一部分， 与本 发明的实施例一起用于解释本发明， 并不构成对本发明的限制。 在附图中： 图 1是才艮据现有技术的 Iur接口的组网结构示意图； 图 2是根据现有技术的 Iur接口的协议栈的示意图； 图 3是才艮据本发明实施例的 CID的分配管理***的结构示意图； 图 4是才艮据本发明实施例的第一 RNC 10的结构示意图； 图 5是才艮据本发明实施例的第二 RNC 20的结构示意图； 图 6是才艮据本发明实施例的 CID的分配管理方法的流程图； 图 7是才艮据本发明实施例的 RNC1和 RNC2分配 CID顺序的示意图； 图 8是根据本发明实施例的无线链路建立的流程图一； 图 9是才艮据本发明实施例的无线链路建立的流程图二。 具体实施方式 在不冲突的情况下，本申请中的实施例及实施例中的特征可以相互组合。 以下结合附图对本发明的优选实施例进行说明， 应当理解， 此处所描述 的优选实施例仅用于说明和解释本发明， 并不用于限定本发明。 图 3是 居本发明实施例 CID的分配管理***的结构示意图， 如图 3所 示， 该***主要包括： 第一 RNC 10和第二 RNC 20, 其中， 第一 RNC 10和 第二 RNC 20之间通过 Iur接口连接， 即第一 RNC 10和第二 RNC 20为对等 实体， 双方通过 Iur接口通信。 第一 RNC 10用于在获知有 CID被占用或释放时， 更新本地保存的空闲 的 CID,将该空闲的 CID按从小到大的顺序进行排序，并在建立新的连接时， 使用该空闲的 CID中的最小 CID向第二 RNC 20发送 ERQ消息； 第二 RNC 20, 用于在获知有 CID被占用或释放时， 更新本地保存的空 闲的 CID , 将该空闲的 CID按从小到大的顺序进行排列， 并在建立新的连接 时， 使用该空闲的 CID中的最大 CID向第一 RNC 10发送 ERQ消息。 在本发明实施例提供的上述***中， 第一 RNC 10和第二 RNC 20在获 知有 CID被占用或释放时，对本地保存的空闲的 CID进行更新， 并按照从小 到大的顺序进行 _悱序， 从而使得第一 RNC 10每次在使用 CID时均可以使用 到当前空闲的 CID中的最小 CID , 而第二 RNC 20每次在使用 CID时均可以 使用到当前空闲的 CID中的最大 CID,从而避免了第一 RNC 10和第二 RNC 20在同一时刻在同一条通道使用同一个 CID向对端发送 ERQ消息而导致的 CID冲突， 确保承载能够建立成功。 图 4是才艮据本发明实施例的第一 RNC 10的结构示意图， 如图 4所示， 第一 RNC 10可以包括： 第一存储模块 100、 第一获取模块 102、 第一更新模 块 104、 第一排序模块 106和第一发送模块 108。 其中， 第一存储模块 100, 用于保存本地的空闲的 CID; 第一获取模块 102 , 用于获取被占用或释放的 CID的信息； 第一更新模块 104 , 用于根据被占用或释放的上述 CID的信息， 更新第一存储模块 100中保存的空闲的 CID, 并触发第一排序模块 106; 第 一排序模块 106, 用于按从小到大的顺序对第一存储模块 100中存储的更新 后的空闲的 CID进行排序； 第一发送模块 108 , 用于在建立新的连接时， 使 用第一存储模块 100存储的空闲的 CID中的最小 CID向第二 RNC 20发送 ERQ消息。 通过本发明实施例的该第一 RNC, 可以在 CID被占用或释放时， 更新存储的空闲的 CID , 并对更新后的空闲的 CID进行排序， 从而使得在每 次建立新连接时， 第一发送模块 108可以很方便的使用当前空闲的 CID中的 最小值。 例如， 支如初始状态的第一 RNC 10的内部的空闲 CID队列为： 8, 9, 10... , x, ... y, ...254,255 其中， x, y是第一 RNC 10的 Iur口上一条通道（ PATH )的任意 2个 CID, 其中， 8≤x<y≤255。 某一时刻， 支设在一次呼叫中 X, y 被占用了之后被释放， 则不论释放 的时间顺序如何， 只要 X, y回到空闲队列中， 则空闲的 CID均保持 8, 9, 10... , X, . . . y , ...254 , 255的队歹 'J J'l页序。 在本发明实施例的一个优选实施方式中， 第一获取模块 102可以在第一 发送模块 108使用所述最小 CID的发送 ERQ消息之后， 获知所述最小 CID 被占用， 则通知第一更新模块 104, 第一更新模块 104删除第一存储模块 100 中存储的所述最小 CID。 在本明实施例的另一优选实施方式中， 第一获取模块 102可以在接收到 第二 RNC 20使用上述最大 CID发送的 ERQ消息后， 获取所述最大 CID已 被占用的信息， 则通知第一更新模块 104; 第一更新模块 104将第二 RNC使 用的所述最大 CID从第一存储模块 100存储的所述空闲的 CID中删除。 在本发明实施例的又一优选实施方式中， 第一获取模块 102可以在占用TECHNICAL FIELD The present invention relates to the field of mobile communications technologies, and in particular, to a channel identifier allocation management method and system. BACKGROUND As shown in FIG. 1 , an interface between two radio network controllers (Radio Network Controller, RNC X, Serving RNC (SRNC for short) and Drift RNC (DRNC for short)) Called the Iur interface. Among them, SRNC and DRNC are different logical and functional concepts for a specific user, and SRNC refers to an RNC that provides the current user with an Iu connection to the core network. The same RNC is SRNC for User Equipment 1 (UE1) and DRNC for UE2. For the same UE, the original DRNC can also be converted to SRNC by relocation. 2 is a schematic structural diagram of a protocol stack of an Iur interface. As shown in FIG. 2, the Iur port can be divided into a wireless network layer and a transport network layer. When the transport network layer uses the ATM technology, the transport network layer can be further divided into a control plane and a user plane. The Alcap protocol is a transport network layer control plane protocol. According to the Alcap protocol, when the Iur port is to establish a bearer, the SRNC sends an Establish Request (ERQ) message to the DRNC. After receiving the ERQ message, the DRNC allocates resources. If the resource allocation is successful, the DRNC returns to the SRNC. Establish an Confirmation (ECF) message to confirm that the bearer is successfully established. Since the SRNC and the DRNC are only logical concepts for a specific user, in actual use, the RNC at both ends of the Iur interface may simultaneously send an ERQ message to the opposite end. The RNCs at both ends of the Iur share the Asynchronous Transfer Mode (ATM) Adaptation Layer (AAL) 2 resources. If the RNCs at both ends use the same AAL2 channel, they can use the channel identifier. (Channel Identifier, abbreviated as CID) The resources are all from 8 to 255, so that when two RNCs send ERQ messages to the other party at the same time, the same CID on the same channel may be used, and conflicts may occur, causing the bearer establishment failure. In order to reduce the possibility of CID conflict, the principle of CID allocation is only specified in the ALCAP protocol: (1) If the AAL2 channel carrying the new connection belongs to the AAL2 node, it starts from 8. The CID value is allocated upwards; (2) If the AAL2 channel carrying the new connection is not attributed to the AAL2 node, the CID value is assigned downward from 255. However, the specific scheme of CID allocation management is not given, so that the CID conflict of the Iur interface cannot be effectively solved. SUMMARY OF THE INVENTION In view of this, the present invention provides a CID allocation management method and system solution for solving the problem that the CID conflict of the Iur interface cannot be effectively solved in the prior art. According to an aspect of the present invention, a CID allocation management system is provided, including: a first RNC, configured to update a locally saved idle CID when it is learned that a CID is occupied or released, and press the idle CID from a small Sorting in a large order, and when establishing a new connection, sending an ERQ message to the second RNC using the smallest CID in the idle CID; the second RNC is connected to the first RNC through the Iur interface, When it is learned that the CID is occupied or released, the locally saved free CID is updated, the free CIDs are arranged in order from small to large, and when a new connection is established, the maximum CID in the free CID is used. Sending an ERQ message to the first RNC. According to another aspect of the present invention, a method for managing allocation of a CID is provided, including: the first RNC sorts the locally stored idle CIDs in order from small to large; the first RNC determines that it needs to be associated with the second RNC. Establishing a radio link connection, and sending a radio link setup request message to the second RNC, where the second RNC is a peer RNC connected to the first RNC through an Iur interface; the first RNC receives the a response message of the asynchronous transfer mode ATM address carrying the second RNC returned by the second RNC; the first RNC allocates a transmission resource according to the ATM address, and uses the smallest CID of the idle CID to the second The RNC sends an ERQ message. The method further includes: the second RNC sorting the locally stored idle CIDs in an order from small to large; the second RNC determines that a wireless link connection needs to be established with the first RNC, to the The first RNC sends a radio link setup request message; the second RNC receives a response message that is sent by the first RNC and carries an ATM address of the first RNC; and the second RNC allocates a transmission resource according to the ATM address, And transmitting an ERQ message to the first RNC using a maximum CID of the freely stored CIDs stored locally. With the present invention, when the first RNC and the second RNC learn that a CID is occupied or released, the locally saved free CIDs are updated and sorted in ascending order, thereby enabling The first RNC can use the smallest CID in the currently idle CID every time the CID is used, and the second RNC can use the maximum CID in the currently idle CID every time the CID is used, thereby avoiding the first The CID conflict caused by the RNC and the second RNC sending the ERQ message to the peer using the same CID on the same channel at the same time ensures that the load can be successfully established. Other features and advantages of the invention will be set forth in the description which follows, and The objectives and other advantages of the invention will be realized and attained by the <RTI The drawings are intended to provide a further understanding of the invention, and are intended to be a part of the description of the invention. In the drawings: FIG. 1 is a schematic diagram of a networking structure of an Iur interface according to the prior art; FIG. 2 is a schematic diagram of a protocol stack of an Iur interface according to the prior art; FIG. 3 is a schematic diagram of an embodiment of the present invention. 4 is a schematic structural diagram of a first RNC 10 according to an embodiment of the present invention; FIG. 5 is a schematic structural diagram of a second RNC 20 according to an embodiment of the present invention; A flowchart of a CID allocation management method according to an embodiment of the present invention; FIG. 7 is a schematic diagram of a CID sequence allocated by RNC1 and RNC2 according to an embodiment of the present invention; FIG. 8 is a radio link establishment according to an embodiment of the present invention. Flowchart 1; Figure 9 is a flow chart 2 of the wireless link setup in accordance with an embodiment of the present invention. DETAILED DESCRIPTION OF THE INVENTION Embodiments in the present application and features in the embodiments may be combined with each other without conflict. The preferred embodiments of the present invention are described in the following with reference to the accompanying drawings, which are intended to illustrate and illustrate the invention. 3 is a schematic structural diagram of an allocation management system of a CID according to an embodiment of the present invention. As shown in FIG. 3, the system mainly includes: a first RNC 10 and a second RNC 20, wherein the first RNC 10 and the second RNC 20 The first RNC 10 and the second RNC 20 are peer entities, and the two parties communicate through the Iur interface. The first RNC 10 is configured to update the locally saved idle CID when it is learned that the CID is occupied or released, sort the free CIDs in ascending order, and use the idle when establishing a new connection. The minimum CID in the CID sends an ERQ message to the second RNC 20, and the second RNC 20 is configured to update the locally saved idle CID when the CID is occupied or released, and the free CID is in ascending order. The arrangement is performed, and when a new connection is established, the ERQ message is sent to the first RNC 10 using the largest CID in the free CID. In the foregoing system provided by the embodiment of the present invention, when the CRN is occupied or released, the first RNC 10 and the second RNC 20 update the locally saved idle CIDs, and perform _悱 in order from small to large. So that the first RNC 10 can use the smallest CID in the currently idle CID each time the CID is used, and the second RNC 20 can use the maximum CID in the currently idle CID each time the CID is used. Therefore, the CID conflict caused by the first RNC 10 and the second RNC 20 transmitting the ERQ message to the opposite end by using the same CID on the same channel at the same time is avoided, and the bearer can be successfully established. FIG. 4 is a schematic structural diagram of a first RNC 10 according to an embodiment of the present invention. As shown in FIG. 4, the first RNC 10 may include: a first storage module 100, a first acquisition module 102, and a first update module 104. The first sorting module 106 and the first sending module 108. The first storage module 100 is configured to save the local idle CID; the first obtaining module 102 is configured to acquire information about the occupied or released CID; and the first update module 104 is configured to use the foregoing according to the occupied or released The information of the CID is updated, and the idle CID saved in the first storage module 100 is updated, and the first sorting module 106 is triggered. The first sorting module 106 is configured to update the stored in the first storage module 100 in order from smallest to largest. The idle CID is sorted; the first sending module 108 is configured to send an ERQ message to the second RNC 20 by using a minimum CID of the idle CIDs stored by the first storage module 100 when establishing a new connection. The first RNC of the embodiment of the present invention may update the stored idle CID when the CID is occupied or released, and sort the updated idle CIDs, so that each time a new connection is established, the first The transmitting module 108 can conveniently use the minimum of the currently available CIDs. For example, the internal idle CID queue of the first RNC 10 that is in the initial state is: 8, 9, 10... , x, ... y, ... 254, 255 where x, y are any two CIDs of a channel ( PATH ) on the Iur port of the first RNC 10, where 8≤x< y ≤ 255. At some point, the support is released in a call after X, y is occupied, and regardless of the time sequence of the release, as long as X, y returns to the idle queue, the free CID remains 8, 9, 10. .. , X, . . . y , ...254 , 255 of the team 歹 'J J'l page order. In a preferred embodiment of the present invention, the first obtaining module 102 may notify the first update module 104 after the first sending module 108 uses the sending ERQ message of the minimum CID to learn that the minimum CID is occupied. The first update module 104 deletes the minimum CID stored in the first storage module 100. In another preferred embodiment of the present disclosure, the first obtaining module 102 may obtain the information that the maximum CID has been occupied after receiving the ERQ message sent by the second RNC 20 using the maximum CID, and notify the first An update module 104; the first update module 104 deletes the maximum CID used by the second RNC from the free CID stored by the first storage module 100. In a further preferred embodiment of the embodiment of the present invention, the first obtaining module 102 can be occupied.
CID的连接被释放时， 获取该连接占用的 CID被释放的信息， 并通知第一更 新模块 104; 第一更新模块 104接收到第一获取模块 102的通知后， 将该连 接占用的 CID添加到第一存储模块 100存储的所述空闲的 CID中，并触发第 一排序模块 106对更新后的空闲的 CID进行排序。 图 5是才艮据本发明实施例的第二 RNC 20的结构示意图， 如图 5所示， 第二 RNC 20可以包括： 第二存储模块 200、 第二获取模块 202、 第二更新模 块 204、 第二排序模块 206和第二发送模块 208。 其中， 第二存储模块 200, 用于保存本地的空闲的 CID； 第二获取模块 202 , 用于获取被占用或释放的 CID的信息； 第二更新模块 204 , 用于根据被占用或释放的上述 CID的信息， 更新第二存储模块 200中保存的空闲的 CID, 并触发第二排序模块 206; 第 二排序模块 206, 用于按从小到大的顺序对第二存储模块 200中存储的更新 后的空闲的 CID进行排序； 第二发送模块 208 , 用于在建立新的连接时， 使 用第二存储模块 200存储的空闲的 CID中的最大 CID向第一 RNC 20发送 ERQ消息。 通过本发明实施例的该第二 RNC, 可以在 CID被占用或释放时， 更新存储的空闲的 CID , 并对更新后的空闲的 CID进行排序，从而使得在每 次建立新连接时， 第二发送模块 208可以很方便的使用当前空闲的 CID中的 最大值。 在本发明实施例的一个优选实施方式中， 第二获取模块 202可以在第二 发送模块 208使用所述最大 CID的发送 ERQ消息之后， 获知所述最大 CID 被占用， 则通知第二更新模块 204 , 第二更新模块 204删除第二存储模块 200 中存储的所述最大 CID。 在本明实施例的另一优选实施方式中， 第二获取模块 202可以在接收到 第一 RNC 10使用上述最小 CID发送的请求消息后，获取所述最小 CID已被 占用的信息， 则通知第二更新模块 204; 第二更新模块 204将第二 RNC使用 的所述最小 CID从第二存储模块 200存储的所述空闲的 CID中删除。 在本发明实施例的又一优选实施方式中， 第二获取模块 202可以在占用 CID的连接被释放时， 获取该连接占用的 CID被释放的信息， 并通知第二更 新模块 204; 第二更新模块 204接收到第二获取模块 202的通知后， 将该连 接占用的 CID添加到第二存储模块 200存储的所述空闲的 CID中，并触发第 二排序模块 206对更新后的空闲的 CID进行排序。 图 6是才艮据本发明实施例的 CID的分配管理方法的流程图，该方法可以 通过如上所述的***实现， 如图 6所示， 该方法主要包括以下步骤： 步骤 S602, 第一 RNC按从小到大的顺序对本地保存的空闲的 CID进行 排序； 步骤 S604, 第一 RNC确定需要与第二 RNC之间建立无线链路连接， 向 第二 RNC发送无线链路建立请求消息， 其中， 第二 RNC为与第一 RNC通 过 Iur接口连接的对端 RNC; 例如， 第一 RNC作为某 UE的 SRNC , 需要为该 UE建立 载， 则向该 UE的 DRNC (即上述第二 RNC )发送无线链路建立请求消息； 步骤 S606 , 第一 RNC接收第二 RNC返回的携带第二 RNC的 ATM地 址的响应消息； 步骤 S 608, 第一 RNC才艮据该 ATM地址分配传输资源， 并使用空闲的 CID中的最小 CID向第二 RNC发送 ERQ消息。 为了使保存的空闲的 CID能够正确反映当前空闲的 CID , 在步骤 S608 之后， 第一 RNC可以将所述最小 CID从本地保存的空闲的 CID中删除； 同 样， 第二 RNC也可以将所述最小 CID从本地保存的空闲的 CID中删除。 上述以第一 RNC作为 SRNC发起建立承载进行描述，对于第二 RNC作 为 SRNC发起建立承载的流程与第一 RNC相似， 因此， 该方法还可以包括 以下步 4聚： 步骤 1 , 第二 RNC按从 , j、到大的顺序对本地保存的空闲的 CID进行排 序； 步骤 2 , 第二 RNC确定需要与第一 RNC之间建立无线链路连接， 向第 一 RNC发送无线链路建立请求消息； 步骤 3 , 第二 RNC接收第一 RNC返回的携带第一 RNC的 ATM地址的 响应消息； 步骤 4, 第二 RNC 居该 ATM地址分配传输资源， 并使用本地保存的 所述空闲的 CID中的最大 CID向第一 RNC发送 ERQ消息。 为了使保存的空闲的 CID能够正确反映当前空闲的 CID,在步骤 4之后， 第二 RNC可以将所述最大 CID从本地保存的空闲的 CID中删除； 同样， 第 一 RNC也可以将所述最大 CID从本地保存的空闲的 CID中删除。 并且， 当一次呼叫中的占用的 CID被释放， 则第一 RNC和第二 RNC分 别将该 CID添加到本地保存的空闲的 CID中，并分别按照从小到大的顺序重 新对本地保存的空闲的 CID进行排序。 图 7是本发明实施例中两个通过 Iur连接的 RNC ( RNC1和 RNC2 ) 分 配 CID顺序的示意图， 如图 7所示， RNC1按照从小到大的顺序分配 CID, 也就是说 RNC1每次分配的 CID为当前空闲 CID中的最小值， 而 RNC2按 照从大到小的顺序分配 CID, 即 RNC2每次分配的 CID为当前空闲 CID中 的最大值， 从而避免了 CID冲突。 下面结合图 7, 分别以 RNC1作为 SRNC和 RNC2作为 SRNC为例进行 说明。 如果在一次业务中， RNC1作为 SRNC, 则如图 8所示， 载建立的流 程主要包括以下步 4聚: 步骤 801 , RNC 1向 RNC2发送无线链路建立请求消息； 步骤 802, RNC2向 RNC1回复无线链路建立响应消息， 该响应消息中携 带有 RNC2的 ATM地址； 步骤 803 , RNC1接收到 RNC2的响应消息后， 才艮据 RNC2的 ATM地址 分配传输资源， 并发送 ERQ消息， 其中， RNC1使用的 CID为当前空闲 CID 中的最小值， 例如， 8 (如果 8已经被占用， 则用 9, 9被占用， 则用 10, 以 此类推）； 步骤 804, RNC1和 RNC2将步骤 803中使用的 CID从空闲的 CID中删 除； 下一次业务重复上述流程。 如果在某一次业务中， RNC2作为 SRNC, 则如图 9所示， 载建立的 流程主要包括以下步 4聚： 步骤 901 , RNC2向 RNC 1发送无线链路建立请求消息； 步骤 902, RNC1向 RNC2回复无线链路建立响应消息， 该响应消息中携 带有 RNC1的 ATM地址； 步骤 903 , RNC2收到 RNC1的响应消息后， 才艮据 RNC1的 ATM地址分 配传输资源， 并发送 ERQ消息， 其中使用的 CID是当前空闲的 CID中的最 大值， Ϊ列 ^口 255 ( ^口果 255 已经被占用， 贝' J用 254, 254被占用， 贝' J用 253 , 以 jt匕类 4舞）； 步骤 904, RNC1和 RNC2将步骤 903中使用的 CID从空闲 CID中删除； 下一次业务重复上述流程。 如上所述， 借助本发明实施例提供的技术方案， 第一 RNC和第二 RNC 在获知有 CID被占用或释放时，对本地保存的空闲的 CID进行更新， 并按照 从小到大的顺序进行 _悱序， 从而使得第一 RNC每次在使用 CID时均可以使 用到当前空闲的 CID中的最小 CID , 而第二 RNC每次在使用 CID时均可以 使用到当前空闲的 CID中的最大 CID,从而避免了第一 RNC和第二 RNC在 同一时刻在同一条通道使用同一个 CID向对端发送 ERQ消息而导致的 CID 冲突， 确保承载能够建立成功。 以上所述仅为本发明的优选实施例而已， 并不用于限制本发明， 对于本 领域的技术人员来说， 本发明可以有各种更改和变化。 凡在本发明的 ^"神和 原则之内， 所作的任何修改、 等同替换、 改进等， 均应包含在本发明的保护 范围之内。 When the connection of the CID is released, the information that the CID occupied by the connection is released is obtained, and the first update module 104 is notified; after receiving the notification of the first obtaining module 102, the first update module 104 adds the CID occupied by the connection to the CID. The first storage module 100 stores the idle CID, and triggers the first sorting module 106 to sort the updated idle CID. FIG. 5 is a schematic structural diagram of a second RNC 20 according to an embodiment of the present invention. As shown in FIG. 5, the second RNC 20 may include: a second storage module 200, a second acquisition module 202, and a second update module 204. The second sorting module 206 and the second sending module 208. The second storage module 200 is configured to save the local idle CID; the second obtaining module 202 is configured to acquire information about the occupied or released CID; and the second update module 204 is configured to use the foregoing according to the occupied or released The information of the CID is updated, and the idle CID saved in the second storage module 200 is updated, and the second sorting module 206 is triggered. The second sorting module 206 is configured to update the stored in the second storage module 200 in order from small to large. The idle CID is sorted; the second sending module 208 is configured to send an ERQ message to the first RNC 20 by using a maximum CID of the idle CIDs stored by the second storage module 200 when establishing a new connection. With the second RNC of the embodiment of the present invention, the stored idle CID may be updated when the CID is occupied or released, and the updated idle CIDs are sorted, so that each When a new connection is established, the second sending module 208 can conveniently use the maximum value of the currently idle CID. In a preferred embodiment of the present invention, the second obtaining module 202 may notify the second update module 204 after the second sending module 208 uses the sending ERQ message of the maximum CID to learn that the maximum CID is occupied. The second update module 204 deletes the maximum CID stored in the second storage module 200. In another preferred embodiment of the present disclosure, the second obtaining module 202 may obtain the information that the minimum CID has been occupied after receiving the request message sent by the first RNC 10 using the minimum CID, and notify the The second update module 204 deletes the minimum CID used by the second RNC from the free CID stored by the second storage module 200. In a further preferred embodiment of the present invention, the second obtaining module 202 may obtain the information that the CID occupied by the connection is released when the connection occupying the CID is released, and notify the second update module 204; After receiving the notification from the second obtaining module 202, the module 204 adds the CID occupied by the connection to the free CID stored by the second storage module 200, and triggers the second sorting module 206 to perform the updated idle CID. Sort. FIG. 6 is a flowchart of a CID allocation management method according to an embodiment of the present invention. The method may be implemented by the system as described above. As shown in FIG. 6, the method mainly includes the following steps: Step S602, a first RNC Sorting the locally saved idle CIDs in order from small to large; step S604, the first RNC determines that a radio link connection needs to be established with the second RNC, and sends a radio link setup request message to the second RNC, where The second RNC is the peer RNC connected to the first RNC through the Iur interface; for example, the first RNC is the SRNC of the UE, and needs to establish a bearer for the UE, and then sends the radio to the DRNC of the UE (ie, the second RNC). a link establishment request message; Step S606, the first RNC receives a response message of the second RNC carrying the ATM address returned by the second RNC; Step S 608, the first RNC allocates the transmission resource according to the ATM address, and uses the idle The smallest CID in the CID sends an ERQ message to the second RNC. In order to enable the saved idle CID to correctly reflect the currently idle CID, after the step S608, the first RNC may delete the minimum CID from the locally saved idle CID; likewise, the second RNC may also minimize the The CID is removed from the locally saved free CID. The foregoing description is performed by using the first RNC as the SRNC to initiate the setup of the bearer. The process for starting the bearer setup by the second RNC as the SRNC is similar to that of the first RNC. Therefore, the method may further include the following steps: Step 1: The second RNC presses the slave , j, in a large order, sorting the locally stored idle CIDs; Step 2, the second RNC determines that a radio link connection needs to be established with the first RNC, and sends a radio link setup request message to the first RNC; The second RNC receives the response message of the ATM address carrying the first RNC returned by the first RNC. Step 4: The second RNC allocates the transmission resource to the ATM address, and uses the largest CID of the idle CID saved locally. The ERQ message is sent to the first RNC. In order to enable the saved idle CID to correctly reflect the currently idle CID, after step 4, the second RNC may delete the maximum CID from the locally saved idle CID; likewise, the first RNC may also maximize the The CID is removed from the locally saved free CID. Moreover, when the occupied CID in one call is released, the first RNC and the second RNC respectively add the CID to the locally saved free CID, and re-locally save the idle in the order from small to large. CID is sorted. FIG. 7 is a schematic diagram of two RNCs (RNC1 and RNC2) that are connected by Iur in the embodiment of the present invention. As shown in FIG. 7, RNC1 allocates CIDs in order from small to large, that is, each time RNC1 allocates The CID is the minimum value in the current idle CID, and the RNC2 allocates the CIDs in descending order, that is, the CID allocated by the RNC2 each time is the maximum value in the current idle CID, thereby avoiding the CID conflict. In the following, with reference to FIG. 7, RNC1 is taken as SRNC and RNC2 as SRNC as an example. If RNC1 is used as the SRNC in a service, as shown in Figure 8, the flow is set up. The process includes the following steps: Step 801: The RNC 1 sends a radio link setup request message to the RNC 2; Step 802, the RNC 2 replies to the RNC1 with a radio link setup response message, where the response message carries the ATM address of the RNC 2; After receiving the response message of the RNC2, the RNC1 allocates the transmission resource according to the ATM address of the RNC2, and sends an ERQ message, where the CID used by the RNC1 is the minimum value of the current idle CID, for example, 8 (if 8 is already occupied) Then, 9,9 is occupied, then 10, and so on); Step 804, RNC1 and RNC2 delete the CID used in step 803 from the idle CID; the next service repeats the above process. If RNC2 is used as the SRNC in a certain service, as shown in FIG. 9, the process of the bearer establishment mainly includes the following steps: Step 901: RNC2 sends a radio link setup request message to RNC 1; Step 902, RNC1 to RNC2 Responding to the radio link setup response message, where the response message carries the ATM address of the RNC1; Step 903, after receiving the response message of the RNC1, the RNC2 allocates the transmission resource according to the ATM address of the RNC1, and sends the ERQ message, where the ERQ message is used. CID is the maximum value of the currently idle CID, Ϊ column ^ port 255 (^ mouth 255 has been occupied, Bay 'J with 254, 254 is occupied, Bay 'J with 253, with jt 匕 class 4 dance); 904, RNC1 and RNC2 delete the CID used in step 903 from the idle CID; the next service repeats the above process. As described above, with the technical solution provided by the embodiment of the present invention, when the CRN is occupied or released, the first RNC and the second RNC update the locally saved idle CIDs, and perform the order from small to large. In order to enable the first RNC to use the smallest CID in the currently idle CID each time the CID is used, and the second RNC can use the maximum CID in the currently idle CID each time the CID is used. Thereby avoiding the first RNC and the second RNC At the same time, the CID conflict caused by sending the ERQ message to the peer using the same CID on the same channel ensures that the bearer can be successfully established. The above is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the scope of the present invention are intended to be included within the scope of the present invention.

Claims

权 利 要 求 书 一种信道标识符 CID的分配管理***， 其特征在于， 包括： The present invention provides a channel identifier CID allocation management system, which is characterized in that it comprises:
第一无线网络控制器 RNC, 用于在获知有 CID被占用或释放时， 更 新本地保存的空闲的 CID ,将该空闲的 CID按从 ,j、到大的顺序进行排序， 并在建立新的连接时， 使用所述空闲的 CID中的最小 CID向第二 RNC 发送建立请求 ERQ消息；  The first radio network controller RNC is configured to update the locally saved idle CID when it is learned that the CID is occupied or released, sort the free CIDs from j, to a large order, and establish a new one. When connecting, sending a setup request ERQ message to the second RNC using the smallest CID in the idle CID;
所述第二 RNC, 通过 Iur接口与所述第一 RNC连接， 用于在获知有 CID被占用或释放时， 更新本地保存的空闲的 CID, 将该空闲的 CID按 从小到大的顺序进行排列， 并在建立新的连接时， 使用所述空闲的 CID 中的最大 CID向所述第一 RNC发送 ERQ消息。 根据权利要求 1所述的***， 其特征在于， 所述第一 RNC包括：  The second RNC is connected to the first RNC through an Iur interface, and is configured to update a locally saved idle CID when the CID is occupied or released, and arrange the free CIDs from small to large. And when establishing a new connection, sending an ERQ message to the first RNC using the largest CID in the idle CID. The system according to claim 1, wherein the first RNC comprises:
第一存储模块， 用于保存所述空闲的 CID;  a first storage module, configured to save the idle CID;
第一获取模块， 用于获取被占用或释放的 CID的信息；  a first acquiring module, configured to acquire information about an occupied or released CID;
第一更新模块， 用于根据被占用或释放的所述 CID的信息， 更新所 述第一存储模块中保存的所述空闲的 CID, 触发第一排序模块；  a first update module, configured to update the idle CID saved in the first storage module according to the information of the CID that is occupied or released, triggering a first sorting module;
所述第一排序模块， 用于按从小到大的顺序对更新后的所述空闲的 CID进行排序；  The first sorting module is configured to sort the updated idle CIDs in order from small to large;
第一发送模块， 用于在建立新的连接时， 使用所述空闲的 CID中的 最小 CID向所述第二 RNC发送 ERQ消息。 根据权利要求 2所述的***， 其特征在于，  And a first sending module, configured to send an ERQ message to the second RNC by using a minimum CID in the idle CID when establishing a new connection. The system of claim 2, wherein
所述第一获取模块用于在所述第一发送模块使用所述最小 CID发送 ERQ消息之后， 获知所述最小 CID被占用；  The first obtaining module is configured to learn, after the first sending module sends the ERQ message by using the minimum CID, that the minimum CID is occupied;
所述第一更新模块用于删除所述第一存储模块存储的所述最小 The first update module is configured to delete the minimum stored by the first storage module
CID。 根据权利要求 2所述的***， 其特征在于， CID. The system of claim 2, wherein
所述第一获取模块用于获取所述第二 RNC 向所述第一 RNC 发送 ERQ消息时使用的 CID; 所述第一更新模块用于将所述第二 RNC使用的所述 CID从所述空 闲的 CID中删除。 根据权利要求 2所述的***， 其特征在于， The first acquiring module is configured to acquire a CID used by the second RNC to send an ERQ message to the first RNC; The first update module is configured to delete the CID used by the second RNC from the idle CID. The system of claim 2, wherein
所述第一获取模块用于在占用 CID的连接被释放时， 获取该连接占 用的 CID被释放的信息；  The first obtaining module is configured to acquire, when the connection occupying the CID is released, information that the CID occupied by the connection is released;
所述第一更新模块用于将该连接占用的 CID添加到所述空闲的 CID 中， 并触发所述第一排序模块。 才艮据权利要求 1至 5中任一项所述的***， 其特征在于， 所述第二 RNC 包括：  The first update module is configured to add the CID occupied by the connection to the idle CID, and trigger the first sorting module. The system according to any one of claims 1 to 5, wherein the second RNC comprises:
第二存储模块， 用于保存所述空闲的 CID;  a second storage module, configured to save the idle CID;
第二获取模块， 用于获取被占用或释放的 CID的信息；  a second acquiring module, configured to acquire information about an occupied or released CID;
第二更新模块， 用于根据被占用或释放的所述 CID的信息， 更新所 述第二存储模块中保存的所述空闲的 CID, 触发第二排序模块；  a second update module, configured to update, according to the information about the CID that is occupied or released, the idle CID saved in the second storage module, triggering a second sorting module;
所述第二排序模块， 用于按从小到大的顺序对更新后的所述空闲的 CID进行排序；  The second sorting module is configured to sort the updated idle CIDs in order from small to large;
第二发送模块， 用于在建立新的连接时， 使用所述空闲的 CID中的 最大 CID向所述第一 RNC发送 ERQ消息。 才艮据权利要求 6所述的***， 其特征在于，  And a second sending module, configured to send an ERQ message to the first RNC by using a maximum CID in the idle CID when establishing a new connection. The system of claim 6 wherein:
所述第二获取模块用于在所述第二发送模块使用所述最大 CID发送 所述 ERQ消息之后， 获知所述最大 CID被占用；  The second obtaining module is configured to learn that the maximum CID is occupied after the second sending module sends the ERQ message by using the maximum CID;
所述第二更新模块用于删除所述第二存储模块存储的所述最大 The second update module is configured to delete the maximum stored by the second storage module
CID。 才艮据权利要求 6所述的***， 其特征在于， CID. The system of claim 6 wherein:
所述第二获取模块用于获取所述第一 RNC 向所述第二 RNC 发送 ERQ消息时使用的 RNC;  The second obtaining module is configured to acquire an RNC used by the first RNC to send an ERQ message to the second RNC;
所述第二更新模块用于将所述第一 RNC使用的所述 CID从所述空 闲的 CID中删除。 The second update module is configured to delete the CID used by the first RNC from the idle CID.
9. 根据权利要求 6所述的***， 其特征在于， 9. The system of claim 6 wherein:
所述第二获取模块用于在占用 CID的连接被释放时， 获取该连接占 用的 CID被释放的信息；  The second obtaining module is configured to obtain, when the connection occupying the CID is released, information that the CID occupied by the connection is released;
所述第二更新模块用于将该连接占用的 CID添加到所述空闲的 CID 中， 并触发所述第二排序模块。  The second update module is configured to add the CID occupied by the connection to the idle CID, and trigger the second sorting module.
10. —种 CID的分配管理方法， 其特征在于， 包括： 10. A CID allocation management method, characterized in that:
第一 RNC按从小到大的顺序对本地保存的空闲的 CID进行排序； 所述第一 RNC确定需要与第二 RNC之间建立无线链路连接， 向所 述第二 RNC发送无线链路建立请求消息， 其中， 所述第二 RNC为与所 述第一 RNC通过 Iur接口连接的对端 RNC;  The first RNC sorts the locally stored idle CIDs in ascending order; the first RNC determines that a radio link connection needs to be established with the second RNC, and sends a radio link setup request to the second RNC. a message, where the second RNC is a peer RNC connected to the first RNC through an Iur interface;
所述第一 RNC接收所述第二 RNC返回的携带所述第二 RNC的异 步传输模式 ATM地址的响应消息；  Receiving, by the first RNC, a response message that is sent by the second RNC and carries an asynchronous transmission mode ATM address of the second RNC;
所述第一 RNC根据所述 ATM地址分配传输资源， 并使用所述空闲 的 CID中的最小 CID向所述第二 RNC发送 ERQ消息。  The first RNC allocates a transmission resource according to the ATM address, and sends an ERQ message to the second RNC by using a minimum CID of the idle CID.
11. 根据权利要求 10所述的方法， 其特征在于， 在所述第一 RNC使用所述 空闲的 CID中的最小 CID向所述第二 RNC发送 ERQ消息之后，所述方 法还包括： The method according to claim 10, wherein after the first RNC sends an ERQ message to the second RNC by using a minimum CID of the idle CID, the method further includes:
所述第一 RNC将所述最小 CID从本地保存的所述空闲的 CID中删 除；  The first RNC deletes the minimum CID from the free CID saved locally;
所述第二 RNC将所述最小 CID从本地保存的空闲的 CID中删除。  The second RNC deletes the minimum CID from the locally stored free CID.
12. 居权利要求 10所述的方法， 其特征在于， 还包括： 12. The method of claim 10, further comprising:
所述第二 RNC按从小到大的顺序对本地保存的空闲的 CID进行排 序；  The second RNC sorts the locally saved idle CIDs in ascending order;
所述第二 RNC确定需要与所述第一 RNC之间建立无线链路连接， 向所述第一 RNC发送无线链路建立请求消息；  Determining, by the second RNC, that a radio link connection needs to be established with the first RNC, and sending a radio link setup request message to the first RNC;
所述第二 RNC接收所述第一 RNC 返回的携带所述第一 RNC 的 ATM地址的响应消息；  Receiving, by the second RNC, a response message that is returned by the first RNC and carries an ATM address of the first RNC;
所述第二 RNC根据该 ATM地址分配传输资源， 并使用本地保存的 所述空闲的 CID中的最大 CID向所述第一 RNC发送 ERQ消息。 The second RNC allocates a transmission resource according to the ATM address, and sends an ERQ message to the first RNC using a maximum CID of the idle CIDs stored locally.
13. 根据权利要求 12所述的方法， 其特征在于， 在所述第二 RNC使用本地 保存的所述空闲的 CID中的最大 CID向所述第一 RNC发送 ERQ消息之 后， 所述方法还包括： The method according to claim 12, wherein after the second RNC sends an ERQ message to the first RNC using a maximum CID of the locally saved CIDs, the method further includes :
所述第二 RNC将所述最大 CID从本地保存的空闲的 CID中删除； 所述第一 RNC将所述最大 CID从本地保存的空闲的 CID中删除。  The second RNC deletes the maximum CID from the locally saved free CID; the first RNC deletes the maximum CID from the locally saved free CID.
14. 根据权利要求 10至 13中任一项所述的方法， 其特征在于， 还包括： 占用 CID的连接被释放， 该连接占用的所述 CID被释放； 所述第一 RNC和所述第二 RNC分别将该 CID添加到本地保存的空 闲的 CID中， 并分别按照从小到大的顺序重新对本地保存的空闲的 CID 进行排序。 The method according to any one of claims 10 to 13, further comprising: releasing a connection occupying a CID, the CID occupied by the connection being released; the first RNC and the first The two RNCs respectively add the CID to the locally stored free CID, and reorder the locally saved free CIDs in ascending order.
PCT/CN2010/077065 2010-09-17 2010-09-17 Method and system for managing channel identifier allocation WO2012034289A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
PCT/CN2010/077065 WO2012034289A1 (en) 2010-09-17 2010-09-17 Method and system for managing channel identifier allocation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2010/077065 WO2012034289A1 (en) 2010-09-17 2010-09-17 Method and system for managing channel identifier allocation

Publications (1)

Publication Number Publication Date
WO2012034289A1 true WO2012034289A1 (en) 2012-03-22

Family

ID=45830939

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2010/077065 WO2012034289A1 (en) 2010-09-17 2010-09-17 Method and system for managing channel identifier allocation

Country Status (1)

Country Link
WO (1) WO2012034289A1 (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1288624A (en) * 1998-11-13 2001-03-21 三星电子株式会社 AAL2 processing device and method for ATM network
CN1735266A (en) * 2004-08-11 2006-02-15 北京三星通信技术研究有限公司 On the Iur interface, solve the method for CID resource allocation conflict
CN1889456A (en) * 2005-06-29 2007-01-03 华为技术有限公司 Parameter information and method for connecting identification renewal during system soft switching

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1288624A (en) * 1998-11-13 2001-03-21 三星电子株式会社 AAL2 processing device and method for ATM network
CN1735266A (en) * 2004-08-11 2006-02-15 北京三星通信技术研究有限公司 On the Iur interface, solve the method for CID resource allocation conflict
CN1889456A (en) * 2005-06-29 2007-01-03 华为技术有限公司 Parameter information and method for connecting identification renewal during system soft switching

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
"ITU-T study group 11. ITU-T Q.2630.1: AAL type 2 signalling protocol - Capability set 1", TELECOMMUNICATION STANDARDIZATION SECTOR OF INTERNATIONAL TELECOMMUNICATION UNION (ITU-T), December 1999 (1999-12-01), pages 74 - 75 *

Similar Documents

Publication Publication Date Title
US20200383007A1 (en) Method and apparatus for non-access stratum message processing during handover in evolved network
JP3802006B2 (en) Signaling connection setting method in mobile communication system
US7664503B2 (en) Method for multimedia broadcast/multicast service signaling bearer connection on Iu interface
CN103874026B (en) Method, system and user terminal that group is exhaled are realized in PTT systems
JP5021772B2 (en) How to prevent resources being accidentally released during the tracking area update or switchover process
CN101018109B (en) A mobility management method of the automatic retransfer request
WO2009015526A1 (en) Method for triggering group information synchronization in real time on network side in cluster communication system
CN101355785B (en) Method and system for transmitting non-access layer information during switching procedure
JP4820952B2 (en) Management of radio bearers in cellular communication systems
CN101272315B (en) Packet data package transmission method, system and network appliance
TW201448630A (en) System architecture and transmission method for service continuity in heterogeneous wireless networks for user device
US8116272B2 (en) Method for dealing with the packet domain gateway support node errors
CN101527935B (en) Processing method and device in scheduling of resources
WO2011018040A1 (en) Method and system for cell update
WO2008025206A1 (en) A method and network for creating the control plane tunnel in the multicast service of the mobile communicating system
WO2006122495A1 (en) A method for switch between the activation status ans in hrpd network and the system thereof
CN101047957B (en) Method for quickly activating moving platform
WO2007098640A1 (en) Method for assigning the carrier frequency in a trunked system
WO2009117887A1 (en) A cluster mobile station and a method for releasing it from a group call
WO2008011807A1 (en) Method for releasing free channel resource and group call system
WO2012034289A1 (en) Method and system for managing channel identifier allocation
CA2737332C (en) Method and system for handling qos flows when moving between systems
WO2011113210A1 (en) Method and device for local switching among multiple base stations
KR100838199B1 (en) Method for data transfer in handover between RASs in WiBro system
WO2006050675A1 (en) A method of realizing link sharing in a digital trunk system

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: 10857145

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: 10857145

Country of ref document: EP

Kind code of ref document: A1