CN100407740C - Priority local calling method for local transitional personal number - Google Patents

Priority local calling method for local transitional personal number Download PDF

Info

Publication number
CN100407740C
CN100407740C CN031013414A CN03101341A CN100407740C CN 100407740 C CN100407740 C CN 100407740C CN 031013414 A CN031013414 A CN 031013414A CN 03101341 A CN03101341 A CN 03101341A CN 100407740 C CN100407740 C CN 100407740C
Authority
CN
China
Prior art keywords
local
pihlr
user
network
userpn
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.)
Expired - Fee Related
Application number
CN031013414A
Other languages
Chinese (zh)
Other versions
CN1516430A (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.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to CN031013414A priority Critical patent/CN100407740C/en
Publication of CN1516430A publication Critical patent/CN1516430A/en
Application granted granted Critical
Publication of CN100407740C publication Critical patent/CN100407740C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Landscapes

  • Telephonic Communication Services (AREA)

Abstract

The present invention provides a calling method with local priority of a personal number for local transfer. The present invention is characterized in that a personal number transferred to local is optimized according to a preset method, and thus, the reverter position PIHLR of personal information of a personal-number user can be obtained by direct calculation from User PN. When a call needs initiating to a USER PN transferred to the local, PIHLR which stores the number of the User PN, is quickly positioned directly by the User PN number of the transferred local user according to a preset method. The PIHLR is visited, and the User PI of a called user can be sought by the number of the User PN. Because the personal number transferred to the local adopts optimized storage and acquisition strategies, the PIHLR where the persona information can be stored, of the transferred user can be quickly positioned by a personal number transferred to the local. Therefore, the traversal frequency is reduced, and thus, the visiting efficiency is improved. The calling connection time is reduced, and meanwhile, the calling cost is reduced.

Description

A kind of preferential local call method of moving local personal number
Technical field
The present invention relates to a kind of preferential local call method of moving local personal number.
Background technology
In the implementation method of existing preferential local call, network is to know that the ground of opening an account is not in this locality, the personal information (UserPI) of moving to local user afterwards is actually in the PIHLR of which this locality (userspersonal information's attribution server is provided), therefore, the straightforward procedure of preferential local call is, network is searched the ground of opening an account not in this locality in traversal, and when moving to local user's personal information afterwards, the average time that its traversal is searched is half of local PIHLR number.If the quantity of the on-site PIHLR of caller is very big, on network, carry out such traversal, its efficient will be extremely low, and when the user of moving to this locality was a lot, this traversal may produce catastrophic effect.
Summary of the invention
To achieve these goals, the present invention proposes a kind of preferential local call method of moving local personal number, to improve access efficiency, the reduction access cost to moving to local personal number user profile.
The preferential local call method of the personal number of migration this locality that the present invention is proposed for achieving the above object comprises the steps: that (1) network is optimized storage according to predefined method to the personal information UserPI of moving to local personal number user, this method can navigate to the PIHLR of this UserPN according to user's personal number (UserPN) through computing, make network when visiting the PIHLR of people's number one by one, can obtain from the direct computing of UserPN; (2) when calling one by one during people's number user's UserPN, network directly according to called subscriber's UserPN, according to described predefined method, through computing, navigates to the PIHLR of corresponding this userspersonal information UserPI of storage; (3) PIHLR of the described correspondence of visit searches called subscriber's UserPI, if this PIHLR has found relevant called subscriber's UserPI, then directly Query Result is returned to network; (4) Query Result that returns of network utilisation PIHLR, replay call.
According to one embodiment of the present of invention, step (1) is described to be optimized storage and to be meant moving to local personal number according to predefined method: according to scattering tree technology, the personal number of moving to this locality is optimized storage.
According to scattering tree technology, be optimized storage to moving to local personal number, be meant that set up and store the scattering tree that is mapped to leaf node from root node in advance in network, described scattering tree is the table of comparisons of mapping step by step that reflects the PIHLR equipment the network that is mapped to from UserPN; When using scattering tree technology, can also leave concentratedly in some specific PIHLR moving to local UserPN number, can reduce the node scale of scattering tree like this, especially run the initial stage, the migration data amount is seldom the time, this remarkably productive of data of leaving concentratedly.
Adopted above scheme, owing to carried out optimal Storage to moving local personal number information, the PIHLR that the personal information that makes network can directly navigate to this migrated users according to called subscriber's personal number UserPN apace should be deposited, reduced the traversal number of times, thereby the raising access efficiency reduces cost.This method can be because of the development along with network operation, and migration becomes universal phenomenon, and migrated users increases gradually, and influences access performance, and causes the reduction of described access efficiency.
Description of drawings
Fig. 1 is the flow chart that the present invention moves the preferential local call method of local personal number.
Fig. 2 is the schematic diagram of the used scattering tree of the present invention;
Embodiment
One embodiment of the present of invention are used the method for scattering tree the PIHLR of UserPI in this locality of moving to local user are deposited, and according to this deposit method, carry out obtaining of userspersonal information UserPI.
This method to the deposit method of the UserPI that moves local user is:
1) according to scattering tree technology, the scattering tree of the number of tectonic transport this locality, the unique PIHLR that corresponds to a this locality of leaf node of scattering tree; (it is can grow along with the development of operation situation and atrophy that scattering is set.)
2) move to local user for one,,, make its leaf node that corresponds to the scattering tree,, navigate to the PIHLR that the personal information of this migrated users should be deposited by this leaf node by scattering computing step by step according to its personal number.Whether the pairing PIHLR1 of leaf node that also need judge the scattering tree has therebetween reached the place capacity warning line; If reached warning line, check whether the non-migrating user is arranged among this PIHLR1; If no, no longer in this PIHLR1, increase new user profile this moment; If have, search local PIHLR again, find out the PIHLR2 of enough remaining spaces, then the non-migrating user profile among the PIHLR1 is moved on among the PIHLR2, and revise among the corresponding PNHLR personal number-PIHLR corresponding relation about this non-migrating user.
3) when not having the non-migrating user, handle according to the moving of PIHLR in the scattering tree principle, dilatation, fractionation principle.
The removing method of corresponding migration local user's personal information UserPI is:
1) according to the personal number UserPN of moving to local user, by scattering computing step by step, make its leaf node that corresponds to the scattering tree, by this leaf node, navigate to the PIHLR that the personal information UserPI of this migrated users should deposit.When quick preferential this migrated users of local call, network based this user's number by local scattering tree, calculates the PIHLR that this user's personal information should be deposited, and then therefrom takes out this user's personal information, and carries out the calling network of essence.
As shown in Figure 1, the preferential local call method of the personal number of migration this locality is:
1) to a fast preferential local call of moving to local personal number (such as, add " the local sign of Priority Call " in the call number front, such as being " 00 " or local area code, represent that this is called out is preferential local call), at first check PNHLR (attribution server of the individual subscriber number is provided) numbering among the UserPN (individual user number), judge whether (this step also can save in the current location of caller for the PNHLR of its this personal number correspondence, it has just added and has prevented that user mistake from adding preferential local call sign, even but user's mistake adds, also can find corresponding PIHLR, just around bend), if, then network is directly visited this PNHLR, PNHLR is according to UserPN---the table of comparisons of PIHLR numbering, obtain the numbering of user PIHLR, and visit the PIHLR of this numbering, obtain user's personal information UserPI, and replay call.That is, still handle according to the call handling process that does not add normally preferential local call sign; If not in current location, added preferential local call sign when then the network meeting is because of calling, and this personal number user has been treated as the local user, think that promptly this user's personal information belongs in this locality, also promptly, be to open an account ground not in this locality, moved to local user afterwards;
2) draw corresponding PIHLR according to called migration local user number by the scattering computing, visit this PIHLR, search called subscriber's personal information; If found relevant called subscriber's personal information, then directly finish inquiry; Carry out call handling process.If finally do not find this information, then, network thinks that the number home PNHLR of this number UserPN is not or not the caller location, and the personal information of this number ownership PIHLR is not or not the caller location (promptly yet, be to open an account ground, and also do not move to the caller location not in the caller location), at this moment:
3) PNHLR among the network based UserPN numbers, and directly visits this PNHLR in strange land, and according to UserPN---the table of comparisons of PIHLR numbering, obtain the numbering of user PIHLR, visit the PIHLR of this numbering, obtain user's personal information UserPI, and replay call.That is, still handle according to the call handling process that does not add normally preferential local call sign.If still do not obtain this user profile, then point out the information of " dialing numbers does not exist ".
More than, PNHLR is according to UserPN---the table of comparisons of PIHLR numbering, obtain the numbering of user PIHLR, visit the PIHLR of this numbering, obtain user's personal information UserPI, and in the process of replay call, visit to PIHLR can be finished by PNHLR, and the UserPI that obtains is fed back to network by PNHLR, and also can directly the PIHLR numbering be fed back to network by PNHLR, directly visit the PIHLR of described numbering by network.General, when PNHLR and PIHLR are in together in the local telephone network zone, the visit of PIHLR is finished better by PNHLR.Described network refers to the switch device at caller place, or the tandem exchange of this equipment, or the tandem exchange at PNHLR place.
In the middle of the reality, network is handled for unified, can all handle by preferential local call flow process any calling, like this, just no longer needs the user to be added with first local call sign extraly, thereby, also be more convenient for user's use.
Used scattering tree notion can simply be illustrated in Fig. 2 in the said method of the present invention.
After telephone network is set up, in the regional coverage scope that the local telephone network ruton reaches, set up PIHLR, be used to store the personal information data of all users in this area.The table of comparisons of personal number and PIHLR numbering is set, and is stored in the switch or other network equipments of network.Wherein, be the corresponding relation that makes up according to scattering tree technology between personal number of migration this locality and the PIHLR numbering.Fig. 2 shows the structure of a scattering tree.As can be seen, root node and 5 nodes of this scattering tree have direct corresponding relation, just have solid line directly to connect in the drawings in Fig. 2.The root node of scattering tree is called 0 grade of node, and 5 nodes that it comprised all are called 1 grade of node.In these 51 grade of nodes, the 3rd 1 grade of node and the 4th 1 grade of node comprise 5 child nodes and 7 child nodes again respectively, these are included in 1 grade of child node in the node are called 2 grades of nodes.As can see from Figure 2, in these all nodes, the all directly corresponding actual network equipment of the 1st 1 grade of node, the 2nd 1 grade of node and the 5th 1 grade of node and all 2 grades of nodes, be PIHLR, they are called leaf node, the just oval node that with dashed lines is connected with PIHLR among the figure, the wherein numbering of the PIHLR of their correspondences of Biao Zhu numeral.In the scattering tree, a root node can only be arranged, under root node, a plurality of 1 grade of node can be arranged according to power system capacity and number of users, simultaneously, below each 1 grade of node a plurality of 2 grades of nodes can be arranged, a plurality of 3 grades of nodes can also be arranged below each 2 grades of node, the rest may be inferred.Direct corresponding PIHLR equipment be leaf node, other nodes all are non-leaf nodes.Each non-leaf node of scattering tree all comprises this node method of traversal downwards, just be stored in by this non-leaf node in the table of comparisons of personal number in the network equipment and PIHLR numbering, all marked the method for how to locate its child node from this node downwards, this method comprises packet count under this node and the information such as hash operation method that are suitable for.
If leave processing concentratedly to moving local personal number information, can make the scattering tree scale of migration local number reduce greatly, like this, can help operation management more so that local scattering tree becomes littler.
Above just to a kind of summary of scattering tree, be 02146090.6 at application number, name is called in the Chinese invention patent application of " a kind of method by storage of data message key and read data information " and then describes the principle that scattering is set in detail.
Now the principle of scattering tree being done one simply introduces: at the beginning of network is set up, when number of users is also fewer, may have only a PIHLR, and the scattering tree also has only a root node, there is not child node, the direct corresponding PIHLR of root node, root node is exactly a leaf node, and all users' personal information directly is mapped to PIHLR1 by root node.At this moment, because root node does not comprise child node, so it does not comprise grouping information and hash computing information yet.If in communication network, will increase a userspersonal information, directly this personal number is mapped to PIHLR1 by root node, and the personal information storage of this personal number correspondence is got final product to PIHLR1.
If because number of users increases, the maximum size threshold value that the stored amount of user information of PIHLR1 has reached its present maximum storage capacity or set in advance, for example 80% of the maximum storage capacity.So Xin Zeng user profile can not be inserted among the PIHLR1 again.In this case, can at first consider PIHLR1 is carried out dilatation.That is to say,, can carry out dilatation such as the way of memory banks such as database to it by increasing if when the present operable capacity of PIHLR1 does not reach its design maximum capacity as yet.Like this, just can renew the newly-increased userspersonal information of storage at original PIHLR1 relaying.
If original PIHLR has reached the design maximum capacity, can not be by the new personal information of way storage of dilatation, so just needing has increased new PIHLR.At first, newly-increased PIHLR is called PIHLR2.Because the leaf node of PIHLR1 correspondence has only a root node, at this moment, need select suitable packet count G and hash operation method according to Subscriber Number distribution characteristics among this PIHLR1, during the personal number packet map among the PIHLR1 divided into groups to G.Create a node with each grouping, be respectively Node1~NodeG, and with the child node of this G node as root node.G node is divided into two groups of 1~m and m+1~G, allow the corresponding original PIHLR1 of first group of 1~m node, allow second group of m+1~G PIHLR2 that the node correspondence increases newly, and the personal number corresponding informance in m+1 among the original PIHLR1~G grouping is transferred among the newly-increased PIHLR2.
In this example, packet count G is 5, just is divided into 51 grade of nodes below root node, and they all point to PIHLR1.The hash operation method here is a known technology, can adopt a kind of concrete hash operation method at some nodes as the case may be in practical operation, and the hash operation method of different nodes can be different.Here can cite a plain example, for example personal number is made up of 6 bit digital, and the preceding 3 item sign indicating numbers of personal number are got remainder divided by 5, according to remainder personal number is mapped to respectively in 1 grade of different nodes.For example, remainder is 0 and is mapped to the 1st 1 grade of node that remainder is 1 and is mapped to the 2nd 1 grade of node that remainder is 2 and is mapped to the 3rd 1 grade of node that the rest may be inferred.Like this, just original all personal numbers of corresponding root node are mapped to respectively among 1 grade of different nodes.
In this example, m gets 3, is exactly the 1st, the 2nd and the 3rd the still corresponding PIHLR1 of 1 grade of node like this, all the other 2 then corresponding PIHLR2 of 1 grade of node.The corresponding personal information of personal number that will be mapped to all the other 21 grade of nodes is simultaneously moved the PIHLR2 from PIHLR1.Should illustrate that the method that the personal number of moving to this locality is optimized storage not necessarily is limited to above-mentioned scattering tree method.

Claims (9)

1. a preferential local call method of moving local personal number is characterized in that comprising the steps:
One, network is optimized storage according to predefined method to the personal information UserPI of moving to local personal number user, this method can navigate to the PIHLR of this UserPN according to user's personal number UserPN through computing, make network when visiting the PIHLR of people's number one by one, obtain from the direct computing of UserPN;
Two, when calling one by one during people's number user's UserPN, network directly according to called subscriber's UserPN, according to described predefined method, through computing, navigates to the PIHLR of corresponding this userspersonal information UserPI of storage;
Three, the PIHLR of the described correspondence of visit searches called subscriber's UserPI, if this PIHLR has found relevant called subscriber's UserPI, then directly Query Result is returned to network;
Four, the Query Result that returns of network utilisation PIHLR, replay call.
2. the preferential local call method of the personal number that migration as claimed in claim 1 is local, it is characterized in that: step 1 is described to be optimized storage and to be meant moving to local personal number according to predefined method: according to scattering tree technology, be optimized storage to moving to local personal number, that is: set up and store the scattering tree that is mapped to leaf node from root node in advance in network, described scattering tree is the table of comparisons of mapping step by step that reflects the PIHLR equipment the network that is mapped to from UserPN.
3. the preferential local call method of the personal number that migration as claimed in claim 2 is local is characterized in that: step 1 is described to be optimized storage and also to comprise moving to local personal number according to predefined method: the UserPI that will move to local user leaves concentratedly in some specific PIHLR.
4. as claim 2 or 3 described preferential local call methods of moving local personal number, it is characterized in that: step 2 is described according to described predefined method, through computing, the PIHLR that navigates to this userspersonal information UserPI of storage fast is meant: network is directly according to user's UserPN, according to scattering tree technology, navigate to the PIHLR of this userspersonal information UserPI of storage.
5. the preferential local call method of the personal number that migration as claimed in claim 1 is local, it is characterized in that: the described calling of step 2 people's number user's UserPN one by one is the calling that has added preferential local call sign.
6. the preferential local call method of the personal number that migration as claimed in claim 1 is local, it is characterized in that: the described calling of step 2 people's number user's UserPN one by one is the calling that does not add preferential local call sign.
7. the preferential local call method of the personal number that migration as claimed in claim 1 is local, it is characterized in that: in step 2, when calling one by one during people's number user's UserPN, network is at first checked the PNHLR numbering among the UserPN, whether the PNHLR that judges this personal number correspondence is in the current location of caller, if, then network is directly visited this PNHLR, PNHLR is according to the table of comparisons of UserPN-PIHLR numbering, obtain the numbering of user PIHLR, and visit the PIHLR of this numbering, therefrom inquire called UserPI, and Query Result returned to network, then execution in step four is finished call proceeding.
8. the preferential local call method of the personal number that migration as claimed in claim 1 is local, it is characterized in that: in the step 3, if the PIHLR of described correspondence does not find relevant called subscriber's UserPI, then number according to the PNHLR among the UserPN, directly visit the corresponding PNHLR of this numbering, PNHLR is according to the table of comparisons of UserPN-PIHLR numbering, obtain the numbering of user PIHLR, and visit the PIHLR of this numbering, therefrom inquire called UserPI, and Query Result returned to network, then execution in step four.
9. as claim 1 or 7 or 8 described preferential local call methods of moving local personal number, it is characterized in that also comprising the steps: that then network-feedback is given calling subscriber's's " dialing numbers does not exist " information if finally do not obtain this user's UserPI in described PIHLR.
CN031013414A 2003-01-03 2003-01-03 Priority local calling method for local transitional personal number Expired - Fee Related CN100407740C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN031013414A CN100407740C (en) 2003-01-03 2003-01-03 Priority local calling method for local transitional personal number

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN031013414A CN100407740C (en) 2003-01-03 2003-01-03 Priority local calling method for local transitional personal number

