CN102843769B

CN102843769B - Paging method and core network node

Info

Publication number: CN102843769B
Application number: CN201110166527.8A
Authority: CN
Inventors: 冯传奋; 纪芳; 付宏志; 李爱娇
Original assignee: China Mobile Group Design Institute Co Ltd
Current assignee: China Mobile Group Design Institute Co Ltd
Priority date: 2011-06-20
Filing date: 2011-06-20
Publication date: 2015-02-04
Anticipated expiration: 2031-06-20
Also published as: CN102843769A

Abstract

The invention discloses a paging method and a core network node. The paging method comprises the following steps: when the core network node needs to page UE (User Equipment), whether the current LA (Location Area) of the UE is the LA of an LAC (Location Area Network) shared by a first network and a second network is judged; if yes, whether the UE is ever accessed into the first network or the second network in the current LA is judged; and if the judged result is that the UE is ever accessed into the first network in the current LA but never accessed into the second network, then the first network is notified to page the UE in the current LA. According to the technical scheme of the invention, the paging method and the core network node solve the problems that in the prior art, the quantity of paging processing resources consumed when paging the UE is large, and the paging time delay is long.

Description

Paging method and core net node

Technical field

The present invention relates to mobile communication technology field, particularly relate to a kind of paging method and core net node.

Background technology

3G (Third Generation) Moblie (3G, 3rd Generation Mobile Communications) the network Development initial stage, because the network coverage etc. is not yet optimized, same position district (LA, Location Area) in may there is too much Generation Mobile Telecommunication System (2G, 2nd Generation Mobile Communications) internet and 3G network of network border, this will cause user terminal (UE, User Equipment) carry out the location updating of a large amount of 2G network/3G networks, due in position updating process cannot paging to UE, therefore the call completing rate of 3G network will be had a strong impact on.To this, prior art proposes the lane place number (LAC of 2G internet and 3G network in above-mentioned LA, Location Area Code) carry out unifying to arrange, namely the LAC of the access node of 2G network in this LA is identical with the LAC of the access node of 3G network in this LA, this LA can be called that 2G internet and 3G network is total to the LA of LAC, access node in 2G network is base station controller (BSC, Base Station Controller), access node in 3G network is radio network controller (RNC, Radio Network Controller), by unified for the LAC of 2G internet and 3G network, the location updating can avoiding a large amount of 2G network/3G networks is set.

Prior art proposes a kind of method of paging UE in the LA that 2G internet and 3G network is total to LAC, and the method comprises the process of record UE access information and the process of paging UE, is introduced respectively below to two processing procedures.

Core net node is when UE access network side, record the access information of this UE, access information comprises UE when being in the LA of 2G internet and 3G network altogether LAC, node identification (the ID of the access node accessed during the last access 2G network, IDentity) and turn-on time, and the last access 3G network time the node ID of access node that accesses and turn-on time.Time initial, all node ID in access information be set to node ID initial value, all turn-on times are set to initial value turn-on time.

As shown in Figure 1, for recording the method flow diagram of UE access information in prior art, its concrete handling process is as follows:

Step 11, when UE access network side, core net node judges whether the current residing LA of this UE is the LA that 2G internet and 3G network is total to LAC;

Step 12, if the determination result is YES, then determines the node ID of the access node that this UE is current accessed;

Step 13, according to the node ID determined, determines the network belonging to this access node;

Step 14, in the access information of this UE, the node ID of the access node accessed when the last time is accessed the network determined is updated to the node ID that step 13 is determined, turn-on time when being accessed the network determined the last time is updated to current time.

As shown in Figure 2, be the method flow diagram of paging UE in prior art, its concrete handling process is as follows:

Step 21, when core net node needs paging UE, first judges that whether the current residing LA of this UE is the LA of 2G internet and 3G network LAC altogether, if the determination result is YES, then goes to step 22, if judged result is no, then go to step 27;

Step 22, obtains turn-on time during the last access 2G network from the access information of this UE of record, and turn-on time during the last access 3G network;

Step 23, judges whether two of the acquisition time spans between turn-on time and current point in time are all less than default time span threshold value, if the determination result is YES, then go to step 24, if judged result is no, then go to step 25;

Step 24, core net node notice 2G internet and 3G network paging UE in the current residing LA of this UE;

Step 25, in two turn-on times obtained, selects the turn-on time that distance current point in time is nearest;

Step 26, core net node notifies the paging UE in the current residing LA of this UE of the network corresponding to turn-on time selected;

Step 27, core net node, according to normal paging flow process paging UE, namely notifies this UE of access node paging in the current residing LA of UE.

Therefore, if the current 2G internet and 3G network that is in of UE is total in the LA of LAC, the no matter what state of UE access network, prior art is when paging UE, turn-on time when turn-on time when all needing first to read the last time access 2G network recorded in the access information of this UE and the last access 3G network, then the ICQ UE corresponding to turn-on time that chosen distance current point in time is nearest, therefore just consume more paging process resource, and paging time delay is longer.

