CN100463556C - Aggregating method of group data service between nodal joints - Google Patents
Aggregating method of group data service between nodal joints Download PDFInfo
- Publication number
- CN100463556C CN100463556C CNB021367574A CN02136757A CN100463556C CN 100463556 C CN100463556 C CN 100463556C CN B021367574 A CNB021367574 A CN B021367574A CN 02136757 A CN02136757 A CN 02136757A CN 100463556 C CN100463556 C CN 100463556C
- Authority
- CN
- China
- Prior art keywords
- pdsn
- cluster
- load
- group
- oneself
- 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
Links
Images
Abstract
The method belonging to CDMA mobile communication area includes following steps. A package data service node (PDSN) selects and joins a cluster group. Each PDSN broadcasts timed or not timed information of own cluster. PDSN records information from other PDSN onto 'cluster PDSN table' and 'cluster MS table'. When a user is switched in a PDSN, the PDSN queries cluster MS table first. If the user is found in the table, the PDSN recommends the user to PDSN just switched in; otherwise, the MS is a new user. PDSN queries cluster PDSN table for new user. A PDSN with most light load is found. The new user is recommend to a PDSN with most light load. The invention realizes load balancing and intelligent selection between PDSNs in cluster so as to prevent unnecessary switching and reduce communication discontinuity in moving procedure.
Description
Technical field
The present invention relates to the cluster method between a kind of packet data serving node (Packet Data Serving Node is hereinafter to be referred as PDSN).Belong to CDMA2000-1x grouped data software field.
Background technology
Along with the continuous fusion and the development of wireless communication networks and IP network, the utilization of Packet data service in cdma network will be more and more widely, and its status and effect in daily life and work will be more and more higher.Continuous promotion and application along with new business, the data volume of Packet Service will be increasing, PDSN as the grouping service wireless IAD of CDMA2000-1x also will get more and more, how these PDSN are organically integrated, make and accomplish load balancing between them, reduce the switching of travelling carriage between different PDSN etc. and just seem and be even more important.
There have been at present some to implement the technology of cluster between PDSN, for example provide a PDSN who is named as FACN (Foreign Agent Control Node) to insert selection equipment specially, as group control of functional node (Packet Control Function, hereinafter to be referred as PCF) be before the newly-built R-P of travelling carriage (Radio Network-PDSN) connects, at first must be linked into the FACN there, FACN is travelling carriage (Mobile Station according to the information of inner each cluster PDSN, hereinafter to be referred as MS) select a suitable PDSN, PCF reconnects to the PDSN of that new selection again according to this selection result then.Do the purpose that also can reach the PDSN cluster like this, but there are following shortcomings in it:
When each travelling carriage inserted, PCF must at first be connected to the FACN there, and then was connected to suitable PDSN according to the recommendation results of FACN, the turn-on time that this certainly will prolong travelling carriage, had increased the burden of network;
Being necessary for the PDSN cluster increases a preselected equipment, and for example FACN has increased operation cost;
Dependence to FACN is too big, and after the FACN operation irregularity, the cluster work of whole PDSN can't continue, and each PDSN in the cluster group will become one by one independent entity separately;
The PDSN that participates in cluster must be in a physical subnets scope, and it does not provide the cluster between the PDSN of strange land (promptly not in a physical subnets).
Summary of the invention
Shortcoming at above prior art, the present invention proposes cluster method between a new packet data serving node, make all PDSN in the cluster group have the function of load balancing and Intelligence Selection simultaneously, this method implementation method is simple, reliable, relevance is little between each cluster PDSN.
Technical scheme of the present invention is based on such thinking:
At first, packet data serving node PDSN selects a cluster group that will add and adds this group, so that implement cluster strategy, exchange cluster information in this group;
Secondly, the cluster information of each PDSN timing or not timing announcement oneself in the group, comprise the load-bearing capacity of oneself, current load condition, insert and the MS of off-line or the like in the recent period that PDSN is recorded in these information that other PDSN send in " cluster PDSN table " and " cluster MS table ";
When a MS is linked among the PDSN, PDSN at first inquires about cluster MS table, if found this MS in table, illustrates that so this MS is that other PDSN switch the users of coming in this cluster group, PDSN recommends back that PDSN of access just now with this user, otherwise illustrates that this MS is the new user who inserts;
If the new user who inserts, PDSN will inquire about cluster PDSN table, find out a lightest PDSN of load from cluster PDSN table, and the user of this new access be recommended the lightest PDSN of load insert.
This mode by software provided by the invention realizes the cluster of PDSN, implementation method is simple, load balancing and Intelligence Selection between the PDSN in the cluster have been realized by standard, open R-P interface, avoided the generation of the phenomenon of the load inequality between each PDSN, avoid the unnecessary switching of travelling carriage simultaneously, reduced the communicating interrupt of travelling carriage in moving process.
Description of drawings
Fig. 1 is the schematic flow sheet of cluster method of the present invention;
When being cluster, recommends Fig. 2 the A11 registration process sequence chart of new PDSN;
Fig. 3 (a) is the process chart of PDSN load balancing in the inventive method;
Fig. 3 (b) is the process chart of PDSN Intelligence Selection in the inventive method;
Fig. 4 is the interaction sequence figure of PDSN of the present invention cluster message when just having started;
Fig. 5 is the interaction sequence figure of cluster message under the communication abnormality situation of the present invention;
Fig. 6 is the cluster message interaction sequence chart of PDSN of the present invention when restarting.
Embodiment
As shown in Figure 1, the course of work of the cluster method between packet data serving node described in the invention is such:
At first, PDSN selects a cluster group that will add and adds this group, implements cluster strategy, exchange cluster information etc. later on and all will carry out in this group;
Secondly, the cluster information of each PDSN timing or not timing announcement oneself in the group, comprise the load-bearing capacity of oneself, current load condition, insert and the MS of off-line or the like in the recent period that PDSN is recorded in these information that other PDSN send in " cluster PDSN table " and " cluster MS table ".Wherein, the effect of " cluster PDSN table " is the load condition information of all PDSN in the record clustering group, from this table, can find out the lightest PDSN of load, this table is very useful when load balancing, the effect of " cluster MS table " is the basic condition that record is linked into all MS in this cluster group, and this table is very useful when Intelligence Selection;
When a MS is linked among the PDSN, PDSN at first inquires about cluster MS table, judge that this MS is that other PDSN switch the user or the new user who inserts that come in this cluster group, if in table, found this MS, illustrate that so this MS is that other PDSN switch the users of coming in this cluster group, otherwise illustrate that this MS is the new user who inserts;
Switch the user of coming for other PDSN in this cluster group, PDSN will recommend back the PDSN of access just now to this MS, avoid MS to produce unnecessary switching, and this strategy just is Intelligence Selection;
User for new access, PDSN will inquire about cluster PDSN table, from cluster PDSN table, find out a lightest PDSN of load, if the load of oneself is at present the lightest, PDSN will accept the access of this MS so, otherwise will recommend the lightest PDSN of load to the MS of this new access, this strategy just is load balancing, claims load sharing again.
The algorithm that PDSN butt joint access customer carries out Intelligence Selection or load balancing as shown in Figure 3, we will introduce this algorithm in detail the back.In the cluster group, the swarm algorithm of each PDSN is identical, and operation independent separately, has taken place also can not have influence on other PDSN unusually even participate in certain PDSN of cluster.
When MS is linked into certain PDSN, through after the Intelligence Selection or load balancing computing of this PDSN,, MS more suitably talks about if being linked into other PDSN, and this PDSN need recommend other more suitably PDSN to this MS so, and recommend method is as shown in Figure 2.PDSN is when recommending other PDSN to MS, in addition not newly-increased interface, but utilized A11 registration reply message (A11Registration RePly in the R-P interface of standard dexterously, abbreviation A11-RRP) (error code equals 136 in error code expression, implication is the IP address of unknown PDSN), do not need PCF to revise any interface in the time of can accomplishing like this to implement PDSN cluster strategy.
When the cluster that Fig. 2 describes, recommend in the A11 registration process of new PDSN, after having set up airlink between MS and the wireless network, PCF will send A11 register requirement (A11 RegistrationReQuest to PDSN_1, be called for short A11-RRQ), indicated home agent (Home Agent among the A11-RRQ, be called for short HA) equal the IP address of PDSN_1, PDSN will carry out load balancing and Intelligence Selection according to previously described strategy, if desired MS is recommended other PDSN in the group, PDSN_1 will send an A11-RRP to PCF so, the refusal code that comprises in the message equals 136, the best PDSN that provides access simultaneously is PDSN_2 (HA=2.1.1.1), PCF will send a new A11-RRQ to PDSN_2 again according to this recommendation results subsequently, wait PDSN_2 to respond the A11-RRP message after, the A11 passage is just set up and has been finished.
Fig. 3 (a) has provided the process chart of PDSN load balancing in the inventive method; Fig. 3 (b) provides the process chart of PDSN Intelligence Selection in the inventive method.
In the middle of practice, when a MS is linked into PDSN, what PDSN at first carried out will be Intelligence Selection, just carry out load balancing when Intelligence Selection is unsuccessful, introduce load balancing and Intelligence Selection respectively below in conjunction with Fig. 3.
The purpose of implementing load balancing in cluster group is to avoid some PDSN overload of power, and the too light situation of some PDSN load takes place, and utilizes Internet resources fully, for MS provides reliablely and stablely access service.
In conjunction with Fig. 3 (a), the work thinking of load balancing is as follows:
1. cluster PDSN is regularly to the Hostname of external world's notice (multicast and clean culture) oneself, IP address, present load condition, the information such as load-bearing capacity of oneself;
2. calculate the load percentage of each cluster PDSN, load percentage=present load/total load-bearing capacity;
When PCF be that the newly-built R-P of the new MS of access is when connecting, if find to have the load percentage of PDSN lower more than 10% than the load percentage of oneself, this PDSN just can recommend the minimum PDSN of that load percentage to MS so, otherwise just oneself admits the user of this new access;
4. for fear of the situation generation of overload suddenly of certain PDSN load, cluster PDSN also can be to the load condition of extraneous not timing ground proactive notification oneself;
5. if PDSN has a plurality of R-P network interfaces, cluster PDSN also can carry out load balancing between the several R-P network interfaces of oneself, promptly accept the request of setting up A10/A11 of PCF, but recommends the lighter R-P network interface of another one load simultaneously.
The purpose of Intelligence Selection is to avoid MS to produce unnecessary switching in cluster group, guarantees that the communication of MS is not interrupted.For example, PDSN1, PDSN2, PCF1, PCF2 totally 4 network elements are arranged, wherein PCF1 preferably is connected to PDSN1, and PCF2 preferably is connected to PDSN2, and PDSN1 and PDSN2 are in a cluster grouping.Original MS is linked into PDSN1 by PCF1, MS switched to PCF2 afterwards, but PCF2 has preferentially selected PDSN2, because PDSN1 and PDSN2 are same cluster groupings, so this moment, MS should be PDSN1 by the optimum PDSN that PCF2 connects, because MS can carry out PPP, mobile IP (Mobile IP more like this, be called for short MIP) etc. the reconstruction of session, can accelerate the switch speed of MS like this,, can also guarantee that like this communication of MS is not interrupted if the MS employing is the simple IP access way.
In conjunction with Fig. 3 (b), the work thinking of Intelligence Selection is as follows:
1. the PDSN of all participation clusters writes down the IMSI of interior all accesses of a period of time and off-line MS;
When timer to constantly just in group other PDSN notice insert recently and the IMSI of off-line MS, if when the MS of access or off-line reaches some, PDSN also can initiatively send to not timing this information;
3. each PDSN MS access information that other clusters PDSN is sent and the MS that is linked into oneself are recorded in the cluster MS table; All will inquire about this cluster MS table when having new MS to insert, if that find that MS inserted just now is other PDSN in the cluster PDSN, PDSN will recommend back old access PDSN to MS again so.
If the new MS that inserts does not appear in the cluster MS table, illustrate that this PDSN only need consider that load balancing is just passable, need not to consider Intelligence Selection.If the current load of PDSN has not surpassed the thresholding of cluster, PDSN will accept the A11-RRQ that PCF sends so, otherwise will inquire about cluster PDSN table, therefrom select a lightest PDSN of load, the possibility of result that chooses is oneself, also may be other clusters PDSN.Here the load balancing of carrying is not only the load balancing between PDSN, also comprises the load balancing between several R-P network interfaces of PDSN.After receiving the A11-RRQ message of PCF, when the load of several R-P network interfaces of PDSN discovery oneself is unbalanced, can accept the A11-RRQ of PCF, but in response message, recommend the R-P network interface that load is lighter simultaneously, will send to the new R-P network interface that PDSN recommends when PCF can transmit the A10 message afterwards.
If the new MS that inserts has appeared in the cluster MS table, just need to have considered Intelligence Selection that because MS should be recommended back the PDSN that inserted just now this moment, MS need not to rebuild the PPP connection of previous foundation and MIP connection or the like like this this moment.If that previous access is PDSN oneself, the switching that MS has taken place between PCF, PDSN is interior is described so, PDSN will accept the A11 register requirement that PCF sends.If that previous MS inserts is other clusters PDSN, and this PDSN is working properly, PDSN will recommend back the previous PDSN that inserts with MS according to cluster IMSI table so.
After travelling carriage is linked into PDSN, PDSN will revise cluster MS table, simultaneously mobile station information be preserved, and in suitable the IMSI of the travelling carriage that inserts be announced to other clusters PDSN.When being linked into the travelling carriage off-line of this PDSN, PDSN also needs the information of travelling carriage is preserved, and in suitable the IMSI of the travelling carriage of recent off-line is also announced to other PDSN.
The present invention distinguishes different cluster groupings by different PORT COM, not communication mutually between the PDSN of different grouping, and the cluster of PDSN only carries out in this grouping, and a PDSN can not participate in two cluster groupings simultaneously.In addition, also provide two kinds of trunking modes: next-door neighbour's cluster and strange land cluster according to the difference of the position of the PDSN that participates in cluster.
So-called next-door neighbour's cluster is meant all PDSN that participate in cluster in a physical subnets, and in general, the PDSN of next-door neighbour's cluster is usually in a machine room.So-called strange land cluster is meant that the PDSN that participates in cluster can be from different local, and their IP address belongs to different physical subnets, each other a plurality of routers, switch etc. can be arranged.
Cluster between the PDSN adopts the bearing protocol of UDP as communication, next-door neighbour's cluster adopts the communication of multicast mode: IP=224.0.0.224, Port=10224+ (nGroup-1) * 10, the strange land cluster adopts the mode of unicast communication: the address of IP=opposite end PDSN, Port=10225+ (nGroup-1) * 10, wherein nGroup is the cluster packet numbering, and scope is generally 1～16.
The rudimentary algorithm of cluster has been described in the front, describes the cluster message that is used to exchange cluster information below again, and the reciprocal process of these cluster messages.
The PDSN cluster message that the present invention relates to mainly contains 8 classes, as shown in Table 1.In order to guarantee the fail safe of cluster message, the PDSN of all participation clusters of the present invention all disposes the key that identical being used to authenticates the cluster message, and identifying algorithm can adopt the HMAC-MD5 algorithm.
The type of message and the explanation thereof of table one PDSN cluster
| Type of message | The message function declaration |
| Hello packet | Other PDSN in cluster group announce this PDSN and have started and begun to join in the cluster group. |
| Announcement load-bearing capacity message | The load-bearing capacity of other PDSN announcements in cluster group oneself. |
| Announcement inserts, the MS message of off-line | Other PDSN announcement in cluster group inserts in this PDSN and the user profile of off-line. |
| Announce online message | Other PDSN announcements in cluster group are own online. |
| The PDSN message of renaming | When PDSN changes the host name of oneself, by the newname of this message announcement oneself. |
| Stop the cluster message | When PDSN need leave certain cluster group, by other PDSN of this message notifying. |
| Ask for the cluster information request message | Initiatively other PDSN in cluster group ask for all information relevant with cluster of the other side. |
| Ask for the cluster information response message | Ask for the response message of cluster information request message. |
Tell about the reciprocal process of cluster message below in conjunction with Fig. 4, Fig. 5, Fig. 6.
What Fig. 4 described is the transmission situation of message when PDSN has just started under the normal condition.
When PDSN just started, it also can't obtain the cluster information of other clusters PDSN, and this moment, PDSN will be initiatively to external world's issue hello packet, and the number of times of issue is generally continuous 3 times.Other PDSN produce a time delay (0～3 second) at random after receiving this hello packet, and then have inserted the information of MS to the load-bearing capacity of the PDSN of new startup announcement oneself and all on one's own initiative, and communication modes generally adopts the mode of clean culture.Why PDSN has a time delay when answering hello packet, mainly be for fear of the situation generation that all cluster PDSN respond hello packet simultaneously occurring.
Subsequently, PDSN of this firm startup will start 3 timers, be respectively the timer (t2) of the announcement online message timer of PDSN (t1), announcement PDSN load-bearing capacity message and the MS message timer (t3) of recent access of announcement and off-line.All PDSN in the cluster group all need the online message of timed sending oneself, each PDSN can judge which PDSN is working properly according to this message, which PDSN has lost contact, just can to judge that this cluster PDSN has worked undesired if (be generally 30 seconds) the online message of not receiving certain cluster PDSN in a period of time, and all later on Intelligence Selection and load balancing will foreclose the PDSN of this operation irregularity.If (being generally 20 minutes) this unusual PDSN does not also recover operate as normal in the longer time, all cluster informations of this unusual PDSN are with deleted, comprising all records that are linked into this PDSN in record in cluster PDSN table and the cluster MS table so.PDSN periodically outwards announces own present load condition, when carrying out load balancing, that preferentially select will be the lightest PDSN of cluster group internal loading, if certain PDSN finds that the load growth of oneself is too fast, it also can outwards issue the load condition message of oneself on one's own initiative, and will wait until that not necessarily timer arrives constantly just issue.When MS access or off-line were arranged, PDSN all can note the IMSI of these MS, and the MS message timer that waits announcement access in the recent period and off-line is to these IMSI being announced to other clusters PDSN constantly again.
The message interaction order under the normal condition has been described in the front, may also some abnormal conditions can occur in the middle of the practice process, below we discuss how to implement the mutual of PDSN cluster message again under abnormal conditions.
What Fig. 5 described is a kind of abnormal conditions, after (for example network communication is unusual) PDSN_1, PDSN_2 start a period of time promptly for a certain reason, all do not receive the other side's messages such as Hello, that is to say that PDSN_1 and PDSN_2 all do not know the other side's existence, although they are operated in the same cluster grouping.PDSN_1 has received any cluster message of PDSN_2 after a period of time, PDSN_1 does not find the relevant information of PDSN_2 in cluster PDSN table, PDSN_1 will initiatively send one to PDSN_2 and ask for the cluster information request message so, PDSN_2 will send one earlier to PDSN_1 and ask for the cluster information response message after receiving this message, PDSN_2 also can send announcement load-bearing capacity message and announce all and inserted the message of MS subsequently, hereafter, the cluster of PDSN_1 and PDSN_2 just recovers normal.
What Fig. 6 described is another kind of abnormal conditions, be that initial PDSN_1, PDSN_2 have all added a cluster group, and all set up normal trunking communication between them, PDSN_2 was restarted after occurring unusually afterwards, and outwards issue a hello packet, PDSN_1 is after receiving hello packet, all cluster informations of PDSN_2 will be removed, comprise that all are linked into MS information all among the PDSN_2 in the cluster MS table, and then the PDSN of PDSN_2, and to PDSN_2 transmission announcement load-bearing capacity message and announcement MS access information message as new startup.
Claims (10)
1. cluster method between a packet data serving node is characterized in that, comprises the steps:
Step 1, packet data serving node PDSN select a cluster group that will add and add this group, so that implement cluster strategy, exchange cluster information in this group;
The cluster information of each PDSN timing or not timing broadcasting announcement oneself in step 2, the group, PDSN is recorded in these information that other PDSN send in " cluster PDSN table " and " cluster MS table ";
Described cluster PDSN table stores the PDSN inventory that this cluster comprises, described cluster MS table stores the PDSN information that MS and MS inserted that this cluster inserts;
Step 3, when a MS is linked among the PDSN, PDSN at first inquires about cluster MS table, if in table, found this MS, illustrate that then this MS is that other PDSN switch the users of coming in this cluster group, PDSN recommends that PDSN that inserted just now with this user, otherwise illustrates that this MS is the new user who inserts;
Step 4 is if the new user who inserts, and PDSN will inquire about cluster PDSN table, find out a lightest PDSN of load from cluster PDSN table, will recommend the lightest PDSN access of load to the user of this new access.
2. cluster method between packet data serving node according to claim 1, it is characterized in that, each PDSN regularly or the own cluster information of not timing broadcasting announcement comprises the load-bearing capacity of oneself, the information such as MS of current load condition, access in the recent period and off-line in the described step 2 group.
3. according to cluster method between the described packet data serving node of claim 1, it is characterized in that PDSN recommends that PDSN that inserted just now with this user in the described step 3, comprises the steps:
The PDSN of all participation clusters writes down the IMSI of interior all accesses of a period of time and off-line MS;
Set timer, regularly other PDSN notices insert and the IMSI of off-line MS recently in group, if when the MS of access or off-line reaches some, PDSN also can initiatively send to not timing this information;
MS access information that each PDSN sends other clusters PDSN and the MS that is linked into oneself are recorded in the cluster MS table; All will inquire about this cluster MS table when having new MS to insert, if that find that MS inserted just now is other PDSN in the cluster PDSN, PDSN will recommend back old access PDSN to MS again so.
4. according to cluster method between claim 1,2, one of 3 described packet data serving nodes, it is characterized in that described step 4 will be recommended the lightest PDSN of load to the user of this new access and insert, and comprise:
Cluster PDSN is regularly to the Hostname of extraneous multicast or clean culture oneself, IP address, present load condition, the information such as load-bearing capacity of oneself;
Calculate the load percentage of each cluster PDSN, load percentage=present load/total load-bearing capacity;
If find to have the load percentage of PDSN lower more than 10%, just will be somebody's turn to do the new user who inserts and recommend on the minimum PDSN of the percentage of wherein loading, otherwise just oneself admit the user of this new access than the load percentage of oneself.
5. cluster method between packet data serving node according to claim 4 is characterized in that, the described minimum PDSN of that load percentage that recommends to sets up A10/A11 request realization by group control of functional node PCF.
6. cluster method between packet data serving node according to claim 4, it is characterized in that, if PDSN has a plurality of R-P network interfaces, cluster PDSN also can carry out load balancing between the several R-P network interfaces of oneself, promptly accept the request of setting up A10/A11 of PCF, but recommend the lighter R-P network interface of another one load simultaneously.
7. cluster method between packet data serving node according to claim 1 is characterized in that, the cluster group of described step 1 comprises next-door neighbour group and strange land group; The described group that is close to is meant that all PDSN that participate in clusters are in a physical subnets; Described strange land group is meant the PDSN that participates in cluster from different local, and their IP address belongs to different physical subnets.
8. cluster method between packet data serving node according to claim 7 is characterized in that, the cluster between the PDSN adopts the bearing protocol of UDP as communication, and next-door neighbour group adopts the communication of multicast mode; Strange land group adopts the mode of unicast communication.
9. cluster method between packet data serving node according to claim 1, it is characterized in that, when PDSN just starts, comprise the steps: further before the described step 1 that PDSN is initiatively to continuous 3 the issue hello packet in the external world, other PDSN produce a time delay of 0～3 second at random after receiving this hello packet, adopt the communication modes of clean culture then, inserted the information of MS to the load-bearing capacity of the PDSN of new startup announcement oneself and all on one's own initiative.
10. cluster method between packet data serving node according to claim 1, it is characterized in that, when PDSN just starts, further comprising the steps: 3 timers of PDSN startup before the described step 1, is respectively the timer t2 of the online message timer of announcement PDSN t1, announcement PDSN load-bearing capacity message and the MS message timer t3 of announcement access in the recent period and off-line; The online message of all PDSN timed sending in the cluster group oneself, if do not receive the online message of certain cluster PDSN in 30 seconds, it is undesired to judge that then this cluster PDSN has worked, and temporarily will foreclose the PDSN of this operation irregularity; If in 20 minutes, this unusual PDSN does not also recover operate as normal, and all cluster informations deletions that then will this unusual PDSN are comprising all records that are linked into this PDSN in record in cluster PDSN table and the cluster MS table.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB021367574A CN100463556C (en) | 2002-08-29 | 2002-08-29 | Aggregating method of group data service between nodal joints |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB021367574A CN100463556C (en) | 2002-08-29 | 2002-08-29 | Aggregating method of group data service between nodal joints |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1479466A CN1479466A (en) | 2004-03-03 |
| CN100463556C true CN100463556C (en) | 2009-02-18 |
Family
ID=34146647
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB021367574A Expired - Fee Related CN100463556C (en) | 2002-08-29 | 2002-08-29 | Aggregating method of group data service between nodal joints |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100463556C (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1314296C (en) * | 2004-06-12 | 2007-05-02 | 中兴通讯股份有限公司 | Method for realizing hard changing-over in CDMA cluster system |
| CN100369428C (en) * | 2004-06-28 | 2008-02-13 | 中兴通讯股份有限公司 | Method for establishing connection and reconnection in radio local network |
| CN100334853C (en) * | 2004-07-01 | 2007-08-29 | 中兴通讯股份有限公司 | Method for realizing radio local network negantive load uniform using radio network information |
| CN101019378B (en) * | 2004-09-10 | 2014-06-25 | 美商内数位科技公司 | Accelerating discovery of access points in a wireless local area network |
| CN100417114C (en) * | 2005-03-01 | 2008-09-03 | 华为技术有限公司 | Method for realizing load balance between access devices in WLAN |
| CN100394726C (en) * | 2005-06-30 | 2008-06-11 | 西安交通大学 | Method for raising reliability of software system based on strucural member |
| CN1921648A (en) * | 2005-08-22 | 2007-02-28 | 华为技术有限公司 | Method and system for inquiring PoC conversation information beforehand |
| CN101222752B (en) * | 2007-01-12 | 2010-12-01 | 华为技术有限公司 | Group node switching method, communication system based on group node, group node controller |
| WO2008134959A1 (en) * | 2007-05-08 | 2008-11-13 | Huawei Technologies Co., Ltd. | Method and system for realizing load balancing in packet network |
| US7827270B2 (en) * | 2007-10-31 | 2010-11-02 | Cisco Technology, Inc. | Mobility service clustering using network service segments |
| CN101500201B (en) * | 2008-02-03 | 2011-05-11 | 中兴通讯股份有限公司 | Method and system for cluster call distribution customer terminal |
| CN103020801B (en) * | 2012-12-20 | 2016-03-30 | 西南科技大学 | A kind of method improving logistics distribution efficiency |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001078322A2 (en) * | 2000-04-11 | 2001-10-18 | Telefonaktiebolaget L M Ericsson (Publ) | System and method for packet data servicing node (pdsn) initial assignment and reselection |
-
2002
- 2002-08-29 CN CNB021367574A patent/CN100463556C/en not_active Expired - Fee Related
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001078322A2 (en) * | 2000-04-11 | 2001-10-18 | Telefonaktiebolaget L M Ericsson (Publ) | System and method for packet data servicing node (pdsn) initial assignment and reselection |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1479466A (en) | 2004-03-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100521660C (en) | Method for implementing integrated network mobile switch management | |
| CN100463556C (en) | Aggregating method of group data service between nodal joints | |
| CN100334866C (en) | Method for realizing dynamic gateway load sharing and backup | |
| CN101371605B (en) | For the agreement communicated between paging controller and paging agent during idle mode paging operations in the wireless network | |
| CN1307851C (en) | Method for reserving a new care of address (COA) in advance to achieve a fast handover | |
| US7633897B2 (en) | Method and apparatus for the discovery of radio access network elements and exchange of capability and data attributes between those elements | |
| EP2314049B1 (en) | Methods and apparatus for optimal participation of devices in a peer-to-peer overlay network | |
| CN101442502A (en) | Method, apparatus and system for monitoring session based on multicast technology | |
| WO2006051331A1 (en) | Roaming network stations using a mac address identifier to select a new access point | |
| JP2002044143A (en) | Communication control system and router and communication control method | |
| US20040082312A1 (en) | Communications network | |
| Ververidis et al. | Routing layer support for service discovery in mobile ad hoc networks | |
| WO2020043209A1 (en) | Disconnected network state reporting method and apparatus, and storage medium | |
| CN102271080A (en) | Method for preventing BGP (Border Gateway Protocol) session from being disconnected in the event of changing service, and applicable system thereof | |
| JP3785101B2 (en) | Communication connection establishment method, communication control device, recording medium, and control program | |
| WO2005076817B1 (en) | Method for preserving wireless resources in a wireless local area network | |
| US20040068578A1 (en) | Forwarding tree generation in a communications network | |
| CN102761477A (en) | Multicast protocol messaging method and device | |
| Benedetti et al. | An energy efficient and software-defined information-centric networking approach to consumer mobility | |
| JP2002186010A (en) | Mobile node position management method and network system | |
| KR100420667B1 (en) | Method for processing igmp message in radio mobile communication network and apparatus for preforming the same | |
| TWI701921B (en) | Method for repairing wireless distribution system under software defined networking structure | |
| CN108990051B (en) | Mobility management method supporting mobile networking | |
| CN110460500B (en) | Method and system for processing local area network instant communication network node abnormal offline | |
| Chin et al. | AMTree: An active approach to multicasting in mobile networks |
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 | ||
| EE01 | Entry into force of recordation of patent licensing contract |
Assignee: Nanjing Zhongxing Software Co., Ltd. Assignor: ZTE Corporation Contract record no.: 2011320000217 Denomination of invention: Aggregating method of group data service between nodal joints Granted publication date: 20090218 License type: Exclusive License Open date: 20040303 Record date: 20110310 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090218 Termination date: 20190829 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |