WO2013053252A1 - Method and apparatus for processing network overload - Google Patents

Method and apparatus for processing network overload Download PDF

Info

Publication number
WO2013053252A1
WO2013053252A1 PCT/CN2012/078513 CN2012078513W WO2013053252A1 WO 2013053252 A1 WO2013053252 A1 WO 2013053252A1 CN 2012078513 W CN2012078513 W CN 2012078513W WO 2013053252 A1 WO2013053252 A1 WO 2013053252A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
request message
message
standby
standby node
Prior art date
Application number
PCT/CN2012/078513
Other languages
French (fr)
Chinese (zh)
Inventor
陈志峰
Original Assignee
中兴通讯股份有限公司
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 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2013053252A1 publication Critical patent/WO2013053252A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/12Avoiding congestion; Recovering from congestion
    • H04L47/122Avoiding congestion; Recovering from congestion by diverting traffic away from congested entities

Definitions

  • the present invention relates to the field of communications, and in particular to a method and apparatus for processing network overload.
  • P2P Peer-to-Peer
  • SIP Session Initiation Protocol
  • FIG. 1 is a schematic diagram of a P2P overlay network architecture according to the related art. As shown in Figure 1, the P2P overlay network 11 and P2P are included. The node 12, the non-P2P terminal device 13, the P2P terminal device 14, and the access node 15 in the overlay network 11 are described in detail below.
  • the P2P overlay network 11 is a logical network composed of various types of peers (also referred to as nodes in the present invention) that are responsible for different tasks.
  • the node 12 in the P2P overlay network 11 is the basic component of the P2P overlay network 11, and is capable of giving the same
  • the non-P2P terminal device 13 accesses the P2P overlay network, but does not support any P2P protocol, and only supports the SIP protocol.
  • the P2P terminal device 14 is connected to the P2P overlay network, and supports both the P2P protocol and the SIP protocol. Considering that the general terminal device, especially the handheld terminal device, has weak capabilities, in many cases, the P2P terminal is actually deployed. The device is only used as a P2P client to access the P2P overlay network, and is not used as a server for storage and transmission.
  • the access node 15 is an access node of a terminal device such as a non-P2P terminal device 13, a P2P terminal device 14, etc., and in consideration of the needs of telecommunication operations, both the P2P terminal and the non-P2P terminal must access the P2P overlay through the nearest access node.
  • the access node when the access node acts as an access node of a non-P2P terminal, and simultaneously acts as a proxy node, it is responsible for completing the conversion of the protocol adopted by the non-P2P terminal and the protocol used by the P2P overlay network internal routing SIP, and when the node When acting as an access node of a P2P terminal, only the message needs to be relayed.
  • each node can store data and process data. Since each node stores different processed data, the load level at the same time is also different. Of course, some good load balancing algorithms are in specific conditions. Under the normal low load condition, the load degree between different nodes in the same overlay network is basically the same.
  • Step S202 The terminal sends a SIP request message to the P2P overlay network, and the SIP message is forwarded by the transit node.
  • Step S204 the transit node finds the responsible node of the SIP request, and forwards the SIP message to the responsible node.
  • Step S206 the responsible node has a high current load level and cannot process a new SIP request, and then rejects the processing of the current message.
  • Step S208 the responsible node returns a 3xx, 486 or 5xx message according to the current configuration, and rejects the current call.
  • Step S210 The transit node forwards the response message to the terminal, indicating that the current request processing fails, and the terminal further performs processing according to the response message returned by the overlay network.
  • the IETF is also studying the overload of SIP servers, and the result is called SOC (SIP Load Control).
  • FIG. 1 SIP Load Control
  • Step 3 is a flowchart of a process for overloading a node in another P2P overlay network according to the related art. If a node in the P2P overlay network supports the SOC, the process specifically includes steps S302 to S314. Step S302, the terminal sends a SIP request message to the P2P overlay network, and the SIP message is forwarded by the transit node. Step S304, the transit node supports the SOC, and when the SIP message is forwarded, the support SOC header field is added to the SIP message, and the supported SOC algorithm is carried.
  • Step S306 after receiving the message, the node is found to be in an overload state, replying to the SIP response message, adding a responsible node busy indication in the response message, and indicating an algorithm used after the overload, and an expiration date of the overload processing.
  • Step S308 the transit node forwards the response message.
  • Step S310 when the subsequent message arrives at the transit node, the transit node finds that the responsible node of the message is still at the overload node.
  • step S312 the transit node discards or forwards the message according to the previously negotiated overload algorithm.
  • the overload algorithm is not part of the discussion of the present invention and will not be described in detail herein.
  • Step S314 if the transit node selects the forwarding request in step S306, the subsequent response request will also be forwarded by the transit node.
  • the above solution is to apply the overload method to the P2P network in the client/server model (C/S) network architecture.
  • C/S client/server model
  • the P2P network and the C/S architecture are obviously different: P2P network When a single node is overloaded, it does not mean that the entire P2P network is overloaded. There are other nodes and even most of the nodes have processing power. Therefore, these processing methods will cause session loss and low processing capability.
  • a method for processing a network overload including: receiving, by a node, a request message from a terminal or a node; determining that the request message cannot be processed; and instructing the standby node to process the request message.
  • the responsible node receiving the request message from the terminal or the node comprises: the responsible node receiving the request message sent by the terminal or the node and forwarding via the transit node.
  • indicating that the standby node processes the request message includes: adding an identifier in the request message, where the identifier is used to indicate a standby node processing request message, where the identifier includes one of the following: a busy identifier for indicating that the responsible node is busy, used for A temporary resource or host identifier indicating that the standby node temporarily processes the request message; forwarding the request message after adding the identifier to the standby node.
  • the method further includes: the responsible node receiving the request response from the standby node; and forwarding the request response to the terminal or the node.
  • the method further includes: the standby node determines that the request message cannot be processed; and the standby node instructs the next standby node to process the request message.
  • the method further includes: the standby node receiving the request response from the next standby node; and the standby node forwarding the request response to the terminal or the node by the responsible node.
  • the method further includes: when the request response includes the forced routing information, for the INVITE request message in the subsequent session to be sent, the terminal or the node directly sends the standby message to the standby node. node.
  • the method further includes: when the standby node maintains the user registration relationship, for the subsequent REGISTER request message to be sent, the terminal or the node is directly sent to the standby node across the responsible node.
  • the method further includes: the standby node processing the request message.
  • the method further includes: performing, between the responsible node and the standby node, a data update corresponding to the request message.
  • the method further includes: the responsible node determining the recovery processing capability; and performing, between the responsible node and the standby node, the data update corresponding to the request message.
  • a network overload processing apparatus comprising: a receiving module configured to receive a request message from a terminal or a node; a determining module configured to determine that the request message cannot be processed; and an indication module configured to Instruct the alternate node to process the request message.
  • the invention solves the problem that the processing capability of the P2P overlay network cannot be fully utilized in the telecommunication network in the related art by using the scheme that the standby node processes the new request when the responsible node is busy, thereby achieving the problem in the telecommunication network. Make full use of the processing power of the P2P overlay network.
  • FIG. 1 is a schematic diagram of a P2P overlay network architecture according to the related art
  • 2 is a flowchart of processing of node overload in a P2P overlay network according to the related art
  • FIG. 3 is a flowchart of processing of node overload in another P2P overlay network according to the related art
  • FIG. 4 is a network overload according to an embodiment of the present invention.
  • FIG. 5 is a flowchart of general message processing according to an embodiment of the present invention
  • FIG. 6 is a flow chart of INVITE and subsequent message processing according to an embodiment of the present invention
  • FIG. 7 is a REGISTER according to an embodiment of the present invention
  • FIG. 8 is a flowchart of another REGISTER and subsequent message processing according to an embodiment of the present invention;
  • FIG. 5 is a flowchart of general message processing according to an embodiment of the present invention
  • FIG. 6 is a flow chart of INVITE and subsequent message processing according to an embodiment of the present invention
  • FIG. 7 is a REGI
  • FIG. 9 is a flowchart of processing for actively synchronizing data of a node according to an embodiment of the present invention
  • FIG. 11 is a structural block diagram of a processing device for network overload according to an embodiment of the present invention.
  • BEST MODE FOR CARRYING OUT THE INVENTION Hereinafter, the present invention will be described in detail with reference to the accompanying drawings. It should be noted that, in the case where no conflict occurs, the features in the embodiments and the embodiments in the present application can be combined with each other.
  • FIG. 4 is a flowchart of a method for processing network overload according to an embodiment of the present invention. As shown in FIG. 4, the following steps S402 to S406 are included. Step S402, the responsible node receives the request message from the terminal or the node.
  • Step S404 determining that the request message cannot be processed.
  • Step S406 instructing the standby node to process the request message.
  • the network overload processing method causes session loss and low processing capability.
  • the busy node in the network can forward the request message to be processed to other nodes with processing capability, thereby reducing session loss and making full use of the characteristics and processing capability of the P2P overlay network.
  • the responsible node receiving the request message from the terminal or the node comprises: the responsible node receiving the request message sent by the terminal or the node and forwarding via the transit node. The transmission of the message in this embodiment is transited through the transit node, so that the request message can be stably and reliably transmitted.
  • indicating that the standby node processes the request message includes: adding an identifier in the request message, where the identifier is used to indicate a standby node processing request message, where the identifier includes one of the following: a busy identifier for indicating that the responsible node is busy, used for A temporary resource or host identifier indicating that the standby node temporarily processes the request message; forwarding the request message after adding the identifier to the standby node.
  • the added identifier enables the standby node to process the new request when the responsible node is busy, thereby improving the utilization of the P2P network.
  • the method further includes: the responsible node receiving the request response from the standby node; and forwarding the request response to the terminal or the node.
  • the responsible node can obtain the request response after the standby node processes the request and forwards it to the sender of the request message, and completes the whole process of processing the request signal.
  • the method further includes: the standby node determines that the request message cannot be processed; and the standby node instructs the next standby node to process the request message.
  • the next standby node performs processing, thereby avoiding the request failure.
  • the method further includes: the standby node receiving the request response from the next standby node; and the standby node forwarding the request response to the terminal or the node by the responsible node.
  • the selection of the standby node and the next standby node may be a node calculated according to the P2P algorithm and the current status of the P2P overlay network, or may be a pre-configured node, or may be randomly selected in the routing table of the active node. Selected node.
  • the method further includes: when the request response includes the forced routing information, for the INVITE request message in the subsequent session to be sent, the terminal or the node directly sends the standby message to the standby node. node.
  • the terminal or node can find the actual processing of the request by adding mandatory routing information in the request information. node.
  • the method further includes: when the standby node maintains the user registration relationship, for the subsequent REGISTER request message to be sent, the terminal or the node is directly sent to the standby node across the responsible node.
  • the terminal or the node sends the subsequent REGISTER request message to the standby node directly to the standby node, which can be implemented in multiple manners, for example, by adding a mandatory routing information header to the subsequent REGISTER request message to be sent. area. It should be noted that other implementations in the prior art that can achieve the same cross-transmission are all included in the protection scope of the present invention.
  • the responsible node maintains the user registration relationship, the subsequent request message sent by the terminal or the node is not added.
  • the routing information header field is enhanced. The responsible node determines whether the message is processed by the local node according to the current load condition after receiving the request message. If processed by the local node, the processing flow is the same as the normal message processing flow.
  • the method further includes: the standby node processing the request message.
  • the method further includes: performing, between the responsible node and the standby node, a data update corresponding to the request message. Considering that data synchronization will affect the processing capability of subsequent messages, each time the message is processed in this embodiment, the relevant node will update the data to ensure consistency.
  • the method further includes: the responsible node determining the recovery processing capability; and performing, between the responsible node and the standby node, the data update corresponding to the request message.
  • the responsible node can actively synchronize data with the standby node when not busy, thereby ensuring the accuracy of its own data.
  • a method for processing an overload of a SIP application in a P2P network is implemented. The method is that when the responsible node that should process the message is overloaded and cannot process a new request, the responsible node adds the identifier to the message and forwards the request.
  • the identifier added by the responsible node means that the responsible node is busy and cannot continue processing the message; after the standby node receives the message, although the node is not responsible for the node, after detecting the identifier in the message, The message will be processed.
  • the destination in the forwarding message needs to be replaced with the relevant identifier of the standby node.
  • the related identifier may be the identifier of the standby node itself, or may be The standby node is responsible for the identification of resources within the interval.
  • the standby node may initiate an overlay network data modification operation if the overlay network data needs to be modified; or when the responsible node is no longer overloaded, the responsible node actively retrieves the modified data and performs the overlay. Network data modification.
  • the new request may be forwarded to the next standby node for processing, and the process forwards the message to the standby node, and adds the overload identifier of the standby node or replaces the original overload identifier, and the next standby node receives After the message is found, the responsible node is overloaded with the previous standby node, and the message is processed.
  • the session or registration data may exist on the current processing node, and subsequent messages are handed over to the processing node; otherwise, the conversation or registration If the data does not exist on the current node, the subsequent message will be handed over to the responsible node, and will only be handed over to the standby node when the responsible node is still overloaded.
  • a header field needs to be added in the response message for description, otherwise the subsequent message is processed by the responsible node.
  • FIG. 5 is a flowchart of a general message processing according to an embodiment of the present invention, and the specific process includes steps S502 to S520.
  • Step S502 The terminal or the node sends a SIP request message to the P2P overlay network, and the SIP message is forwarded by the transit node.
  • Step S504 the transit node forwards the message to the responsible node.
  • Step S506 since the responsible node is busy at this time, the new SIP request message cannot be processed.
  • Step S508 the responsible node forwards the request message to the standby node for processing, adds an identifier to the forwarded request message, marks that the primary node is busy, and is handed over to the standby node for processing, and the identifier may be adding the responsible node to the busy identifier in the message, or Is to generate a temporary resource or host ID, inserted into the message.
  • Step S510 After receiving the request message, the standby node searches for the identifier added by the responsible node in the message, so the data required for processing the request is obtained, and the request processing is performed.
  • Step S512 after the standby node completes the request processing, returns a response message.
  • Step S514 the response message arrives at the transit node after being forwarded by the responsible node.
  • Step S520 after the responsible node of the data completes the data update request message, returns a data update response message, and completes the processing of the message when the node is overloaded.
  • the above figure is the processing of the ordinary request response message.
  • the INVITE message will generate a dialogue, and the REGISTER message will generate a registration dialog. If these messages are processed on the standby node, the subsequent messages in the conversation may be affected.
  • Process flow Preferred Embodiment 2
  • FIG. 6 is a flowchart of an INVITE message and a subsequent message processing according to an embodiment of the present invention. The specific process includes steps S602 to S630. Step S602, the terminal or the node sends an INVITE request message to the transit node.
  • Step S604 the transit node forwards the request message to the responsible node of the message.
  • Step S606 because the responsible node of the message is busy and cannot process the new INVITE request, the responsible node forwards the INVITE request message to the standby node, and adds the master node busy identifier in the message.
  • Step S608 After the standby node completes the request processing, the subsequent message that determines the call corresponding to the INVITE is processed by the standby node. When the SIP response message is returned, the message carries the mandatory routing information that the subsequent message is processed by the standby node.
  • step S610 the message is forwarded to the transit node.
  • Step S612 the transit node forwards the response message to the terminal or the node.
  • Step S614 the subsequent request message sent by the terminal or the node carries the signature routing message header field.
  • Step S616, the message is forwarded to the standby node after being forwarded by the transit node.
  • Step S622 The message is not added to the mandatory routing information header field for the non-intra-session request message sent by the terminal or the node.
  • Step S624, the non-intra-session request message is forwarded to the responsible node by the transit node.
  • Step S626, the responsible node determines whether the message is processed by the local node according to the current load condition.
  • FIG. 7 is a flowchart of REGISTER and subsequent message processing according to an embodiment of the present invention, and the specific process includes steps S702 to S720.
  • Step S702 the terminal or the node sends a REGISTER request message to the transit node.
  • Step S704 the transit node forwards the request message to the responsible node of the message.
  • Step S706 the responsible node of the message is busy, unable to process the new REGISTER request, so the message is forwarded to the standby node, and the primary node is busy identifier added in the message.
  • Step S708 after the standby node completes the request processing, the subsequent message that determines the call corresponding to the REGISTER is processed by the standby node. When the SIP response message is returned, the subsequent message carrying the registered user in the message has the mandatory processing by the standby node. Routing information.
  • step S710 the message is forwarded to the transit node.
  • Step S712 the transit node forwards the response message to the terminal or the node.
  • Step S714 the subsequent request message sent by the terminal or the node, where the message carries the signature routing message header field.
  • Step S716 the message is forwarded to the standby node by the transit node.
  • Step S718 After receiving the request message and processing the message, the standby node returns a response message.
  • Step S720 the response message is forwarded to the originating terminal or node through the transit node.
  • the registration relationship of the user is maintained by the standby node in the above figure, and the registration relationship of the user is maintained by the responsible node, and the process is as shown in FIG. 8.
  • FIG. 8 is a flow chart of another REGISTER and subsequent message processing procedure according to an embodiment of the present invention, which is specifically performed in steps S802 to S822.
  • Step S802 the terminal or the node sends a REGISTER request message to the transit node.
  • Step S804 the transit node forwards the request message to the responsible node of the message.
  • Step S806, the responsible node of the message is busy, unable to process the new REGISTER request, so the message is forwarded to the standby node, and the primary node is busy identified in the message.
  • Step S808 After the standby node completes the request processing, the subsequent message that determines the call corresponding to the REGISTER is processed by the standby node. When the SIP response message is returned, the subsequent message that does not carry the registered user in the message has a standby node. Forced routing information. In step S810, the message is forwarded to the transit node.
  • Step S812 the transit node forwards the response message to the terminal or the node.
  • Step S814, the subsequent request message sent by the terminal or the node does not add the mandatory routing information header field.
  • Step S816 the request message is forwarded to the responsible node by the transit node.
  • Step S818, the responsible node determines whether the message is processed by the local node according to the current load condition. If processed by the local node, the processing flow is the same as the normal message processing flow. If the node cannot process and needs to be handed over to other nodes for processing, the processing flow is the same as the figure. 4 is shown.
  • Step S820 after the processing is completed, a response message is returned.
  • Step S822 the response message is forwarded to the terminal or node through the transit node.
  • the synchronization data described in the foregoing fifth embodiment is the synchronous data operation initiated by the standby node.
  • the responsible node may initiate the data synchronization operation actively.
  • FIG. 9 is a processing flow of the node actively synchronizing data according to an embodiment of the present invention.
  • the specific process of the figure includes steps S902 to S922.
  • Step S902 The terminal or the node sends a SIP request message to the P2P overlay network, and the SIP message is forwarded by the transit node.
  • Step S904 the transit node forwards the message to the responsible node.
  • Step S906 since the responsible node is busy at this time, the new SIP request message cannot be processed.
  • Step S908 the responsible node forwards the request message to the standby node, and the standby node processes, and the responsible node adds an identifier to the forwarded request message, marking the primary node is busy, and the remote node is processed, and the identifier may be added in the message.
  • the node is busy identifying, or it can generate a temporary resource or host ID and insert it into the message.
  • Step S910 After receiving the request message, the standby node searches for the tag added by the responsible node in the message, so the data required for processing the request is obtained, and the request processing is performed.
  • Step S912 after the standby node completes the request, returns a response message.
  • Step S914 the response message is forwarded to the transit node by the responsible node.
  • Step S916 the transit node sends a response message to the terminal or node that sends the request message.
  • step S918 after the load of the responsible node is reduced and the busy state is released, the data synchronization operation can be completed.
  • Step S920 the node is responsible for initiating a data synchronization operation request to the standby node where the data is changed, and requesting to acquire the data change content.
  • Step S922 the standby node returns the data change content, thereby completing data synchronization.
  • the preferred embodiment 6 of course, in the extreme case, also has the same moment when the node is overloaded, and the standby node is also overloaded at the same time, unable to handle the new request.
  • Step 10 is a message processing flowchart of a standby node being simultaneously overloaded according to an embodiment of the present invention, and the specific process includes steps S1002 to S1026.
  • Step SI 002 the terminal or the node sends a SIP request message to the P2P overlay network, and the SIP message is forwarded through the transit node.
  • step S1004 the transit node forwards the message to the responsible node.
  • step S1006 since the responsible node is busy at this time, the new SIP request message cannot be processed.
  • Step S1008 The responsible node forwards the request message to the standby node for processing, adds an identifier to the forwarded request message, marks that the primary node is busy, and is handed over to the standby node for processing, and the identifier may be adding the responsible node to the busy identifier in the message, or Is to generate a temporary resource or host ID, inserted into the message.
  • the standby node is busy and cannot process the new SIP request message.
  • Step S1012 The standby node forwards the request message to the next standby node for processing, adds an identifier to the forwarded request message, marks that the standby node is busy, and is processed by the next standby node, and the identifier may be that the standby node is busy in the message.
  • the identifier may also be a temporary resource or a host identifier, which replaces the identifier added by the original responsible node.
  • Step S1014 After receiving the request message, the next standby node searches for the identifier added by the responsible node and/or the standby node in the message, so the data required for processing the request is obtained, and the request processing is performed. Step S1016, returning a response message after completing the processing.
  • step S1018 the response message is forwarded by the standby node to the responsible node.
  • step S1020 The response message is forwarded by the responsible node to the transit node.
  • Step S1022 The response message is forwarded by the transit node to the terminal or the node.
  • Step S1024 when the processing in the next standby node causes the modification of the data in the overlay network, the next standby node sends a data update request message to the responsible node of the data to perform data modification, where the responsible node of the data may be the responsible node of the request. Alternatively, the two nodes are combined into the same node for convenience of presentation.
  • FIG. 11 is a structural block diagram of a processing device for network overload according to an embodiment of the present invention.
  • a receiving module 1102, a determining module 1104, and an indicating module 1106 are included.
  • the structure is described in detail below.
  • the receiving module 1102 is configured to receive a request message from the terminal or the node;
  • the determining module 1104 is connected to the receiving module 1102, and is configured to determine that the request message received by the receiving module 1102 cannot be processed;
  • the indicating module 1106 is connected to the receiving module 1102 and the determining module. 1104.
  • the method provided by the present invention realizes the normal processing of the new request message when the node is overloaded in the P2P network, fully utilizes the advantages of the P2P overlay network, and does not impose a large burden on the overlay network.
  • the present invention may be embodied in various other various modifications and changes without departing from the spirit and scope of the invention. Modifications are intended to fall within the scope of the appended claims.
  • a method and apparatus for processing network overload are provided.
  • the invention solves the problem that the network overload processing method causes session loss and low processing capability when the responsible node is busy, and the standby node takes care of the new request, thereby achieving full utilization of the P2P overlay in the telecommunication network.
  • the processing power of the network can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device, or they may be separately fabricated into individual integrated circuit modules, or they may be Multiple modules or steps are made into a single integrated circuit module.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

Disclosed are a method and an apparatus for processing network overload. The method comprises: receiving, by a responsible node, a request message sent from a terminal or a node; determining that the request message cannot be processed; instructing a standby node to process the request message. In the embodiments of the invention, the node of the network which is busy can forward, the request messages needed to be processed, to other nodes having processing abilities, thus reducing the session loss, and utilizing the characteristic and processing ability of the Peer-to-Peer(P2P) overlay network more adequately.

Description

网络过载的处理方法及装置 技术领域 本发明涉及通信领域, 具体而言, 涉及一种网络过载的处理方法及装置。 背景技术 点对点 (Peer-to-Peer, 简称为 P2P) 技术可以让用户直接连接到其他用户的计算 机, 进行文件共享与交换, 同时 P2P在深度搜索、 分布计算、 和协同工作等方面也大 有用途。 目前 P2P在加强网络上人的交流、 文件交换、 分布式计算、 服务共享等方面已经 充分显示出了其强大的技术优势, 但是 P2P的应用主要还是集中在 Internet应用中, 在传统电信网络中尚未大规模应用。 考虑到目前以及将来电信网络中, 会话控制的主 流是会话初始化(Session Initiation Protocol, 简称为 SIP)协议, 因此, 将 P2P技术引 入到电信网中去, 必须要保证 SIP协议在 P2P网络中的应用, 同时需要能够运行各类 典型级业务。 基于以上考虑, 目前业界的很多机构都在致力于研究如何将 P2P技术引入到电信 网络中, 图 1是根据相关技术的 P2P叠加网架构示意图, 如图 1所示, 包括 P2P叠加 网 11、 P2P叠加网 11中的节点 12、 非 P2P终端设备 13、 P2P终端设备 14和接入节点 15, 详细介绍如下。  The present invention relates to the field of communications, and in particular to a method and apparatus for processing network overload. BACKGROUND Peer-to-Peer (P2P) technology allows users to directly connect to other users' computers for file sharing and exchange, and P2P is also useful for deep search, distributed computing, and collaborative work. . At present, P2P has fully demonstrated its strong technical advantages in enhancing communication, file exchange, distributed computing, and service sharing on the network. However, P2P applications are mainly concentrated in Internet applications, but not in traditional telecommunication networks. Large-scale application. Considering the current and future telecom networks, the mainstream of session control is the Session Initiation Protocol (SIP) protocol. Therefore, the introduction of P2P technology into the telecommunication network must ensure the application of the SIP protocol in the P2P network. At the same time, it needs to be able to run all kinds of typical business. Based on the above considerations, many organizations in the industry are working on how to introduce P2P technology into the telecommunication network. Figure 1 is a schematic diagram of a P2P overlay network architecture according to the related art. As shown in Figure 1, the P2P overlay network 11 and P2P are included. The node 12, the non-P2P terminal device 13, the P2P terminal device 14, and the access node 15 in the overlay network 11 are described in detail below.
P2P叠加网 11由各类担负不同任务的对等体(本发明中也称为节点)组成的一张 逻辑网络。 P2P叠加网 11中的节点 12, 为 P2P叠加网 11中的基本组成部分, 是能够给同一The P2P overlay network 11 is a logical network composed of various types of peers (also referred to as nodes in the present invention) that are responsible for different tasks. The node 12 in the P2P overlay network 11 is the basic component of the P2P overlay network 11, and is capable of giving the same
P2P叠加网中其它节点提供存储和传送服务的节点。 非 P2P终端设备 13接入到 P2P叠加网中, 但不支持任何 P2P协议, 仅支持 SIP 协议。 Other nodes in the P2P overlay network provide nodes for storing and transmitting services. The non-P2P terminal device 13 accesses the P2P overlay network, but does not support any P2P protocol, and only supports the SIP protocol.
P2P终端设备 14接入到 P2P叠加网中, 既支持 P2P协议, 也支持 SIP协议; 考虑 到一般终端设备,特别是手持终端设备的能力较弱,所以在很多情况下的实际部署中, P2P终端设备仅仅作为 P2P客户端接入到 P2P叠加网中, 并不作为存储、 传送等服务 器。 接入节点 15为非 P2P终端设备 13、 P2P终端设备 14等终端设备的接入节点, 考 虑到电信营运的需要, 包括 P2P终端与非 P2P终端都必须通过就近的接入节点接入到 P2P叠加网中, 当该接入节点作为非 P2P终端的接入节点时, 同时作为代理节点, 负 责完成非 P2P终端所采用的 SIP协议与 P2P叠加网内部路由 SIP所采用协议的转换, 而当该节点作为 P2P终端的接入节点时, 仅需要对消息进行中转。 在 P2P叠加网中, 每个节点都可以存储数据并处理数据, 由于每个节点存储处理 的数据都不相同, 因此同一时刻的负载程度也不相同, 当然一些好的负载均衡算法在 特定的条件下能够较好的解决负载均衡问题, 保证在此正常低负载条件下, 同一叠加 网中的不同节点之间的负载程度基本相同, 一旦负载较高时, 算法将自动进行调整, 调整中不可避免的出现计算以及数据迁移操作, 从而进一步加重叠加网负载, 因此一 般 P2P叠加网的负载均衡算法的应用也有一定的局限性。 图 2是根据相关技术的 P2P叠加网中节点过载的处理流程图,在 P2P叠加网的 SIP 应用中, 碰到单个节点过载时的一般处理流程如图 2所示, 其流程具体包括步骤 S202 至步骤 S210。 步骤 S202,终端向 P2P叠加网发送 SIP请求消息, SIP消息将通过中转节点转发。 步骤 S204, 中转节点查找到 SIP请求的负责节点, 并将 SIP消息转发给该负责节 点。 步骤 S206, 该负责节点当前负载程度很高, 无法处理新的 SIP请求, 则拒绝本次 消息的处理。 步骤 S208, 负责节点根据当前配置返回 3xx、 486或者 5xx消息, 拒绝本次呼叫。 步骤 S210, 中转节点转发响应消息到终端, 表明本次请求处理失败, 终端将根据 叠加网返回的响应消息做进一步处理。 目前 IETF也在对 SIP服务器过载做研究, 其成果称为 SOC ( SIP负载控制)。 图 3是根据相关技术的另一种 P2P叠加网中节点过载的处理流程图, 如果 P2P叠加网中 的节点支持 SOC, 其流程具体包括步骤 S302至步骤 S314。 步骤 S302,终端向 P2P叠加网发送 SIP请求消息, SIP消息将通过中转节点转发。 步骤 S304, 中转节点支持 SOC, 在转发 SIP消息时, 在 SIP消息中添加支持 SOC 头域, 以及携带支持的 SOC算法。 步骤 S306, 负责节点收到消息后, 发现自身已经处于过载状态, 回复 SIP响应消 息, 同时在响应消息中添加负责节点正忙指示, 并说明过载后采用的算法, 以及过载 处理的有效期。 步骤 S308, 中转节点转发响应消息。 步骤 S310, 当后续的消息到达中转节点时, 中转节点发现该消息的负责节点当前 还处于过载节点。 步骤 S312,中转节点根据之前协商的过载算法,对该消息进行抛弃或者转发处理, 过载算法不属于本发明的讨论内容, 这里不再详述。 步骤 S314, 如果中转节点在步骤 S306中选择了转发请求, 后续的响应请求也将 由中转节点转发。 以上解决方法都是将客户 /服务器模型 (Client / Server, 简称为 C/S) 网络架构中 解决过载方法应用到 P2P网络中来的方案, 但是 P2P网络与 C/S架构明显区别在于: P2P网络中单个节点过载时, 并不代表整个 P2P网络过载, 还有其它节点甚至大部分 节点具有处理能力, 因此这些处理方法都会造成会话损失, 处理能力低。 发明内容 本发明提供了一种网络中过载的处理方法和装置, 可以用于解决相关技术中网络 过载处理方法会造成会话损失, 处理能力低的问题,。 根据本发明的一个方面, 提供了一种网络过载的处理方法, 包括: 负责节点接收 来自终端或节点的请求消息; 确定无法处理请求消息; 指示备用节点处理请求消息。 优选地, 负责节点接收来自终端或节点的请求消息包括: 负责节点接收终端或节 点发送的经由中转节点转发的请求消息。 优选地, 指示备用节点处理请求消息包括: 在请求消息中添加标识, 其中标识用 于指示备用节点处理请求消息, 其中标识包括以下之一: 用于指示负责节点正忙的正 忙标识、 用于指示备用节点临时处理请求消息的临时资源或主机标识; 向备用节点转 发添加标识之后的请求消息。 优选地, 在指示备用节点处理请求消息之后, 还包括: 负责节点接收来自备用节 点的请求响应; 向终端或节点转发请求响应。 优选地, 在指示备用节点处理请求消息之后, 还包括: 备用节点确定无法处理请 求消息; 备用节点指示下一个备用节点处理请求消息。 优选地, 在备用节点指示下一个备用节点处理请求消息之后, 还包括: 备用节点 接收来自下一个备用节点的请求响应; 备用节点通过负责节点向终端或节点转发请求 响应。 优选地, 在向终端或节点转发请求响应之后, 还包括: 在请求响应包括强制路由 信息的情况下, 对于后续的待发送的会话内的 INVITE请求消息, 终端或节点跨越负 责节点直接发送给备用节点。 优选地, 在向终端或节点转发请求响应之后, 还包括: 在备用节点维护用户注册 关系的情况下, 对于后续的待发送的 REGISTER请求消息, 终端或节点跨越负责节点 直接发送给备用节点。 优选地, 在指示备用节点处理请求消息之后, 还包括: 备用节点处理请求消息。 优选地, 在指示备用节点处理请求消息之后, 还包括: 在负责节点和备用节点之 间, 进行与请求消息对应的数据更新。 优选地, 在指示备用节点处理请求消息之后, 还包括: 负责节点确定恢复处理能 力; 在负责节点和备用节点之间, 进行与请求消息对应的数据更新。 根据本发明的另一方面, 提供了一种网络过载的处理装置, 包括: 接收模块, 设 置为接收来自终端或节点的请求消息; 确定模块, 设置为确定无法处理请求消息; 指 示模块, 设置为指示备用节点处理请求消息。 通过本发明, 采用在负责节点正忙时, 由备用节点代为处理新请求的方案, 解决 了相关技术中不能在电信网络中充分利用 P2P叠加网的处理能力的问题, 进而达到了 在电信网络中充分利用 P2P叠加网的处理能力效果。 附图说明 此处所说明的附图用来提供对本发明的进一步理解, 构成本申请的一部分, 本发 明的示意性实施例及其说明用于解释本发明, 并不构成对本发明的不当限定。 在附图 中: 图 1是根据相关技术的 P2P叠加网架构示意图; 图 2是根据相关技术的 P2P叠加网中节点过载的处理流程图; 图 3是根据相关技术的另一种 P2P叠加网中节点过载的处理流程图; 图 4是根据本发明实施例的网络过载的处理方法的流程图; 图 5是根据本发明实施例的通用消息处理流程图; 图 6是根据本发明实施例的 INVITE以及后续消息处理流程图; 图 7是根据本发明实施例的 REGISTER以及后续消息处理流程图; 图 8是根据本发明实施例的另一种 REGISTER以及后续消息处理流程图; 图 9是根据本发明实施例的负责节点主动同步数据的处理流程图; 图 10是根据本发明实施例的备份节点同时过载的消息处理流程图; 图 11是根据本发明实施例的网络过载的处理装置的结构框图。 具体实施方式 下文中将参考附图并结合实施例来详细说明本发明。 需要说明的是, 在不发生冲 突的情况下, 本申请中的实施例及实施例中的特征可以相互组合。 图 4是根据本发明实施例的网络过载的处理方法的流程图, 如图 4所示, 包括如 下的步骤 S402至步骤 S406。 步骤 S402, 负责节点接收来自终端或节点的请求消息。 步骤 S404, 确定无法处理请求消息。 步骤 S406, 指示备用节点处理请求消息。 相关技术中, 网络过载处理方法会造成会话损失, 处理能力低。 本发明实施例中 网络中正忙的节点可以将需要处理的请求消息转发给其他具有处理能力的节点, 因此 减小了会话损失, 更充分地利用了 P2P叠加网的特性以及处理能力。 优选地, 负责节点接收来自终端或节点的请求消息包括: 负责节点接收终端或节 点发送的经由中转节点转发的请求消息。本实施例消息的传送通过中转节点进行中转, 从而可以保证请求消息稳定、 可靠的发送。 优选地, 指示备用节点处理请求消息包括: 在请求消息中添加标识, 其中标识用 于指示备用节点处理请求消息, 其中标识包括以下之一: 用于指示负责节点正忙的正 忙标识、 用于指示备用节点临时处理请求消息的临时资源或主机标识; 向备用节点转 发添加标识之后的请求消息。本实施例中,添加的标识使备用节点在负责节点正忙时, 代为处理新的请求, 提高了 P2P网络的利用率。 优选地, 在指示备用节点处理请求消息之后, 还包括: 负责节点接收来自备用节 点的请求响应; 向终端或节点转发请求响应。 本实施例中负责节点能够获取备用节点 处理请求后的请求响应并将其转发到请求消息的发送方, 完成了对请求信号进行处理 的全过程。 优选地, 在指示备用节点处理请求消息之后, 还包括: 备用节点确定无法处理请 求消息; 备用节点指示下一个备用节点处理请求消息。 考虑到备用节点与负责节点都 忙的情况, 本实施例中由下一备用节点进行处理, 避免了请求失败。 优选地, 在备用节点指示下一个备用节点处理请求消息之后, 还包括: 备用节点 接收来自下一个备用节点的请求响应; 备用节点通过负责节点向终端或节点转发请求 响应。 通过该步骤, 本实施例达到在负责节点和备用节点都正忙时, 网络还能及时处 理新请求的效果。 需要说明的是, 上述备用节点以及下一个备用节点的选择可以是根据 P2P算法以 及 P2P叠加网现状计算出的节点, 也可以是预先配置的节点, 也可以是在主用节点的 路由表中随机选取的节点。 优选地, 在向终端或节点转发请求响应之后, 还包括: 在请求响应包括强制路由 信息的情况下, 对于后续的待发送的会话内的 INVITE请求消息, 终端或节点跨越负 责节点直接发送给备用节点。 考虑到每次由负责节点自身来判断是否处理新请求降低 了网络运行效率, 在负责节点正忙时, 终端或节点可以通过在请求信息中添加强制路 由信息, 更快捷地找到实际处理该请求的节点。 优选地, 在向终端或节点转发请求响应之后, 还包括: 在备用节点维护用户注册 关系的情况下, 对于后续的待发送的 REGISTER请求消息, 终端或节点跨越负责节点 直接发送给备用节点。 具体地, 终端或节点跨越负责节点直接向备用节点发送后续的 待发送的 REGISTER请求消息, 可以通过多种方式来实现, 例如, 通过在后续的待发 送的 REGISTER请求消息中添加了强制路由信息头域。 需要说明的是, 现有技术中存 在的其它能够同样实现跨越发送的实现方式, 均应当纳入本发明的保护范围。 另外, 在负责节点维护用户注册关系的情况下, 终端或者节点发出的后续其请求消息中不添 加强制路由信息头域, 负责节点收到请求消息后根据当前的负载情况判断该消息是否 由本节点处理, 如果由本节点处理, 则处理流程与正常消息处理流程相同, 如果本节 点无法处理, 需要转交其它节点处理。 本实施例中, 通过对负责节点和备用节点维护 用户注册关系分情况处理, 更加高效地维持了整个网络的运行。 优选地, 在指示备用节点处理请求消息之后, 还包括: 备用节点处理请求消息。 优选地, 在指示备用节点处理请求消息之后, 还包括: 在负责节点和备用节点之 间,进行与请求消息对应的数据更新。考虑到数据不同步将影响后续消息的处理能力, 本实施例每次处理消息后, 相关节点都会进行数据的更新以确保一致性。 优选地, 在指示备用节点处理请求消息之后, 还包括: 负责节点确定恢复处理能 力; 在负责节点和备用节点之间, 进行与请求消息对应的数据更新。 在本实施例中, 负责节点能够在不忙时主动与备用节点进行数据同步, 确保了自身数据的准确。 本实施例要实现一种 P2P网络中 SIP应用过载的处理方法, 其方法在于当应该处 理该消息的负责节点过载, 无法再处理新的请求时, 负责节点在消息中添加标识后, 将请求转发给选定的备用节点处理, 负责节点添加的标识含义为负责节点正忙, 无法 继续处理该消息; 而备用节点受到该消息后, 虽然本节点并非负责节点, 但检测到消 息中的标识后, 将处理该消息。 优选地, 为了使转发消息能够顺利被路由到备用节点, 需要将转发消息中的目的 地更换为备用节点的相关标识, 在 P2P叠加网中该相关标识可以是备用节点自身的标 识, 也可以是备用节点负责区间内资源的标识。 优选地, 备用节点在处理完该消息后, 如果需要对叠加网数据进行修改, 可以发 起叠加网数据修改操作; 也可以当负责节点不再过载时, 由负责节点主动取回修改数 据, 执行叠加网数据修改。 优选地, 如果当前备用节点也正忙, 可以将新请求转交给下一个备用节点处理, 其过程为备用节点转发消息, 同时添加备用节点的过载标识或者替换原有过载标识, 当下一个备用节点收到消息后, 发现负责节点与前面的备用节点都过载, 则对该消息 进行处理。 如果采用本方法处理的消息建立了对话或者注册关系, 该会话或者注册数据可以 存在于当前处理节点上, 则后续的消息都会交由该处理节点处理; 否则对话或者注册 数据不存在于当前节点上, 则后续消息将会交由负责节点处理, 只有当负责节点仍然 过载时, 才会交由备用节点处理。 优选地, 当后续消息仍然由当前处理节点处理时, 需要在响应消息中添加头域进 行说明, 否则后续消息由负责节点处理。 采用本实施例方法后, 当 P2P叠加网中有节点过载后, 可以将过载节点应当处理 的新请求消息交转其给他节点处理, 从而保证了新请求消息的处理。 下面将结合优选实施例对本发明实施例的实现过程进行详细描述。 优选实施例一 图 5是根据本发明实施例的通用消息处理流程图,其具体流程包括步骤 S502至步 骤 S520。 步骤 S502, 终端或者节点向 P2P叠加网发送 SIP请求消息, SIP消息将通过中转 节点转发。 步骤 S504, 中转节点将消息转发给负责节点。 步骤 S506, 由于此时负责节点正忙, 无法处理新的 SIP请求消息。 步骤 S508, 负责节点将请求消息转发给备用节点处理, 在转发的请求消息中添加 标识, 标记主节点正忙, 交由备用节点处理, 标识可以是在消息中添加负责节点正忙 标识, 也可以是生成一个临时资源或者主机标识, 插入到消息中。 步骤 S510, 备用节点收到请求消息后, 在消息中查找到负责节点添加的标识, 所 以获取处理该请求所需的数据, 进行请求处理。 步骤 S512, 备用节点完成请求处理后, 返回响应消息。 步骤 S514, 响应消息经过负责节点转发后到达中转节点。 步骤 S516, 中转节点将响应消息发送到发送请求消息的终端或者节点。 步骤 S518, 当备用节点的处理引起了叠加网中数据的修改时, 备用节点向数据的 负责节点发起数据更新请求消息, 进行数据修改, 这里数据的负责节点可以是请求的 负责节点也可以不是, 图中为了表述方便, 将两个节点合为同一个节点。 步骤 S520, 数据的负责节点完成数据更新请求消息后, 返回数据更新响应消息, 完成负责节点过载情况下, 消息的处理。 上图是对普通的请求响应消息的处理, 对于特殊的 SIP消息, 例如 INVITE消息 会产生对话, REGISTER消息会产生注册对话, 如果这些消息在备用节点上处理, 可 能会影响后续的对话内消息的处理流程。 优选实施例二 图 6是根据本发明实施例的 INVITE消息以及后续消息处理流程图, 其具体流程 包括步骤 S602至步骤 S630。 步骤 S602, 终端或者节点发送 INVITE请求消息到中转节点。 步骤 S604, 中转节点将该请求消息转发到消息的负责节点。 步骤 S606, 由于消息的负责节点正忙, 无法处理新的 INVITE请求, 该负责节点 将该 INVITE请求消息转发给备用节点, 并在消息中添加主节点正忙标识。 步骤 S608, 备用节点完成请求处理后, 决定该 INVITE对应的呼叫的后续消息都 由该备用节点处理, 在返回 SIP响应消息时, 在消息中携带后续消息都由备用节点处 理的强制路由信息。 步骤 S610, 消息被转发到中转节点。 步骤 S612, 中转节点将响应消息转发给终端或节点。 步骤 S614, 终端或节点发送的后续请求消息中携带了签字路由消息头域。 步骤 S616, 该消息经过中转节点转发后到达备用节点。 步骤 S618, 备用节点收到请求消息并处理消息后, 返回响应消息。 步骤 S620, 响应消息经过中转节点转发, 发送到发起的终端或者节点。 步骤 S622, 对于终端或节点发出的非会话内请求消息, 消息不添加强制路由信息 头域。 步骤 S624, 该非会话内请求消息经过中转节点转发到负责节点。 步骤 S626, 负责节点根据当前的负载情况判断该消息是否由本节点处理, 如果由 本节点处理, 则处理流程与正常消息处理流程相同, 如果本节点无法处理, 需要转交 其它节点处理, 则处理流程同图 5所示。 步骤 S628, 在完成处理之后, 返回响应消息。 步骤 S630, 响应消息经过中转节点转发到终端或节点。 优选实施例三 图 7是根据本发明实施例的 REGISTER以及后续消息处理流程图,其具体流程包 括步骤 S702到步骤 S720。 步骤 S702, 终端或者节点发送 REGISTER请求消息到中转节点。 步骤 S704, 中转节点将该请求消息转发到消息的负责节点。 步骤 S706, 消息的负责节点正忙, 无法处理新的 REGISTER请求, 因此将该消息 转发给备用节点, 并在消息中添加主节点正忙标识。 步骤 S708,备用节点完成请求处理后,决定该 REGISTER对应的呼叫的后续消息 都由该备用节点处理, 在返回 SIP响应消息时, 在消息中携带该注册用户的后续消息 都有备用节点处理的强制路由信息。 步骤 S710, 消息被转发到中转节点。 步骤 S712, 中转节点将响应消息转发给终端或节点。 步骤 S714, 终端或节点发送的后续请求消息, 消息中携带了签字路由消息头域。 步骤 S716, 该消息经过中转节点转发到备用节点。 步骤 S718, 备用节点收到请求消息并处理消息后, 返回响应消息。 步骤 S720, 响应消息经过中转节点转发到发起的终端或者节点。 优选实施例四 上图中由备用节点维护用户的注册关系, 也可以不由备用节点, 而是由负责节点 维护用户的注册关系, 其流程如图 8所示。 图 8是根据本发明实施例的另一个 REGISTER以及后续消息处理过程的流程图, 其具体流程步骤 S802至步骤 S822。 步骤 S802, 终端或者节点发送 REGISTER请求消息到中转节点。 步骤 S804, 中转节点将该请求消息转发到消息的负责节点。 步骤 S806, 消息的负责节点正忙, 无法处理新的 REGISTER请求, 因此将该消息 转发到备用节点, 并在该消息中添加主节点正忙标识。 步骤 S808,备用节点完成请求处理后,决定与该 REGISTER对应的呼叫的后续消 息都由该备用节点处理, 在返回 SIP响应消息时, 在消息中不携带该注册用户的后续 消息都有备用节点处理的强制路由信息。 步骤 S810, 消息被转发到中转节点。 步骤 S812, 中转节点将响应消息转发到终端或节点。 步骤 S814, 终端或节点发出的后续请求消息, 消息不添加强制路由信息头域。 步骤 S816, 该请求消息经过中转节点转发到负责节点。 步骤 S818, 负责节点根据当前的负载情况判断该消息是否由本节点处理, 如果由 本节点处理, 则处理流程与正常消息处理流程相同, 如果本节点无法处理, 需要转交 其它节点处理, 则处理流程同图 4所示。 步骤 S820, 在完成处理之后, 返回响应消息。 步骤 S822, 响应消息经过中转节点转发到终端或节点。 优选实施例五 前面所述的同步数据都是由备用节点发起的同步数据操作, 当然也可以由负责节 点主动发起数据同步操作, 图 9是根据本发明实施例的负责节点主动同步数据的处理 流程图, 其具体流程包括步骤 S902至步骤 S922。 步骤 S902, 终端或者节点向 P2P叠加网发送 SIP请求消息, SIP消息将通过中转 节点转发。 步骤 S904, 中转节点将消息转发到负责节点。 步骤 S906, 由于此时负责节点正忙, 无法处理新的 SIP请求消息。 步骤 S908, 负责节点将请求消息转发到备用节点, 由该备用节点处理, 负责节点 在转发的请求消息中添加标识, 标记主节点正忙, 交由备用节点处理, 标识可以是在 消息中添加负责节点正忙标识, 也可以是生成一个临时资源或者主机标识, 插入到消 息中。 步骤 S910, 备用节点收到请求消息后, 在消息中查找到负责节点添加的标记, 所 以获取处理该请求所需的数据, 进行请求处理。 步骤 S912, 备用节点完成请求后, 返回响应消息。 步骤 S914, 响应消息经过负责节点转发到中转节点。 步骤 S916, 中转节点将响应消息发送到发送请求消息的终端或者节点。 步骤 S918,在负责节点的负载降低,解除正忙状态后,能够完成数据同步操作时。 步骤 S920, 负责节点向数据发生改变的备用节点发起数据同步操作请求, 请求获 取数据改变内容。 步骤 S922, 备用节点返回数据改变内容, 从而完成数据同步。 优选实施例六 当然在极端的情况也会存在负责节点过载的同一时刻, 备用节点也同时过载, 无 法处理新的请求的情况。图 10是根据本发明实施例的备用节点同时过载的消息处理流 程图, 其具体流程包括步骤 S1002至步骤 S1026。 步骤 SI 002,终端或者节点向 P2P叠加网发送 SIP请求消息, SIP消息将通过中转 节点转发。 步骤 S1004, 中转节点将消息转发到负责节点。 步骤 S1006, 由于此时负责节点正忙, 无法处理新的 SIP请求消息。 步骤 S1008, 负责节点将请求消息转发给备用节点处理, 在转发的请求消息中添 加标识, 标记主节点正忙, 交由备用节点处理, 标识可以是在消息中添加负责节点正 忙标识, 也可以是生成一个临时资源或者主机标识, 插入到消息中。 步骤 S1010, 此时备用节点正忙, 无法处理新的 SIP请求消息。 步骤 S1012, 备用节点将请求消息转发给下一备用节点处理, 在转发的请求消息 中添加标识, 标记备用节点正忙, 交由下一备用节点处理, 标识可以是在消息中添加 备用节点正忙标识, 也可以是生成一个临时资源或者主机标识, 替换原有负责节点添 加的标识。 步骤 S1014, 下一备用节点接收到请求消息后, 在消息中查找到负责节点和 (或) 备用节点添加的标识, 所以获取处理该请求所需的数据, 进行请求处理。 步骤 S1016, 完成处理后返回响应消息。 步骤 S1018, 响应消息由备用节点转发到负责节点。 步骤 S1020, 响应消息由负责节点转发到中转节点。 步骤 S1022, 响应消息由中转节点转发到终端或者节点。 步骤 S1024, 当下一备用节点中的处理会引起叠加网中数据的修改时, 下一备用 节点向数据的负责节点发送数据更新请求消息, 进行数据修改, 这里数据的负责节点 可以是请求的负责节点也可以不是, 图中为了表述方便,将两个节点合为同一个节点。 步骤 S1026, 数据的负责节点完成数据更新请求消息后, 返回数据更新响应消息, 完成在叠加网过载情况下, 消息的处理。 图 11是根据本发明实施例的网络过载的处理装置的结构框图, 如图 11所示, 包 括接收模块 1102、 确定模块 1104和指示模块 1106。 下面对其结构进行详细描述。 接收模块 1102, 设置为接收来自终端或节点的请求消息; 确定模块 1104, 连接至 接收模块 1102, 设置为确定无法处理接收模块 1102接收的请求消息; 指示模块 1106, 连接至接收模块 1102和确定模块 1104, 设置为在确定模块 1104确定无法处理请求消 息之后, 指示备用节点处理接收模块 1102接收的请求消息。 可以看到通过本发明提供的方法, 实现了 P2P网络中在节点过载时, 新请求消息 的正常处理, 充分利用了 P2P叠加网的优势, 并且也没有对叠加网造成大的负担。 当然, 本发明还可有其他多种实施例, 在不背离本发明精神及其实质的情况下, 本领域的技术人员可以根据本发明作出各种相应的改变和变形, 但这些相应的改变和 变形都应属于本发明所附的权利要求的保护范围。 综上所述, 根据本发明的上述实施例, 提供了一种网络过载的处理方法和装置。 通过本发明, 采用在负责节点正忙时, 由备用节点代为处理新请求的方案, 解决了网 络过载处理方法会造成会话损失, 处理能力低的问题, 进而达到了在电信网络中充分 利用 P2P叠加网的处理能力效果。 显然, 本领域的技术人员应该明白, 上述的本发明的各模块或各步骤可以用通用 的计算装置来实现, 它们可以集中在单个的计算装置上, 或者分布在多个计算装置所 组成的网络上, 可选地, 它们可以用计算装置可执行的程序代码来实现, 从而, 可以 将它们存储在存储装置中由计算装置来执行, 或者将它们分别制作成各个集成电路模 块, 或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。 这样, 本发明 不限制于任何特定的硬件和软件结合。 以上所述仅为本发明的优选实施例而已, 并不用于限制本发明, 对于本领域的技 术人员来说, 本发明可以有各种更改和变化。 凡在本发明的精神和原则之内, 所作的 任何修改、 等同替换、 改进等, 均应包含在本发明的保护范围之内。 The P2P terminal device 14 is connected to the P2P overlay network, and supports both the P2P protocol and the SIP protocol. Considering that the general terminal device, especially the handheld terminal device, has weak capabilities, in many cases, the P2P terminal is actually deployed. The device is only used as a P2P client to access the P2P overlay network, and is not used as a server for storage and transmission. The access node 15 is an access node of a terminal device such as a non-P2P terminal device 13, a P2P terminal device 14, etc., and in consideration of the needs of telecommunication operations, both the P2P terminal and the non-P2P terminal must access the P2P overlay through the nearest access node. In the network, when the access node acts as an access node of a non-P2P terminal, and simultaneously acts as a proxy node, it is responsible for completing the conversion of the protocol adopted by the non-P2P terminal and the protocol used by the P2P overlay network internal routing SIP, and when the node When acting as an access node of a P2P terminal, only the message needs to be relayed. In the P2P overlay network, each node can store data and process data. Since each node stores different processed data, the load level at the same time is also different. Of course, some good load balancing algorithms are in specific conditions. Under the normal low load condition, the load degree between different nodes in the same overlay network is basically the same. Once the load is high, the algorithm will automatically adjust, and the adjustment is inevitable. The occurrence calculation and data migration operation further add overlapping screening load, so the application of the load balancing algorithm of the general P2P overlay network also has certain limitations. 2 is a flowchart of processing a node overload in a P2P overlay network according to the related art. In a SIP application of a P2P overlay network, a general processing flow when a single node is overloaded is shown in FIG. 2, and the process specifically includes step S202 to Step S210. Step S202: The terminal sends a SIP request message to the P2P overlay network, and the SIP message is forwarded by the transit node. Step S204, the transit node finds the responsible node of the SIP request, and forwards the SIP message to the responsible node. Step S206, the responsible node has a high current load level and cannot process a new SIP request, and then rejects the processing of the current message. Step S208, the responsible node returns a 3xx, 486 or 5xx message according to the current configuration, and rejects the current call. Step S210: The transit node forwards the response message to the terminal, indicating that the current request processing fails, and the terminal further performs processing according to the response message returned by the overlay network. At present, the IETF is also studying the overload of SIP servers, and the result is called SOC (SIP Load Control). FIG. 3 is a flowchart of a process for overloading a node in another P2P overlay network according to the related art. If a node in the P2P overlay network supports the SOC, the process specifically includes steps S302 to S314. Step S302, the terminal sends a SIP request message to the P2P overlay network, and the SIP message is forwarded by the transit node. Step S304, the transit node supports the SOC, and when the SIP message is forwarded, the support SOC header field is added to the SIP message, and the supported SOC algorithm is carried. Step S306, after receiving the message, the node is found to be in an overload state, replying to the SIP response message, adding a responsible node busy indication in the response message, and indicating an algorithm used after the overload, and an expiration date of the overload processing. Step S308, the transit node forwards the response message. Step S310, when the subsequent message arrives at the transit node, the transit node finds that the responsible node of the message is still at the overload node. In step S312, the transit node discards or forwards the message according to the previously negotiated overload algorithm. The overload algorithm is not part of the discussion of the present invention and will not be described in detail herein. Step S314, if the transit node selects the forwarding request in step S306, the subsequent response request will also be forwarded by the transit node. The above solution is to apply the overload method to the P2P network in the client/server model (C/S) network architecture. However, the P2P network and the C/S architecture are obviously different: P2P network When a single node is overloaded, it does not mean that the entire P2P network is overloaded. There are other nodes and even most of the nodes have processing power. Therefore, these processing methods will cause session loss and low processing capability. SUMMARY OF THE INVENTION The present invention provides a method and apparatus for processing an overload in a network, which can be used to solve the problem that a network overload processing method in the related art causes session loss and low processing capability. According to an aspect of the present invention, a method for processing a network overload is provided, including: receiving, by a node, a request message from a terminal or a node; determining that the request message cannot be processed; and instructing the standby node to process the request message. Preferably, the responsible node receiving the request message from the terminal or the node comprises: the responsible node receiving the request message sent by the terminal or the node and forwarding via the transit node. Preferably, indicating that the standby node processes the request message includes: adding an identifier in the request message, where the identifier is used to indicate a standby node processing request message, where the identifier includes one of the following: a busy identifier for indicating that the responsible node is busy, used for A temporary resource or host identifier indicating that the standby node temporarily processes the request message; forwarding the request message after adding the identifier to the standby node. Preferably, after indicating the standby node processing the request message, the method further includes: the responsible node receiving the request response from the standby node; and forwarding the request response to the terminal or the node. Preferably, after indicating the standby node processing the request message, the method further includes: the standby node determines that the request message cannot be processed; and the standby node instructs the next standby node to process the request message. Preferably, after the standby node indicates the next standby node processing the request message, the method further includes: the standby node receiving the request response from the next standby node; and the standby node forwarding the request response to the terminal or the node by the responsible node. Preferably, after forwarding the request response to the terminal or the node, the method further includes: when the request response includes the forced routing information, for the INVITE request message in the subsequent session to be sent, the terminal or the node directly sends the standby message to the standby node. node. Preferably, after forwarding the request response to the terminal or the node, the method further includes: when the standby node maintains the user registration relationship, for the subsequent REGISTER request message to be sent, the terminal or the node is directly sent to the standby node across the responsible node. Preferably, after indicating the standby node processing the request message, the method further includes: the standby node processing the request message. Preferably, after indicating the standby node processing the request message, the method further includes: performing, between the responsible node and the standby node, a data update corresponding to the request message. Preferably, after indicating the standby node processing the request message, the method further includes: the responsible node determining the recovery processing capability; and performing, between the responsible node and the standby node, the data update corresponding to the request message. According to another aspect of the present invention, a network overload processing apparatus is provided, comprising: a receiving module configured to receive a request message from a terminal or a node; a determining module configured to determine that the request message cannot be processed; and an indication module configured to Instruct the alternate node to process the request message. The invention solves the problem that the processing capability of the P2P overlay network cannot be fully utilized in the telecommunication network in the related art by using the scheme that the standby node processes the new request when the responsible node is busy, thereby achieving the problem in the telecommunication network. Make full use of the processing power of the P2P overlay network. BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings, which are set to illustrate,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,, In the drawings: FIG. 1 is a schematic diagram of a P2P overlay network architecture according to the related art; 2 is a flowchart of processing of node overload in a P2P overlay network according to the related art; FIG. 3 is a flowchart of processing of node overload in another P2P overlay network according to the related art; FIG. 4 is a network overload according to an embodiment of the present invention. FIG. 5 is a flowchart of general message processing according to an embodiment of the present invention; FIG. 6 is a flow chart of INVITE and subsequent message processing according to an embodiment of the present invention; FIG. 7 is a REGISTER according to an embodiment of the present invention; FIG. 8 is a flowchart of another REGISTER and subsequent message processing according to an embodiment of the present invention; FIG. 9 is a flowchart of processing for actively synchronizing data of a node according to an embodiment of the present invention; FIG. 11 is a structural block diagram of a processing device for network overload according to an embodiment of the present invention. BEST MODE FOR CARRYING OUT THE INVENTION Hereinafter, the present invention will be described in detail with reference to the accompanying drawings. It should be noted that, in the case where no conflict occurs, the features in the embodiments and the embodiments in the present application can be combined with each other. FIG. 4 is a flowchart of a method for processing network overload according to an embodiment of the present invention. As shown in FIG. 4, the following steps S402 to S406 are included. Step S402, the responsible node receives the request message from the terminal or the node. Step S404, determining that the request message cannot be processed. Step S406, instructing the standby node to process the request message. In the related art, the network overload processing method causes session loss and low processing capability. In the embodiment of the present invention, the busy node in the network can forward the request message to be processed to other nodes with processing capability, thereby reducing session loss and making full use of the characteristics and processing capability of the P2P overlay network. Preferably, the responsible node receiving the request message from the terminal or the node comprises: the responsible node receiving the request message sent by the terminal or the node and forwarding via the transit node. The transmission of the message in this embodiment is transited through the transit node, so that the request message can be stably and reliably transmitted. Preferably, indicating that the standby node processes the request message includes: adding an identifier in the request message, where the identifier is used to indicate a standby node processing request message, where the identifier includes one of the following: a busy identifier for indicating that the responsible node is busy, used for A temporary resource or host identifier indicating that the standby node temporarily processes the request message; forwarding the request message after adding the identifier to the standby node. In this embodiment, the added identifier enables the standby node to process the new request when the responsible node is busy, thereby improving the utilization of the P2P network. Preferably, after indicating the standby node processing the request message, the method further includes: the responsible node receiving the request response from the standby node; and forwarding the request response to the terminal or the node. In this embodiment, the responsible node can obtain the request response after the standby node processes the request and forwards it to the sender of the request message, and completes the whole process of processing the request signal. Preferably, after indicating the standby node processing the request message, the method further includes: the standby node determines that the request message cannot be processed; and the standby node instructs the next standby node to process the request message. Considering that both the standby node and the responsible node are busy, in this embodiment, the next standby node performs processing, thereby avoiding the request failure. Preferably, after the standby node indicates the next standby node processing the request message, the method further includes: the standby node receiving the request response from the next standby node; and the standby node forwarding the request response to the terminal or the node by the responsible node. Through this step, the embodiment achieves the effect that the network can also process new requests in time when both the responsible node and the standby node are busy. It should be noted that the selection of the standby node and the next standby node may be a node calculated according to the P2P algorithm and the current status of the P2P overlay network, or may be a pre-configured node, or may be randomly selected in the routing table of the active node. Selected node. Preferably, after forwarding the request response to the terminal or the node, the method further includes: when the request response includes the forced routing information, for the INVITE request message in the subsequent session to be sent, the terminal or the node directly sends the standby message to the standby node. node. Considering that each time the responsible node itself judges whether to process a new request to reduce the efficiency of network operation, when the responsible node is busy, the terminal or node can find the actual processing of the request by adding mandatory routing information in the request information. node. Preferably, after forwarding the request response to the terminal or the node, the method further includes: when the standby node maintains the user registration relationship, for the subsequent REGISTER request message to be sent, the terminal or the node is directly sent to the standby node across the responsible node. Specifically, the terminal or the node sends the subsequent REGISTER request message to the standby node directly to the standby node, which can be implemented in multiple manners, for example, by adding a mandatory routing information header to the subsequent REGISTER request message to be sent. area. It should be noted that other implementations in the prior art that can achieve the same cross-transmission are all included in the protection scope of the present invention. In addition, in the case that the responsible node maintains the user registration relationship, the subsequent request message sent by the terminal or the node is not added. The routing information header field is enhanced. The responsible node determines whether the message is processed by the local node according to the current load condition after receiving the request message. If processed by the local node, the processing flow is the same as the normal message processing flow. If the node cannot process, the handover needs to be handed over. Other node processing. In this embodiment, by managing the user registration relationship between the responsible node and the standby node, the operation of the entire network is maintained more efficiently. Preferably, after indicating the standby node processing the request message, the method further includes: the standby node processing the request message. Preferably, after the requesting the standby node to process the request message, the method further includes: performing, between the responsible node and the standby node, a data update corresponding to the request message. Considering that data synchronization will affect the processing capability of subsequent messages, each time the message is processed in this embodiment, the relevant node will update the data to ensure consistency. Preferably, after indicating the standby node processing the request message, the method further includes: the responsible node determining the recovery processing capability; and performing, between the responsible node and the standby node, the data update corresponding to the request message. In this embodiment, the responsible node can actively synchronize data with the standby node when not busy, thereby ensuring the accuracy of its own data. In this embodiment, a method for processing an overload of a SIP application in a P2P network is implemented. The method is that when the responsible node that should process the message is overloaded and cannot process a new request, the responsible node adds the identifier to the message and forwards the request. For the selected standby node, the identifier added by the responsible node means that the responsible node is busy and cannot continue processing the message; after the standby node receives the message, although the node is not responsible for the node, after detecting the identifier in the message, The message will be processed. Preferably, in order to enable the forwarding message to be successfully routed to the standby node, the destination in the forwarding message needs to be replaced with the relevant identifier of the standby node. In the P2P overlay network, the related identifier may be the identifier of the standby node itself, or may be The standby node is responsible for the identification of resources within the interval. Preferably, after processing the message, the standby node may initiate an overlay network data modification operation if the overlay network data needs to be modified; or when the responsible node is no longer overloaded, the responsible node actively retrieves the modified data and performs the overlay. Network data modification. Preferably, if the current standby node is also busy, the new request may be forwarded to the next standby node for processing, and the process forwards the message to the standby node, and adds the overload identifier of the standby node or replaces the original overload identifier, and the next standby node receives After the message is found, the responsible node is overloaded with the previous standby node, and the message is processed. If the message processed by the method establishes a conversation or registration relationship, the session or registration data may exist on the current processing node, and subsequent messages are handed over to the processing node; otherwise, the conversation or registration If the data does not exist on the current node, the subsequent message will be handed over to the responsible node, and will only be handed over to the standby node when the responsible node is still overloaded. Preferably, when the subsequent message is still processed by the current processing node, a header field needs to be added in the response message for description, otherwise the subsequent message is processed by the responsible node. After the method in this embodiment is used, when a node in the P2P overlay network is overloaded, the new request message that the overload node should process may be forwarded to the other node for processing, thereby ensuring the processing of the new request message. The implementation process of the embodiment of the present invention will be described in detail below in conjunction with the preferred embodiments. Preferred Embodiment 1 FIG. 5 is a flowchart of a general message processing according to an embodiment of the present invention, and the specific process includes steps S502 to S520. Step S502: The terminal or the node sends a SIP request message to the P2P overlay network, and the SIP message is forwarded by the transit node. Step S504, the transit node forwards the message to the responsible node. Step S506, since the responsible node is busy at this time, the new SIP request message cannot be processed. Step S508, the responsible node forwards the request message to the standby node for processing, adds an identifier to the forwarded request message, marks that the primary node is busy, and is handed over to the standby node for processing, and the identifier may be adding the responsible node to the busy identifier in the message, or Is to generate a temporary resource or host ID, inserted into the message. Step S510: After receiving the request message, the standby node searches for the identifier added by the responsible node in the message, so the data required for processing the request is obtained, and the request processing is performed. Step S512, after the standby node completes the request processing, returns a response message. Step S514, the response message arrives at the transit node after being forwarded by the responsible node. Step S516, the transit node sends a response message to the terminal or node that sends the request message. Step S518, when the processing of the standby node causes modification of the data in the overlay network, the standby node initiates a data update request message to the responsible node of the data, and performs data modification, where the responsible node of the data may be the responsible node of the request or not, For the convenience of the figure, the two nodes are combined into the same node. Step S520, after the responsible node of the data completes the data update request message, returns a data update response message, and completes the processing of the message when the node is overloaded. The above figure is the processing of the ordinary request response message. For special SIP messages, for example, the INVITE message will generate a dialogue, and the REGISTER message will generate a registration dialog. If these messages are processed on the standby node, the subsequent messages in the conversation may be affected. Process flow. Preferred Embodiment 2 FIG. 6 is a flowchart of an INVITE message and a subsequent message processing according to an embodiment of the present invention. The specific process includes steps S602 to S630. Step S602, the terminal or the node sends an INVITE request message to the transit node. Step S604, the transit node forwards the request message to the responsible node of the message. Step S606, because the responsible node of the message is busy and cannot process the new INVITE request, the responsible node forwards the INVITE request message to the standby node, and adds the master node busy identifier in the message. Step S608: After the standby node completes the request processing, the subsequent message that determines the call corresponding to the INVITE is processed by the standby node. When the SIP response message is returned, the message carries the mandatory routing information that the subsequent message is processed by the standby node. In step S610, the message is forwarded to the transit node. Step S612, the transit node forwards the response message to the terminal or the node. Step S614, the subsequent request message sent by the terminal or the node carries the signature routing message header field. Step S616, the message is forwarded to the standby node after being forwarded by the transit node. Step S618, after receiving the request message and processing the message, the standby node returns a response message. Step S620: The response message is forwarded by the transit node and sent to the originating terminal or node. Step S622: The message is not added to the mandatory routing information header field for the non-intra-session request message sent by the terminal or the node. Step S624, the non-intra-session request message is forwarded to the responsible node by the transit node. Step S626, the responsible node determines whether the message is processed by the local node according to the current load condition. If processed by the local node, the processing flow is the same as the normal message processing flow. If the local node cannot process and needs to be handed over to other nodes for processing, the processing flow is the same as the figure. 5 is shown. Step S628, after the processing is completed, a response message is returned. Step S630, the response message is forwarded to the terminal or node through the transit node. Preferred Embodiment 3 FIG. 7 is a flowchart of REGISTER and subsequent message processing according to an embodiment of the present invention, and the specific process includes steps S702 to S720. Step S702, the terminal or the node sends a REGISTER request message to the transit node. Step S704, the transit node forwards the request message to the responsible node of the message. Step S706, the responsible node of the message is busy, unable to process the new REGISTER request, so the message is forwarded to the standby node, and the primary node is busy identifier added in the message. Step S708, after the standby node completes the request processing, the subsequent message that determines the call corresponding to the REGISTER is processed by the standby node. When the SIP response message is returned, the subsequent message carrying the registered user in the message has the mandatory processing by the standby node. Routing information. In step S710, the message is forwarded to the transit node. Step S712, the transit node forwards the response message to the terminal or the node. Step S714, the subsequent request message sent by the terminal or the node, where the message carries the signature routing message header field. Step S716, the message is forwarded to the standby node by the transit node. Step S718: After receiving the request message and processing the message, the standby node returns a response message. Step S720, the response message is forwarded to the originating terminal or node through the transit node. In the above embodiment, the registration relationship of the user is maintained by the standby node in the above figure, and the registration relationship of the user is maintained by the responsible node, and the process is as shown in FIG. 8. FIG. 8 is a flow chart of another REGISTER and subsequent message processing procedure according to an embodiment of the present invention, which is specifically performed in steps S802 to S822. Step S802, the terminal or the node sends a REGISTER request message to the transit node. Step S804, the transit node forwards the request message to the responsible node of the message. Step S806, the responsible node of the message is busy, unable to process the new REGISTER request, so the message is forwarded to the standby node, and the primary node is busy identified in the message. Step S808: After the standby node completes the request processing, the subsequent message that determines the call corresponding to the REGISTER is processed by the standby node. When the SIP response message is returned, the subsequent message that does not carry the registered user in the message has a standby node. Forced routing information. In step S810, the message is forwarded to the transit node. Step S812, the transit node forwards the response message to the terminal or the node. Step S814, the subsequent request message sent by the terminal or the node does not add the mandatory routing information header field. Step S816, the request message is forwarded to the responsible node by the transit node. Step S818, the responsible node determines whether the message is processed by the local node according to the current load condition. If processed by the local node, the processing flow is the same as the normal message processing flow. If the node cannot process and needs to be handed over to other nodes for processing, the processing flow is the same as the figure. 4 is shown. Step S820, after the processing is completed, a response message is returned. Step S822, the response message is forwarded to the terminal or node through the transit node. The synchronization data described in the foregoing fifth embodiment is the synchronous data operation initiated by the standby node. Of course, the responsible node may initiate the data synchronization operation actively. FIG. 9 is a processing flow of the node actively synchronizing data according to an embodiment of the present invention. The specific process of the figure includes steps S902 to S922. Step S902: The terminal or the node sends a SIP request message to the P2P overlay network, and the SIP message is forwarded by the transit node. Step S904, the transit node forwards the message to the responsible node. Step S906, since the responsible node is busy at this time, the new SIP request message cannot be processed. Step S908, the responsible node forwards the request message to the standby node, and the standby node processes, and the responsible node adds an identifier to the forwarded request message, marking the primary node is busy, and the remote node is processed, and the identifier may be added in the message. The node is busy identifying, or it can generate a temporary resource or host ID and insert it into the message. Step S910: After receiving the request message, the standby node searches for the tag added by the responsible node in the message, so the data required for processing the request is obtained, and the request processing is performed. Step S912, after the standby node completes the request, returns a response message. Step S914, the response message is forwarded to the transit node by the responsible node. Step S916, the transit node sends a response message to the terminal or node that sends the request message. In step S918, after the load of the responsible node is reduced and the busy state is released, the data synchronization operation can be completed. Step S920, the node is responsible for initiating a data synchronization operation request to the standby node where the data is changed, and requesting to acquire the data change content. Step S922, the standby node returns the data change content, thereby completing data synchronization. The preferred embodiment 6 of course, in the extreme case, also has the same moment when the node is overloaded, and the standby node is also overloaded at the same time, unable to handle the new request. FIG. 10 is a message processing flowchart of a standby node being simultaneously overloaded according to an embodiment of the present invention, and the specific process includes steps S1002 to S1026. Step SI 002, the terminal or the node sends a SIP request message to the P2P overlay network, and the SIP message is forwarded through the transit node. In step S1004, the transit node forwards the message to the responsible node. In step S1006, since the responsible node is busy at this time, the new SIP request message cannot be processed. Step S1008: The responsible node forwards the request message to the standby node for processing, adds an identifier to the forwarded request message, marks that the primary node is busy, and is handed over to the standby node for processing, and the identifier may be adding the responsible node to the busy identifier in the message, or Is to generate a temporary resource or host ID, inserted into the message. In step S1010, the standby node is busy and cannot process the new SIP request message. Step S1012: The standby node forwards the request message to the next standby node for processing, adds an identifier to the forwarded request message, marks that the standby node is busy, and is processed by the next standby node, and the identifier may be that the standby node is busy in the message. The identifier may also be a temporary resource or a host identifier, which replaces the identifier added by the original responsible node. Step S1014: After receiving the request message, the next standby node searches for the identifier added by the responsible node and/or the standby node in the message, so the data required for processing the request is obtained, and the request processing is performed. Step S1016, returning a response message after completing the processing. In step S1018, the response message is forwarded by the standby node to the responsible node. Step S1020: The response message is forwarded by the responsible node to the transit node. Step S1022: The response message is forwarded by the transit node to the terminal or the node. Step S1024, when the processing in the next standby node causes the modification of the data in the overlay network, the next standby node sends a data update request message to the responsible node of the data to perform data modification, where the responsible node of the data may be the responsible node of the request. Alternatively, the two nodes are combined into the same node for convenience of presentation. Step S1026, after the responsible node of the data completes the data update request message, returns a data update response message, and completes the processing of the message in the case of overload of the overlay network. FIG. 11 is a structural block diagram of a processing device for network overload according to an embodiment of the present invention. As shown in FIG. 11, a receiving module 1102, a determining module 1104, and an indicating module 1106 are included. The structure is described in detail below. The receiving module 1102 is configured to receive a request message from the terminal or the node; the determining module 1104 is connected to the receiving module 1102, and is configured to determine that the request message received by the receiving module 1102 cannot be processed; the indicating module 1106 is connected to the receiving module 1102 and the determining module. 1104. Set, after the determining module 1104 determines that the request message cannot be processed, instructing the standby node to process the request message received by the receiving module 1102. It can be seen that the method provided by the present invention realizes the normal processing of the new request message when the node is overloaded in the P2P network, fully utilizes the advantages of the P2P overlay network, and does not impose a large burden on the overlay network. Of course, the present invention may be embodied in various other various modifications and changes without departing from the spirit and scope of the invention. Modifications are intended to fall within the scope of the appended claims. In summary, according to the above embodiments of the present invention, a method and apparatus for processing network overload are provided. The invention solves the problem that the network overload processing method causes session loss and low processing capability when the responsible node is busy, and the standby node takes care of the new request, thereby achieving full utilization of the P2P overlay in the telecommunication network. The processing power of the network. Obviously, those skilled in the art should understand that the above modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device, or they may be separately fabricated into individual integrated circuit modules, or they may be Multiple modules or steps are made into a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software. The above is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and scope of the present invention are intended to be included within the scope of the present invention.

Claims

权 利 要 求 书 Claim
1. 一种网络过载的处理方法, 包括: 1. A method for processing network overload, comprising:
负责节点接收来自终端或节点的请求消息;  The responsible node receives the request message from the terminal or node;
确定无法处理所述请求消息;  Determining that the request message cannot be processed;
指示备用节点处理所述请求消息。  Instructing the standby node to process the request message.
2. 根据权利要求 1所述的方法, 其中, 指示备用节点处理所述请求消息包括: 在所述请求消息中添加标识, 其中所述标识用于指示所述备用节点处理所 述请求消息, 其中所述标识包括以下之一: 用于指示所述负责节点正忙的正忙 标识、 用于指示所述备用节点临时处理所述请求消息的临时资源或主机标识; 向所述备用节点转发添加所述标识之后的所述请求消息。 2. The method according to claim 1, wherein the instructing the standby node to process the request message comprises: adding an identifier to the request message, wherein the identifier is used to instruct the standby node to process the request message, where The identifier includes one of: a busy identifier indicating that the responsible node is busy, a temporary resource or a host identifier used to instruct the standby node to temporarily process the request message; and an add-on to the standby node Said request message after the identification.
3. 根据权利要求 1所述的方法, 其中, 在指示备用节点处理所述请求消息之后, 还包括: The method according to claim 1, wherein after indicating that the standby node processes the request message, the method further includes:
所述负责节点接收来自所述备用节点的请求响应;  The responsible node receives a request response from the standby node;
向所述终端或节点转发所述请求响应。  Forwarding the request response to the terminal or node.
4. 根据权利要求 1所述的方法, 其中, 在指示备用节点处理所述请求消息之后, 还包括: The method according to claim 1, wherein after indicating that the standby node processes the request message, the method further includes:
所述备用节点确定无法处理所述请求消息;  The standby node determines that the request message cannot be processed;
所述备用节点指示下一个备用节点处理所述请求消息。  The standby node instructs the next standby node to process the request message.
5. 根据权利要求 4所述的方法, 其中, 在所述备用节点指示所述下一个备用节点 处理所述请求消息之后, 还包括: The method according to claim 4, after the standby node instructs the next standby node to process the request message, the method further includes:
所述备用节点接收来自所述下一个备用节点的请求响应;  The standby node receives a request response from the next standby node;
所述备用节点通过所述负责节点向所述终端或节点转发所述请求响应。  The standby node forwards the request response to the terminal or node through the responsible node.
6. 根据权利要求 3或 5所述的方法, 其中, 在向所述终端或节点转发所述请求响 应之后, 还包括: 在所述请求响应包括强制路由信息的情况下, 对于后续的待 发送的会话内的 INVITE请求消息, 所述终端或节点跨越所述负责节点直接发 送给所述备用节点。 根据权利要求 1至 5中任一项所述的方法, 其中, 在向所述终端或节点转发所 述请求响应之后, 还包括: 在所述备用节点维护用户注册关系的情况下, 对于 后续的待发送的 REGISTER请求消息,所述终端或节点跨越所述负责节点直接 发送给所述备用节点。 根据权利要求 1至 5中任 项所述的方法, 其中, 在指示所述备用节点处理所 述请求消息之后, 还包括: 所述备用节点处理所述请求消息。 根据权利要求 1至 5中任 项所述的方法, 其中, 在指示所述备用节点处理所 述请求消息之后, 还包括: 在所述负责节点和所述备用节点之间, 进行与所述 请求消息对应的数据更新。 根据权利要求 1至 5中任 项所述的方法, 其中, 在指示所述备用节点处理所 述请求消息之后, 还包括: The method according to claim 3 or 5, wherein, after forwarding the request response to the terminal or the node, the method further includes: if the request response includes mandatory routing information, for subsequent sending The INVITE request message within the session, the terminal or node is directly sent to the standby node across the responsible node. The method according to any one of claims 1 to 5, wherein, after forwarding the request response to the terminal or the node, the method further comprises: in case the standby node maintains a user registration relationship, for the subsequent The REGISTER request message to be sent, the terminal or node is directly sent to the standby node across the responsible node. The method according to any one of claims 1 to 5, wherein after the instructing the standby node to process the request message, the method further comprises: the standby node processing the request message. The method according to any one of claims 1 to 5, wherein after indicating that the standby node processes the request message, the method further includes: performing, between the responsible node and the standby node, the request The data corresponding to the message is updated. The method according to any one of claims 1 to 5, further comprising: after instructing the standby node to process the request message, further comprising:
所述负责节点确定恢复处理能力;  Responsible node determines recovery processing capability;
在所述负责节点和所述备用节点之间, 进行与所述请求消息对应的数据更 新。 一种网络过载的处理装置, 包括:  Data update corresponding to the request message is performed between the responsible node and the standby node. A network overload processing device includes:
接收模块, 设置为接收来自终端或节点的请求消息;  a receiving module, configured to receive a request message from a terminal or a node;
确定模块, 设置为确定无法处理所述请求消息;  Determining a module, setting to determine that the request message cannot be processed;
指示模块, 设置为指示备用节点处理所述请求消息。  The indication module is configured to instruct the standby node to process the request message.
PCT/CN2012/078513 2011-10-10 2012-07-11 Method and apparatus for processing network overload WO2013053252A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2011103044879A CN103036928A (en) 2011-10-10 2011-10-10 Network overload processing method and network overload processing device
CN201110304487.9 2011-10-10

Publications (1)

Publication Number Publication Date
WO2013053252A1 true WO2013053252A1 (en) 2013-04-18

Family

ID=48023410

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2012/078513 WO2013053252A1 (en) 2011-10-10 2012-07-11 Method and apparatus for processing network overload

Country Status (2)

Country Link
CN (1) CN103036928A (en)
WO (1) WO2013053252A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109936603A (en) * 2017-12-18 2019-06-25 厦门本能管家科技有限公司 One kind being based on the non-associated network network communication means of HTTP

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103944974B (en) * 2014-04-02 2017-10-17 华为技术有限公司 A kind of protocol message processing method, controller failure processing method and relevant device
CN107786460A (en) * 2017-09-08 2018-03-09 北京科东电力控制系统有限责任公司 A kind of management of electricity transaction system request and current-limiting method based on token bucket algorithm
CN108304455B (en) * 2017-12-20 2022-04-29 创新先进技术有限公司 Method, device and equipment for processing service request

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101039263A (en) * 2007-03-01 2007-09-19 华为技术有限公司 Method for processing node overload of core network and mobile switch equipment and communication system
CN101686172A (en) * 2008-09-27 2010-03-31 华为技术有限公司 Method, system and equipment for selecting gateway node

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6885634B1 (en) * 2001-01-24 2005-04-26 At&T Corp. Network protocol having staggered recovery
CN100471091C (en) * 2003-10-10 2009-03-18 清华大学 SAN dual-node image schooling method and system based on FCP protocol
CN100396006C (en) * 2005-12-20 2008-06-18 华为技术有限公司 Method of internodal loading transfer in network accounting
CN101052212B (en) * 2006-04-03 2010-09-22 华为技术有限公司 Method for re-attaching network of mobile terminal
US7797426B1 (en) * 2008-06-27 2010-09-14 BitGravity, Inc. Managing TCP anycast requests
CN102118828A (en) * 2009-12-30 2011-07-06 华为技术有限公司 Method and equipment for controlling access of user equipment
CN102739711B (en) * 2011-04-08 2017-10-17 中兴通讯股份有限公司 The method and system of overload are controlled in a kind of peer-to-peer network

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101039263A (en) * 2007-03-01 2007-09-19 华为技术有限公司 Method for processing node overload of core network and mobile switch equipment and communication system
CN101686172A (en) * 2008-09-27 2010-03-31 华为技术有限公司 Method, system and equipment for selecting gateway node

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109936603A (en) * 2017-12-18 2019-06-25 厦门本能管家科技有限公司 One kind being based on the non-associated network network communication means of HTTP
CN109936603B (en) * 2017-12-18 2022-07-01 本无链科技(深圳)有限公司 Non-direct connection network communication method based on HTTP

Also Published As

Publication number Publication date
CN103036928A (en) 2013-04-10

Similar Documents

Publication Publication Date Title
JP6047229B2 (en) Name-based neighbor discovery and multi-hop service discovery in information-centric networks
US7978631B1 (en) Method and apparatus for encoding and mapping of virtual addresses for clusters
US9614687B2 (en) Dynamic configuration of a conference system with distributed media agents
TWI507077B (en) Multipath overlay network and its multipath management protocol (2)
JP5086475B2 (en) Method and apparatus for optimal participation of devices in a peer-to-peer overlay network
WO2021047515A1 (en) Service routing method and apparatus
WO2007033363A2 (en) System and method for providing packet connectivity between heterogeneous networks
WO2012041604A1 (en) Aggregation of mobile broadband network interfaces
WO2011006324A1 (en) Method and terminal for file transmission
WO2013040970A1 (en) Relay node selecting method and device
WO2021008591A1 (en) Data transmission method, device, and system
WO2022179218A1 (en) Communication method and apparatus
WO2013053252A1 (en) Method and apparatus for processing network overload
US11864093B2 (en) Methods, systems, and computer readable media for communicating delegated network function (NF) discovery results between service communication proxies (SCPs) and using the delegated NF discovery results for alternate routing
US20240214301A1 (en) Packet processing method and related apparatus
US20180367620A1 (en) Session Layer Communications Using an ID-Oriented Network
CN102624759B (en) A kind of method and node for realizing Data Migration in session
US20150156164A1 (en) Communication system, communication control method, communication relay system, and communication relay control method
JP2010068107A (en) Communication device, communication method, and communication program
WO2011044835A1 (en) Method and access router for route optimization
EP1033848B1 (en) Proxy server supporting IP quality of service
WO2012129794A1 (en) Communication method, network node and network super node in a peer-to-peer (p2p) network
JP2011166453A (en) Sip (session initiation protocol) relay apparatus, packet converting device, network system, control method, and control program
WO2012136094A1 (en) Method and system for controlling overload in peer-to-peer network
US20240171641A1 (en) Data service management of proxy devices

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 12839968

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 12839968

Country of ref document: EP

Kind code of ref document: A1