Publications (2)

Publication Number Publication Date
CN1516430A CN1516430A (en) 2004-07-28
CN100407740C true CN100407740C (en) 2008-07-30

Family

ID=34239084

Family Applications (1)

Application Number Title Priority Date Filing Date
CN031013414A Expired - Fee Related CN100407740C (en) 2003-01-03 2003-01-03 Priority local calling method for local transitional personal number

Country Status (1)

Country Link
CN (1) CN100407740C (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1160471A (en) * 1994-10-05 1997-09-24 奥林吉个人通讯服务公司 Mobile telecommunications system
CN1224564A (en) * 1996-03-26 1999-07-28 艾利森公司 Routing incoming call to ported mobile station within telecommunications network
CN1277789A (en) * 1997-08-27 2000-12-20 利伯特尔网络有限公司 Method and system for processing calls for communication equipment with a subscriber number ported from a first operator to a second operator, especially for mobile communication
US20010051525A1 (en) * 1998-07-23 2001-12-13 Rayne Mark W. Radio communications newtwork

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1160471A (en) * 1994-10-05 1997-09-24 奥林吉个人通讯服务公司 Mobile telecommunications system
CN1224564A (en) * 1996-03-26 1999-07-28 艾利森公司 Routing incoming call to ported mobile station within telecommunications network
CN1277789A (en) * 1997-08-27 2000-12-20 利伯特尔网络有限公司 Method and system for processing calls for communication equipment with a subscriber number ported from a first operator to a second operator, especially for mobile communication
US20010051525A1 (en) * 1998-07-23 2001-12-13 Rayne Mark W. Radio communications newtwork

Also Published As

Publication number Publication date
CN1516430A (en) 2004-07-28

Similar Documents

Publication Publication Date Title
CN104375992B (en) A kind of method and apparatus of address matching
JP2994547B2 (en) Directory / network structure
US20020151315A1 (en) Managing and querying moving point data
CN107766433A (en) A kind of range query method and device based on Geo BTree
KR20170018015A (en) Method, apparatus and system for implementing location based services
CN101478608A (en) Fast operating method for mass data based on two-dimensional hash
CN102156756A (en) Method for finding optimal path in road network based on graph embedding
CN105515997B (en) The higher efficiency range matching process of zero scope expansion is realized based on BF_TCAM
CN112214485B (en) Power grid resource data organization planning method based on global subdivision grid
CN106777387A (en) A kind of Internet of Things big data access method based on HBase
CN101159966A (en) Peer-to-peer network topology matching method in mobile environment
CN103425694B (en) The searching method of relational data and device
CN105138536B (en) Mobile social networking data fragmentation method based on Directed Hypergraph
CN107133339A (en) Circuit query method and apparatus and storage medium, processor
CN106372262A (en) System and method for urban outdoor public space urban home furnishing management
CN102110139B (en) Analytic algorithm for geographic grid in telecommunication field
CN100407740C (en) Priority local calling method for local transitional personal number
CN101217690A (en) A system and method for realizing distributed storage of data operation and data information
CN100421114C (en) Data matching inquiry method based on key words
CN102214214B (en) Method and device for processing data relationship and mobile communication terminal
CN104156475B (en) Geography information read method and device
CN107465706A (en) A kind of distributed data object storage device based on cordless communication network
CN107066581B (en) The storage of distributed traffic monitor video data and quick retrieval system
CN1135801C (en) Routing method for signaling No.7 network management system
CN114996535A (en) Data retrieval method and system for power equipment in power grid and electronic equipment

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20080730

Termination date: 20180103