IP Library Granted Patent US 12,464,042
Granted Patent B2
US 12,464,042 · App. 18/414,692 · Granted Nov 4, 2025

Peer in hybrid peer-to-peer network and method of setting path between peers and method of communicating between peers

Inventors: Wook Hyun (Daejeon, KR); Changkyu Lee (Daejeon, KR); Mi Young Huh (Daejeon, KR)
Assignee: ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE
H04L67/1048H04L45/02H04L45/18H04L45/22H04L45/24
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,464,042
App. No.
18/414,692
Granted
Nov 4, 2025
Kind
B2
Abstract

A method of setting a path between peers included in a hybrid P2P network is disclosed. The method comprises transmitting, by a first peer, a primary path setting message for setting a primary path between the first peer and a second peer to the second peer; transmitting, by the second peer, a response message to the primary path setting message including information about a third peer, which is a parent peer of the second peer having a primary path relationship with the second peer, to the first peer; and transmitting one or more messages for setting a vertical candidate path with the third peer between the first peer and the third peer using the information about the third peer.

Claims (40)

1 . A method of setting a path between peers included in a hybrid peer-to-peer (P2P) network, which is a path setting method performed in at least one peer included in the P2P network, comprising:

transmitting, by a first peer, a primary path setting message for setting a primary path between the first peer and a second peer to the second peer;

transmitting, by the second peer, a response message to the primary path setting message including information about a third peer, which is a parent peer of the second peer having a primary path relationship with the second peer, to the first peer; and

transmitting one or more messages for setting a vertical candidate path with the third peer between the first peer and the third peer using the information about the third peer,

wherein the transmitting of the one or more messages between the first peer and the third peer includes:

transmitting, by the first peer, a first message including a vertical candidate path parameter with the third peer to the third peer; and

transmitting, by the third peer, a second message to the first peer in response to the first message,

wherein, in the second message, a value of a field related to the primary path is set to a value corresponding to “negative” to prevent a loop between the first peer, the second peer, and the third peer from being formed.

2 . The method of claim 1 , wherein the transmitting of the one or more messages between the first peer and the third peer further includes, when the first peer receives the second message, transmitting a vertical candidate path setting message for setting the vertical candidate path with the third peer to the third peer.

3 . The method of claim 1 , further comprising, when the first peer receives the second message and all of candidate paths in a candidate path pool of the first peer are occupied, terminating one with a peer having a highest ticket-id among of a plurality of preset candidate paths to set the vertical candidate path between the first peer and the third peer.

4 . The method of claim 1 , further comprising setting the vertical candidate path between the first peer and the third peer as a first-priority candidate of a new primary path for replacing the primary path between the first peer and the second peer in a case in which the second peer leaves the network or is expelled from the network.

5 . The method of claim 1 , further comprising sharing, by the second peer, the primary path setting message with one or more peers having the primary path relationship with the second peer.

6 . The method of claim 1 , wherein, in the transmitting of the primary path setting message to the second peer, the second peer from among one or more peers having candidate paths with the first peer is determined as a counterpart peer on the primary path, and the primary path setting message is transmitted to the second peer.

7 . The method of claim 1 , further comprising:

transmitting, by the third peer, an expulsion notification message for the second peer to the first peer and the second peer;

checking, by the first peer, whether the expulsion notification message for the second peer has been redundantly received from the second peer based on a number of the expulsion notification message for the second peer;

when it is determined that the expulsion notification message is a normal message and is not received redundantly, updating, by the first peer, the sequence number of the expulsion notification message to a latest sequence number and storing the latest sequence number; and

transmitting, by the first peer, the expulsion notification message for the second peer to all remaining peers among peers having a primary path relationship and a candidate path relationship with the first peer, except for peers on the path through which the expulsion notification message for the second peer has already been transmitted.

8 . The method of claim 7 , further comprising selecting, by the first peer, the vertical candidate path between the first peer and the third peer as a new primary path that replaces the primary path between the first peer and the second peer and transmitting a second primary path setting message for setting the primary path between the first peer and the third peer to the third peer.

9 . The method of claim 8 , further comprising transmitting, by the third peer, a response message to the second primary path setting message including information about a fourth peer, which is a parent peer of the third peer having a primary path relationship with the third peer, to the first peer.

10 . A method of setting a path between peers included in a hybrid peer-to-peer (P2P) network, which is a path setting method performed in a peer included in the P2P network, comprising:

transmitting, by a first peer, a primary path setting message for setting a primary path between the first peer and a second peer to the second peer;

receiving, by the first peer, a response message to the primary path setting message from the second peer; and

transmitting, by the first peer, one or more messages for setting a vertical candidate path with a third peer to the third peer using information about the third peer included in the response message, wherein the third peer is a parent peer of the second peer having a primary path relationship with the second peer;

receiving, by the first peer, an expulsion notification message for the second peer from the third peer;

checking, by the first peer, whether the expulsion notification message for the second peer has been redundantly received from the second peer; and

transmitting, by the first peer, the expulsion notification message for the second peer to all remaining peers among peers having a primary path relationship and a candidate path relationship with the first peer, except for peers on the path through which the expulsion notification message for the second peer has already been transmitted.

11 . The method of claim 10 , wherein the transmitting of the one or more messages to the third peer includes:

transmitting a first message including a vertical candidate path parameter with the third peer to the third peer; and

receiving a second message from the third peer in response to the first message.

12 . The method of claim 11 , wherein the transmitting of the one or more messages to the third peer further includes, when the first peer receives the second message, transmitting a vertical candidate path setting message for setting the vertical candidate path with the third peer to the third peer.

13 . The method of claim 11 , further comprising, when the first peer receives the second message and all of candidate paths in a candidate path pool of the first peer are occupied, terminating any one of a plurality of preset candidate paths to set the vertical candidate path between the first peer and the third peer.

14 . A method of setting a path between peers included in a hybrid peer-to-peer (P2P) network, which is a path setting method performed in at least one peer included in the P2P network, comprising:

transmitting, by a first peer, a primary path setting message for setting a primary path between the first peer and a second peer to the second peer;

transmitting, by the second peer, a response message to the primary path setting message including information about a third peer, which is a parent peer of the second peer having a primary path relationship with the second peer, to the first peer; and

transmitting one or more messages for setting a vertical candidate path with the third peer between the first peer and the third peer using the information about the third peer;

transmitting, by the third peer, an expulsion notification message for the second peer to the first peer and the second peer;

checking, by the first peer, whether the expulsion notification message for the second peer has been redundantly received from the second peer based on a number of the expulsion notification message for the second peer;

when it is determined that the expulsion notification message is a normal message and is not received redundantly, updating, by the first peer, the sequence number of the expulsion notification message to a latest sequence number and storing the latest sequence number; and

transmitting, by the first peer, the expulsion notification message for the second peer to all remaining peers among peers having a primary path relationship and a candidate path relationship with the first peer, except for peers on the path through which the expulsion notification message for the second peer has already been transmitted.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 18, 2024
From: HYUN, WOOK; LEE, CHANGKYU; HUH, MI YOUNG
To: ELECTRONICS AND TELECOMMUNICATIONS RESEARCH INSTITUTE
Reel/Frame 066165/0199 →
Priority Claims (1)
KR 10-2023-0043512 · Apr 3, 2023 · national
Continuity (1)
Related Publication 20240333791A1 · Oct 3, 2024
References Cited (18)
US 8321539B2 · Ahn · 2012 [cited by examiner]
US 8381013B2 · Zheng · 2013 [cited by applicant]
US 9276808B2 · Mäenpääet al. · 2016 [cited by applicant]
US 11863621B2 · Mikonis · 2024 [cited by examiner]
US 20210099384A1 · Hyun · 2021 [cited by examiner]
US 20210314399A1 · Hyun · 2021 [cited by examiner]
CN 111541733B · 2022 [cited by applicant]
EP 2003845B1 · 2015 [cited by applicant]
JP 2009117944A · 2009 [cited by applicant]
JP 2009246698A · 2009 [cited by applicant]
KR 1020210038281A · 2021 [cited by applicant]
Yuh-Jzer Joung and Zhang-Wen Kin. “On the self-organization of a hybrid peer-to-peer system”, Journal of Network and Computer Applications 33 (2010) 183-202, 20 pages. (Year: 2010). [cited by examiner]
International Telecommunication Union. “Hybrid peer-to-peer communications: Functional architecture”, Series Q: Switching and Signalling, and Associated Measurements and Tests: Protocols and signalling for peer-to-peer … [cited by examiner]
International Telecommunication Union. “Hybrid peer-to-peer (P2P) communications: Tree and data recovery procedures”, Series Q: Switching and Signalling, and Associated Measurements and Tests: Protocols and signalling f… [cited by examiner]
Eng Keong Lua et al. “A Survey and Comparison of Peer-to-Peer Overlay Network Schemes”, IEEE Communications Surveys and Tutorials, Second Quarter 2005, vol. 7, No. 2, 22 pages. (Year: 2005). [cited by examiner]
Hatem Ismail et al., “A Composite Malicious Peer Eviction Mechanism for Super-P2P Systems,” IEEE, 2018. [cited by applicant]
Feng Wang et al., “A High-Feasibility Secure Routing against Malicious Peer in Structured P2P”, Mathematical Problems in Engineering, 2022. [cited by applicant]
Hatem Ismail et al., “Malicious peers eviction for P2P overlays,” IEEE, 2016. [cited by applicant]