In prior art, after core net introduces disaster-tolerant backup mechanism, if the core net node fault of called UE ownership, then need to carry out paging by corresponding backup node to called UE, because backup node does not upgrade the access information of UE, even if therefore UE only accessed first network or only accessed second network in current residing LA, backup node still needed notice first network and second network to carry out paging to UE, thus waste more process resource, and add paging time delay.

For the problems referred to above, the embodiment of the present invention proposes, core net node is by the node ID after renewal and each backup node informing to described core net node turn-on time, the access information of each backup node to this UE that self stores upgrades, if the core net node fault of called UE ownership, when then corresponding backup node carries out paging to called UE, can judge whether this UE only accessed one of them network in current residing LA according to the access information of this UE after renewal, if only accessed one of them network, then only need notify this ICQ UE, thus effectively save paging process resource, shorten paging time delay.

As shown in Figure 4, be the paging method flow chart in the embodiment of the present invention, its concrete handling process is as follows:

Step 41, core net node, when needs paging UE, judges whether the current residing LA of described UE is the LA that first network and second network are total to LAC;

Core net node judges that whether the current residing LA of described UE is that the process of first network and the second network LA of LAC altogether can be, but not limited to as following:

Core net node first finds the access information of this UE of record according to the user ID of this UE, then from the access information of this UE found, this UE is obtained when being in the LA of first network and second network LAC altogether, the node ID of the second access node accessed when the node ID of the first access node accessed during the last access first network and the last access second network, core net node judges whether the node ID of the first access node obtained is default node ID initial value, and second the node ID of access node whether be default node ID initial value, if at least one judged result is no, then determine that the current residing LA of described UE is the LA that first network and second network are total to LAC, if judged result is be, then determine that the current residing LA of described UE is not for first network and second network are total to the LA of LAC.

In the embodiment of the present invention, each access node in first network is called the first access node, each access node in second network is called the second access node.

Step 42, if the judged result of step 41 is yes, then judges whether described UE accessed first network and whether accessed second network in current residing LA;

If core net node judges that the node ID of the first access node obtained is default node ID initial value, namely the judged result for the first access node obtained is yes, then determine that described UE did not access first network, if judge the node ID initial value of node ID not for presetting of the first access node obtained, namely the judged result for the first access node obtained is no, then determine that described UE accessed first network; In like manner, if the node ID judging the second access node obtained is default node ID initial value, namely the judged result for the second access node obtained is yes, then determine that described UE did not access second network, if judge the node ID initial value of node ID not for presetting of the second access node obtained, namely the judged result for the second access node obtained is no, then determine that described UE accessed second network.

Step 43, if judge, described UE accessed first network in current residing LA, and did not access second network, then notify described first network UE described in paging in the current residing LA of described UE.

Wherein, core net node notice first network paging UE in the current residing LA of described UE can be, but not limited to be realized by following two kinds of execution modes, is specially:

The first execution mode, LAC paging way, core net node first determines the LAC of the current residing LA of described UE, then according to the LAC determined, in each first access node in first network, determine each first access node that this LAC is corresponding, reinform each first this UE of access node paging determined, each first access node determined is sent to by the beep-page message of this UE of giving to be sent, after each first access node receives the beep-page message of core net node transmission, this UE of paging in the coverage of self.

Wherein, when core net node determines the LAC of UE current residing LA, according to the user ID of this UE, in the corresponding relation of user ID and LAC, search the LAC corresponding with described user ID, i.e. the LAC of the current residing LA of this UE.

Core net node determines that each first access node that this LAC is corresponding is specially: core net node is first according to the LAC determined, in corresponding relation between LAC and the node ID of each access node, search each node ID that this LAC is corresponding, then in each node ID found, determine the node ID of the first access node in first network, by the first corresponding respectively for each node ID found access node, be defined as each first access node that this LAC is corresponding.

The second execution mode, secondary LAC paging mode, core net node finds the access information of this UE of record according to the user ID of this UE, then from the access information of this UE found, this UE is obtained when being in the LA of first network and second network LAC altogether, the node ID of the first access node accessed during the last access first network, first this UE of access node paging that the node ID that core net node notice obtains is corresponding, by the first access node sending to the node ID of acquisition corresponding to the beep-page message of this UE to be sent, after this first access node receives the beep-page message of core net node transmission, this UE of paging in the coverage of self.

In the embodiment of the present invention, if core net node judges that the node ID of the first access node obtained is default node ID initial value, and the node ID of the second access node obtained is default node ID initial value, then determine that the current residing LA of described UE is not for first network and second network are total to the LA of LAC, so core net node can according to normal paging flow process paging UE, core net node first determines the LAC of the current residing LA of described UE, then according to the LAC determined, determine each access node that this LAC is corresponding, core net node notifies each this UE of access node paging determined, the each access node determined is sent to by the beep-page message of this UE of giving to be sent, after each access node receives the beep-page message of core net node transmission, this UE of paging in the coverage of self.

Wherein, core net node determines that each access node that this LAC is corresponding is specially: core net node is according to the LAC determined, in corresponding relation between LAC and the node ID of each access node, search each node ID that this LAC is corresponding, by access node corresponding respectively for each node ID found, be defined as each access node that this LAC is corresponding.

In the embodiment of the present invention, if core net node judges the node ID initial value of node ID not for presetting of the first access node obtained, and the node ID initial value of the node ID of the second access node obtained not for presetting, then determine that described UE accessed first network in current residing LA, and accessed second network, now, core net node obtains this UE when being in the LA of first network and second network LAC altogether from the access information of this UE, turn-on time when turn-on time during the last access first network and the last access second network, then for each turn-on time obtained, judge whether the time span between this turn-on time and current point in time is less than default time span threshold value respectively, if judged result is be, then notify described first network and second network UE described in paging in the current residing LA of described UE, otherwise in two turn-on times obtained, determine the turn-on time that distance current point in time is nearest, core net node notifies network UE described in paging in the current residing LA of described UE that turn-on time of determining is corresponding.

Wherein, the method for core net node notice first network or second network this UE of paging in the current residing LA of described UE can be, but not limited to adopt the first execution mode above-mentioned or the second execution mode, repeats no more here.

The embodiment of the present invention proposes, in order to shorten paging time delay further, after turn-on time when the turn-on time of core net node when obtaining this UE the last time access first network and the last access second network, directly can perform the operation determining the turn-on time that distance current point in time is nearest, and without the need to judging whether the time span between each turn-on time and current point in time is less than default time span threshold value.

In prior art, if do not receive the page-response message of UE after core net node first time paging UE, then core net needs to carry out secondary paging, now core net directly can notify first network and second network paging UE, and this just wastes more paging process resource, in addition, if UE has been updated to new LA, core net node is paging UE in former LA still, then can cause secondary paging failure, wastes paging process resource.

For the problems referred to above, the embodiment of the present invention proposes a kind of secondary paging method, is specially:

If core net node does not receive the page-response message that described UE sends in stipulated time length, then core net node judges in described stipulated time length, when this UE is in the LA of first network and second network common LAC, whether the node ID of the first access node accessed during the last access first network changes, and whether the node ID of the second access node accessed during the last access second network changes, if at least one judged result is yes, then core net node notifies UE described in the access node paging corresponding to node ID that judged result is yes, otherwise notify described first network and second network UE described in paging in the current residing LA of described UE.

Wherein, above-mentioned first network can be, but not limited to as 2G network or 3G network, and second network can be, but not limited to as 3G network or 2G network, when first network is 2G network, second network is 3G network, and when first network is 3G network, second network is 2G network.The first access node in 2G network is BSC, and the second access node in 3G network is RNC.

Above-mentioned core net node can be, but not limited to as mobile switching centre (MSC, Mobile Switching Center).

From above-mentioned processing procedure, core net node is when needs paging UE, first judge whether the current residing LA of described UE is the LA that first network and second network are total to LAC, if the determination result is YES, then judge whether this UE accessed first network and whether accessed second network in current residing LA, if judge, this UE accessed first network in current residing LA, and did not access second network, then notify described first network UE described in paging in the current residing LA of described UE.Therefore, in the technical scheme that the embodiment of the present invention provides, if this UE is the current LA being in first network and the common LAC of second network, and UE only accessed one of them network in current residing LA, then core net node directly notifies this ICQ UE, and turn-on time when turn-on time during without the need to reading the last time access first network recorded in the access information of UE and the last access second network, also without the need to turn-on time that chosen distance current point in time is nearest, therefore, it is possible to effectively save paging process resource, shorten paging time delay.

Provide more specifically execution mode below.

Summary of the invention

The embodiment of the present invention provides a kind of paging method and core net node, consumes more paging process resource during in order to solve the paging UE existed in prior art, and the problem that paging time delay is longer.

Embodiment of the present invention technical scheme is as follows:

A kind of paging method, the method comprising the steps of: core net node, when needs calling user terminal UE, judges whether described UE current present position district LA is the LA that first network and second network are total to lane place number LAC; If the determination result is YES, then judge whether described UE accessed first network and whether accessed second network in current residing LA; If judge, described UE accessed first network in current residing LA, and did not access second network, then notify described first network UE described in paging in the current residing LA of described UE.

A kind of core net node, comprising: lane place judging unit, for when needs calling user terminal UE, judges that whether described UE current present position district LA is the LA of first network and second network lane place number LAC altogether; Access network judging unit, for when the judged result of lane place judging unit is for being, judges whether described UE accessed first network and whether accessed second network in current residing LA; First paging unit, for judging that at access network judging unit described UE accessed first network in current residing LA, and when not accessing second network, notifies described first network UE described in paging in the current residing LA of described UE.

