KR20190134539A - Method for improving performance in peer-to-peer network using peer pool - Google Patents

Abstract

The present invention provides a method which improves the performance of a peer-to-peer (P2P) network using a peer pool and is performed by a terminal to download content from the P2P network. The method comprises: a step of performing a peer pool configuration, wherein the peer pool and a swarm are not equal; a step of generating a chuck download map for a content file to be downloaded, wherein the chuck download map defines first file fragments of the content file to be downloaded by the terminal and second file fragments of the file to be downloaded from one or more peers in the peer pool; and a step of transmitting the chuck download map to the peer pool. The method further comprises: a step of downloading the first file fragments; and a step of receiving the second file fragments from the one or more peers of the peer pool.

Description

How to improve P2P network performance using peer set {METHOD FOR IMPROVING PERFORMANCE IN PEER-TO-PEER NETWORK USING PEER POOL}

The present invention relates to a P2P network, and more particularly, to a method of improving a transmission speed performance of a P2P network by utilizing a cooperative pool between peers in a P2P network.

P2P Network P2P means 'peer-to-peer' and means a network where each terminal communicates in an equal position without a central server. Unlike traditional methods of going through a host server to find information on the Internet, it is a method of receiving and sharing information or services directly from all personal computers connected to the Internet. P2P technology was first widespread and popularized by file sharing applications such as Napster and KaZaA.

One-to-many file sharing is a method of dividing a piece of content file into pieces and exchanging pieces between clients. The client creates a session with the client that owns / shares the pieces of the content file and requests a transfer for the required pieces. When each client finds a new client sharing a content file, it tells them what piece of information it has and asks the new client for the piece they need. Because of this approach, one client can create multiple sessions with multiple clients, and as the sessions continue to grow, the user's download speed gradually increases, up to the maximum bandwidth of the Internet environment the client uses. Increases.

Some seed / peerless content in a P2P network has a long download time.

If the seed leaves the P2P network, there is a problem that the content itself cannot be downloaded.

In the P2P network, when downloading data, when peers cooperate, the download performance is increased. Therefore, peers need a method of improving the performance of a specific peer by configuring a pool to improve performance.

There is a need for a method in which peers in a P2P network share their resources (storage / bandwidth) to increase the download speed while increasing the availability of the content.

There is a need for peers in a peer-to-peer network to improve performance by providing part of their storage as shared storage to other peers in the peer pool.

According to the present disclosure, a method for improving the performance of a P2P network utilizing a peer pool performed at a terminal for downloading content from a peer-to-peer network is provided. The method includes performing peer set establishment, wherein the peer set and swarm are not identical; Creating a chunk download map for the content file to be downloaded, wherein the chunk download map is to be downloaded from the first file fragments of the content file to be downloaded by the terminal and at least one peer in the peer set; Defining second file fragments of the file to perform, and transmitting the chunk download map to the peer set, wherein the method comprises downloading the first file fragments; and Receiving the second file pieces from a peer.

In one embodiment, the first file fragments and the second file fragments do not overlap with each other, and each of the one or more peers in the peer set may download the same second file fragments.

In one embodiment, receiving the second file fragments from a peer in one or more peer sets may unilaterally receive the second file fragments without compensating for the terminal to receive the second file fragments. have.

In one embodiment, the method may further comprise receiving the second file pieces from a peer that is not a peer of the one or more peer aggregation.

In one embodiment, the method further comprises the step of transmitting, after the terminal has received all of the content file, the first file fragments divided and transmitted to the peers of the one or more peer sets that have sent the second file fragments. can do.

In one embodiment, the method may further comprise managing shared storage for storing chunks shared by the peer set.

According to the present disclosure, in a P2P network, when downloading data, multiple peers may cooperate to improve download performance.

According to the present disclosure, peers in a P2P network can share their resources (storage / bandwidth) to increase the download speed while increasing the availability of the content.

According to the present disclosure, peers in a P2P network may improve performance by providing a portion of their storage as shared storage to other peers in a peer pool.

1 is a diagram schematically illustrating a system environment in which a P2P system having a general swarm structure may be implemented.
FIG. 2 is a diagram schematically illustrating a system environment in which a P2P system having a swarm structure constituting a peer set may be implemented according to an embodiment of the present invention.
3 through 5 illustrate shared storage of peers 1 and peers in a set of peers in accordance with one embodiment of the present invention.
FIG. 6 is a diagram illustrating shared storage of peers in a peer set when peer 1 of FIG. 1 disappears according to an embodiment of the present invention.
7 and 8 illustrate a method of managing shared storage (LRU (Least Recently Used)) according to an embodiment of the present invention.

Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings. In the following, when it is determined that there is a risk of unnecessarily obscuring the gist of the present invention, a detailed description of the known functions and configurations will be omitted. In addition, it should be understood that the following description only relates to one embodiment of the present invention, but the present disclosure is not limited thereto.

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. For example, a component expressed in the singular should be understood as a concept including a plurality of components unless the context clearly indicates the singular. It is to be understood that the term "and / or" as used in this disclosure encompasses all possible combinations by one or more of the listed items. The terms 'comprise' or 'having' as used in the present disclosure are merely intended to designate that there exists a feature, number, step, operation, component, part, or combination thereof described on the present disclosure. It is not intended to exclude the possibility of the presence or the addition of one or more other features or numbers, steps, actions, components, parts or combinations thereof by use.

In the embodiment of the present invention, the module or the unit means a functional part that performs at least one function or operation, and may be implemented by hardware or software or by a combination of hardware and software. Also, a plurality of 'modules' or 'units' may be integrated by at least one software module and implemented by at least one processor, except for 'modules' or 'units', which need to be implemented by specific hardware. have.

Terms used in the present disclosure are as follows.

1. Seed means a node that has all files to share and provides only file sharing service to other peers through upload.

2. Peer refers to a node that cooperates with other peers to download a file from a seed.

3. Swarm is a group of peers associated with a particular file. Seeds and peers are included.

4. Peer Pools are groups that provide shared storage for a particular peer.

5. Contents chunk download map refers to a map indicating chunks to be downloaded by a specific peer of the same content.

Hereinafter, with reference to the accompanying drawings, it will be described in detail an embodiment of the present invention.

1 is a diagram schematically illustrating a system environment in which a P2P system having a general swarm structure may be implemented. As shown, system environment 100 may include swarms, which are groups of peers, peers associated with a particular file.

In an embodiment of the present disclosure, a particular peer may be included in a swarm and a peer set respectively, and the peer set and the swarm are not identical. Those skilled in the art will appreciate that there are various ways and modifications to configure swarm and peer aggregation, so the description is omitted below.

As shown in FIG. 1, swarm1 (swarm1) exchanges content1 between four peers, including peer1 (Peer1), and swarm2 (swarm2) includes four peers, including peer2. Content2 is being exchanged between peers. Also, Peer3, Peer4, Peer5, and the like are peers on a P2P network that do not belong to Swarm 1 or Swarm 2.

FIG. 2 is a diagram schematically illustrating a system environment in which a P2P system having a swarm structure constituting a peer set may be implemented according to an embodiment of the present invention.

As shown in FIG. 2, a peer pool is configured, and a peer set includes peer1, peer2, peer3, peer4, and peer5. It includes.

According to an embodiment of the present disclosure, Peer3, Peer4, and Peer5 belonging to the same peer set do not belong to Swarm 1, but download content related to Swarm 1 and belong to the same peer set. Send to Peer1. That is, peer3, peer4, and peer5 belonging to the same peer set may help peer1. In an embodiment, Peer3, Peer4, and Peer5 may download and store in the shared storage a non-chunk chunk received by Peer1.

In one embodiment, a chunk download map may be created for a content file to be downloaded in order to download a chunk other than the chunk received by Peer1. In one embodiment, the chunk download map is a chunk (first file fragments) of the content file to be downloaded by Peer1 and a chunk of content file (second file fragments) to be downloaded from one or more peers in the peer set. ) Can be defined.

In one embodiment, Peer3, Peer4, and Peer5 unilaterally send the disjoint chunks received by Peer1 to Peer1. Can be. In other words, the conventional rule of P2P is that the chunks received from Peer1 are not subject to the rule that peers can simultaneously perform upload and download and download in proportion to the traffic they upload. If not, the chunk may be sent to Peer1.

3 through 5 illustrate shared storage of peers 1 and peers in a set of peers in accordance with one embodiment of the present invention.

FIG. 3 is a diagram illustrating chunks stored in storage by peers in the same peer set after Peer 1 downloads all of Content 1. FIG. As shown in FIG. 3, in an embodiment of the present disclosure, peer1 is a node that wants to download content1, and receives and stores all chunks of content1. Peer3, Peer4, and Peer5 in the set of peers to which Peer1 belongs can download the content to shared storage to assist Peer1, so some Can only have content (no need to download the entire chunk)

4 illustrates that peers in the same peer set are stored in storage when Peer1 downloads some chunks from Peer7 outside the same peer set and downloads all content 1 according to an embodiment of the present invention. It is a figure which shows the state of the chunk.

In one embodiment of the present disclosure, Peer1 may download some chunks from Peer7 outside of the same peer set and download all of Content 1. In this case, the chunks downloaded to the peer storage of the peer set's peers may be missing some chunks as shown.

FIG. 5 illustrates that when Peer1 downloads some chunks from Peer7 outside of the same peer set and downloads all content 1 according to an embodiment of the present invention, Peer1 is an external peer. 7 is a diagram illustrating the transmission of a chunk downloaded from Peer7 to peers in the same peer set.

In one embodiment, Peer1 may complete the download of Content1 and then send a chunk to the peer set whose peer aggregate peer set is not stored in shared storage. In one embodiment, Peer1 may distribute the number of chunks arithmetically evenly. In one embodiment, Peer3, Peer4, and Peer5 may store the received chunks in their shared storage.

FIG. 6 is a diagram illustrating shared storage of peers in a peer set when peer 1 of FIG. 1 disappears according to an embodiment of the present invention.

As described in FIG. 5, since content 1 of peer 1 is distributed to and stored in peers in peer set, content 1 may exist in the peer set even if peer 1 disappears. In one embodiment, when Peer3 requests Content1, it will receive the chunks that are already downloaded to Peer3's own shared storage, and the chunks in Peer4's and Peer5's shared storage. Can be. In one embodiment, peers, a peer-to-peer rule within a peer set, are not subject to the rule that they can both simultaneously upload and download and download in proportion to the traffic they upload. 3 (Peer3) can quickly receive the content1.

7 and 8 are diagrams illustrating a method of managing shared storage according to an embodiment of the present invention.

FIG. 7 is a diagram illustrating a method for storing content-specific chunks and distinguishing stored and unstored chunks from each peer according to an embodiment of the present invention. As shown, in one embodiment, each peer logically stores chunks of content and distinguishes between stored and unstored chunks, and may actually use contiguous storage in one store. In one embodiment, each peer may construct a map data structure in which chunk maps exist logically for each content for storage management and may actually store chunks of content in one contiguous storage.

FIG. 8 illustrates a method of properly replacing a stored chunk with a new chunk according to an embodiment of the present invention (Least Recently Used: LRU).

Because peers cannot provide infinite amount of shared storage for a set of peers, there is a need for a way to properly replace stored chunks with new chunks.

In one embodiment, if a peer downloads new content for another node in the peer set and lacks shared storage, it may sequentially replace the chunks of the longest downloaded / used content. For example, you can discard the oldest items first.

As shown, since the content 1 is the oldest, when the content 4 is downloaded, it can be deleted from the chunk of the content 1. In one embodiment, since one chunk is deleted, if only two chunks of content4 are received, two chunks of content1 may still remain in the shared storage.

In the embodiments disclosed herein, the arrangement of the components shown may vary depending on the environment or requirements on which the invention is implemented. For example, some components may be omitted or several components may be integrated and implemented as one. In addition, the arrangement order and connection of some components may be changed.

While the invention and its various functional components have been described in particular embodiments, the invention may be implemented in hardware, software, firmware, middleware, or a combination thereof, and the system, subsystem, components, or sub-configurations thereof. It should be understood that the elements can be utilized. If implemented in software, the elements of the present invention may be instructions / code segments for performing the necessary tasks. The program or code segments may be stored in a machine readable medium, a computer program product, such as a processor readable medium. Machine readable media or processor readable media may include any medium that can store or transmit information in a form readable and executable by a machine (eg, processor, computer, etc.).

Although various embodiments of the present invention have been illustrated and described above, the present invention is not limited to the above-described specific embodiments, and the above-described embodiments deviate from the gist of the present invention as claimed in the appended claims. Without departing from the scope of the present invention pertains to those skilled in the art, various modifications may be made to those skilled in the art, and such modified embodiments should not be understood separately from the technical spirit or scope of the present invention. Accordingly, the technical scope of the present invention should be defined only by the appended claims.

Claims (6)

As a method of improving performance of a P2P network using a peer pool performed by a terminal for downloading content from a peer-to-peer network,
Performing peer set establishment, wherein the peer set and swarm are not identical;
Creating a chunk download map for the content file to be downloaded, wherein the chunk download map is to be downloaded from the first file fragments of the content file to be downloaded by the terminal and at least one peer in the peer set; Define second file fragments of the file to perform, and
Sending the chunk download map to the peer set,
The method is
Downloading the first file fragments, and
Receiving the second file fragments from a peer of the one or more peer aggregates
How to improve performance of a P2P network utilizing a peer set that includes. The method of claim 1,
And the first file fragments and the second file fragments do not overlap each other, and each of the one or more peers in the peer set utilizes a peer set capable of downloading the same second file fragments. The method of claim 2,
Receiving the second file fragments from a peer of the one or more peer aggregates utilizes a peer set that unilaterally receives the second file fragments without compensating for the terminal to receive the second file fragments. How to improve performance of a P2P network. The method of claim 3,
And the method further comprises receiving the second file fragments from a peer that is not a peer of the one or more peer sets. The method of claim 1,
And after the terminal has received all of the content file, splitting and transmitting the first file fragments to the peers of the one or more peer sets that have sent the second file fragments. How to improve performance of a P2P network. The method of claim 1,
The method further comprises managing shared storage for storing chunks shared by the peer set.

Images