EP2346215A1 - Procédé de gestion de groupes d'équipements, équipement de noeud et système de communication - Google Patents

Procédé de gestion de groupes d'équipements, équipement de noeud et système de communication Download PDF

Info

Publication number
EP2346215A1
EP2346215A1 EP09823020A EP09823020A EP2346215A1 EP 2346215 A1 EP2346215 A1 EP 2346215A1 EP 09823020 A EP09823020 A EP 09823020A EP 09823020 A EP09823020 A EP 09823020A EP 2346215 A1 EP2346215 A1 EP 2346215A1
Authority
EP
European Patent Office
Prior art keywords
node device
ancestor
descendant
autonomous loop
unit
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.)
Granted
Application number
EP09823020A
Other languages
German (de)
English (en)
Other versions
EP2346215B1 (fr
EP2346215A4 (fr
Inventor
Ping Zhang
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
Publication of EP2346215A1 publication Critical patent/EP2346215A1/fr
Publication of EP2346215A4 publication Critical patent/EP2346215A4/fr
Application granted granted Critical
Publication of EP2346215B1 publication Critical patent/EP2346215B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
    • H04L12/42—Loop networks
    • H04L12/437—Ring fault isolation or reconfiguration
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0803—Configuration setting
    • H04L41/084—Configuration by using pre-existing information, e.g. using templates or copying from other elements
    • H04L41/0846—Configuration by using pre-existing information, e.g. using templates or copying from other elements based on copy from other elements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/08—Configuration management of networks or network elements
    • H04L41/0893—Assignment of logical groups to network elements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/12—Avoiding congestion; Recovering from congestion
    • H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering

Definitions

  • the present invention relates to communication technologies, and in particular, to a method, a node device, and a communication system for device pool management.
  • a pool management mechanism is introduced in the core network to implement load sharing between network elements and disaster recovery, reducing service interruption and improving reliability of the core network.
  • the pool management mechanism in the prior art provides no peer interfaces between members. Therefore, important operations such as synchronization, backup and handover are not practicable between members, and the pool is unable to ensure continuity of online services when the pool fails.
  • a pool area includes all Location Areas (LAs) or Routing Areas (RAs) which are located in a Radio Access Network (RAN) and served by a group of core network nodes.
  • LAs Location Areas
  • RAs Routing Areas
  • RAN Radio Access Network
  • multiple core network nodes run concurrently, and they share services in the pool area.
  • MS Mobile Station
  • the UE is served by only one dedicated core network node in the pool area.
  • All RAN nodes in a pool area are fully connected with all core network nodes in the pool area.
  • Another benefit brought by a pool area that includes multiple core network nodes is: When one more core network node is added to the pool area, the pool area is better served by the core network nodes. That is, when a core network node fails, other core network nodes may provide services instead.
  • a pool area may include diverse core network nodes, for example, Mobile Switching Center (MSC) pool, Serving General Packet Radio Service Supporting Node (SGSN) pool, and so on.
  • FIG. 1 shows a schematic diagram of an MSC pool.
  • the embodiments of the present invention provide a method, a node device, and a communication system for device pool management to prevent loss of service data on a node device and improve network reliability.
  • the embodiments of the present invention provide a method, a node device, and a communication system for device pool management.
  • Each node device is concatenated with an ancestor node device and a descendant node device and forms a relation with the ancestor node device and the descendant node device, forming a Pool-style autonomous loop.
  • Any node device in the autonomous loop stores backup of the data required by an ancestor node device of the node device, stores the load state information of an ancestor node device and a descendant node device, sends the data to be backed up to a descendant node device, and sends the load state information of the node device to a ancestor node device and a descendant node device.
  • FIG. 1 is a flow chart of a device pool management method provided in Embodiment 1 of the present invention. The method includes the following steps:
  • S101 Obtain autonomous loop configuration data from a network management unit (such as network server), where the autonomous loop configuration data describes relations between a node device and its ancestor node device and between the node device and its descendant node device in an autonomous loop by using identifiers of node devices in the autonomous loop.
  • a network management unit such as network server
  • S102 Set up a backup relation between each node device and its ancestor node device, and a backup relation between each node device and its descendant node device according to the autonomous loop configuration data. Specifically, obtain the IP address of the ancestor node device and the IP address of the descendant node device according to the autonomous loop configuration data; set up a control channel between the node device and the ancestor node device, or a control channel between the node device and the descendant node device through a Point-to-Point (P2P) interface; and set up a service channel between the node device and the ancestor node device, and a service channel between the node device and the descendant node device through the control channel. Transmit the control signaling through the control channel, and transmit the service-related data such as backup data and load state information through the service channel.
  • P2P Point-to-Point
  • S103 Receive and store the backup data sent by the ancestor node device, and send the data of the node device to be backed up to the descendant node device.
  • the data to be backed up includes user information, connection information of upstream and downstream service nodes, or service bearer contexts.
  • the method may further include the following steps:
  • S104 When the ancestor node device disengages from the autonomous loop, update the autonomous loop configuration data, and trigger an operation of allocating resources required for running services of the ancestor node device according to the backup data sent by the ancestor node device, taking over the services of the ancestor node device and preventing service interruption of the ancestor node device.
  • the identifier of each node device is unique in the autonomous loop.
  • Embodiment 1 uses an example with reference to FIG. 2 :
  • a second Mobility Management Entity (MME) 202 obtains the autonomous loop configuration data from the network management unit 207.
  • the configuration data indicates that an ancestor node device is a first MME 201 and a descendant node device is a third MME 203, and indicates the IP addresses of the first MME 201 and the third MME 203.
  • the second MME 202 sets up a pool-P2P communication connection to the ancestor node device according to the IP address of the ancestor node device. Specifically, the second MME 202 sends a pool-P2P interface message such as P2P_Connect_Req to the first MME 201 according to the IP address of the ancestor node device.
  • the pool-P2P interface message carries the following information: (1) connection type which is the same as that of the descendant node device; (2) control channel identifier allocated by the second MME 202 to the pool-P2P communication connection; and (3) data channel identifier allocated by the second MME 202 to the pool-P2P communication connection.
  • the first MME 201 returns a P2P_Connect_Rsp message to the second MME 202.
  • the P2P_Connect_Rsp message carries the control channel identifier and the data channel identifier of the P2P connection allocated by the first MME 201. If the first MME 201 refuses to set up the P2P connection, the message carries a failure cause. In this instance, if a GPRS Tunneling Protocol (GTP) is applied between the MMEs, the control channel identifier and the data channel identifier are in the form of Tunnel Endpoint Identifier (TEID).
  • GTP GPRS Tunneling Protocol
  • the second MME 202 sets up a pool-P2P communication connection to the descendant node device in the same way as setting the pool P2P communication connection to the ancestor node device.
  • the second MME 202 receives the backup data from the MME 201 through the pool-P2P communication connection to the ancestor node device, and obtains management parameters of the autonomous loop.
  • the management parameters of the autonomous loop include IP addresses of all node devices in the autonomous loop and the arrangement relation between the node devices: 201-202-203-204-205-206-201.
  • the second MME 202 sends the service contexts (including mobility context and session context) active on the second MME 202 to the third MME 203 for backup.
  • the message that carries the service contexts is Pool_Data_Backup, and the parameter 1 carried in the message is: "number of contexts to be backed up", and the parameter 2 carried in the message is "list of contexts to be backed up". Each context to be backed up in the list includes the parameter entries to be updated and the update mode (such as add, delete, and modify).
  • the upstream service node of the second MME 202 is an evolved NodeB (eNB) 208, and the downstream service node of the second MME 202 is a Serving Gateway (SGW) 209.
  • eNB evolved NodeB
  • SGW Serving Gateway
  • the second MME 202 takes over the upstream and downstream services of the first MME 201 according to the backup data which is received by the second MME202 from the first MME 201.
  • the second MME 202 knows that the ancestor node device of the first MME 201 is a sixth MME 206. Therefore, the second MME 202 sets up a new ancestor relation with the sixth MME 206, and receives and stores the service contexts which are active on the sixth MME 206.
  • the second MME 202 stops sending service contexts to the third MME 203.
  • the second MME 202 knows that the descendant node device of the third MME 203 is a fourth MME 204. Therefore, the second MME 202 sets up a P2P interface and a backup relation with the fourth MME 204, and sends service contexts to the fourth MME 204 through the P2P interface according to the backup relation, where the service contexts include the service contexts previously sent to the third MME 203.
  • a backup relation is set up between a node device and the ancestor node device, and between the node device and the descendant node device in the autonomous loop. Therefore, when some node devices in the autonomous loop fail or abort the service, other node devices take over online services in real time.
  • the takeover of the online services includes these steps: (1) The upstream and downstream service nodes detect a fault of the node device on the autonomous loop; (2) the upstream and downstream service nodes modify the service path, and send services destined for the faulty node device to a backup node device of the faulty node device; and (3) after receiving the services from the upstream and downstream service nodes, the backup node device activates the corresponding backup data, and processes the services in the same way of processing local services. In this way, the service continuity is ensured, and the network reliability is improved.
  • Scenario 1 A new node device joins the pool area.
  • FIG. 3 is a flow chart of a device pool management method provided in Embodiment 2 of the present invention. The method includes the following steps:
  • Anode device in a Pool-style autonomous loop receives configuration data sent by a network management unit.
  • S302 The node device in the Pool-style autonomous loop is started up and configured according to the configuration data received from the network management unit.
  • P2P_Connect_Req pool_P2P connection request
  • N6 notifies N5 and N1 to modify the "descendant" and the "ancestor” to N6 respectively.
  • S303 The node device in the Pool-style autonomous loop receives and stores backup data sent by an ancestor node device. For example, N5 modifies "descendant" to N6 and then starts real-time backup so that important data is backed up to N6.
  • S304 The node device in the Pool-style autonomous loop sends data of itself to be backed up to a descendant node device.
  • N1 modifies "ancestor" to N6 and then stops receiving backup data from N5, but starts receiving backup data from N6.
  • the node device in the Pool-style autonomous loop reads the load state of the ancestor node device and the descendant node device in the local database or the global variables of resource monitoring.
  • the load state includes "CPU load” and "user quantity”.
  • the node device Through the control channel of the pool_P2P interface, the node device sends a message to the ancestor node device and the descendant node device periodically, where the message carries a load state name "P2P_Load_Info" of the node device and parameters "load type” and "load state value”.
  • Scenario 2 load balance at the time of accessing a service.
  • FIG. 4 is a flow chart of a device pool management method provided in Embodiment 3 of the present invention. The method includes the following steps:
  • a node device in a Pool-style autonomous loop receives a service request from a downstream service node.
  • a node device N2 in a pool area receives a service request from a downstream service node A1, where N2 is a node device closest to Al or a node device predetermined by the network management unit.
  • S402 The node device in the Pool-style autonomous loop detects the load state of itself, the load state of the ancestor node device, and the load state of the descendant node device.
  • S403 The node device in the Pool-style autonomous loop processes services together with the downstream service node if determining that the load of itself is the lightest.
  • S404 The node device in the Pool-style autonomous loop forwards the service request to the ancestor node device if determining that the load of the ancestor node device is the lightest.
  • S405 The node device in the Pool-style autonomous loop forwards the service request to the descendant node device if determining that the load of the descendant node device is the lightest.
  • N2 detects the load state of itself, load state of the ancestor N1, and load state of the descendant N3, selects the lightest-loaded node device (such as N3), and forwards the service request to the lightest-loaded node device.
  • N3 detects the load state of itself, load state of the ancestor, and load state of the descendant. If finding a node device (for example, N4) whose load is even lighter, N3 forwards the service request to N4.
  • the service request is forwarded to the node device whose load is the lightest in the whole autonomous loop.
  • N4 detects the load state of itself, load state of the ancestor, and load state of the descendant. If finding that the load of itself is the lightest, N4 works together with the initiator A1 to process services normally.
  • each node device needs to grasp the load state of adj acent node devices, and forward services to the node device whose load is the lightest in the pool in a relay mode, accomplishing load balance in the pool area. Because the load state of the node device is sent to an ancestor node device and a descendant node device without being broadcast in the pool area, the bandwidth resources are conserved.
  • Scenario 3 real-time backup of services.
  • FIG. 5 is a flow chart of a device pool management method provided in Embodiment 4 of the present invention. The method includes the following steps:
  • a node device in the Pool-style autonomous loop sends the data of itself to be backed up to a descendant node device for backup.
  • N2 sends user information, upstream and downstream service node connection information, service bearer contexts, and other important service-related information to the descendant node device N3 for backup in real time.
  • the message that carries the service contexts is Pool_Data_Backup, and the parameters carried in the message are: "number of contexts to be backed up", and "list of contexts to be backed up”. Each context to be backed up in the list includes the parameter entries to be updated and the update mode (such as add, delete, and modify).
  • the node device in the Pool-style autonomous loop receives a request for detecting backup data synchronicity from the descendant node device periodically, and detects synchronicity of the data already backed up. For example, N2 receives the request for detecting backup data synchronicity from N3 periodically, so as to ensure consistency of backup information.
  • N2 When the capacity of N3 is not sufficient for storing all backup data of N2, some of the backup data of N2 may be sent to the descendant node device of N3 (namely, N4) for storage.
  • N4 To keep the single-link structure of the autonomous loop, N2 and N4 are required to be invisible to each other. That is, N2 does not care whether the backup on N3 is stored locally or remotely, and N4 considers that all backup data comes from N3 solely.
  • the data of N2 that needs to be backed up to N4 is checked and forwarded by N3.
  • the upstream and downstream service nodes consider that a "hot backup" relation exists between the serving node device of the current service and the descendant node device of the serving node device.
  • Two active links are connected to the serving node device of the current service and the descendant node device respectively.
  • the service data is backed up once in the pool, but not backed up on all node devices repeatedly, and the seamless switching capability of hot backup and the flexibility of selecting the access point are ensured.
  • Scenario 4 A node device quits the service initiatively.
  • FIG. 6 is a flow chart of a device pool management method provided in Embodiment 5 of the present invention. The method includes the following steps:
  • S601 Anode device in the Pool-style autonomous loop receives an active quit command sent by a network management unit.
  • the active quit may be caused by upgrade, increase or decrease of capacity, or isolated repair.
  • the node device in the Pool-style autonomous loop triggers the ancestor node device and the descendant node device to modify the relations between a node device and its ancestor node device and between the node device and its descendant node device in the autonomous loop.
  • N2 sends a Pool_P2P disconnection request to N3 and N1, and sends a Pool_P2P disconnection request to the descendant node device.
  • the request indicates that N2 is about to quit the service, and requires N3 and N1 to modify relations between a node device and its ancestor node device and between the node device and its descendant node device.
  • N3 After receiving the request from N2, N3 starts an operation of taking over services of N2, and allocates the resources required for running the services of N2. Meanwhile, upon receiving the request from N2, N1 stops sending backup data to N2, starts setting up the relation originally with its ancestor node device and descendant node device with N3, and sets up a backup relation.
  • S603 The node device in the Pool-style autonomous loop triggers the upstream service node and the downstream service node connected with the node device and located outside the autonomous loop to switch services over to the descendant node device.
  • N2 sends a message to the upstream service node and the downstream service node as an instruction of switching services over to the descendant node device N3.
  • N3 may initiate a load migration procedure so that the part beyond the capacity is transferred to the descendant node device (or the node device whose load is lighter).
  • the quit of a node device leads to a short period of load imbalance in the pool area, and makes the adjacent node device bear greater load.
  • the surplus load is migrated to remote node devices along the autonomous loop, and the load will be balanced again in the pool area.
  • the autonomous loop updates management parameters, for example, decreases the node device quantity of the autonomous loop by 1, and changes the order between node devices in the autonomous loop.
  • the quit of any node device does not lead to interruption of services running on this node device.
  • the load of the node device that has quit the autonomous loop is transferred to other node devices along the autonomous loop, and the balance in the pool area is balanced again.
  • Scenario 5 A node device quits the service passively.
  • FIG. 7 is a flow chart of a device pool management method provided in Embodiment 6 of the present invention. The method includes the following steps:
  • a node device in the Pool-style autonomous loop detects the service connection state of an ancestor node device of the node device.
  • the node device in the Pool-style autonomous loop After detecting that the ancestor node device quits the service passively, the node device in the Pool-style autonomous loop allocates resources required for running services of the ancestor node device, and sets up a new ancestor relation according to the stored autonomous loop information before entering step S704. For example, if N3 receives no data from N2 or receives no response to the data sent to N2 within a preset period, N3 considers that N2 has quit the service passively, and starts an operation of taking over services of N2 and allocates the resources required for running the services of N2.
  • the node device in the Pool-style autonomous loop receives a service request from the upstream service node and the downstream service node that perform service interaction with the ancestor node device.
  • the upstream service node and the downstream service node have service connections with the node device on the autonomous loop and can perform uplink and downlink service transmission.
  • the upstream service node of the MME is an eNB
  • the downstream service node of the MME is an SGW.
  • S704 The node device in the Pool-style autonomous loop detects the service connection state of the ancestor node device of the node device.
  • the node device N3 should reserve sufficient capacity for taking over the services of N2 so as to ensure that the services are not interrupted when N2 fails. If the processing resources of N3 become deficient for such reasons, N3 may take over the services and then migrate the services to other node devices. , If N3 is overloaded when taking over the services of N2, N3 may initiate a load migration procedure so that the part beyond the capacity is transferred to the descendant node device (or the node device whose load is lighter).
  • the autonomous loop updates management parameters, for example, decreases the node device quantity on the autonomous loop by 1, and changes the relations between each node device and its ancestor node device and descendant node device in the autonomous loop.
  • a fault of a node device can be detected by the upstream node, the downstream node, and the adjacent node devices in the autonomous loop simultaneously, and the fault triggers the service switching immediately.
  • a predetermined backup relation exists between a node device in the autonomous loop and the descendant node device. Therefore, the upstream service node and the downstream service node can switch the services over to the descendant node device correctly, and the services are recovered quickly.
  • Scenario 6 overload control.
  • FIG. 8 is a flow chart of a device pool management method provided in Embodiment 7 of the present invention. The method includes the following steps:
  • a node device in a Pool-style autonomous loop receives a service migration request from an ancestor node device.
  • the ancestor node device clears the services which have been migrated out.
  • the network management unit when planning the pool, configures the backup relations between the node devices in the autonomous loop according to the capacity or processing capability of each node device in the autonomous loop and the node devices adjacent to this node device.
  • the overload pressure is shared by all node devices in the pool area under the overload control, reducing services discarded for the purpose of traffic control.
  • the storage medium may be a magnetic disk, CD-ROM, Read-Only Memory (ROM), or Random Access Memory (RAM).
  • FIG. 9 shows a schematic diagram of a node device provided in Embodiment 8 of the present invention.
  • the node device includes:
  • the identifier of each node device is unique in the autonomous loop, and the node device further includes:
  • the backup unit 902 stores the backup data of the ancestor node device according to the autonomous loop configuration data, and the first sending unit 903 sends the data of the node device to be backed up to the descendant node device. Therefore, when the ancestor node device in the autonomous loop fails and needs to disengage from the autonomous loop, the triggering unit 904 allocates the resources required for running the corresponding services to prevent service interruption.
  • the second sending unit 905 sends the data to be backed up to the newly determined descendant node device so that the newly determined descendant node device is capable of taking over services of the node device disengaged from the autonomous loop.
  • the node device in this embodiment may further include:
  • the obtaining unit in this embodiment is a first obtaining unit, which is configured to obtain configuration data indicative of changes of the ancestor node device, for example, obtain the configuration data of N2 if the ancestor node device changes from N3 to N2; and, accordingly, the backup unit is an updated data backup unit, which is configured to receive and store the backup data sent by a changed ancestor node device.
  • the obtaining unit in this embodiment is a second obtaining unit, which is configured to obtain configuration data indicative of changes of the descendant node device; and, accordingly, the backup unit is an updated data sending unit, which is configured to send the data of the node device to be backed up to the updated descendant node device.
  • the node device in this embodiment further includes:
  • the node device in this embodiment further includes:
  • the node device in this embodiment further includes:
  • the node device in this embodiment further includes:
  • the node device in this embodiment further includes:
  • FIG. 10 shows a communication system provided in Embodiment 17 of the present invention.
  • the communication system in this embodiment includes a network management unit 1001, and an autonomous loop 1002 including a plurality of node devices.
  • the autonomous loop 1002 is a closed loop, and each node device has an identifier in the autonomous loop.
  • the network management unit 1001 is configured to send autonomous loop configuration data to each node device in the autonomous loop, where the autonomous loop configuration data describes relations between a node device and its ancestor node device and between the node device and its descendant node device in the autonomous loop by using identifiers of node devices in the autonomous loop.
  • the configuration data includes: an identifier of the node device in the pool area, sequence numbers of the ancestor node device and the descendant node device in the autonomous loop, load bearing capacities of the node device, the ancestor node device, and the descendant node device, and management parameters of the autonomous loop.
  • the node device is configured to: obtain the autonomous loop configuration data which describes relations between a node device and its ancestor node device and between the node device and its descendant node device in the autonomous loop by using identifiers of node devices in the autonomous loop; set up a backup relation between the node device and an ancestor node device as well as a backup relation between the node device and a descendant node device according to the autonomous loop configuration data, receive and store backup data sent by the ancestor node device, and send data of itself to be backed up to the descendant node device.
  • the identifier of each node device is unique in the autonomous loop.
  • the system further includes:
  • the node device in this embodiment is the node device described in Embodiment 9.
  • the node device in this embodiment is the node device described in Embodiment 10.
  • the node device in this embodiment is the node device described in Embodiment 11.
  • the node device in this embodiment is the node device described in Embodiment 12.
  • the node device in this embodiment is the node device described in Embodiment 13.
  • the node device in this embodiment is the node device described in Embodiment 14.
  • the network management unit in this embodiment further includes: a quit command sending unit, configured to send an active quit command to the node device.
  • the node device in this embodiment is the node device described in Embodiment 15.
  • the node device in this embodiment is the node device described in Embodiment 16.
  • SAE System Architecture Evolution
  • WiMAX Worldwide Interoperability for Microwave Access
  • UMTS Universal Mobile Telecommunications System
  • a Pool-style autonomous loop is set up between the node devices; relations between a node device and its ancestor node device and descendant node device, a data backup relation, and a load adjustment relation are configured between the node devices in the autonomous loop; when a node device fails, the services of the faulty node device can be switched over to other node devices in time, preventing service loss; the load can be balanced between node devices, which improves network reliability and the autonomous capability of the network.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)
EP09823020.4A 2008-10-27 2009-08-11 Procédé de gestion de groupes d'équipements, équipement de noeud et système de communication Active EP2346215B1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN200810171221.XA CN101729277B (zh) 2008-10-27 2008-10-27 设备池的管理方法、节点设备和通信系统
PCT/CN2009/073185 WO2010048828A1 (fr) 2008-10-27 2009-08-11 Procédé de gestion de groupes d'équipements, équipement de nœud et système de communication

Publications (3)

Publication Number Publication Date
EP2346215A1 true EP2346215A1 (fr) 2011-07-20
EP2346215A4 EP2346215A4 (fr) 2011-11-23
EP2346215B1 EP2346215B1 (fr) 2013-05-01

Family

ID=42128226

Family Applications (1)

Application Number Title Priority Date Filing Date
EP09823020.4A Active EP2346215B1 (fr) 2008-10-27 2009-08-11 Procédé de gestion de groupes d'équipements, équipement de noeud et système de communication

Country Status (4)

Country Link
US (1) US8780724B2 (fr)
EP (1) EP2346215B1 (fr)
CN (1) CN101729277B (fr)
WO (1) WO2010048828A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3086509A4 (fr) * 2013-12-19 2016-10-26 Zte Corp Procédé, dispositif et système de traitement de défaillance pour noeud de service de réseau
WO2017065654A1 (fr) * 2015-10-14 2017-04-20 Telefonaktiebolaget Lm Ericsson (Publ) Procédé et première entité de réseau permettant de traiter des informations de contexte de plan de commande

Families Citing this family (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8086734B2 (en) 2009-08-26 2011-12-27 International Business Machines Corporation Method of autonomic representative selection in local area networks
US8375245B2 (en) * 2010-07-15 2013-02-12 Verizon Patent And Licensing Inc. Mobility management entity failover
CN102739762B (zh) * 2011-04-08 2017-03-29 中兴通讯股份有限公司 一种对等网络节点过负荷过程中数据迁移的方法及系统
CN102739711B (zh) * 2011-04-08 2017-10-17 中兴通讯股份有限公司 一种对等网络中控制过负荷的方法及系统
CN103095744B (zh) * 2011-10-28 2016-05-25 中国移动通信集团公司 对等网络节点降级方法及系统、对等网络节点
WO2013060221A1 (fr) * 2011-10-28 2013-05-02 中国移动通信集团公司 Procédé d'addition de nœuds pour système p2p, système p2p correspondant, procédé et système de rétrogradation de nœuds d'un réseau homologue, et nœud de réseau homologue
US8908603B2 (en) * 2012-01-24 2014-12-09 Telefonaktiebolaget L M Ericsson (Publ) MME restoration
EP2830344A4 (fr) 2012-03-23 2016-03-23 Kyocera Corp Procédé de commande de communication
US9344938B1 (en) * 2013-08-09 2016-05-17 Sprint Spectrum L.P. Network controller management of UE context records
CN103533047B (zh) * 2013-10-12 2017-07-14 华为技术有限公司 用于升级数据离散备份系统的方法和设备
CN106332222A (zh) * 2015-07-02 2017-01-11 北京三星通信技术研究有限公司 一种网络选择的方法和基站
CN106817239B (zh) * 2015-11-30 2020-01-31 华为软件技术有限公司 一种站点切换的方法、相关装置及系统
US11564277B2 (en) * 2018-08-16 2023-01-24 Lg Electronics Inc. Method and apparatus for supporting early data transmission in inactive state in wireless communication system
CN111404647B (zh) * 2019-01-02 2023-11-28 中兴通讯股份有限公司 一种节点协同关系的控制方法及相关设备
CN110413453A (zh) * 2019-07-31 2019-11-05 珠海格力电器股份有限公司 多终端数据备份和恢复方法、装置

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070270984A1 (en) * 2004-10-15 2007-11-22 Norbert Lobig Method and Device for Redundancy Control of Electrical Devices
EP1876788A1 (fr) * 2006-07-07 2008-01-09 Alcatel Lucent Mécanisme distribué de hashing pour réseau auto -organisant

Family Cites Families (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1453250A1 (fr) * 2003-02-28 2004-09-01 Siemens Aktiengesellschaft Procédé pour une réaction rapide à une rupture de connection entre deux domaines de routage
US20050007954A1 (en) * 2003-07-11 2005-01-13 Nokia Corporation Network device and method for categorizing packet data flows and loading balancing for packet data flows
TWI244286B (en) * 2004-01-13 2005-11-21 Ind Tech Res Inst Method for MPLS link protection
US7420989B2 (en) * 2004-09-30 2008-09-02 Lucent Technologies Inc. Technique for identifying backup path for shared mesh protection
US20060165009A1 (en) * 2005-01-25 2006-07-27 Zvolve Systems and methods for traffic management between autonomous systems in the Internet
US7817539B2 (en) * 2005-05-17 2010-10-19 Resiliens As Resilient routing systems and methods
CN100421494C (zh) 2005-06-13 2008-09-24 上海华为技术有限公司 一种接入网设备的数据配置方法
CN100574334C (zh) 2005-09-09 2009-12-23 华为技术有限公司 Ppp接入终端实现自动业务发放的方法
US7852772B2 (en) * 2005-10-20 2010-12-14 Cisco Technology, Inc. Method of implementing a backup path in an autonomous system
CN100442712C (zh) 2005-12-13 2008-12-10 华为技术有限公司 一种实现网络终端设备配置自动更新的方法及系统
CN101132326B (zh) 2006-08-24 2010-05-12 华为技术有限公司 一种自动配置的方法及系统及设备
CN101179815B (zh) * 2007-12-12 2010-09-08 华为技术有限公司 移动交换中心池故障处理方法、装置及系统
CN101183984B (zh) * 2007-12-14 2011-11-09 华为技术有限公司 网管系统、管理方法及设备

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070270984A1 (en) * 2004-10-15 2007-11-22 Norbert Lobig Method and Device for Redundancy Control of Electrical Devices
EP1876788A1 (fr) * 2006-07-07 2008-01-09 Alcatel Lucent Mécanisme distribué de hashing pour réseau auto -organisant

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
See also references of WO2010048828A1 *
SIEMENS: "Proposed Pool Area Definition", 3GPP DRAFT; R3-061543, 3RD GENERATION PARTNERSHIP PROJECT (3GPP), MOBILE COMPETENCE CENTRE ; 650, ROUTE DES LUCIOLES ; F-06921 SOPHIA-ANTIPOLIS CEDEX ; FRANCE, vol. RAN WG3, no. Seoul, Korea; 20061005, 5 October 2006 (2006-10-05), XP050160428, [retrieved on 2006-10-05] *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3086509A4 (fr) * 2013-12-19 2016-10-26 Zte Corp Procédé, dispositif et système de traitement de défaillance pour noeud de service de réseau
WO2017065654A1 (fr) * 2015-10-14 2017-04-20 Telefonaktiebolaget Lm Ericsson (Publ) Procédé et première entité de réseau permettant de traiter des informations de contexte de plan de commande
US10757589B2 (en) 2015-10-14 2020-08-25 Telefonaktiebolaget L M Ericsson (Publ) Method and a first network entity for handling control plane context information

Also Published As

Publication number Publication date
US8780724B2 (en) 2014-07-15
EP2346215B1 (fr) 2013-05-01
EP2346215A4 (fr) 2011-11-23
US20110205900A1 (en) 2011-08-25
CN101729277B (zh) 2015-07-08
WO2010048828A1 (fr) 2010-05-06
CN101729277A (zh) 2010-06-09

Similar Documents

Publication Publication Date Title
US8780724B2 (en) Method, node device, and communication system for device pool management
US9407498B2 (en) Mobile gateways in pool for session resilience
JP6896850B2 (ja) セッション管理のためのシステムおよび方法
US9883436B2 (en) Method and apparatus for performing mobile handover based on an indication flag
JP6007974B2 (ja) 通信システム及び経路制御方法
KR101523457B1 (ko) 지오-리던던트 게이트에서 세션 복원을 위한 시스템 및 방법
US20190166634A1 (en) Communication control method, and related network element
CN112703773A (zh) 用于集成接入和回程中由于无线电链路故障而经由另选路由进行连接重建的系统、设备和方法
WO2014183715A1 (fr) Procédé de notification d'informations de mise à jour de passerelle, et contrôleur
WO2008134962A1 (fr) Procédé de synchronisation, procédé de transfert de communication, réseau et nœud radio
JP2021524689A (ja) 通信方法及び通信装置
CN108282827B (zh) 用于网络间互操作的方法、节点及设备
JP2017509222A (ja) モビリティアンカのモビリティ
US20230042390A1 (en) Tunnel initiation in a communications network
US20230114614A1 (en) Relay apparatus, communication apparatus, control method, and computer-readable storage medium for streamlining processing for changing connection destination of relay apparatus
US20230114768A1 (en) Relay apparatus, base station apparatus, control method, and computer-readable storage medium for streamlining processing for changing connection destination of relay apparatus
EP2574104A1 (fr) Procédé, dispositif et système de commutation de chemins de communication
Htike et al. Enhancing service resiliency in the next generation EPC system
CN111970729A (zh) 信息处理方法
CN113766584A (zh) 辅节点小区变更处理方法及装置

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20110505

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO SE SI SK SM TR

AX Request for extension of the european patent

Extension state: AL BA RS

A4 Supplementary search report drawn up and despatched

Effective date: 20111020

RIC1 Information provided on ipc code assigned before grant

Ipc: H04L 12/24 20060101ALI20111015BHEP

Ipc: H04L 12/437 20060101AFI20111015BHEP

DAX Request for extension of the european patent (deleted)
GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

AK Designated contracting states

Kind code of ref document: B1

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 610500

Country of ref document: AT

Kind code of ref document: T

Effective date: 20130515

Ref country code: CH

Ref legal event code: EP

REG Reference to a national code

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602009015500

Country of ref document: DE

Effective date: 20130704

REG Reference to a national code

Ref country code: NL

Ref legal event code: T3

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130902

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130801

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130901

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130802

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130812

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130801

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

Ref country code: BE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

26N No opposition filed

Effective date: 20140204

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20130831

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20130831

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602009015500

Country of ref document: DE

Effective date: 20140204

REG Reference to a national code

Ref country code: IE

Ref legal event code: MM4A

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20130811

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: HU

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT; INVALID AB INITIO

Effective date: 20090811

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20130811

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20130501

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 8

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 9

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 10

REG Reference to a national code

Ref country code: FR

Ref legal event code: PLFP

Year of fee payment: 14

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: AT

Payment date: 20220725

Year of fee payment: 14

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: NL

Payment date: 20230719

Year of fee payment: 15

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20230629

Year of fee payment: 15

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20230703

Year of fee payment: 15

Ref country code: DE

Payment date: 20230703

Year of fee payment: 15

REG Reference to a national code

Ref country code: AT

Ref legal event code: MM01

Ref document number: 610500

Country of ref document: AT

Kind code of ref document: T

Effective date: 20230811

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20230811

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AT

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20230811