CN106953804B - Method and device for inquiring routing information of called user - Google Patents

Method and device for inquiring routing information of called user Download PDF

Info

Publication number
CN106953804B
CN106953804B CN201610005163.8A CN201610005163A CN106953804B CN 106953804 B CN106953804 B CN 106953804B CN 201610005163 A CN201610005163 A CN 201610005163A CN 106953804 B CN106953804 B CN 106953804B
Authority
CN
China
Prior art keywords
hss
sub
storage unit
routing information
hss storage
Prior art date
Legal status (The legal status 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 status listed.)
Active
Application number
CN201610005163.8A
Other languages
Chinese (zh)
Other versions
CN106953804A (en
Inventor
王磊
王玉娜
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Mobile Group Hainan Co Ltd
Original Assignee
China Mobile Group Hainan 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 China Mobile Group Hainan Co Ltd filed Critical China Mobile Group Hainan Co Ltd
Priority to CN201610005163.8A priority Critical patent/CN106953804B/en
Publication of CN106953804A publication Critical patent/CN106953804A/en
Application granted granted Critical
Publication of CN106953804B publication Critical patent/CN106953804B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L45/00Routing or path finding of packets in data switching networks
    • H04L45/74Address processing for routing
    • H04L45/745Address table lookup; Address filtering

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

The embodiment of the invention discloses a method for inquiring routing information of a called subscriber number, which comprises the following steps: establishing a ring Home Subscriber Server (HSS) by using a Chord protocol; the annular HSS is formed by n-a sub HSS storage units which are sequentially increased in the clockwise direction, routing information of a user number is stored in the n-a sub HSS storage units, and n is an integer which is larger than or equal to 3; establishing a routing table of user numbers corresponding to the n-a sub HSS storage units by adopting a Chord protocol; and determining the routing information of the called subscriber number according to the routing information identifier pointing relation of the routing table of the subscriber number. The embodiment of the invention also discloses a device for inquiring the routing information of the called subscriber number.

Description

被叫用户的路由信息查询方法及装置Called user's routing information query method and device

技术领域technical field

本发明涉及路由信息查询技术,尤其涉及一种被叫用户的路由信息查询方法及装置。The invention relates to a routing information query technology, in particular to a routing information query method and device for a called user.

背景技术Background technique

归属位置寄存器(Home Location Register,HLR)是核心网的一个重要组成部分,在核心网中HLR主要负责管理用户的数据库,它存储着所有在该HLR签约用户的位置信息、业务数据、账户管理等信息;HLR在存放用户原始信息的同时,可以根据用户访问的移动交换中心(Mobile Switching Center,MSC)/拜访位置寄存器(Visitor Location Register,VLR)/服务GPRS支持节点(Serving GPRS Support Node,SGSN)不同,记录并更新用户当前的位置信息,根据这些位置信息,HLR可以为用户提供路由信息。Home Location Register (HLR) is an important part of the core network. In the core network, the HLR is mainly responsible for managing the user's database, which stores the location information, service data, account management, etc. Information; while storing the original information of the user, the HLR can store the original information of the user according to the mobile switching center (Mobile Switching Center, MSC)/Visitor Location Register (Visitor Location Register, VLR)/Serving GPRS Support Node (SGSN) visited by the user. Differently, the current location information of the user is recorded and updated, and according to the location information, the HLR can provide routing information for the user.

当前的被叫用户的路由信息查询方法主要为:当主叫A用户呼叫本地被叫B用户时,A用户将发送查询请求,请求本地HLR数据库查询被叫B用户号码所属的位置信息,待本地HLR查询到B用户的路由信息后发送至A用户,至此完成被叫用户的路由信息的查询过程;当前的HLR数据库采用集中式存储架构,HLR数据库主要依托直接数值模拟(DirectNumerical Simulation,DNS)查询算法来实现被叫用户的路由信息的查找,该查询算法低效,无法快速定位被叫用户的路由信息。The current route information query method of the called user is mainly as follows: when the calling user A calls the local called user B, the user A will send a query request to request the local HLR database to query the location information of the called user B's number. The HLR queries the routing information of user B and sends it to user A. At this point, the query process of the routing information of the called user is completed; the current HLR database adopts a centralized storage architecture, and the HLR database mainly relies on Direct Numerical Simulation (DNS) query Algorithms are used to find the routing information of the called user. This query algorithm is inefficient and cannot quickly locate the routing information of the called user.

发明内容SUMMARY OF THE INVENTION

有鉴于此,本发明实施例期望提供一种被叫用户的路由信息查询方法及装置,仅需较少的跳数即可完成被叫用户号码的路由信息的快速定位,提高被叫用户的路由信息查询的效率。In view of this, the embodiments of the present invention are expected to provide a method and device for querying routing information of a called user, which can quickly locate the routing information of the called user's number with only a few hops, and improve the routing information of the called user. Information query efficiency.

为达到上述目的,本发明的技术方案是这样实现的:In order to achieve the above object, the technical scheme of the present invention is achieved in this way:

本发明提供一种被叫用户号码的路由信息查询方法,所述方法包括:The present invention provides a method for querying routing information of a called subscriber number, the method comprising:

利用Chord协议建立环形归属签约用户服务器HSS;其中,所述环形HSS由n=a个子HSS存储单元按照顺时针方向依次增大原则所组成,用户号码的路由信息存储在所述n=a个子HSS存储单元上,所述n为大于等于3的整数;A ring-shaped home subscriber server HSS is established by using the Chord protocol; wherein, the ring-shaped HSS is composed of n=a sub-HSS storage units according to the principle of increasing clockwise order, and the routing information of the subscriber number is stored in the n=a sub-HSS On the storage unit, the n is an integer greater than or equal to 3;

采用Chord协议构建所述n=a个子HSS存储单元各自对应的用户号码的路由表;Adopt Chord protocol to construct the routing table of the respective corresponding subscriber numbers of the n=a sub-HSS storage units;

根据所述用户号码的路由表的路由信息标识符指向关系确定出被叫用户号码的路由信息。The routing information of the called subscriber number is determined according to the pointing relationship of the routing information identifier in the routing table of the subscriber number.

上述方案中,在所述环形HSS由所述n=a个子HSS存储单元按照顺时针方向依次增大原则所组成之后,所述方法还包括:In the above solution, after the annular HSS is composed of the n=a sub-HSS storage units according to the principle of increasing sequentially in a clockwise direction, the method further includes:

确定在所述环形HSS中离当前子HSS存储单元中路由信息标识符最近的前一个有效的子HSS存储单元为当前子HSS存储单元中路由信息标识符的前驱子HSS存储单元,在所述环形HSS中离当前子HSS存储单元中路由信息标识符最近的后一个有效的子HSS存储单元为当前子HSS存储单元中路由信息标识符的后继子HSS存储单元。It is determined that the previous valid sub-HSS storage unit closest to the routing information identifier in the current sub-HSS storage unit in the ring HSS is the predecessor sub-HSS storage unit of the routing information identifier in the current sub-HSS storage unit, and in the ring The next valid sub-HSS storage unit in the HSS that is closest to the routing information identifier in the current sub-HSS storage unit is the successor sub-HSS storage unit of the routing information identifier in the current sub-HSS storage unit.

上述方案中,所述采用Chord协议构建所述n=a个子HSS存储单元各自对应的用户号码的路由表之后,所述方法还包括:In the above solution, after the Chord protocol is used to construct the routing table of the subscriber numbers corresponding to the n=a sub-HSS storage units, the method further includes:

当所述环形HSS扩容一个新的子HSS存储单元时,利用所述Chord协议确定所述新的子HSS存储单元中路由信息标识符的后继子HSS存储单元和前驱子HSS存储单元;When the annular HSS expands a new sub-HSS storage unit, utilize the Chord protocol to determine the successor sub-HSS storage unit and the predecessor sub-HSS storage unit of the routing information identifier in the new sub-HSS storage unit;

将属于所述新的子HSS存储单元的用户号码的路由信息由所述n个子HSS存储单元转移到所述新的子HSS存储单元中;Transferring the routing information of the subscriber number belonging to the new sub-HSS storage unit to the new sub-HSS storage unit from the n sub-HSS storage units;

采用所述Chord协议更新扩容后的环形HSS中的n=a+1个子HSS存储单元各自对应的用户号码的路由表。The Chord protocol is used to update the routing table of the subscriber numbers corresponding to each of the n=a+1 sub-HSS storage units in the expanded ring HSS.

上述方案中,所述方法还包括:所述当前子HSS存储单元备份所述当前子HSS存储单元的前驱子HSS存储单元内的用户号码的路由信息。In the above solution, the method further includes: the current sub-HSS storage unit backs up the routing information of the subscriber number in the predecessor sub-HSS storage unit of the current sub-HSS storage unit.

上述方案中,所述当前子HSS存储单元备份所述当前子HSS存储单元的前驱子HSS存储单元内的用户号码的路由信息之后,所述方法还包括:In the above solution, after the current sub-HSS storage unit backs up the routing information of the subscriber number in the predecessor sub-HSS storage unit of the current sub-HSS storage unit, the method further includes:

当所述环形HSS减容一个旧的子HSS存储单元时,采用所述Chord协议更新减容后的环形HSS中的n=a-1个子HSS存储单元各自对应的用户号码的路由表。When the ring HSS reduces the capacity of an old sub-HSS storage unit, the Chord protocol is used to update the routing table of the subscriber numbers corresponding to each of the n=a-1 sub-HSS storage units in the reduced ring HSS.

本发明还提供一种被叫用户号码的路由信息查询装置,所述装置包括:The present invention also provides a routing information query device for a called subscriber number, the device comprising:

建立模块,用于利用Chord协议建立环形归属签约用户服务器HSS;其中,所述环形HSS由n=a个子HSS存储单元按照顺时针方向依次增大原则所组成,用户号码的路由信息存储在所述n=a个子HSS存储单元上,所述n为大于等于3的整数;The establishment module is used to establish a ring-shaped home subscriber server HSS by using the Chord protocol; wherein, the ring-shaped HSS is composed of n=a sub-HSS storage units according to the principle of increasing clockwise direction, and the routing information of the user number is stored in the On n=a sub-HSS storage units, the n is an integer greater than or equal to 3;

路由表构建模块,用于采用Chord协议构建所述n=a个子HSS存储单元各自对应的用户号码的路由表;a routing table building module for constructing the routing table of the respective subscriber numbers of the n=a sub-HSS storage units using the Chord protocol;

第一确定模块,用于根据所述用户号码的路由表的标识符指向关系确定出被叫用户号码的路由信息。The first determining module is configured to determine the routing information of the called subscriber number according to the identifier pointing relationship in the routing table of the subscriber number.

上述方案中,所述装置还包括:In the above scheme, the device also includes:

第二确定模块,用于确定在所述环形HSS中离当前子HSS存储单元中路由信息标识符最近的前一个有效的子HSS存储单元为当前子HSS存储单元中路由信息标识符的前驱子HSS存储单元,在所述环形HSS中离当前子HSS存储单元中路由信息标识符最近的后一个有效的子HSS存储单元为当前子HSS存储单元中路由信息标识符的后继子HSS存储单元。The second determining module is configured to determine that the last valid sub-HSS storage unit in the ring HSS that is closest to the routing information identifier in the current sub-HSS storage unit is the predecessor sub-HSS of the routing information identifier in the current sub-HSS storage unit A storage unit, in the ring HSS, the next valid sub-HSS storage unit closest to the routing information identifier in the current sub-HSS storage unit is the successor sub-HSS storage unit of the routing information identifier in the current sub-HSS storage unit.

上述方案中,所述装置还包括:In the above scheme, the device also includes:

扩容模块,用于当所述环形HSS扩容一个新的子HSS存储单元时,利用所述Chord协议确定所述新的子HSS存储单元中路由信息标识符的后继子HSS存储单元和前驱子HSS存储单元;The capacity expansion module is used to determine the successor sub-HSS storage unit and the predecessor sub-HSS storage unit of the routing information identifier in the new sub-HSS storage unit by using the Chord protocol when the annular HSS expands a new sub-HSS storage unit unit;

还用于将属于所述新的子HSS存储单元的用户号码的路由信息由所述n个子HSS存储单元转移到所述新的子HSS存储单元中;Also used for transferring the routing information of the subscriber number belonging to the new sub-HSS storage unit to the new sub-HSS storage unit from the n sub-HSS storage units;

还用于采用所述Chord协议更新扩容后的环形HSS中的n=a+1个子HSS存储单元各自对应的用户号码的路由表。It is also used to update the routing table of the subscriber numbers corresponding to each of the n=a+1 sub-HSS storage units in the expanded ring HSS by using the Chord protocol.

上述方案中,所述装置还包括:In the above scheme, the device also includes:

备份模块,用于所述当前子HSS存储单元备份所述当前子HSS存储单元的前驱子HSS存储单元内的用户号码的路由信息。A backup module, used for the current sub-HSS storage unit to back up the routing information of the subscriber number in the predecessor sub-HSS storage unit of the current sub-HSS storage unit.

上述方案中,所述装置还包括:In the above scheme, the device also includes:

移除模块,用于当所述环形HSS减容一个旧的子HSS存储单元时,采用所述Chord协议更新减容后的环形HSS中的n=a-1个子HSS存储单元各自对应的用户号码的路由表。A removal module, configured to update the corresponding user numbers of n=a-1 sub-HSS storage units in the reduced ring HSS by using the Chord protocol when the ring HSS reduces the capacity of an old sub-HSS storage unit routing table.

本发明实施例提供的被叫用户的路由信息查询方法及装置,利用Chord协议建立环形HSS;其中,所述环形HSS由n=a个子HSS存储单元按照顺时针方向依次增大原则所组成,用户号码的路由信息存储在所述n=a个子HSS存储单元上,所述n为大于等于3的整数;确定在所述环形HSS中离当前子HSS存储单元最近的前一个有效的子HSS存储单元为当前子HSS存储单元的前驱子HSS存储单元,在所述环形HSS中离当前子HSS存储单元最近的后一个有效的子HSS存储单元为当前子HSS存储单元的后继子HSS存储单元;采用Chord协议构建所述n=a个子HSS存储单元各自对应的用户号码的路由表;根据所述用户号码的路由表的标识符指向关系确定出被叫用户号码的路由信息;本发明的方法基于Chord协议构建分布式网络架构的环形HSS,通过构建各自子HSS存储单元的用户号码的路由表,根据路由表查询到被叫用户号码的路由信息,相比集中式DNS查询算法效率更高,仅需较少的跳数即可完成被叫用户号码的路由信息的快速定位。The method and device for querying the routing information of the called user provided by the embodiment of the present invention use the Chord protocol to establish a ring HSS; wherein, the ring HSS is composed of n=a sub-HSS storage units according to the principle of increasing sequentially in a clockwise direction, and the user The routing information of the number is stored in the n=a sub-HSS storage units, where n is an integer greater than or equal to 3; determine the previous valid sub-HSS storage unit closest to the current sub-HSS storage unit in the ring HSS is the predecessor sub-HSS storage unit of the current sub-HSS storage unit, and the next effective sub-HSS storage unit closest to the current sub-HSS storage unit in the annular HSS is the successor sub-HSS storage unit of the current sub-HSS storage unit; adopt Chord The protocol constructs the routing table of the respective corresponding subscriber numbers of the n=a sub-HSS storage units; the routing information of the called subscriber number is determined according to the identifier pointing relationship of the routing table of the subscriber number; the method of the present invention is based on the Chord protocol Constructing the ring HSS of the distributed network architecture, by constructing the routing table of the subscriber numbers of the respective sub-HSS storage units, and querying the routing information of the called subscriber number according to the routing table, it is more efficient than the centralized DNS query algorithm, and only needs to be more efficient. A few hops can complete the rapid positioning of the routing information of the called subscriber number.

附图说明Description of drawings

图1为本发明被叫用户的路由信息查询方法实施例一的流程图;1 is a flowchart of Embodiment 1 of a method for querying routing information of a called user according to the present invention;

图2为本发明被叫用户的路由信息查询方法实施例一的环形HSS架构图;2 is a schematic diagram of a ring-shaped HSS structure according to Embodiment 1 of a method for querying routing information of a called user according to the present invention;

图3为本发明被叫用户的路由信息查询方法实施例一的子HSS存储单元逻辑连接示意图;3 is a schematic diagram of logical connections of sub-HSS storage units in Embodiment 1 of a routing information query method for a called user according to the present invention;

图4为本发明被叫用户的路由信息查询方法实施例二的流程图;4 is a flowchart of Embodiment 2 of a method for querying routing information of a called user according to the present invention;

图5为本发明被叫用户的路由信息查询方法实施例三的流程图;5 is a flowchart of Embodiment 3 of a method for querying routing information of a called user according to the present invention;

图6为本发明被叫用户的路由信息查询方法实施例三的减容前的子HSS存储单元逻辑连接示意图;6 is a schematic diagram of logical connections of sub-HSS storage units before capacity reduction according to Embodiment 3 of a method for querying routing information of a called user according to the present invention;

图7为本发明被叫用户的路由信息查询方法实施例三的减容后的子HSS存储单元逻辑连接示意图;7 is a schematic diagram of logical connections of sub-HSS storage units after capacity reduction according to Embodiment 3 of a method for querying routing information of a called user according to the present invention;

图8为本发明被叫用户的路由信息查询装置实施例的结构示意图。FIG. 8 is a schematic structural diagram of an embodiment of an apparatus for querying routing information of a called user according to the present invention.

具体实施方式Detailed ways

下面将结合本发明实施例中的附图,对本发明实施例中的技术方案进行清楚、完整地描述。The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention.

图1为本发明被叫用户的路由信息查询方法实施例一的流程图,如图1所示,本发明的方法步骤可以包括如下步骤:FIG. 1 is a flowchart of Embodiment 1 of a method for querying routing information of a called user according to the present invention. As shown in FIG. 1 , the method steps of the present invention may include the following steps:

步骤101、利用Chord协议建立环形HSS;其中,所述环形HSS由n=a个子HSS存储单元按照顺时针方向依次增大原则所组成,用户号码的路由信息存储在所述n=a个子HSS存储单元上,所述n为大于等于3的整数。Step 101, using the Chord protocol to establish a ring HSS; wherein, the ring HSS is composed of n=a sub-HSS storage units according to the principle of increasing clockwise order, and the routing information of the subscriber number is stored in the n=a sub-HSS storage units. On the unit, the n is an integer greater than or equal to 3.

Chord协议是一种为网络应用开发的扩展性较好的P2P发现服务,Chord协议为HSS的每个节点和关键字(Key)分配m位标识符,m最大为160位整数,因此最大地址空间为2160;关键字由用户号码的路由信息标识符(Routing Information ID,RIID)表示,节点标识符为子HSS存储单元标识符(N)。每个子HSS存储单元都有两个邻居子HSS存储单元。The Chord protocol is a P2P discovery service with good scalability developed for network applications. The Chord protocol allocates m-bit identifiers to each node and key (Key) of the HSS. The maximum m is a 160-bit integer, so the maximum address space is 2 160 ; the keyword is represented by the routing information identifier (Routing Information ID, RIID) of the subscriber number, and the node identifier is the sub-HSS storage unit identifier (N). Each sub-HSS memory cell has two neighbor sub-HSS memory cells.

被叫用户号码的路由信息查询装置利用Chord协议建立环形HSS,其中,所述环形HSS由n=a个子HSS存储单元按照顺时针方向依次增大原则所组成,用户号码的路由信息存储在所述n=a个子HSS存储单元上,所述n为大于等于3的整数。The routing information query device of the called subscriber number uses the Chord protocol to establish a ring HSS, wherein the ring HSS is composed of n=a sub-HSS storage units according to the principle of increasing clockwise order, and the routing information of the subscriber number is stored in the said ring HSS. On n=a sub-HSS storage units, the n is an integer greater than or equal to 3.

图2为本发明被叫用户的路由信息查询方法实施例一的环形HSS架构图,图3为本发明被叫用户的路由信息查询方法实施例一的子HSS存储单元逻辑连接示意图,如图2、图3所示,本发明实施例设计为n=200个子HSS存储单元(图中现有子HSS存储单元为11个,其余子HSS存储单元未示出);用户号码的路由信息标识符设计为m=48位,则理论上可以存储的用户号码的路由信息数量为248个,因此本发明实施例的最大用户号码的路由信息数量为N=200×1012(2×1014<248);环形HSS有200个子HSS存储单元,每个子HSS存储单元存储1×1012条用户号码的路由信息;在此设计第一个保存1×1012条用户号码路由信息的子HSS存储单元标识符为N1×10 12,则根据Chord协议的子HSS存储单元标识符顺时针方向依次增大原则,在此设计第二个HSS存储单元标识符为N2×10 12,第三个子HSS存储单元标识符为N3×10 12,第n个子HSS存储单元标识符为Nn×10 122 is a schematic diagram of a ring HSS structure according to Embodiment 1 of a method for querying routing information of a called user according to the present invention, and FIG. 3 is a schematic diagram of logical connections of sub-HSS storage units in Embodiment 1 of the method for querying routing information of a called user according to the present invention, as shown in FIG. 2 3, the embodiment of the present invention is designed as n=200 sub-HSS storage units (the existing sub-HSS storage units are 11 in the figure, and the remaining sub-HSS storage units are not shown); the routing information identifier design of the subscriber number is m= 48 bits, then the number of routing information of the user number that can be stored theoretically is 248, so the number of routing information of the maximum user number in the embodiment of the present invention is N=200×10 12 (2×10 14 <2 48 ); the ring HSS has 200 sub-HSS storage units, and each sub-HSS storage unit stores the routing information of 1×10 12 user numbers; the first sub-HSS storage unit that saves 1×10 12 user number routing information is designed here If the identifier is N 1×10 12 , according to the principle of increasing the sub-HSS storage unit identifiers in the Chord protocol in a clockwise direction, the second HSS storage unit identifier is designed to be N 2×10 12 , and the third sub-HSS storage unit identifier is N 2×10 12 . The storage unit identifier is N 3×10 12 , and the n-th sub-HSS storage unit identifier is N n×10 12 .

步骤102、确定在所述环形HSS中离当前子HSS存储单元中路由信息标识符最近的前一个有效的子HSS存储单元为当前子HSS存储单元中路由信息标识符的前驱子HSS存储单元,在所述环形HSS中离当前子HSS存储单元中路由信息标识符最近的后一个有效的子HSS存储单元为当前子HSS存储单元中路由信息标识符的后继子HSS存储单元。Step 102: Determine that the last valid sub-HSS storage unit closest to the routing information identifier in the current sub-HSS storage unit in the ring HSS is the predecessor sub-HSS storage unit of the routing information identifier in the current sub-HSS storage unit, and The next valid sub-HSS storage unit in the ring HSS that is closest to the routing information identifier in the current sub-HSS storage unit is the successor sub-HSS storage unit of the routing information identifier in the current sub-HSS storage unit.

被叫用户号码的路由信息查询装置根据表1中的指向开始项finger[k].start及确定前驱子HSS存储单元项.node可以确定在环形HSS中离当前子HSS存储单元中路由信息标识符最近的前一个有效的子HSS存储单元,即当前子HSS存储单元中路由信息标识符的前驱子HSS存储单元,在确定出当前子HSS存储单元中路由信息标识符的前驱子HSS存储单元后可以确定出在环形HSS中离当前子HSS存储单元中路由信息标识符最近的后一个有效的子HSS存储单元,即为当前子HSS存储单元中路由信息标识符的后继子HSS存储单元。The routing information query device of the called subscriber number can determine the routing information identifier in the ring HSS from the current sub-HSS storage unit in the ring HSS according to the pointing start item finger[k].start and determining the predecessor sub-HSS storage unit item.node The last valid sub-HSS storage unit, that is, the predecessor sub-HSS storage unit of the routing information identifier in the current sub-HSS storage unit, after determining the predecessor sub-HSS storage unit of the routing information identifier in the current sub-HSS storage unit, you can It is determined that the next valid sub-HSS storage unit closest to the routing information identifier in the current sub-HSS storage unit in the ring HSS is the successor sub-HSS storage unit of the routing information identifier in the current sub-HSS storage unit.

表1Table 1

Figure BDA0000902498700000061
Figure BDA0000902498700000061

Figure BDA0000902498700000071
Figure BDA0000902498700000071

步骤103、采用Chord协议构建所述n=a个子HSS存储单元各自对应的用户号码的路由表。Step 103 , using the Chord protocol to construct a routing table of the subscriber numbers corresponding to each of the n=a sub-HSS storage units.

被叫用户号码的路由信息查询装置采用Chord协议构建所述n=a个子HSS存储单元各自对应的用户号码的路由表;表2为用户号码的路由表,如表2所示:The routing information inquiry device of the called subscriber number adopts the Chord protocol to construct the routing table of the subscriber numbers corresponding to the n=a sub-HSS storage units respectively; Table 2 is the routing table of the subscriber number, as shown in Table 2:

表2Table 2

Figure BDA0000902498700000072
Figure BDA0000902498700000072

用户号码的路由表包括了指向开始项finger[k].start、区间项.interval、确定前驱子HSS存储单元项.node、前驱子HSS存储单元项Successor、后继子HSS存储单元项Predecessor。The routing table of the subscriber number includes the pointing start item finger[k].start, the interval item.interval, the determined predecessor sub HSS storage unit item.node, the predecessor sub HSS storage unit item Successor, and the successor HSS storage unit item Predecessor.

例如,构建子HSS存储单元为N8×10 12的用户号码的路由表,子HSS存储单元为N8×10 12的用户号码的路由表每个表项分别以每个用户号码的路由信息标识符(RIID):For example, construct a routing table with a sub-HSS storage unit of N 8×10 12 user numbers, and a sub-HSS storage unit of a routing table of N 8×10 12 user numbers. Each entry is identified by the routing information of each user number. Identifier (RIID):

(8×1012+20)mod248=8×1012+20,(8×1012+21)mod248=8×1012+21(8×10 12 +2 0 )mod2 48 =8×10 12 +2 0 , (8×10 12 +2 1 )mod2 48 =8×10 12 +2 1 ,

(8×1012+22)mod248=8×1012+22,…,(8×1012+245)mod248=8×1012+245(8×10 12 +2 2 )mod2 48 =8×10 12 +2 2 ,…,(8×10 12 +2 45 )mod2 48 =8×10 12 +2 45 ,

(8×1012+246)mod248=8×1012+246,(8×1012+247)mod248=8×1012+247(mod为取余运算)(8×10 12 +2 46 )mod2 48 =8×10 12 +2 46 , (8×10 12 +2 47 )mod2 48 =8×10 12 +2 47 (mod is the remainder operation)

为起始,对应的用户号码的路由信息标识符(RIID)分别为:The routing information identifiers (RIIDs) of the corresponding subscriber numbers are:

[8×1012+20,8×1012+21),[8×1012+21,8×1012+22),…,[8×10 12 +2 0 , 8×10 12 +2 1 ), [8×10 12 +2 1 , 8×10 12 +2 2 ), …,

[8×1012+245,8×1012+246),[8×1012+246,8×1012+247),因此每个用户号码路由信息的后继子HSS存储单元分别为9×1012,9×1012,9×1012,…,44×1012,79×1012,149×1012[8×10 12 +2 45 , 8×10 12 +2 46 ), [8×10 12 +2 46 , 8×10 12 +2 47 ), so the successor HSS storage units of routing information of each subscriber number are respectively are 9×10 12 , 9×10 12 , 9×10 12 , …, 44×10 12 , 79×10 12 , 149×10 12 .

表3为子HSS存储单元为N8×10 12的用户号码的路由表,如表3所示:Table 3 is the routing table of the subscriber numbers whose sub-HSS storage unit is N 8×10 12 , as shown in Table 3:

表3table 3

Figure BDA0000902498700000081
Figure BDA0000902498700000081

Figure BDA0000902498700000091
Figure BDA0000902498700000091

按照构建子HSS存储单元为N8×10 12的用户号码的路由表的方法,可以分别得到子HSS存储单元为N44×10 12的用户号码的路由表,子HSS存储单元为N49×10 12的用户号码的路由表。According to the method of constructing the routing table of the subscriber numbers whose sub-HSS storage units are N 8×10 12 , the routing tables of the subscriber numbers whose sub-HSS storage units are N 44×10 12 can be obtained respectively, and the sub-HSS storage units are N 49×10 Routing table for 12 subscriber numbers.

表4为子HSS存储单元为N44×10 12的用户号码的路由表,如表4所示:Table 4 is the routing table of the subscriber number whose sub-HSS storage unit is N 44×10 12 , as shown in Table 4:

表4Table 4

Figure BDA0000902498700000092
Figure BDA0000902498700000092

表5为子HSS存储单元为N49×10 12的用户号码的路由表,如表5所示:Table 5 is the routing table of the subscriber number whose sub-HSS storage unit is N 49×10 12 , as shown in Table 5:

表5table 5

Figure BDA0000902498700000101
Figure BDA0000902498700000101

步骤104、根据所述用户号码的路由表的标识符指向关系确定出被叫用户号码的路由信息。Step 104: Determine the routing information of the called subscriber number according to the identifier pointing relationship in the routing table of the subscriber number.

被叫用户号码的路由信息查询装置根据所述用户号码的路由表的标识符指向关系确定出被叫用户号码的路由信息;具体的,被叫用户号码的路由信息查询装置可以从任一一个子HSS存储单元开始查找被叫用户号码的路由信息标识符,当查询到一个后继子HSS存储单元时,被叫用户号码的路由信息查询装置会判断被叫用户号码的路由信息标识符的值是否小于等于当前后继子HSS存储单元标识符的值,如果被叫用户号码的路由信息标识符的值大于当前后继子HSS存储单元标识符的值,则继续判断被叫用户号码的路由信息标识符的值是否小于等于下一个后继子HSS存储单元标识符的值,直到被叫用户号码的路由信息标识符的值小于等于后继子HSS存储单元标识符的值为止,这样根据后继子HSS存储单元标识符指向关系就可以确定出被叫用户号码的路由信息;总之,在一个有n个子HSS存储单元的环形HSS中,每次进行被叫用户号码的路由信息查询的路径长度最多为log2(n)跳。The routing information query device of the called user number determines the routing information of the called user number according to the identifier pointing relationship in the routing table of the user number; The sub-HSS storage unit starts to search for the routing information identifier of the called subscriber number. When a successor sub-HSS storage unit is queried, the routing information inquiring device of the called subscriber number will determine whether the value of the routing information identifier of the called subscriber number is Less than or equal to the value of the current successor HSS storage unit identifier, if the value of the routing information identifier of the called subscriber number is greater than the value of the current successor HSS storage unit identifier, continue to judge the value of the routing information identifier of the called subscriber number. Whether the value is less than or equal to the value of the next successor HSS storage unit identifier, until the value of the routing information identifier of the called subscriber number is less than or equal to the value of the successor HSS storage unit identifier, so that according to the successor HSS storage unit identifier The routing information of the called user number can be determined by the pointing relationship; in a word, in a ring HSS with n sub-HSS storage units, the path length of each routing information query of the called user number is at most log 2 (n) Jump.

例如,从子HSS存储单元为N8×10 12开始查找被叫用户号码的路由信息标识符RIID50×10 12时,由表3可以得到被叫用户号码的路由信息标识符RIID50×10 12在区间[RIID8×10 12 +2 45,RIID8×10 12 +2 46)内,其对应的后继子HSS存储单元为N44×10 12,因为被查找的RIID50×10 12的值50×1012大于后继子HSS存储单元N44×10 12的值44×1012,因此继续查询子HSS存储单元N44×10 12,由表4可以得到被叫用户号码的路由信息标识符RIID50×10 12在区间[RIID44×10 12 +2 42,RIID44×10 12 +2 43)内,其对应的后继子HSS存储单元为N49×10 12,因为被查找的RIID50×10 12的值50×1012大于后继子HSS存储单元N49×10 12的值49×1012,因此继续查询子HSS存储单元N49×10 12,由表5可以得到被叫用户号码的路由信息标识符RIID50×10 12在区间[RIID49×10 12 +2 39,RIID49×10 12 +2 40)内,其对应的后继子HSS存储单元为N50×10 12,因为被查找的RIID50×10 12的值50×1012小于等于后继子HSS存储单元N50×10 12的值50×1012,因此被叫用户号码的路由信息标识符RIID50×10 12存储在子HSS存储单元N50×10 12内,可以根据子HSS存储单元N50×10 12标识符指向关系得到被叫用户号码的路由信息标识符RIID50×10 12所对应的被叫用户号码的路由信息,至此被叫用户号码的路由信息查询完成,其查找过程总共为3跳。For example, when searching for the routing information identifier RIID 50×10 12 of the called subscriber number starting from the sub-HSS storage unit of N 8×10 12 , the routing information identifier RIID 50×10 12 of the called subscriber number can be obtained from Table 3 In the interval [RIID 8×10 12 +2 45 , RIID 8×10 12 +2 46 ), its corresponding successor HSS storage unit is N 44×10 12 , because the value of the searched RIID 50×10 12 is 50 ×10 12 is greater than the value 44×10 12 of the successor sub-HSS storage unit N 44× 10 12 , so continue to query the sub-HSS storage unit N 44×10 12 , from Table 4, the routing information identifier RIID 50 of the called subscriber number can be obtained ×10 12 is in the interval [RIID 44×10 12 +2 42 , RIID 44×10 12 +2 43 ), and its corresponding successor HSS storage unit is N 49×10 12 , because the RIID 50×10 12 to be searched for The value of 50×10 12 is greater than the value 49×10 12 of the successor sub-HSS storage unit N 49× 10 12 , so continue to query the sub-HSS storage unit N 49×10 12 , from Table 5, the routing information identifier of the called subscriber number can be obtained If the symbol RIID 50×10 12 is in the interval [RIID 49×10 12 +2 39 , RIID 49×10 12 +2 40 ), its corresponding successor HSS storage unit is N 50×10 12 , because the searched RIID 50 The value 50× 10 12 of ×10 12 is less than or equal to the value 50×10 12 of the successor sub-HSS storage unit N 50× 10 12 , so the routing information identifier RIID 50×10 12 of the called subscriber number is stored in the sub-HSS storage unit N Within 50 ×10 12 , the routing information of the called subscriber number corresponding to the routing information identifier RIID 50×10 12 of the called subscriber number can be obtained according to the sub-HSS storage unit N 50×10 12 identifier pointing relationship. The routing information query of the subscriber number is completed, and the search process is 3 hops in total.

本发明实施例提供的被叫用户的路由信息查询方法,利用Chord协议建立环形HSS;其中,所述环形HSS由n=a个子HSS存储单元按照顺时针方向依次增大原则所组成,用户号码的路由信息存储在所述n=a个子HSS存储单元上,所述n为大于等于3的整数;确定在所述环形HSS中离当前子HSS存储单元最近的前一个有效的子HSS存储单元为当前子HSS存储单元的前驱子HSS存储单元,在所述环形HSS中离当前子HSS存储单元最近的后一个有效的子HSS存储单元为当前子HSS存储单元的后继子HSS存储单元;采用Chord协议构建所述n=a个子HSS存储单元各自对应的用户号码的路由表;根据所述用户号码的路由表的标识符指向关系确定出被叫用户号码的路由信息;本发明的方法基于Chord协议构建分布式网络架构的环形HSS,通过构建各自子HSS存储单元的用户号码的路由表,根据路由表查询到被叫用户号码的路由信息,相比集中式DNS查询算法效率更高,仅需较少的跳数即可完成被叫用户号码的路由信息的快速定位。The method for querying the routing information of the called user provided by the embodiment of the present invention uses the Chord protocol to establish a ring HSS; wherein, the ring HSS is composed of n=a sub-HSS storage units according to the principle of increasing clockwise order, and the number of the user number is increased. The routing information is stored in the n=a sub-HSS storage units, where n is an integer greater than or equal to 3; it is determined that the previous valid sub-HSS storage unit closest to the current sub-HSS storage unit in the ring HSS is the current sub-HSS storage unit The predecessor sub-HSS storage unit of the sub-HSS storage unit, the last valid sub-HSS storage unit closest to the current sub-HSS storage unit in the annular HSS is the successor sub-HSS storage unit of the current sub-HSS storage unit; Adopt Chord protocol to construct The routing table of the respective corresponding subscriber numbers of the n=a sub-HSS storage units; the routing information of the called subscriber number is determined according to the identifier pointing relationship of the routing table of the subscriber number; the method of the present invention constructs a distribution based on the Chord protocol The ring-shaped HSS of the type network architecture, by constructing the routing table of the subscriber numbers of the respective sub-HSS storage units, and querying the routing information of the called subscriber number according to the routing table, is more efficient than the centralized DNS query algorithm, and only needs less The number of hops can complete the rapid positioning of the routing information of the called subscriber number.

为了更加体现出本发明的目的,在上述实施例的基础上,进一步的举例说明。In order to better reflect the purpose of the present invention, further examples are provided on the basis of the above embodiments.

图4为本发明被叫用户的路由信息查询方法实施例二的流程图,如图4所示,在上述实施例的步骤102之后,本发明实施例的方法包括:FIG. 4 is a flowchart of Embodiment 2 of a method for querying routing information of a called user according to the present invention. As shown in FIG. 4 , after step 102 in the foregoing embodiment, the method in this embodiment of the present invention includes:

步骤201、当所述环形HSS扩容一个新的子HSS存储单元时,利用所述Chord协议确定所述新的子HSS存储单元中路由信息标识符的后继子HSS存储单元和前驱子HSS存储单元。Step 201: When the ring HSS is expanded to a new sub-HSS storage unit, use the Chord protocol to determine the successor sub-HSS storage unit and the predecessor sub-HSS storage unit of the routing information identifier in the new sub-HSS storage unit.

当之前的环形HSS扩容一个新的子HSS存储单元时,即当前的环形HSS中子HSS存储单元为n=a+1个时,被叫用户号码的路由信息查询装置利用Chord协议确定这个扩容的新的子HSS存储单元中路由信息标识符的后继子HSS存储单元和前驱子HSS存储单元,具体可以按照步骤102的方法得到这个扩容的新的子HSS存储单元中路由信息标识符的后继子HSS存储单元和前驱子HSS存储单元,在此不加以赘述。When the previous ring HSS expands a new sub-HSS storage unit, that is, when the number of sub-HSS storage units in the current ring HSS is n=a+1, the routing information query device of the called subscriber number uses the Chord protocol to determine the size of the expanded sub-HSS. The successor sub-HSS storage unit and the predecessor sub-HSS storage unit of the routing information identifier in the new sub-HSS storage unit can specifically obtain the successor-sub-HSS of the routing information identifier in the expanded new sub-HSS storage unit according to the method of step 102 The storage unit and the precursor sub-HSS storage unit will not be described in detail here.

步骤202、将属于所述新的子HSS存储单元的用户号码的路由信息由所述n个子HSS存储单元转移到所述新的子HSS存储单元中。Step 202: Transfer the routing information of the subscriber number belonging to the new sub-HSS storage unit from the n sub-HSS storage units to the new sub-HSS storage unit.

被叫用户号码的路由信息查询装置将属于新的子HSS存储单元的用户号码的路由信息由之前的n个子HSS存储单元中转移到新的子HSS存储单元中。The routing information query device for the called subscriber number transfers the routing information of the subscriber number belonging to the new sub-HSS storage unit from the previous n sub-HSS storage units to the new sub-HSS storage unit.

步骤203、采用所述Chord协议更新扩容后的环形HSS中的n=a+1个子HSS存储单元各自对应的用户号码的路由表。Step 203 , using the Chord protocol to update the routing table of the subscriber numbers corresponding to each of the n=a+1 sub-HSS storage units in the expanded ring HSS.

被叫用户号码的路由信息查询装置采用Chord协议更新扩容后的环形HSS中的n=a+1个子HSS存储单元各自对应的用户号码的路由表,具体可以参照步骤103的方法可以得到扩容后的环形HSS中的n=a+1个子HSS存储单元各自对应的用户号码的路由表,在此不加以赘述。The routing information query device of the called subscriber number adopts the Chord protocol to update the routing table of the subscriber numbers corresponding to each of the n=a+1 sub-HSS storage units in the expanded ring HSS. Specifically, the method of step 103 can be used to obtain the expanded The routing table of the subscriber numbers corresponding to each of the n=a+1 sub-HSS storage units in the ring HSS will not be repeated here.

步骤204、根据所述用户号码的路由表的路由信息标识符指向关系确定出被叫用户号码的路由信息。Step 204: Determine the routing information of the called subscriber number according to the pointing relationship of the routing information identifier in the routing table of the subscriber number.

被叫用户号码的路由信息查询装置根据更新后的用户号码的路由表的路由信息标识符指向关系确定出被叫用户号码的路由信息,具体可以参照步骤104的方法可以得到被叫用户号码的路由信息,在此不加以赘述。The routing information query device of the called user number determines the routing information of the called user number according to the routing information identifier pointing relationship of the updated routing table of the user number. information, which is not repeated here.

本发明实施例提供的被叫用户的路由信息查询方法,在实施例一的基础上进一步的,当环形HSS扩容一个新的子HSS存储单元时,利用Chord协议确定新的子HSS存储单元中路由信息标识符的后继子HSS存储单元和前驱子HSS存储单元;将属于新的子HSS存储单元的用户号码的路由信息由之前的n个子HSS存储单元中转移到新的子HSS存储单元中;采用Chord协议更新扩容后的环形HSS中的n=a+1个子HSS存储单元各自对应的用户号码的路由表;根据用户号码的路由表的路由信息标识符指向关系确定出被叫用户号码的路由信息;在上述实施例的技术效果的基础上,实现了子HSS存储单元扩容的简易化,增强了扩展性。The method for querying the route information of the called user provided by the embodiment of the present invention is further based on the first embodiment. When the ring HSS expands a new sub-HSS storage unit, the Chord protocol is used to determine the route in the new sub-HSS storage unit. The successor sub-HSS storage unit and the predecessor sub-HSS storage unit of the information identifier; the routing information of the subscriber number belonging to the new sub-HSS storage unit is transferred from the previous n sub-HSS storage units to the new sub-HSS storage unit; Adopt The Chord protocol updates the routing tables of the respective subscriber numbers of the n=a+1 sub-HSS storage units in the expanded ring HSS; the routing information of the called subscriber number is determined according to the point relationship of the routing information identifier of the routing table of the subscriber number ; On the basis of the technical effects of the above embodiments, the simplification of the capacity expansion of the sub-HSS storage unit is realized, and the expandability is enhanced.

图5为本发明被叫用户的路由信息查询方法实施例三的流程图,如图5所示,在上述实施例的步骤102之后,本发明实施例的方法包括:FIG. 5 is a flowchart of Embodiment 3 of a method for querying routing information of a called user according to the present invention. As shown in FIG. 5 , after step 102 in the foregoing embodiment, the method in this embodiment of the present invention includes:

步骤301、所述当前子HSS存储单元备份所述当前子HSS存储单元的前驱子HSS存储单元内的用户号码的路由信息。Step 301: The current sub-HSS storage unit backs up the routing information of the subscriber number in the predecessor sub-HSS storage unit of the current sub-HSS storage unit.

被叫用户号码的路由信息查询装置指示当前子HSS存储单元备份当前子HSS存储单元的前驱子HSS存储单元内的用户号码的路由信息,即每个子HSS存储单元内的用户号码的路由信息都备份在每个子HSS存储单元所对应的前驱子HSS存储单元内。The routing information query means of the called subscriber number instructs the current sub-HSS storage unit to back up the routing information of the subscriber number in the predecessor sub-HSS storage unit of the current sub-HSS storage unit, that is, the routing information of the subscriber number in each sub-HSS storage unit is backed up in the predecessor sub-HSS storage unit corresponding to each sub-HSS storage unit.

步骤302、当所述环形HSS减容一个旧的子HSS存储单元时,采用所述Chord协议更新减容后的环形HSS中的n=a-1个子HSS存储单元各自对应的用户号码的路由表。Step 302: When the ring HSS reduces the capacity of an old sub-HSS storage unit, the Chord protocol is used to update the routing table of the subscriber numbers corresponding to each of the n=a-1 sub-HSS storage units in the reduced ring HSS. .

当环形HSS减容一个旧的子HSS存储单元时(分为正常移除和故障崩溃两种情况),若被叫用户号码的路由信息正好存储在该旧的子HSS存储单元时,则无法完成查询过程;这时,被叫用户号码的路由信息查询装置检测到环形HSS减容一个旧的子HSS存储单元后,首先通告其前驱子HSS存储单元这个旧的子HSS存储单元将离开环形HSS,并调用其后继子HSS存储单元中的该旧的子HSS存储单元的用户号码的路由信息;然后利用Chord协议更新减容后的环形HSS中的n=a-1个子HSS存储单元各自对应的用户号码的路由表,剔除该旧的子HSS存储单元对环形HSS的影响。When the ring HSS reduces the capacity of an old sub-HSS storage unit (it is divided into two cases: normal removal and failure and collapse), if the routing information of the called subscriber number is stored in the old sub-HSS storage unit, it cannot be completed. Inquiry process; at this time, after the routing information inquiry device of the called subscriber number detects that the ring HSS reduces the capacity of an old sub-HSS storage unit, it first announces its predecessor sub-HSS storage unit that this old sub-HSS storage unit will leave the ring HSS, And call the routing information of the subscriber number of this old sub-HSS storage unit in its successor sub-HSS storage unit; Then utilize the Chord protocol to update the user corresponding to each of n=a-1 sub-HSS storage units in the ring HSS after the capacity reduction The routing table of the number, excluding the influence of the old sub-HSS storage unit on the ring HSS.

例如,图6为本发明被叫用户的路由信息查询方法实施例三的减容前的子HSS存储单元逻辑连接示意图,图7为本发明被叫用户的路由信息查询方法实施例三的减容后的子HSS存储单元逻辑连接示意图,如图6、图7所示,环形HSS在减容子HSS存储单元N7×10 12后,利用Chord协议更新减容后的环形HSS中的199个子HSS存储单元各自对应的用户号码的路由表;子HSS存储单元N7×10 12减容后,其存储的用户号码的路由信息转移至N8×10 12For example, FIG. 6 is a schematic diagram of the logical connection of the sub-HSS storage units before capacity reduction according to the third embodiment of the routing information query method for the called user according to the present invention, and FIG. 7 is the capacity reduction of the third embodiment of the routing information query method for the called user according to the present invention. The schematic diagram of the logical connection of the subsequent sub-HSS storage units, as shown in Figure 6 and Figure 7, the ring HSS uses the Chord protocol to update the 199 sub-HSS storage units in the reduced ring HSS after reducing the capacity of the sub-HSS storage unit N 7×10 12 The routing table of the respective subscriber numbers of the units; after the sub-HSS storage unit N 7×10 12 is reduced in capacity, the routing information of the subscriber numbers stored in the sub-HSS is transferred to N 8×10 12 .

表6为更新前的子HSS存储单元N6×10 12的用户号码的路由表,如表6所示:Table 6 is the routing table of the subscriber numbers of the sub-HSS storage unit N 6×10 12 before the update, as shown in Table 6:

表6Table 6

Figure BDA0000902498700000141
Figure BDA0000902498700000141

Figure BDA0000902498700000151
Figure BDA0000902498700000151

表7为更新后的子HSS存储单元N6×10 12的用户号码的路由表,如表7所示:Table 7 is the updated routing table of the subscriber numbers of the sub-HSS storage unit N 6×10 12 , as shown in Table 7:

Figure BDA0000902498700000152
Figure BDA0000902498700000152

步骤303、根据所述用户号码的路由表的路由信息标识符指向关系确定出被叫用户号码的路由信息。Step 303: Determine the routing information of the called subscriber number according to the pointing relationship of the routing information identifier in the routing table of the subscriber number.

被叫用户号码的路由信息查询装置根据更新后的用户号码的路由表的路由信息标识符指向关系确定出被叫用户号码的路由信息,具体可以参照步骤104的方法可以得到被叫用户号码的路由信息,在此不加以赘述。The routing information query device of the called user number determines the routing information of the called user number according to the routing information identifier pointing relationship of the updated routing table of the user number. information, which is not repeated here.

本发明实施例提供的被叫用户的路由信息查询方法,在实施例一的基础上进一步的,通过当前子HSS存储单元备份当前子HSS存储单元的前驱子HSS存储单元内的用户号码的路由信息;当环形HSS减容一个旧的子HSS存储单元时,采用Chord协议更新减容后的环形HSS中的n=a-1个子HSS存储单元各自对应的用户号码的路由表;根据用户号码的路由表的路由信息标识符指向关系确定出被叫用户号码的路由信息;在上述实施例的技术效果的基础上,可以在任一子HSS存储单元失效时依旧完成被叫用户路由的信息查询,实现了备份数据高效利用和降低了子HSS存储单元崩溃带来的风险。The method for querying the routing information of the called user provided by the embodiment of the present invention is further based on the first embodiment, and the routing information of the user number in the predecessor sub-HSS storage unit of the current sub-HSS storage unit is backed up by the current sub-HSS storage unit When the ring HSS reduces the capacity of an old sub-HSS storage unit, adopt the Chord protocol to update the routing table of the respective user numbers of n=a-1 sub-HSS storage units in the ring HSS after the capacity reduction; according to the routing table of the user number The routing information identifier of the table points to the relationship to determine the routing information of the called user number; on the basis of the technical effect of the above embodiment, the information query of the called user routing can still be completed when any sub-HSS storage unit fails, which realizes Backup data is efficiently utilized and the risk of sub-HSS storage unit collapse is reduced.

图8为本发明被叫用户的路由信息查询装置实施例的结构示意图,如图8所示,本发明的被叫用户的路由信息查询装置08包括:建立模块81、路由表构建模块82、第一确定模块83;其中,FIG. 8 is a schematic structural diagram of an embodiment of an apparatus for querying routing information of a called user according to the present invention. As shown in FIG. 8 , the apparatus 08 for querying routing information for a called user of the present invention includes: a building module 81, a routing table building module 82, a first a determination module 83; wherein,

所述建立模块,用于利用Chord协议建立环形归属签约用户服务器HSS;其中,所述环形HSS由n=a个子HSS存储单元按照顺时针方向依次增大原则所组成,用户号码的路由信息存储在所述n=a个子HSS存储单元上,所述n为大于等于3的整数;The establishment module is used to establish a ring-shaped home subscriber server HSS by using the Chord protocol; wherein, the ring-shaped HSS is composed of n=a sub-HSS storage units according to the principle of increasing clockwise order, and the routing information of the user number is stored in the HSS. On the n=a sub-HSS storage units, the n is an integer greater than or equal to 3;

所述路由表构建模82,用于采用Chord协议构建所述n=a个子HSS存储单元各自对应的用户号码的路由表;The routing table construction model 82 is used to construct the routing table of the respective subscriber numbers of the n=a sub-HSS storage units by adopting the Chord protocol;

所述第一确定模块83,用于根据所述用户号码的路由表的标识符指向关系确定出被叫用户号码的路由信息。The first determining module 83 is configured to determine the routing information of the called subscriber number according to the identifier pointing relationship in the routing table of the subscriber number.

进一步的,所述装置还包括:第二确定模块84;其中Further, the apparatus further includes: a second determining module 84; wherein

所述第二确定模块84,用于确定在所述环形HSS中离当前子HSS存储单元中路由信息标识符最近的前一个有效的子HSS存储单元为当前子HSS存储单元中路由信息标识符的前驱子HSS存储单元,在所述环形HSS中离当前子HSS存储单元中路由信息标识符最近的后一个有效的子HSS存储单元为当前子HSS存储单元中路由信息标识符的后继子HSS存储单元。The second determining module 84 is configured to determine that the previous valid sub-HSS storage unit closest to the routing information identifier in the current sub-HSS storage unit in the ring HSS is the one of the routing information identifier in the current sub-HSS storage unit. The predecessor sub-HSS storage unit, in the ring HSS, the next valid sub-HSS storage unit closest to the routing information identifier in the current sub-HSS storage unit is the successor sub-HSS storage unit of the routing information identifier in the current sub-HSS storage unit .

进一步的,所述装置还包括:扩容模块85;其中,Further, the device further includes: a capacity expansion module 85; wherein,

所述扩容模块85,用于当所述环形HSS扩容一个新的子HSS存储单元时,利用所述Chord协议确定所述新的子HSS存储单元中路由信息标识符的后继子HSS存储单元和前驱子HSS存储单元;The capacity expansion module 85 is configured to utilize the Chord protocol to determine the successor sub-HSS storage unit and the predecessor of the routing information identifier in the new sub-HSS storage unit when the annular HSS expands a new sub-HSS storage unit. Sub HSS storage unit;

还用于将属于所述新的子HSS存储单元的用户号码的路由信息由所述n个子HSS存储单元转移到所述新的子HSS存储单元中;Also used for transferring the routing information of the subscriber number belonging to the new sub-HSS storage unit to the new sub-HSS storage unit from the n sub-HSS storage units;

还用于采用所述Chord协议更新扩容后的环形HSS中的n=a+1个子HSS存储单元各自对应的用户号码的路由表。It is also used to update the routing table of the subscriber numbers corresponding to each of the n=a+1 sub-HSS storage units in the expanded ring HSS by using the Chord protocol.

进一步的,所述装置还包括:备份模块86;其中,Further, the device further includes: a backup module 86; wherein,

所述备份模块86,用于所述当前子HSS存储单元备份所述当前子HSS存储单元的前驱子HSS存储单元内的用户号码的路由信息。The backup module 86 is used for the current sub-HSS storage unit to back up the routing information of the subscriber number in the predecessor sub-HSS storage unit of the current sub-HSS storage unit.

进一步的,所述装置还包括:移除模块87;其中,Further, the device further includes: a removing module 87; wherein,

所述移除模块87,用于当所述环形HSS减容一个旧的子HSS存储单元时,采用所述Chord协议更新减容后的环形HSS中的n=a-1个子HSS存储单元各自对应的用户号码的路由表。The removing module 87 is configured to use the Chord protocol to update the corresponding n=a-1 sub-HSS storage units in the reduced ring HSS when the ring HSS reduces the capacity of an old sub-HSS storage unit. The routing table of the user number.

本实施例的装置,可以用于执行上述所示方法实施例的技术方案,其实现原理和技术效果类似,此处不再赘述。The apparatus of this embodiment can be used to implement the technical solutions of the method embodiments shown above, and the implementation principles and technical effects thereof are similar, and details are not described herein again.

在实际应用中,所述建立模块81、路由表构建模块82、第一确定模块83、第二确定模块84、扩容模块85、备份模块86、移除模块87可由位于装置上的中央处理器(CPU)、微处理器(MPU)、数字信号处理器(DSP)或现场可编程门阵列(FPGA)等器件实现。In practical applications, the establishment module 81, the routing table construction module 82, the first determination module 83, the second determination module 84, the capacity expansion module 85, the backup module 86, and the removal module 87 can be configured by the central processing unit ( CPU), microprocessor (MPU), digital signal processor (DSP) or field programmable gate array (FPGA) and other devices.

本领域内的技术人员应明白,本发明的实施例可提供为方法、系统、或计算机程序产品。因此,本发明可采用硬件实施例、软件实施例、或结合软件和硬件方面的实施例的形式。而且,本发明可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器和光学存储器等)上实施的计算机程序产品的形式。As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the invention may take the form of a hardware embodiment, a software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media having computer-usable program code embodied therein, including but not limited to disk storage, optical storage, and the like.

本发明是参照根据本发明实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器,使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block in the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to the processor of a general purpose computer, special purpose computer, embedded processor or other programmable data processing device to produce a machine such that the instructions executed by the processor of the computer or other programmable data processing device produce Means for implementing the functions specified in a flow or flow of a flowchart and/or a block or blocks of a block diagram.

这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中,使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品,该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory result in an article of manufacture comprising instruction means, the instructions The apparatus implements the functions specified in the flow or flow of the flowcharts and/or the block or blocks of the block diagrams.

这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上,使得在计算机或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理,从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。These computer program instructions can also be loaded on a computer or other programmable data processing device to cause a series of operational steps to be performed on the computer or other programmable device to produce a computer-implemented process such that The instructions provide steps for implementing the functions specified in the flow or blocks of the flowcharts and/or the block or blocks of the block diagrams.

以上所述,仅为本发明的较佳实施例而已,并非用于限定本发明的保护范围。The above descriptions are only preferred embodiments of the present invention, and are not intended to limit the protection scope of the present invention.

Claims (4)

1. A method for inquiring routing information of called subscriber number is characterized in that the method comprises the following steps:
establishing a ring Home Subscriber Server (HSS) by using a Chord protocol; the annular HSS is formed by n-a sub HSS storage units which are sequentially increased in the clockwise direction, routing information of a user number is stored in the n-a sub HSS storage units, and n is an integer which is larger than or equal to 3;
determining that a previous effective sub HSS storage unit closest to the routing information identifier in the current sub HSS storage unit in the annular HSS is a previous sub HSS storage unit of the routing information identifier in the current sub HSS storage unit, and determining that a next effective sub HSS storage unit closest to the routing information identifier in the current sub HSS storage unit in the annular HSS is a subsequent sub HSS storage unit of the routing information identifier in the current sub HSS storage unit;
establishing a routing table of user numbers corresponding to the n-a sub HSS storage units by adopting a Chord protocol;
when the ring HSS expands a new sub HSS memory cell, the routing information of the subscriber number belonging to the new sub HSS memory cell is transferred from the n sub HSS memory cells to the new sub HSS memory cell; updating a routing table of user numbers corresponding to n ═ a +1 sub HSS storage units in the expanded annular HSS by adopting the Chord protocol;
determining the routing information of the called subscriber number according to the routing information identifier pointing relation of the routing table of the subscriber number, wherein the current sub HSS storage unit backups the routing information of the subscriber number in the precursor sub HSS storage unit of the current sub HSS storage unit;
when the ring HSS reduces one old sub HSS memory unit, updating the routing table of the user number corresponding to each of the n-a-1 sub HSS memory units in the ring HSS after reduction by adopting the Chord protocol, and changing the routing information pointing to the old sub HSS memory unit in the routing table into the subsequent sub HSS memory unit pointing to the old sub HSS memory unit.
2. The method of claim 1 wherein when said ring HSS expands a new sub-HSS storage location, the method further comprises:
determining successor and predecessor sub HSS storage locations of routing information identifiers in the new sub HSS storage location using the Chord protocol.
3. An apparatus for inquiring routing information of a called subscriber number, the apparatus comprising:
the establishment module is used for establishing a ring-shaped Home Subscriber Server (HSS) by using a Chord protocol; the annular HSS is formed by n-a sub HSS storage units which are sequentially increased in the clockwise direction, routing information of a user number is stored in the n-a sub HSS storage units, and n is an integer which is larger than or equal to 3;
a routing table constructing module, configured to construct a routing table of the user numbers corresponding to the n-a sub-HSS storage units by using Chord protocol;
the first determining module is used for determining the routing information of the called subscriber number according to the identifier pointing relation of the routing table of the subscriber number;
a second determining module, configured to determine that a previous valid sub-HSS storage closest to the routing information identifier in the current sub-HSS storage in the ring-shaped HSS is a previous sub-HSS storage of the routing information identifier in the current sub-HSS storage, and a next valid sub-HSS storage closest to the routing information identifier in the current sub-HSS storage in the ring-shaped HSS is a subsequent sub-HSS storage of the routing information identifier in the current sub-HSS storage;
a capacity expansion module, configured to transfer, when the ring HSS expands a new sub HSS storage unit, routing information of a subscriber number belonging to the new sub HSS storage unit from the n sub HSS storage units to the new sub HSS storage unit; the route table is also used for updating the user numbers corresponding to the n ═ a +1 sub HSS memory units in the expanded annular HSS by adopting the Chord protocol;
the backup module is used for the current sub HSS storage unit to backup the routing information of the user number in the precursor sub HSS storage unit of the current sub HSS storage unit;
a removing module, configured to update, by using the Chord protocol, a routing table of the subscriber numbers corresponding to the n-a-1 sub-HSS storage units in the ring HSS after the reduction when the ring HSS reduces an old sub-HSS storage unit, and change routing information in the routing table that points to the old sub-HSS storage unit to a subsequent sub-HSS storage unit that points to the old sub-HSS storage unit.
4. The apparatus of claim 3, wherein the capacity expansion module is configured to:
when the ring HSS expands a new sub HSS memory cell, the Chord protocol is used to determine the successor sub HSS memory cell and predecessor sub HSS memory cell of the routing information identifier in the new sub HSS memory cell.
CN201610005163.8A 2016-01-07 2016-01-07 Method and device for inquiring routing information of called user Active CN106953804B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201610005163.8A CN106953804B (en) 2016-01-07 2016-01-07 Method and device for inquiring routing information of called user

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610005163.8A CN106953804B (en) 2016-01-07 2016-01-07 Method and device for inquiring routing information of called user

Publications (2)

Publication Number Publication Date
CN106953804A CN106953804A (en) 2017-07-14
CN106953804B true CN106953804B (en) 2020-08-18

Family

ID=59465566

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610005163.8A Active CN106953804B (en) 2016-01-07 2016-01-07 Method and device for inquiring routing information of called user

Country Status (1)

Country Link
CN (1) CN106953804B (en)

Family Cites Families (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7920572B2 (en) * 2005-09-20 2011-04-05 Cisco Technology, Inc. Modifying operation of peer-to-peer networks based on integrating network routing information
CN101043472A (en) * 2006-03-24 2007-09-26 华为技术有限公司 Method, equipment and system for routing the call in circuit domain network to packet domain network
US7881223B2 (en) * 2006-03-31 2011-02-01 Panasonic Corporation Method for on demand distributed hash table update
CN101252777B (en) * 2008-04-03 2012-02-29 中兴通讯股份有限公司 Method for realizing user routing
CN101729592B (en) * 2008-10-29 2013-08-07 中国移动通信集团公司 Distributed communication network and equipment and communication network separation method
CN101860474B (en) * 2009-04-08 2015-07-22 中兴通讯股份有限公司 Peer-to-peer network and resource information processing method based on same
CN102148739B (en) * 2010-02-05 2014-03-12 中国联合网络通信集团有限公司 IMS (IP (Internet Protocol) Multimedia Subsystem) session routing control method and system
CN102378407B (en) * 2010-08-26 2013-03-13 中国人民解放军国防科学技术大学 Object name resolution system and method in internet of things
CN102055798B (en) * 2010-12-09 2013-01-02 南京远古科技有限公司 Method for collecting programs in basic Chord ring and regional Chord rings
CN102882981B (en) * 2012-10-19 2015-01-28 南京邮电大学 Load balancing method of node task under equivalence structural cloud platform

Also Published As

Publication number Publication date
CN106953804A (en) 2017-07-14

Similar Documents

Publication Publication Date Title
US10050866B2 (en) Parallel top-K simple shortest paths discovery
CN104090897B (en) Method, server and the system of accesses meta-data
WO2014101044A1 (en) Partition balancing method, device and server in distributed storage system
CN111723073B (en) Data storage and processing method, device, processing system, and storage medium
CN104298541A (en) Data distribution algorithm and data distribution device for cloud storage system
CN107092667B (en) Group&#39;s lookup method and device based on social networks
CN101179466A (en) A method and system for realizing a distributed peer-to-peer network based on centralized services
CN102999571B (en) The implementation method of unit multinode in a kind of cluster
WO2015127721A1 (en) Data matching method and apparatus and computer storage medium
WO2010115374A1 (en) Method for resource information backup operation based on peer to peer network and peer to peer network thereof
CN115987888B (en) Routing address storage method, device, network equipment and storage medium
CN102609446A (en) Distributed Bloom filter system and application method thereof
CN105959419A (en) Establishment method and system for distributed storage structure based on consensus tree
US8612464B2 (en) Portable hash-based key location mechanism
CN104283966A (en) Data distribution algorithm and device of cloud storage system
CN108875035A (en) The date storage method and relevant device of distributed file system
CN111553669B (en) Transaction routing method, device and computer readable storage medium
US10565074B2 (en) Systems and methods to distribute computing tasks among multiple computers
CN103559224A (en) Method and device for hashing metadata objects
CN103580918A (en) Method and device for processing configuration data
CN108153759B (en) Data transmission method, middle-tier server and system for distributed database
WO2009006779A1 (en) Method and system for determining user home index node and home service node
CN106953804B (en) Method and device for inquiring routing information of called user
CN104618414B (en) A kind of implementation method of Distributed Services, service broker&#39;s device and distributed system
JP4459999B2 (en) Non-stop service system using voting and information updating and providing method in the system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant