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

Abstract

According to the present disclosure, a method of improving the performance of a P2P network using a peer pool performed in a terminal to download content in a peer-to-peer (P2P) network is provided. The method includes the steps of performing peer set setup-the peer set and swarm are not the same -; Creating a chunk download map for a content file to be downloaded-The chunk download map is downloaded from first file fragments of the content file to be downloaded by the terminal and one or more peers in the peer set Defining second file fragments of the file to be received-and transmitting the chunk download map to the peer set, wherein the method includes downloading the first file fragments, and the one or more peer sets And receiving the second file fragments from a peer of.

Description

P2P network performance improvement method 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 the transmission speed performance of a P2P network by using a cooperative pool between peers in a P2P network.

P2P Network P2P means'Peer-to-Peer' and refers to a network in which terminals communicate with each other in an equal position without a central server. Unlike the method of having to go through a host server to find information on the Internet, it is a method of receiving and sharing certain 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.

The one-to-many file sharing method is a method of dividing one content file into several pieces and exchanging pieces between each client. The client creates a session with the client that owns/shares the pieces of the content file and requests the transfer of the necessary pieces. When each client finds a new client sharing a content file, it informs the information of the fragment it has and requests the fragment it needs from the new client. Because of this method, one client creates a myriad of sessions with multiple clients, and as the sessions continue to increase, the download speed of the user gradually increases to the maximum bandwidth of the Internet environment used by the client. Increases.

In the case of content without some seeds/peers in a P2P network, there is a problem that it takes a long time to download.

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

In a P2P network, when downloading data, there is a need for a method of increasing the performance of a specific peer by configuring a pool for peers to improve performance based on the feature that the download performance increases when several peers cooperate.

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

In a P2P network, there is a need for a method of improving performance by providing a part of their storage to other peers in a peer pool as shared storage.

According to the present disclosure, a method of improving the performance of a P2P network using a peer pool performed in a terminal to download content in a peer-to-peer (P2P) network is provided. The method includes the steps of performing peer set setup-the peer set and swarm are not the same -; Creating a chunk download map for a content file to be downloaded-The chunk download map must be downloaded from first file fragments of the content file to be downloaded by the terminal and one or more peers in the peer set. Defining second file fragments of the file to be performed, and transmitting the chunk download map to the peer set, the method comprising: downloading the first file fragments, and And receiving the second file fragments from a peer.

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

In one embodiment, the step of receiving the second file fragments from a peer of 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 above-described method may further include receiving the second file fragments from a peer other than a peer of the one or more peer sets.

In one embodiment, the above-described method further comprises the step of dividing and transmitting the first file fragments to peers of the one or more peer sets that transmitted the second file fragments after the terminal receives all the content files. can do.

In one embodiment, the above-described method may further include managing shared storage for storing chunks shared by the peer set.

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

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

According to the present disclosure, peers in a P2P network can increase performance by providing a part of their storage to other peers in a peer pool as shared storage.

1 is a diagram schematically showing a system environment in which a general swarm structured P2P system can be implemented.
FIG. 2 is a diagram schematically illustrating a system environment in which a swarm-structured P2P system comprising a set of peers can be implemented according to an embodiment of the present invention.
3 to 5 are diagrams illustrating shared storage of peers in peer 1 and a peer set of FIG. 1 according to an 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 dies according to an embodiment of the present invention.
7 and 8 are diagrams illustrating a method of managing shared storage (Least Recently Used (LRU)) 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. Hereinafter, when it is determined that there is a possibility that the subject matter of the present invention may be unnecessarily obscure, detailed descriptions of already known functions and configurations will be omitted. In addition, it should be understood that the content described below is only related to an embodiment of the present invention, and the present disclosure is not limited thereto.

Terms used in the present disclosure are only used to describe specific embodiments, and are not intended to limit the present invention. For example, a component expressed in the singular should be understood as a concept including a plurality of components unless the context clearly means only the singular. It is to be understood that the term "and/or" as used in this disclosure encompasses any and all possible combinations by one or more of the listed items. The terms "comprise" or "have" used in the present disclosure are only intended to designate the existence of features, numbers, steps, actions, components, parts, or a combination thereof described in the present disclosure. It is not intended to exclude the possibility of the presence or addition of one or more other features or numbers, steps, actions, components, parts, or combinations thereof by use.

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

Terms used in the present disclosure are as follows.

1. Seed refers to a node that has all the files to be shared and provides only file sharing services to other peers through upload.

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

3. Swarm is a group of peers related to a specific file. Includes seeds and peers.

4. Peer Pool is a group that provides shared storage in relation to a specific peer.

5. Contents chunk download map refers to a map that displays chunks to be downloaded by a specific peer among the same content.

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

1 is a diagram schematically showing a system environment in which a general swarm structured P2P system can be implemented. As illustrated, the system environment 100 may include a plurality of peers and swarms, which are a group of peers related to a specific file.

In an embodiment of the present disclosure, a specific peer may be included in a swarm and a peer set, respectively, and a peer set and a swarm are not the same. Those skilled in the art are well aware that there are various methods and modifications for configuring a swarm and peer set, and thus description thereof will be omitted.

As shown in Fig. 1, swarm1 is exchanging content 1 between four peers including Peer1, and swarm2 is a number of four peers including Peer2. Content 2 is being exchanged between peers. In addition, Peer3, Peer4, Peer5, etc. 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 swarm-structured P2P system comprising a set of peers can be implemented according to an embodiment of the present invention.

As shown in FIG. 2, a peer pool is configured, and the peer sets include Peer1, Peer2, Peer3, Peer4, and Peer5. 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 contents related to Swarm 1 and belong to the same peer set. Can be transmitted to peer 1. That is, Peer3, Peer4, and Peer5 belonging to the same peer set may help Peer1. In one embodiment, Peer3, Peer4, and Peer5 may download disjoint chunks received by Peer1 and store them in shared storage.

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

In one embodiment, Peer3, Peer4, and Peer5 unilaterally transmit a disjoint chunk received by Peer1 to Peer1. I can. In other words, peers, a customary rule of P2P, perform upload and download at the same time, and the chunks received from Peer1 are not subject to the rule that they can download in proportion to the uploaded traffic. Even if there is no, the chunk can be transmitted to Peer1.

3 to 5 are diagrams illustrating shared storage of peers in peer 1 and a peer set of FIG. 1 according to an embodiment of the present invention.

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

FIG. 4 is a diagram illustrating that when peer 1 downloads some chunks from peer 7 outside the same peer set and downloads all content 1 according to an embodiment of the present invention, peers within the same peer set are stored in storage. It is a diagram showing the state of the chunk being performed.

In an embodiment of the present disclosure, Peer1 may download some chunks from Peer7 outside the same peer set to download all of the content 1. In this case, the chunks downloaded to the shared storage of peers of the peer set may be missing some chunks as shown.

FIG. 5 is a case where Peer1 downloads some chunks from Peer7 outside the same peer set and downloads all of the contents 1 according to an embodiment of the present invention, Peer1 is an external peer. Fig. 7 is a diagram showing transmission of the downloaded chunk from Peer7 to peers in the same peer set.

In an embodiment, after completing the download of the content 1, Peer1 may transmit a chunk in which the peer aggregation peer set is not stored in the shared storage to the peer set. In an embodiment, Peer1 may distribute the number of chunks arithmetically equally divided. In one embodiment, Peer3, Peer4, and Peer5 may store the received chunk in their shared storage.

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

As described in FIG. 5, since the content 1 of Peer1 is distributed and stored among peers in the peer set, the content 1 may exist in the peer set even if Peer1 disappears. In one embodiment, when Peer3 requests content 1, the chunks that have already been downloaded to Peer3's own shared storage and the chunks in the shared storage of Peer4 and Peer5 are received. I can. In one embodiment, in a peer set, peers are not subject to the rule that peers, a customary rule of P2P, perform simultaneous upload and download, and download in proportion to the uploaded traffic. 3 (Peer3) can receive content 1 quickly.

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

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

8 is a diagram illustrating a method of appropriately replacing stored chunks with new chunks (Least Recently Used: LRU) according to an embodiment of the present invention.

Peers cannot provide an infinite size of shared storage for a set of peers, so a method is needed to properly replace stored chunks with new chunks.

In one embodiment, a peer downloads new content for another node in the peer set, and if shared storage is insufficient, it may sequentially replace the chunk of content downloaded/used the oldest. For example, the oldest item can be discarded.

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

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

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

In the above, various embodiments of the present invention have been illustrated and described, but the present invention is not limited to the specific embodiments described above, and the above-described embodiments deviate from the gist of the present invention claimed in the appended claims. Without this, various modifications may be made by those of ordinary skill in the art to which the present invention pertains, and these modified embodiments should not be understood separately from the technical spirit or scope of the present invention. Therefore, the technical scope of the present invention should be defined only by the appended claims.

Claims (6)

As a method of improving the performance of a P2P network by using a peer pool performed by a terminal to download content from a peer-to-peer (P2P) network,
Performing peer set setting-the peer set is a group providing shared storage in relation to a specific peer, a swarm is a group of peers related to a specific file, and the peer set and the swarm are not the same -;
Creating a chunk download map for a content file to be downloaded-The chunk download map must be downloaded from first file fragments of the content file to be downloaded by the terminal and one or more peers in the peer set. Defining second file pieces of the file to be done -, and
And transmitting the chunk download map to the peer set,
The above method is
Downloading the first file fragments,
Receiving the second file fragments from a peer of the one or more peer sets; And
After the terminal receives all the content files, dividing and transmitting the first file fragments to peers of the one or more peer sets that transmitted the second file fragments.
A method of improving the performance of a P2P network using a peer set including a. The method of claim 1,
The first file fragments and the second file fragments do not overlap each other, and each of one or more peers in the peer set downloads different second file fragments. A method of improving the performance of a P2P network using a peer set. The method of claim 2,
Receiving the second file fragments from the peers of the one or more peer sets may be performed using a peer set that receives the second file fragments unilaterally without compensation for the terminal receiving the second file fragments. How to improve the performance of P2P networks. The method of claim 3,
The method further comprises receiving the second file fragments from a peer other than a peer of the one or more peer sets. delete The method of claim 1,
The method further comprises managing shared storage for storing the chunks shared by the peer set.

Images