WO2009124482A1 - 控制节点加入对等网络的方法和装置 - Google Patents
控制节点加入对等网络的方法和装置 Download PDFInfo
- Publication number
- WO2009124482A1 WO2009124482A1 PCT/CN2009/071080 CN2009071080W WO2009124482A1 WO 2009124482 A1 WO2009124482 A1 WO 2009124482A1 CN 2009071080 W CN2009071080 W CN 2009071080W WO 2009124482 A1 WO2009124482 A1 WO 2009124482A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- peer
- node
- peer network
- join
- network
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1044—Group management mechanisms
- H04L67/1046—Joining mechanisms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
- H04L67/1078—Resource delivery mechanisms
- H04L67/1082—Resource delivery mechanisms involving incentive schemes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/14—Network architectures or network communication protocols for network security for detecting or protecting against malicious traffic
- H04L63/1441—Countermeasures against malicious traffic
- H04L63/1458—Denial of Service
Definitions
- the present invention relates to the field of peer-to-peer network technologies, and in particular, to a method and apparatus for a control node to join a peer-to-peer network.
- P2P Peer to Peer
- the peer node has its own independent and unique identifier in the peer-to-peer network. This identifier is called Peer-ID (Peer Identity). Resources that are stored in a peer-to-peer network using a distributed storage service also have their own independent identity in the peer-to-peer network. This identity is called a resource identifier ( Resource-ID).
- Resource-ID Resource identifier
- Peer-to-peer networks have good self-organization and self-management characteristics. Nodes (including peer nodes and client nodes) can freely join and exit peer-to-peer networks, which makes peer-to-peer networks have good scalability.
- a centralized registration server (Enrollment Server) is introduced in the peer-to-peer network to control the joining of the nodes, and is responsible for assigning IDs to the nodes to which the application is applied and specifying a secure boot node (Bootstrap Peer).
- Endstrap Peer The process of joining a peer node to a peer-to-peer network is different from the process of joining a client node to a peer-to-peer network.
- the joining peer When the peer node applies to join the peer-to-peer network, the joining peer (Joining Peer) first communicates with the registration server, and after being admitted to join, obtains the assigned peer node identifier and the specified secure boot node list, and then sends the Join.
- the bootstrap node forwards the Join request message on the peer-to-peer network using the P2P routing mode until the permission node (Admitting Peer) responsible for the peer node identity receives the Join request message
- the response message is then returned, thereby establishing a connection to the peer node to be joined to the licensed node, which is the node in the ID space of the peer-to-peer network that is closest to the node to be added to the peer node.
- the client node When the client node applies to join the peer-to-peer network, the client node first communicates with the registration server, completes the authentication and authorization process, obtains the contact address of the candidate contact node (Associated Peer), and the possible client node identifier (Client-ID); Each of the candidate contact nodes sends an Inquire request message; the client node obtains information about the peer network service that the contact node can provide based on the Inquire response message returned by the candidate contact node, such as DHT (Distributed Hash Table) Histogram) algorithm and contact node status information, etc., selected The contact node sends a peer-to-peer network service connection Join request message; the contact node returns a Response message to permit the client node to join the peer-to-peer network, thereby completing the establishment of the connection.
- DHT Distributed Hash Table
- the effect of the first method relies heavily on the specific Puzzle mechanism, which requires storing a large number of problems, achieving a large overhead, and when a malicious node can give an answer, it still cannot prevent malicious nodes from frequently joining the peer-to-peer network.
- the difficulty is to provide the number represented in the picture.
- the method fails.
- the second method cannot solve the routing jitter, signaling overhead, and possible denial of service caused by the frequent entry of malicious nodes into the peer-to-peer network, and if the malicious node joins the peer-to-peer network multiple times, the released resources are taken away when exiting and Backup, these resources are still unavailable or even lost. Summary of the invention
- an embodiment of the present invention provides a method and apparatus for a control node to join a peer-to-peer network.
- the technical solution is as follows:
- a method for a control node to join a peer-to-peer network comprising:
- a device for controlling a node to join a peer-to-peer network comprising:
- a receiving module configured to receive a request message that the node joins the peer-to-peer network
- a processing module configured to: after the receiving module receives the request message, determine, according to at least one of historical information of the node joining the peer network and the received history information of the request message joining the peer network When the node is not allowed to join the peer-to-peer network, the node is denied to join the peer-to-peer network.
- the legality of the node is determined according to at least one of the historical information of the node joining the peer network and the historical information of the received request message, and it is determined that the node is not allowed to join the peer-to-peer network.
- the node is added to the peer-to-peer network for control, which restricts the node from joining the peer-to-peer network frequently, thus solving the peer-to-peer network route caused by the frequent joining of malicious nodes to some extent. Jitter, resource unavailability or even loss and node denial of service.
- DRAWINGS resource unavailability or even loss and node denial of service.
- FIG. 1 is a flowchart of a method for a control node to join a peer-to-peer network according to an embodiment of the present invention
- FIG. 2 is a flowchart of another method for a control node to join a peer-to-peer network according to an embodiment of the present invention
- FIG. 3 is a schematic structural diagram of a peer-to-peer network provided by an embodiment of the present invention.
- FIG. 4 is a schematic diagram of a process for a peer node to join a peer-to-peer network according to an embodiment of the present invention
- FIG. 5 is a schematic diagram of a process for a client node to join a peer-to-peer network according to an embodiment of the present invention
- FIG. 6 is a schematic structural diagram of an apparatus for a control node to join a peer-to-peer network according to an embodiment of the present invention
- FIG. 7 is a schematic structural diagram of another apparatus for adding a control node to a peer-to-peer network according to an embodiment of the present invention
- Another schematic diagram of a device structure in which a control node is added to a peer-to-peer network is provided by the embodiment.
- the method for the control node to join the peer-to-peer network after receiving the request message of the peer-to-peer network, according to the history information of the node joining the peer-to-peer network and the received request message of joining the peer-to-peer network At least one of the historical information determines that the node is not allowed to join the peer-to-peer network when the node is not allowed to join the peer-to-peer network.
- FIG. 1 is a flowchart of a method for a control node to join a peer-to-peer network according to an embodiment of the present disclosure, where the method specifically includes: 101: Receive a request message that a node joins the peer network.
- Step 102 Determine, according to the history information of the node joining the peer-to-peer network, whether the node is allowed to join the peer-to-peer network, and if yes, execute 103; otherwise, execute 104.
- multiple methods may be used, including but not limited to at least one of the following two types:
- the predetermined time, the first threshold, and the second threshold may be set as needed, such as setting a specified time to be 1 hour, setting a first threshold to 10, and setting a second threshold to 5 minutes.
- the peer-to-peer network mentioned in the historical information of the node joining the peer-to-peer network may be a designated peer-to-peer network, such as the peer-to-peer network that the node requests to join, or all peer-to-peer networks.
- the node is refused to join the peer-to-peer network. Further, the request message may be discarded, and the log is generated or an alarm message is generated, and then the process ends.
- the node may be notified to re-apply to join the peer-to-peer network after a specified time. For example, if the local device is busy, reject the current application of the node and set a delay time of 30 minutes to notify the node to re-apply the next application after 30 minutes.
- the node may also add the related information of the current application to the peer-to-peer network, such as the result of the control (reject or allow to join), to record the history information of the saved node joining the peer-to-peer network, so as to facilitate the subsequent receiving of the join pair.
- the request message of the network is received, the judgment is made based on the result of the current control.
- the method shown in this embodiment determines the legitimacy of the node according to the historical information of the node joining the peer network, and determines that the node is not allowed to join the peer network when the node is not allowed to join the peer-to-peer network.
- Controlling the joining of nodes to the peer-to-peer network restricts the nodes from joining the peer-to-peer network frequently, which solves to some extent the peer-to-peer network routing jitter, resource unavailability or even loss due to the frequent entry of malicious nodes into the peer-to-peer network. And problems such as node denial of service. Compared with the existing Puzzle mechanism, there is no need to store a large number of problems, which greatly saves overhead and has better control effects.
- it may judge according to the frequency of receiving the request message, or judge according to the time of the node staying, or combine to judge, Single convenient, easy to implement, and more flexible to apply.
- FIG. 2 is a flowchart of another method for a control node to join a peer-to-peer network according to an embodiment of the present disclosure, where the method specifically includes:
- whether to allow the node to join the peer-to-peer network may be performed in various manners, including but not limited to the following:
- the specified time and the third threshold may be set as needed, such as setting the specified time to 1 hour and setting the third threshold to 50.
- the peer-to-peer network mentioned in the history information of the received request message for joining the peer-to-peer network may be a designated peer-to-peer network, such as the peer-to-peer network that the node requests to join, or all peer-to-peer networks.
- the node may be notified to re-apply to join the peer-to-peer network after a specified time.
- the node may also add the related information of the current application to the peer network, such as the result of the control (reject or allow to join), to record the history information of the saved request message of joining the peer network, so as to facilitate subsequent receiving.
- the request message of the peer-to-peer network is combined with the result of the current control, the judgment is made.
- the method shown in this embodiment determines the legality of the node according to the historical information of the received request message that is added to the peer-to-peer network, and refuses to join the node when it is determined that the node is not allowed to join the peer-to-peer network.
- the peer-to-peer network implements the control of the node joining the peer-to-peer network, which restricts the nodes from joining the peer-to-peer network frequently, thus solving the peer-to-peer network route jitter caused by the malicious nodes frequently joining the peer-to-peer network. Resources are unavailable or even lost and nodes are denied service. Compared with the existing Puzzle mechanism, there is no need to store a large number of problems, which greatly saves overhead and has better control effects.
- the two judgments are in no particular order, and may be determined according to the history information of the peer network added to the peer network, or may be based on the received The history information of the request message of the peer-to-peer network is determined, and the specific judgment process and the subsequent process are the same as those in the foregoing embodiment, and details are not described herein again.
- better control effects can be achieved, avoiding nodes joining the peer-to-peer network too frequently, and better mitigating peer-to-peer network route jitter, resource unavailability or even loss due to frequent joining of malicious nodes. Node denial of service and other issues.
- the functions of the foregoing technical solutions provided for determining the nodes that request to join the peer-to-peer network and the corresponding processing functions may be integrated on the registration server in the peer-to-peer network, or may be integrated on the peer nodes in the peer-to-peer network. , such as a bootstrap node, a peer node that provides peer-to-peer network services for client nodes, and so on.
- the peer node When integrated on the peer node, the peer node can obtain historical information of the node to apply for joining from the registration server; if the peer node is fixed in the network deployment relative to the node to apply for (such as a gateway), The iB hai peer node can collect the history information of the node to which the application is applied; and all the peer nodes can record the history information of the node to which the application is applied as a kind of resource, and store the pair with the distributed storage service of the peer-to-peer network. On the network, to get it from the peer-to-peer network when needed.
- peer node 1 there are seven peer nodes in the peer-to-peer network, peer node 1 to peer node 7, and the registration server is connected to peer node 1 and peer node 2, respectively.
- the peer node 1 requests to join the peer-to-peer network, it can be judged and processed by the registration server integrated with the above functions, or can be judged and processed by other nodes integrated with the above functions, such as the peer node 2.
- peer nodes can be coupled with SIP functions, such as SIP Proxy Server (proxy server) function, SIP Redirect Server.
- SIP Proxy Server proxy server
- SIP Redirect Server SIP Redirect Server
- SIP UA User Agent
- SIP UA User Agent
- Client nodes are usually coupled to SIP UA functions.
- P2P SIP Peer Protocol communication between peer nodes, client nodes and peer nodes without SIP coupling use P2P SIP ClientProtocol communication, SIP SIP communication is used between the UA entity and the peer node that is coupled with the SIP Proxy Server function or the SIP Redirect Server function.
- the following takes the P2P SIP network reference model as an example to illustrate the process of joining a peer node and a client node to a peer-to-peer network.
- the process of adding a peer-to-peer network to a peer-to-peer network is described as an example of the peer node 1 in Figure 3 requesting to join the peer-to-peer network.
- the process is as follows:
- the peer node 1 sends a Join request message requesting to join the peer network to the registration server;
- the registration server determines whether to allow the peer node 1 to join the peer-to-peer network according to the above method, and if not, rejects absolutely wait for node 1 to join the peer network, discarding the Join request message;
- the registration server If the peer node 1 is allowed to join the peer-to-peer network, the registration server returns information such as the peer node identifier, the boot node list, and the like allocated to the peer node 1;
- Peer node 1 sends a Join request message to Peer node 2 (the boot node specified by the registration server for Peer node 1);
- the peer node 2 forwards the Join request message to the peer node 3 (responsible for the licensed node identified by the peer node 1);
- the peer node 3 replies a Response message to the peer node 2;
- the peer node 2 forwards the Response message to the peer node 1, thereby completing the process in which the peer node 1 establishes a connection with the peer node 3, and ends the peer node 1 joining the peer-to-peer network.
- the malicious peer nodes can be restricted from joining the peer-to-peer network frequently, thus solving the peer-to-peer network routing caused by the malicious peer nodes frequently joining the peer-to-peer network. Jitter, resource unavailability or even loss and node denial of service.
- FIG. 5 a schematic diagram of a process for joining a peer node to a peer-to-peer network is illustrated by the client node 1 in FIG. 3 requesting to join the peer-to-peer network.
- the process is as follows:
- the client node 1 sends a Join request message requesting to join the peer network to the registration server;
- the registration server determines, according to the foregoing method, whether the client node 1 is allowed to join the peer-to-peer network. If not, the client node 1 is denied to join the peer-to-peer network, and the request message is discarded.
- the registration server If the client node 1 is allowed to join the peer-to-peer network, the registration server returns information such as the client node identifier, the candidate contact node list, and the like assigned to the client node 1, wherein the candidate contact node includes the peer node 1 and the peer node 2;
- the client node 1 sends an Inquire request message to the peer node 1;
- the client node 1 sends an Inquire request message to the peer node 2;
- the peer node 1 replies a Response message to the client node 1, and carries information about the peer network service that the peer node 1 can provide, such as the DHT algorithm and the status information of the peer node 1;
- the peer node 2 replies a Response message to the client node 1, and carries information about the peer-to-peer network service that the peer node 2 can provide, such as the DHT algorithm and the status information of the peer node 2;
- the client node 1 selects the peer node 1 as the contact node according to the received information, and sends a Join request message to it;
- the peer node 1 replies with a Response message, if the Join request message sent by the client node 1 is not carried. To authenticate the required identity information, the peer node 1 sends a response message to the client node 1, and carries a response code 404 in the response message, requesting the client node 1 to provide identity information;
- the response code 404 can be carried by w/404.
- the client node 1 sends a Join request message carrying the identity information to the peer node 1;
- the peer node 1 replies with a Response response message, thereby completing the process in which the client node 1 establishes a connection with the peer node 1 and ends the client node 1 joining the peer-to-peer network.
- the client node 1 If the client node 1 provides the identity information in step 408, the client node 1 establishes a connection with the peer node 1 after the peer node 1 replies to the Response message in step 409, and does not need to send a response message to the client node 1, and does not need to execute. Steps 410 and 411.
- the malicious client node can be restricted from joining the peer-to-peer network frequently, thereby alleviating the performance degradation or even rejection of the peer node directly connected to the client node due to frequent entry of the malicious client node into the peer-to-peer network. service.
- an embodiment of the present invention further provides an apparatus for a control node to join a peer-to-peer network, which specifically includes: a receiving module 501, configured to receive a request message that a node joins a peer-to-peer network;
- the processing module 502 is configured to: after receiving the request message, the receiving module 501 determines, according to at least one of the historical information of the node joining the peer network and the received history information of the request message added to the peer network, When the node is allowed to join the peer-to-peer network, the node is denied to join the peer-to-peer network.
- the processing module 502 specifically includes:
- a first processing unit configured to determine, after the receiving module receives the request message, whether the number of request messages that the node receives the peer network in the specified time is higher than a preset first threshold, and if yes, rejects This node joins the peer-to-peer network.
- processing module 502 specifically includes:
- a second processing unit configured to: after the receiving module receives the request message, determine whether an average time that the node stays on the peer network multiple times is lower than a preset second threshold, and if yes, reject the node to join the pair Waiting for the network.
- processing module 502 specifically includes:
- a third processing unit configured to determine, after the receiving module receives the request message, whether the number of all the request messages received into the peer-to-peer network received within the specified time is higher than a preset third threshold, and if yes, rejecting This node joins the peer-to-peer network.
- the above device further includes:
- the recording module 503 is configured to record, after the processing module 502 rejects the node to join the peer-to-peer network, record information about the node applying to join the peer-to-peer network. Further, referring to FIG. 8, the foregoing apparatus may further include:
- the notification module 504 is configured to notify the node to re-apply to join the peer-to-peer network after the specified time after the processing module 502 rejects the node to join the peer-to-peer network.
- the device shown in this embodiment determines the legal component of the node to which the application is applied, and when it is determined that the node is not allowed to join the peer-to-peer network, the node is denied to join the peer-to-peer network, and the node is added to the peer-to-peer network.
- Controlling restricting the nodes from joining the peer-to-peer network frequently, solves the problem of peer-to-peer network routing jitter, resource unavailability or even loss, and node denial of service due to the frequent entry of malicious nodes into the peer-to-peer network.
- there is no need to store a large number of problems which greatly saves overhead and has better control effects.
- Embodiments of the invention may be implemented in software, and the corresponding software program may be stored in a readable storage medium, such as a hard disk, a cache, or an optical disk of a computer.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Mathematical Physics (AREA)
- Theoretical Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Computer And Data Communications (AREA)
Description
Claims
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
KR1020107023679A KR101141127B1 (ko) | 2008-04-11 | 2009-03-30 | 동등 계층 네트워크에 접속하기 위해 노드를 제어하기 위한 방법 및 장치 |
EP09730726.8A EP2259507B1 (en) | 2008-04-11 | 2009-03-30 | Method and device for controlling a node to join in a peer-to-peer network |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN 200810103905 CN101557335B (zh) | 2008-04-11 | 2008-04-11 | 控制节点加入对等网络的方法和装置 |
CN200810103905.6 | 2008-04-11 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2009124482A1 true WO2009124482A1 (zh) | 2009-10-15 |
Family
ID=41161543
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2009/071080 WO2009124482A1 (zh) | 2008-04-11 | 2009-03-30 | 控制节点加入对等网络的方法和装置 |
Country Status (4)
Country | Link |
---|---|
EP (1) | EP2259507B1 (zh) |
KR (1) | KR101141127B1 (zh) |
CN (1) | CN101557335B (zh) |
WO (1) | WO2009124482A1 (zh) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102480422B (zh) * | 2010-11-30 | 2016-03-02 | 中兴通讯股份有限公司 | P2p终端在p2p叠加网中的通讯方法和系统 |
CN106412091A (zh) * | 2016-10-25 | 2017-02-15 | 广东欧珀移动通信有限公司 | 数据传输的控制方法、装置及系统 |
CN109561160A (zh) * | 2019-01-28 | 2019-04-02 | 众安信息技术服务有限公司 | 基于分布式哈希列表的网络初始节点引导方法及设备 |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040083304A1 (en) * | 2002-10-21 | 2004-04-29 | Izumi Usuki | Communication terminal and communication system |
US20040181575A1 (en) * | 2003-03-11 | 2004-09-16 | Visual Circuits Corporation | Method and apparatus for providing peer-to-peer push using broadcast query |
CN101035270A (zh) * | 2007-04-19 | 2007-09-12 | 苏州鹞鹰数据技术有限公司 | 基于互联网络的对等视频监控方法 |
CN101060455A (zh) * | 2007-06-13 | 2007-10-24 | 中兴通讯股份有限公司 | 一种p2p网络应用方法 |
Family Cites Families (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7457874B2 (en) * | 2004-02-20 | 2008-11-25 | Microsoft Corporation | Architecture for controlling access to a service by concurrent clients |
KR100468374B1 (ko) * | 2004-07-06 | 2005-01-31 | 주식회사 잉카인터넷 | 네트워크 유해 트래픽 제어 장치 및 방법 |
EP1847081B1 (en) * | 2005-02-07 | 2014-12-24 | BRITISH TELECOMMUNICATIONS public limited company | Policing networks |
US20060256729A1 (en) * | 2005-05-10 | 2006-11-16 | David Chen | Method and apparatus for identifying and disabling worms in communication networks |
US20070233832A1 (en) * | 2006-03-30 | 2007-10-04 | Matsushita Electric Industrial Co., Ltd. | Method of distributed hash table node ID collision detection |
-
2008
- 2008-04-11 CN CN 200810103905 patent/CN101557335B/zh not_active Expired - Fee Related
-
2009
- 2009-03-30 KR KR1020107023679A patent/KR101141127B1/ko active IP Right Grant
- 2009-03-30 EP EP09730726.8A patent/EP2259507B1/en not_active Not-in-force
- 2009-03-30 WO PCT/CN2009/071080 patent/WO2009124482A1/zh active Application Filing
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20040083304A1 (en) * | 2002-10-21 | 2004-04-29 | Izumi Usuki | Communication terminal and communication system |
US20040181575A1 (en) * | 2003-03-11 | 2004-09-16 | Visual Circuits Corporation | Method and apparatus for providing peer-to-peer push using broadcast query |
CN101035270A (zh) * | 2007-04-19 | 2007-09-12 | 苏州鹞鹰数据技术有限公司 | 基于互联网络的对等视频监控方法 |
CN101060455A (zh) * | 2007-06-13 | 2007-10-24 | 中兴通讯股份有限公司 | 一种p2p网络应用方法 |
Also Published As
Publication number | Publication date |
---|---|
EP2259507B1 (en) | 2016-08-03 |
CN101557335A (zh) | 2009-10-14 |
EP2259507A1 (en) | 2010-12-08 |
KR20100123775A (ko) | 2010-11-24 |
KR101141127B1 (ko) | 2012-05-07 |
EP2259507A4 (en) | 2011-03-23 |
CN101557335B (zh) | 2012-11-21 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
JP4642022B2 (ja) | 通信端末、通信方法、プログラムおよび通信システム | |
EP2230799B1 (en) | User data server system, method and device | |
EP4218169A1 (en) | Methods, systems, and computer readable media for mitigating spoofing attacks on security edge protection proxy (sepp) inter-public land mobile network (inter-plmn) forwarding interface | |
JP2023553496A (ja) | 第5世代(5g)通信ネットワークにおいてメッセージ検証を実行するための方法、システムおよびコンピュータ可読媒体 | |
US8914867B2 (en) | Method and apparatus for redirecting data traffic | |
US8424086B2 (en) | Suppression of malicious SIP messages using the resource priority header | |
US9113031B2 (en) | Call control for conferencing calls | |
US9246906B1 (en) | Methods for providing secure access to network resources and devices thereof | |
WO2010003354A1 (zh) | 认证服务器及虚拟专用网的移动通信终端接入控制方法 | |
WO2009109118A1 (zh) | 一种终端接入控制方法、网络设备及系统 | |
US20110078312A1 (en) | Method and system for monitoring incoming connection requests in a Peer-to-Peer network | |
JP2024518417A (ja) | 単一使用認証メッセージのための方法、システム、およびコンピュータ可読媒体 | |
WO2009155817A1 (zh) | 一种维护引导节点状态的方法、装置和系统 | |
WO2011079650A1 (zh) | 即时通讯控制的实现方法和系统 | |
WO2022121589A1 (zh) | 一种数据信息获取方法、装置、相关设备及介质 | |
WO2009124482A1 (zh) | 控制节点加入对等网络的方法和装置 | |
WO2011120365A1 (zh) | 多穴终端建立连接的方法和系统 | |
US20040162899A1 (en) | Terminating a session in a network | |
US11582258B2 (en) | Methods, systems, and computer readable media for mitigating denial of service (DoS) attacks at network functions (NFs) | |
WO2012175006A1 (zh) | 基于点对点的网络管理方法及代理选择服务器 | |
CN116647538B (zh) | 一种能够访问不同内网服务的连接装置 | |
JP5112491B2 (ja) | Ip基盤の有線無線統合ネットワークのための統合信号処理装置およびその方法 | |
JP4561626B2 (ja) | 情報処理装置およびその制御方法ならびにコンピュータプログラム |
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: 09730726 Country of ref document: EP Kind code of ref document: A1 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
REEP | Request for entry into the european phase |
Ref document number: 2009730726 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2009730726 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 20107023679 Country of ref document: KR Kind code of ref document: A |