In embodiment of the present invention technical scheme, core net node is when needs paging UE, first judge whether the current residing LA of described UE is the LA that first network and second network are total to LAC, if the determination result is YES, then judge whether this UE accessed first network and whether accessed second network in current residing LA, if judge, this UE accessed first network in current residing LA, and did not access second network, then notify described first network UE described in paging in the current residing LA of described UE.Therefore, in the technical scheme that the embodiment of the present invention provides, if this UE is the current LA being in first network and the common LAC of second network, and UE only accessed one of them network in current residing LA, then core net node directly notifies this ICQ UE, and turn-on time when turn-on time during without the need to reading the last time access first network recorded in the access information of UE and the last access second network, also without the need to turn-on time that chosen distance current point in time is nearest, therefore, it is possible to effectively save paging process resource, shorten paging time delay.

Accompanying drawing explanation

Fig. 1 is in prior art, the method flow schematic diagram of record UE access information;

Fig. 2 is in prior art, the method flow schematic diagram of paging UE;

Fig. 3 is in the embodiment of the present invention, the method flow schematic diagram of record UE access information;

Fig. 4 is in the embodiment of the present invention, paging method schematic flow sheet;

Fig. 5 is in the embodiment of the present invention one, paging method specific implementation schematic flow sheet;

Fig. 6 is in the embodiment of the present invention two, paging method specific implementation schematic flow sheet;

Fig. 7 is in the embodiment of the present invention, core net node structural representation.

Embodiment

Below in conjunction with each accompanying drawing, the main of embodiment of the present invention technical scheme is realized principle, embodiment and set forth in detail the beneficial effect that should be able to reach.

The paging method that the embodiment of the present invention proposes comprises the process of record UE access information and the process of paging UE, is introduced respectively below to two processing procedures.

Core net node is when UE access network side, record the access information of this UE, access information comprises UE when being in the LA of first network and second network LAC altogether, the node ID of the access node accessed during the last access first network and turn-on time, and the node ID of the access node accessed during the last access second network and turn-on time.Time initial, all node ID in access information be set to node ID initial value, all turn-on times are set to initial value turn-on time.

Time initial, the access information of UE can be, but not limited to as shown in table 1:

Table 1:

As shown in Figure 3, for recording the method flow diagram of UE access information in the embodiment of the present invention, its concrete handling process is as follows:

Step 31, when UE access network side, core net node obtains the LAC of the current residing LA of this UE;

Wherein when UE carry out location updating, carry out call business or the information of carrying out send business time, UE needs access network side, the user ID of this UE and the LAC of current residing LA is carried in the location update request message that UE sends to core net node, call request message or information sending request message, user ID can be the temporary mobile subscriber identity (TMSI of UE, Temporary Mobile Station Identity), also can be the international mobile subscriber identification code (IMSI, International Mobile Subscriber Identity) of UE.

Step 32, according to the LAC that step 31 obtains, judges whether the current residing LA of this UE is the LA that first network and second network are total to LAC, if the determination result is YES, then goes to step 34, if judged result is no, then goes to step 33;

Core net node has prestored the LAC of each LA of first network and the common LAC of second network, as shown in table 2:

Table 2:

LAC1

LAC2
	LAC3
LAC4
	LAC5
LAC6

Core net node judges the LAC whether storing step 31 acquisition in table 2, the LAC that step 31 finds is stored if judge, then determine that the current residing LA of this UE is the LA that first network and second network are total to LAC, judge the LAC not storing step 31 acquisition, then determine the current residing LA of this UE for first network and second network are total to the LA of LAC.

Step 33, in the access information of this UE, is all updated to node ID initial value by all node ID, all turn-on times is all updated to initial value turn-on time, then goes to step 38;

Step 34, determines the node ID of the access node that this UE is current accessed;

Step 35, according to the node ID determined, determines the network belonging to this access node, namely determines that the network belonging to this access node is first network or second network;

Step 36, if determine, the network belonging to this access node is first network, then in the access information of this UE, the node ID of the access node accessed when being accessed first network the last time is updated to the node ID that step 34 is determined, turn-on time when being accessed first network the last time is updated to current time and then goes to step 38;

Step 37, if determine, the network belonging to this access node is second network, then in the access information of this UE, the node ID of the access node accessed when being accessed second network the last time is updated to the node ID that step 34 is determined, turn-on time when being accessed second network the last time is updated to current time, then goes to step 38;

Such as, time initial, the access information of the UE of core net node record is as shown in table 1, when UE access network side, core net node first judges that the current residing LA of this UE is the LA that first network and second network are total to LAC, then core net node determines that the node ID of the access node that this UE accesses is ID1, determine that the network belonging to this access node is first network according to ID1, the node ID of the access node accessed when then the last time is accessed first network by core net node in access information as shown in table 1 is updated to ID1, turn-on time when being accessed first network the last time is updated to current time T1, access information after renewal is as shown in table 3:

Table 3:

Follow-up when this UE again access network side time, core net node first judges that the current residing LA of this UE is the LA that first network and second network are total to LAC, then core net node determines that the node ID of the access node that this UE accesses is ID2, determine that the network belonging to this access node is second network according to ID2, the node ID of the access node accessed when then the last time is accessed second network by core net node in access information as shown in table 3 is updated to ID2, turn-on time when being accessed second network the last time is updated to current time T2, access information after renewal is as shown in table 4:

Table 4:

Step 38, by the node ID after renewal and each backup node informing to described core net node turn-on time.

Embodiment one

If first network is 2G network, second network is 3G network, and core net node is MSC, then as shown in Figure 5, be the paging method flow chart in the embodiment of the present invention one, its concrete handling process is as follows:

Step 51, when MSC needs paging UE, according to the user ID of this UE, searches the access information of this UE of record;

Step 52, MSC obtains this UE when being in the LA of 2G internet and 3G network altogether LAC from the access information of this UE found, the node ID (ID2) of the node ID (ID1) of the BSC accessed during the last access 2G network and the last RNC accessed when accessing 3G network;

Step 53, MSC judges whether the ID1 obtained is default node ID initial value, and whether the ID2 obtained is default node ID initial value;

Step 54, if MSC judges that ID1 and ID2 is default node ID initial value, then MSC determines the LAC of the current residing LA of UE;

Step 55, MSC, according to the LAC determined, determines each access node (RNC or BSC) that this LAC is corresponding;

Step 56, the beep-page message of this UE of giving to be sent is sent to each RNC or BSC determined by MSC, after each RNC or BSC receives beep-page message, this UE of paging in the coverage of self;

Step 57, if MSC judges the node ID initial value of ID1 not for presetting, ID2 is default node ID initial value, then MSC is by the BSC sending to ID1 corresponding to the beep-page message of this UE to be sent, after this BSC receives beep-page message, this UE of paging in the coverage of self;

Step 58, if MSC judges that ID1 is default node ID initial value, the node ID initial value of ID2 not for presetting, then MSC is by the RNC sending to ID2 corresponding to the beep-page message of this UE to be sent, after this RNC receives beep-page message, this UE of paging in the coverage of self;

Step 59, if MSC judges the node ID initial value of ID1 not for presetting, the node ID initial value of ID2 not for presetting, then MSC obtains this UE when being in the LA of 2G internet and 3G network altogether LAC from the access information of this UE, the turn-on time (T1) during the last access 2G network and the last turn-on time (T2) when accessing 3G network;

Step 510, MSC judges whether the time span between T1 and current point in time and the time span between T2 and current point in time are all less than default time span threshold value, if judged result is no, then go to step 511, if the determination result is YES, then 512 are gone to step;

Step 511, MSC judges whether the time span between T1 and current point in time is less than the time span between T2 and current point in time, if the determination result is YES, then goes to step 57, if judged result is no, then goes to step 58;

Step 512, MSC by RNC corresponding for BSC and ID2 sending to ID1 corresponding to the beep-page message of this UE to be sent, after this BSC and this RNC receives beep-page message, this UE of paging in the coverage of self respectively;

Step 513, MSC judges the page-response message whether receiving this UE transmission in stipulated time length, if the determination result is YES, then goes to step 517, if judged result is no, then goes to step 514;

Step 514, MSC judges in described stipulated time length, whether the node ID (ID1) of the BSC accessed during that record in the access information of this UE, the last access 2G network changes, and whether the node ID (ID2) of the RNC accessed during the last access 3G network changes;

Step 515, if the judged result of step 514 is no, then MSC is by RNC corresponding for BSC and ID2 sending to ID1 corresponding to the beep-page message of this UE to be sent, after this BSC and this RNC receives beep-page message, this UE of paging in the coverage of self, then goes to step 517 respectively;

Step 516, if at least one judged result of step 514 is yes, then MSC is by the access node corresponding to node ID of sending to judged result to be yes to the beep-page message of this UE to be sent, after this access node receives beep-page message, in the coverage of self, this UE of paging, then goes to step 517;

Step 517, paging flow process terminates.

Embodiment two

If first network is 2G network, second network is 3G network, and core net node is MSC, then as shown in Figure 6, be the paging method flow chart in the embodiment of the present invention two, its concrete handling process is as follows:

Step 61, when MSC needs paging UE, according to the user ID of this UE, searches the access information of this UE of record;

Step 62, MSC obtains this UE when being in the LA of 2G internet and 3G network altogether LAC from the access information of this UE found, the node ID (ID2) of the node ID (ID1) of the BSC accessed during the last access 2G network and the last RNC accessed when accessing 3G network;

Step 63, MSC judges whether the ID1 obtained is default node ID initial value, and whether the ID2 obtained is default node ID initial value;

Step 64, if MSC judges that ID1 and ID2 is default node ID initial value, then MSC determines the LAC of the current residing LA of UE;

Step 65, MSC, according to the LAC determined, determines each access node (RNC or BSC) that this LAC is corresponding;

Step 66, the beep-page message of this UE of giving to be sent is sent to each RNC or BSC determined by MSC, after each RNC or BSC receives beep-page message, this UE of paging in the coverage of self;

Step 67, if MSC judges the node ID initial value of ID1 not for presetting, ID2 is default node ID initial value, then MSC is by the BSC sending to ID1 corresponding to the beep-page message of this UE to be sent, after this BSC receives beep-page message, this UE of paging in the coverage of self;

Step 68, if MSC judges that ID1 is default node ID initial value, the node ID initial value of ID2 not for presetting, then MSC is by the RNC sending to ID2 corresponding to the beep-page message of this UE to be sent, after this RNC receives beep-page message, this UE of paging in the coverage of self;

Step 69, if MSC judges the node ID initial value of ID1 not for presetting, the node ID initial value of ID2 not for presetting, then MSC obtains this UE when being in the LA of 2G internet and 3G network altogether LAC from the access information of this UE, the turn-on time (T1) during the last access 2G network and the last turn-on time (T2) when accessing 3G network;

Step 610, MSC judges whether the time span between T1 and current point in time is less than the time span between T2 and current point in time, if the determination result is YES, then goes to step 67, if judged result is no, then goes to step 68;

Step 611, MSC judges the page-response message whether receiving this UE transmission in stipulated time length, if the determination result is YES, then goes to step 615, if judged result is no, then goes to step 612;

Step 612, MSC judges in described stipulated time length, whether the node ID of the BSC accessed during that record in the access information of this UE, the last access 2G network changes, and whether the node ID of the RNC accessed during the last access 3G network changes;

Step 613, if the judged result of step 612 is no, then MSC is by RNC corresponding for BSC and ID2 sending to ID1 corresponding to the beep-page message of this UE to be sent, after this BSC and this RNC receives beep-page message, this UE of paging in the coverage of self, then goes to step 615 respectively;

Step 614, if at least one judged result of step 612 is yes, then MSC is by the access node corresponding to node ID of sending to judged result to be yes to the beep-page message of this UE to be sent, after this access node receives beep-page message, in the coverage of self, this UE of paging, then goes to step 615;

Step 615, paging flow process terminates.

Accordingly, the embodiment of the present invention also provides a kind of core net node, and its structure as shown in Figure 7, comprising:

Lane place judging unit 71, for when needs paging UE, judges that whether the current residing LA of described UE is the LA of first network and second network LAC altogether;

Access network judging unit 72, for when the judged result of lane place judging unit 71 is for being, judges whether described UE accessed first network and whether accessed second network in current residing LA;

First paging unit 73, for judging that at access network judging unit 72 described UE accessed first network in current residing LA, and when not accessing second network, notifies described first network UE described in paging in LA residing for stating UE and being current.

Preferably, lane place judging unit 71 specifically comprises:

First node mark obtains subelement, for obtain described UE be in the LA of first network and second network LAC altogether time, the node ID of the second access node accessed when the node ID of the first access node accessed during the last access first network and the last access second network;

Node identification judgment sub-unit, for judging whether the node ID of the first access node that first node mark acquisition subelement obtains is default node ID initial value, and whether the node ID of the second access node is default node ID initial value;

Subelement is determined in lane place, for when at least one judged result of node identification judgment sub-unit is no, determine that the current residing LA of described UE is the LA that first network and second network are total to LAC, and the judged result of node identification judgment sub-unit be time, determine that the current residing LA of described UE is not the LA of first network and second network LAC altogether.

More preferably, if node identification judgment sub-unit judges that the node ID of the first access node that first node mark acquisition subelement obtains is default node ID initial value, then described access network judging unit 72 determines that described UE did not access first network in current residing LA, otherwise determines that described UE accessed first network in current residing LA;

If node identification judgment sub-unit judges that the node ID of the second access node that first node mark acquisition subelement obtains is default node ID initial value, then described access network judging unit 72 determines that described UE did not access second network in current residing LA, otherwise determines that described UE accessed second network in current residing LA.

Preferably, the first paging unit specifically comprises:

Location Area Identification determination subelement, for determining the LAC of the current residing LA of described UE;

Node determination subelement, for the LAC determined according to Location Area Identification determination subelement, in each first access node in first network, determines each first access node that this LAC is corresponding;

First paging subelement, for notifying each first this UE of access node paging that node determination subelement is determined.

Preferably, the first paging unit specifically comprises:

Section Point mark obtains subelement, for obtain this UE be in the LA of first network and second network LAC altogether time, the node ID of the first access node accessed during the last access first network;

Second paging subelement, for notifying first this UE of access node paging that the node ID of Section Point mark acquisition subelement acquisition is corresponding.

Preferably, described core net node also comprises:

Location Area Identification determining unit, for when the judged result of lane place judging unit 71 is no, determines the LAC of the current residing LA of described UE;

Node determining unit, for the LAC determined according to Location Area Identification determining unit, determines each access node that this LAC is corresponding;

Second paging unit, for notifying each this UE of access node paging that node determining unit is determined.

Preferably, described core net node also comprises:

Turn-on time obtains unit, for judging that at access network judging unit 71 described UE accessed first network in current residing LA, and when accessing second network, obtain described UE when being in the LA of first network and second network LAC altogether, turn-on time when turn-on time during the last access first network and the last access second network;

Turn-on time, determining unit, for obtaining in turn-on time in turn-on time that unit obtains, determined distance current point in time nearest turn-on time;

3rd paging unit, for notifying network UE described in paging in the current residing LA of described UE that turn-on time of determining is corresponding.

More preferably, described core net node also comprises:

Time span judging unit, for before turn-on time, determining unit determined the turn-on time that distance current point in time is nearest, for each turn-on time obtaining unit acquisition turn-on time, judge whether the time span between this turn-on time and current point in time is less than default time span threshold value respectively;

4th paging unit, when for being in the judged result of time span judging unit being, notifies described first network and second network UE described in paging in the current residing LA of described UE;

Described 3rd paging unit, when at least one judged result of time span judging unit is no, performs the operation determining the turn-on time that distance current point in time is nearest.

Preferably, described core net node also comprises:

Node identification judging unit, for do not receive in stipulated time length described UE send page-response message time, judge in described stipulated time length, when described UE is in the LA of first network and second network common LAC, whether the node ID of the first access node accessed during the last access first network changes, and whether the node ID of the second access node accessed during the last access second network changes;

5th paging unit, for when at least one judged result of node identification judging unit is for being, UE described in the access node paging corresponding to node ID that the judged result of notifying section point identification judging unit is yes;

6th paging unit, for when the judged result of node identification judging unit is no, notifies described first network and second network UE described in paging in the current residing LA of described UE.

Preferably, described core net node also comprises:

Information updating unit, for when described UE access network side, the node ID of the access node accessed when the last access first network and second network when the LA of first network and second network LAC is altogether in described UE and upgrading turn-on time;

Information notification unit, for the node ID after being upgraded by information updating unit with inform to each backup node of described core net node turn-on time.

Although describe the preferred embodiments of the present invention, those skilled in the art once obtain the basic creative concept of cicada, then can make other change and amendment to these embodiments.So claims are intended to be interpreted as comprising preferred embodiment and falling into all changes and the amendment of the scope of the invention.

Obviously, those skilled in the art can carry out various change and modification to the present invention and not depart from the spirit and scope of the present invention.Like this, if these amendments of the present invention and modification belong within the scope of the claims in the present invention and equivalent technologies thereof, then the present invention is also intended to comprise these change and modification.

Claims

1. a paging method, is characterized in that, comprising:

When needs calling user terminal UE, judge whether described UE current present position district LA is the LA that first network and second network are total to lane place number LAC;

If the determination result is YES, then judge whether described UE accessed first network and whether accessed second network in current residing LA;

If judge, described UE accessed first network in current residing LA, and did not access second network, then notify described first network UE described in paging in the current residing LA of described UE;

Wherein, judge whether the current residing LA of described UE is the LA that first network and second network are total to LAC, specifically comprises:

Obtain described UE when being in the LA of first network and second network LAC altogether, the node ID of the second access node accessed when the node identification ID of the first access node accessed during the last access first network and the last access second network;

Judge whether the node ID of the first access node obtained is default node ID initial value, and whether the node ID of the second access node is default node ID initial value;

If at least one judged result is no, then determine that the current residing LA of described UE is the LA that first network and second network are total to LAC;

Then determine that the current residing LA of described UE is not for first network and second network are total to the LA of LAC if judged result is.

2. paging method as claimed in claim 1, is characterized in that, judges whether described UE accessed first network in current residing LA, specifically comprised:

If the node ID judging the first access node obtained is default node ID initial value, then determine that described UE did not access first network in current residing LA; Otherwise

Determine that described UE accessed first network in current residing LA;

Judge whether described UE accessed second network in current residing LA, specifically comprised:

If the node ID judging the second access node obtained is default node ID initial value, then determine that described UE did not access second network in current residing LA; Otherwise

Determine that described UE accessed second network.

3. paging method as claimed in claim 1, is characterized in that, notifies described first network UE described in paging in the current residing LA of described UE, specifically comprises:

Determine the LAC of the current residing LA of described UE;

According to the LAC determined, in each first access node in first network, determine each first access node that this LAC is corresponding;

Notify each first this UE of access node paging determined.

4. paging method as claimed in claim 1, is characterized in that, notifies described first network UE described in paging in the current residing LA of described UE, specifically comprises:

Obtain this UE when being in the LA of first network and second network LAC altogether, the node ID of the first access node accessed during the last access first network;

First this UE of access node paging that the node ID that notice obtains is corresponding.

5. paging method as claimed in claim 1, is characterized in that, also comprise:

If judge, the current residing LA of described UE is not for first network and second network are total to the LA of LAC, then determine the LAC of the current residing LA of described UE;

According to the LAC determined, determine each access node that this LAC is corresponding;

Notify each this UE of access node paging determined.

6. paging method as claimed in claim 1, is characterized in that, also comprise:

If judge, described UE accessed first network in current residing LA, and accessed second network, then obtain described UE when being in the LA of first network and second network LAC altogether, turn-on time when turn-on time during the last access first network and the last access second network;

In the turn-on time obtained, determine the turn-on time that distance current point in time is nearest;

Notify network UE described in paging in the current residing LA of described UE that turn-on time of determining is corresponding.

7. paging method as claimed in claim 6, is characterized in that, before determining the turn-on time that distance current point in time is nearest, also comprises:

For each turn-on time obtained, judge whether the time span between this turn-on time and current point in time is less than default time span threshold value respectively;

Then notify described first network and second network UE described in paging in the current residing LA of described UE if judged result is; Otherwise

Perform the operation determining the turn-on time that distance current point in time is nearest.

8. paging method as claimed in claim 1, is characterized in that, also comprise:

If do not receive the page-response message that described UE sends in stipulated time length, then judge in described stipulated time length, when described UE is in the LA of first network and second network common LAC, whether the node ID of the first access node accessed during the last access first network changes, and whether the node ID of the second access node accessed during the last access second network changes;

If at least one judged result is yes, then notify UE described in the access node paging corresponding to node ID that judged result is yes; Otherwise

Notify described first network and second network UE described in paging in the current residing LA of described UE.

9. paging method as claimed in claim 1, is characterized in that, also comprise:

If during described UE access network side, then when the LA of first network and second network LAC being altogether in described UE, the node ID of the access node accessed when the last access first network and second network and upgrading turn-on time; And

By upgrade after node ID and inform to each backup node turn-on time.

10. the paging method as described in claim as arbitrary in claim 1 ~ 9, is characterized in that, described first network is Generation Mobile Telecommunication System network, and described second network is 3 G mobile communication network; Or

Described first network is 3 G mobile communication network, and described second network is Generation Mobile Telecommunication System network.

11. 1 kinds of core net nodes, is characterized in that, comprising:

Lane place judging unit, for when needs calling user terminal UE, judges that whether described UE current present position district LA is the LA of first network and second network lane place number LAC altogether;

Access network judging unit, for when the judged result of lane place judging unit is for being, judges whether described UE accessed first network and whether accessed second network in current residing LA;

First paging unit, for judging that at access network judging unit described UE accessed first network in current residing LA, and when not accessing second network, notifies described first network UE described in paging in the current residing LA of described UE;

Wherein, lane place judging unit specifically comprises:

First node mark obtains subelement, for obtain described UE be in the LA of first network and second network LAC altogether time, the node ID of the second access node accessed when the node identification ID of the first access node accessed during the last access first network and the last access second network;

12. core net nodes as claimed in claim 11, it is characterized in that, if node identification judgment sub-unit judges that the node ID of the first access node that first node mark acquisition subelement obtains is default node ID initial value, then described access network judging unit determines that described UE did not access first network in current residing LA, otherwise determines that described UE accessed first network in current residing LA;

If node identification judgment sub-unit judges that the node ID of the second access node that first node mark acquisition subelement obtains is default node ID initial value, then described access network judging unit determines that described UE did not access second network in current residing LA, otherwise determines that described UE accessed second network in current residing LA.

13. core net nodes as claimed in claim 11, it is characterized in that, the first paging unit specifically comprises:

14. core net nodes as claimed in claim 11, it is characterized in that, the first paging unit specifically comprises:

15. core net nodes as claimed in claim 11, is characterized in that, also comprise:

Location Area Identification determining unit, for when the judged result of lane place judging unit is no, determines the LAC of the current residing LA of described UE;

16. core net nodes as claimed in claim 11, is characterized in that, also comprise:

Turn-on time obtains unit, for judging that at access network judging unit described UE accessed first network in current residing LA, and when accessing second network, obtain described UE when being in the LA of first network and second network LAC altogether, turn-on time when turn-on time during the last access first network and the last access second network;

17. core net nodes as claimed in claim 16, is characterized in that, also comprise:

18. core net nodes as claimed in claim 11, is characterized in that, also comprise:

19. core net nodes as claimed in claim 11, is characterized in that, also comprise: