KR101590099B1 - Apparatus and method for selecting neighbor peers - Google Patents

Abstract

The present invention relates to an apparatus and a method for selecting neighbor peers. The present invention relates to an apparatus for selecting the neighbor peer of a first peer which requires a reproduction point movement in a P2P streaming system. The apparatus includes a neighbor peer selecting part. The neighbor peer selecting part selects neighbor peers as second peers which satisfy a connection replacement condition among the candidate peers when all candidate peers which are reproduced in a relatively near point to the reproduction point which the first peer requires, are connected to other peers of which the number is same as the predetermined largest number of neighbor peers.

Description

[0001] APPARATUS AND METHOD FOR SELECTING NEIGHBOR PEERS [0002]

The present invention relates to an apparatus and method for selecting a neighboring peer, and more particularly, to an apparatus and method for selecting a neighboring peer for a peer requesting movement of a playback point in a peer to peer live streaming system .

2. Description of the Related Art [0002] With the recent development of networks and digitalization of broadcasting contents, IPTV (internet protocol television) services that combine communication services and broadcasting services are actively being provided. In the past, a server-client structure based on CDN (Content Distribution Network) was used to provide video streaming service on the Internet. However, research on P2P streaming technology that can configure the infrastructure with high scalability and low cost as the number of users has surged has been actively researched.

As a P2P streaming technology, VMesh, BulletMedia, and PONDER have been proposed to support an efficient video cassette recorder (VCR) function. These techniques were developed for P2P video on demand (VOD) streaming systems. In this VOD system, because the peers have already stored the entire video file, the user can easily obtain the desired amount of data by simply requesting the data required for the playback. The VCR function such as fast forwarding and rewinding is performed in addition to the normal speed reproduction, so that even if the reproduction speed is changed, necessary data can be predicted in advance, so buffering can be performed easily and effectively.

On the other hand, the P2P live streaming system for transmitting live broadcast data aims to view live broadcasts, so that only a minimum amount of data for smooth reproduction before and after the live broadcast time is buffered in the main memory. Up to now, P2P live streaming has been mainly focused on developing an effective overlay structure to reduce initial playback delay time or increase playback continuity, and studies on supporting VCR function have not been conducted until now.

P2P streaming has been largely tree based and mesh based. In the tree-based structure, once the tree is generated, the transmission delay time is short, but there is a problem that a tree needs to be newly formed every time each peer joins or leaves. In particular, when a peer close to the root leaves, the reconstruction time of the tree becomes considerably long. Due to the problems of the tree-based structure, researches on the mesh-based structure have been actively conducted recently. This structure ensures that each peer shares necessary data by sharing its stored data with other peers through a buffer map.

The mesh structure is advantageous in that the delay time due to connection and disconnection of the peers is smaller than that of the tree-based structure, and the performance is improved as the number of peers increases. However, there is a disadvantage in that the playback lag time with the source server increases because the data stored in other peers is transmitted in a pull manner. In other words, even if many peers are playing at the live view point, there is a considerable difference between peers when the channel is switched according to the time point when the channel is switched, compared with the source server.

On the other hand, efficient neighboring peer selection techniques have been studied in P2P live streaming systems. Techniques have been proposed to reduce network latency by selecting nearby peers as neighbors using mainly the locality of peers. In the mesh structure, all video is divided into chunks and transmitted between peers. For data transfer, each peer periodically sends a buffer map to neighboring peers for each chunk of the video to indicate whether it is storing the chunk. After receiving the buffer map, the neighboring peer checks the data needed by the neighboring peer and requests transmission if the peer has the data. At this time, since the uploading capacity of each peer used for P2P streaming is limited, the maximum number of neighboring peers to which each peer can connect is predetermined.

In conventional techniques, peers with the maximum number of neighborable neighboring peers already being excluded are excluded when neighboring peers are selected. In other words, previous researches focused on selecting the optimal neighboring peer among the currently connectable peers to improve the performance of the live streaming function, and considering neighboring peer selection method to move more precisely to a desired point when supporting the VCR function Did not do it. In particular, since the peers playing at the closest point to the playback time of the source server in the live section having a large number of playing peers are likely to be connected to the neighboring peers as many times as the maximum number of connectable peers, , Most peers attempting to move to a new location will have to move to a point far away from the desired live playback point and most newly connected peers will have to select the most recently accessed peers as neighboring peers.

1 and 2 are views for explaining a conventional neighboring peer selection method. In Fig. 1 and Fig. 2, the peers are displayed in a circular shape, and the numbers of the peers are displayed in a circular shape. In FIG. 1, the peer 19 is a peer that moves to the live point closest to the playback point of the server S at the current playback point. It is assumed that the maximum connectable neighboring peer number of each peer is four. At the time of live playback, many peers are concentrated, and all peers except peer 16, 17, and 18 are already connected to other peers by the maximum number of connections. Therefore, the peer 19 can not but select the peers 16, 17, and 18 to which neighboring peers are connected as shown in FIG. 2 as neighboring peers.

Since peers 16, 17, and 18 are the peers having the largest difference in playback time from the server in the live section, the peer 19 moves to the point where the difference is greatest from the desired moving point. Actually, the difference in playback time with the server is 50 seconds (when the width of the live section is 50 seconds), and when a specific peer has a playback time difference of 10 seconds from the server, (The rewind time is 10 seconds) after moving for 40 seconds by rewinding at a multiplication rate, and when it is intended to move to the live playback point again, it searches for peers with remaining number of neighboring peers connectable with the peer, When the time difference moves to the time point when the time difference becomes about 30 seconds, the peer moves to an older reproduction time point rather than an interval previously viewed by the peer. Therefore, there is a serious problem that the scene that was returned to the live point but was previously viewed at the live point is seen again after about 10 seconds.

An object of the present invention is to provide a neighboring peer selecting apparatus and method for allowing a peer to move to a desired playback point in a peer to peer live streaming system supporting a time-shift function.

Another object of the present invention is to provide an apparatus and method for selecting neighboring peers capable of reducing the playback delay time at the time of moving the playback point, while achieving high accuracy in moving the playback point in the P2P live streaming system.

The problems to be solved by the present invention are not limited to the above-mentioned problems. Other technical subjects not mentioned will be apparent to those skilled in the art from the description below.

A neighboring peer selecting apparatus according to an aspect of the present invention is an apparatus for selecting a neighboring peer of a first peer requesting movement of a playback point in a P2P streaming system, And a neighboring peer selecting unit that selects, as the neighboring peers, second peers satisfying a predetermined connection replacement condition among the candidate peers when all the candidate peers being reproduced are connected to other peers as many as the predetermined maximum neighboring peers .

In an embodiment of the present invention, the neighboring peer selecting unit may select a second peer that is connected to each other among the candidate peers and whose buffering amount is equal to or greater than a predetermined threshold value as the neighboring peer.

In one embodiment of the present invention, the neighboring peer selecting unit includes: a playback information managing unit for collecting and managing playback time information of peers currently connected to the P2P system; A candidate peer selecting unit that selects, from among the peers, the candidate peers being reproduced at a time point at which the first peer is relatively close to a reproduction time point at which the first peer requests movement; A determination unit for determining whether there is a candidate peer connected to another peer among the candidate peers less than the maximum neighboring peer number; Comparing the amount of buffering of the candidate peers with other candidate peers connected to the candidate peers to a threshold value when all candidate peers are connected to other peers by the maximum number of neighboring peers, And a neighboring peer determining unit that selects a candidate peer having the threshold value or more as the neighboring peer.

In an embodiment of the present invention, the neighboring peer selection unit may disconnect the connection between the second peers and connect the first peer with the second peers.

According to another aspect of the present invention, there is provided a method for selecting a neighboring peer of a first peer requesting movement of a playback point in a P2P streaming system, the method comprising: Determining if candidate peers are associated with another peer by a predetermined maximum number of neighboring peers; And selecting, as the neighboring peers, second peers satisfying a predetermined connection replacement condition among the candidate peers when all the candidate peers are connected to other peers as many as the maximum neighboring peers / RTI >

In one embodiment of the present invention, the step of selecting the second peers may select a second peer that is connected to each other among the candidate peers and whose buffering amount is equal to or greater than a preset threshold value as the neighboring peer have.

In one embodiment of the present invention, the step of determining whether all of the candidate peers are connected to another peer by the maximum number of neighboring peers comprises: collecting and managing the playback time information of the peers currently connected to the P2P system; Selecting candidate peers to be reproduced at a time point at which the first peer is relatively close to a reproduction time point at which the first peer requests movement; And determining whether there is a candidate peer that is connected to another of the candidate peers less than the maximum number of neighboring peers with another peer, wherein the step of selecting the second peers comprises: selecting all of the candidate peers as different from the maximum neighboring peers Comparing the amount of buffering of the candidate peers and other candidate peers connected to the candidate peers to a threshold value if the candidate peers are connected to the peer; And selecting a second peer whose buffering amount is equal to or greater than the threshold value among the candidate peers as the neighboring peer.

In one embodiment of the present invention, the neighboring peer selection method includes: releasing a connection between the second peers; And coupling the first peer with the second peer.

According to another aspect of the present invention, there is provided a recording medium on which a program for executing the neighboring peer selection method is recorded.

According to an embodiment of the present invention, in a peer to peer live streaming system supporting a time-shift function, peers that are playing at a desired playback point of the peer are already able to connect to the maximum connectable number There is provided a neighboring peer selecting apparatus and method for allowing a peer to move to a desired reproduction point even if the neighboring peer is connected to the neighboring peer.

In addition, according to the embodiment of the present invention, in the P2P live streaming system, when moving the playback point of the peer, the accuracy of moving the playback point can be improved and the playback delay time can be reduced.

The effects of the present invention are not limited to the effects described above. Unless stated, the effects will be apparent to those skilled in the art from the description and the accompanying drawings.

1 and 2 are views for explaining a conventional neighboring peer selection method.
3 is a block diagram of a neighboring peer selecting apparatus according to an embodiment of the present invention.
4 is a flowchart of a neighboring peer selection method according to an embodiment of the present invention.
5 is a conceptual diagram for explaining a neighboring peer selecting method according to an embodiment of the present invention.

Other advantages and features of the present invention and methods of achieving them will be apparent by referring to the embodiments described hereinafter in detail with reference to the accompanying drawings. However, the present invention is not limited to the embodiments disclosed below, and the present invention is only defined by the scope of the claims. Although not defined, all terms (including technical or scientific terms) used herein have the same meaning as commonly accepted by the generic art in the prior art to which this invention belongs. A general description of known configurations may be omitted so as not to obscure the gist of the present invention. In the drawings of the present invention, the same reference numerals are used as many as possible for the same or corresponding configurations. To facilitate understanding of the present invention, some configurations in the figures may be shown somewhat exaggerated or reduced.

The terminology used in this application is used only to describe a specific embodiment and is not intended to limit the invention. The singular expressions include plural expressions unless the context clearly dictates otherwise. In the present application, the terms "comprises", "having", or "having" are intended to specify the presence of stated features, integers, steps, operations, components, Steps, operations, elements, parts, or combinations thereof, whether or not explicitly described or implied by the accompanying claims.

Used throughout this specification may refer to a hardware component such as, for example, software, FPGA or ASIC, as a unit for processing at least one function or operation. However, "to" is not meant to be limited to software or hardware. &Quot; to " may be configured to reside on an addressable storage medium and may be configured to play one or more processors.

As an example, the term '~' includes components such as software components, object-oriented software components, class components and task components, and processes, functions, attributes, procedures, Routines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables. The functions provided by the components and components may be performed separately from the plurality of components and components, or may be integrated with other additional components.

The neighboring peer selection apparatus according to an embodiment of the present invention is provided to select a neighboring peer of a first peer requesting movement of a reproduction point in a P2P streaming system. The embodiment of the present invention disassociates existing peers at a desired playback point of the peer and associates the peer who wants to move the playback point with the released peers so that the peer can move to the nearest point So as to move the reproduction point of time.

In a P2P live streaming system, a tracker server periodically collects playback time information of currently connected peers so that each of the peers can use a time shift function such as playback time shift, fast forward and rewind, And the like. When each peer tries to move to a desired time point using the time shift function, peers that are connectable among the playing peers at a time close to the moving time stored by the peer are selected as neighboring peers. A skip list structure capable of managing a list of peers at each reproduction time point can be used to quickly perform searching according to a time point of peers.

The neighboring peer selecting apparatus according to the embodiment of the present invention may be configured such that when all the candidate peers being reproduced at a time when the first peer is relatively close to the reproduction time point at which the first peer is requested to move are connected to other peers by the predetermined maximum number of neighboring peers, The second peer satisfying a predetermined connection switching condition is selected as a neighboring peer. The neighboring peer selecting unit may select the second peers whose neighboring peers are connected to each other among the candidate peers and whose buffering amount is equal to or greater than a preset threshold value as neighboring peers for the first peer.

Accordingly, when a neighboring peer for a first peer is selected at the time of requesting movement of a reproduction point of a first peer, even if all the candidate peers currently playing at a desired reproduction point of the first peer are already connected by the maximum number of neighboring peers , A neighboring peer for the first peer can be selected through replacement of the peer connection. That is, by releasing the connection between the existing candidate peers at the desired playback point of the first peer and connecting the first peer to the released peers, the first peer can play back the first peer at a point nearest to the desired playback point You can move the viewpoint.

In other words, among the candidate peers, a peer satisfying a replacement condition is selected, and at least one of the neighboring peers connected to the selected peer is additionally selected, and the connection between the two peers (second peers) is released Then, a connection exchange may be performed in such a manner that the first peer and the second peer are connected to the peer that has performed the movement operation.

The second peers will not be able to receive the data for a period of time that is reconnected to the second peer after disconnecting the selected second peers. As a result, the second peers that are connected and connected can experience the playback interruption. Therefore, in order to prevent the regeneration continuity of the candidate peers to be subjected to the connection change from decreasing, the candidate peers (second peers) buffering the sufficient data are preferentially selected as the replacement peers and the connection is released.

3 is a block diagram of a neighboring peer selecting apparatus 100 according to an embodiment of the present invention. Referring to FIG. 3, the neighboring peer selecting apparatus 100 according to an exemplary embodiment of the present invention includes a neighboring peer selecting unit 120. In one embodiment, the neighboring peer selection unit 120 may be provided to a server terminal constituting a P2P live streaming system, for example, a tracker server side, but is not limited thereto.

The neighboring peer selection unit 120 selects a neighboring peer of the first peer when the first peer connected to the P2P streaming system requests the movement of the reproduction point. The neighboring peer selection unit 120 determines whether or not all of the candidate peers being reproduced at a time when the first peer is relatively close to the reproduction time point when the first peer is requested to move is connected to another peer by a predetermined maximum number of neighboring peers, Second peers satisfying the connection replacement condition are selected as neighboring peers.

In an embodiment of the present invention, the neighboring peer selection unit 120 selects a second peer whose amount of buffering is equal to or greater than a preset threshold value as a neighboring peer for the first peer, can do. In an embodiment of the present invention, the neighboring peer selection unit 120 can release the connection between the second peers and connect the first peer with the disconnected second peers.

The neighboring peer selection unit 120 may include a reproduction information management unit 122, a candidate peer selection unit 124, a determination unit 126, and a neighboring peer determination unit 128. In this case, The playback information management unit 122 collects and manages playback time information of peers currently connected to the P2P system. The candidate peer selection unit 124 selects the candidate peers that are playing at a point relatively close to the reproduction point at which the first peer requests movement from among the peers. The determination unit 126 determines whether there is a candidate peer connected to the other peers less than the maximum neighboring peers. The neighboring peer determination unit 128 compares the buffering amount of the candidate peers with other candidate peers connected to the candidate peers with a threshold value when all the candidate peers are connected to other peers by the maximum number of neighboring peers, A candidate peer whose buffering amount is equal to or greater than a threshold value is selected as a neighboring peer.

4 is a flowchart of a neighboring peer selection method according to an embodiment of the present invention. Referring to FIGS. 3 and 4, the playback information management unit 122 collects and manages playback time information of peers currently connected to the P2P system (S10). When the first peer among the peers requests the movement of the reproduction point, the candidate peer selection unit 124 searches for candidate peers playing at a point relatively close to the reproduction point at which the first peer requested movement (S20).

The determination unit 126 determines whether there is a candidate peer connected to the other peers less than the maximum neighboring peer number with the other peers (S30). If there are candidate peers connected to a smaller number of peers than the maximum number of neighboring peers, the first peer is connected to the candidate peer (S40). Accordingly, the first peer is connected to the candidate peer, and can move to a desired playback point.

If all the candidate peers are connected to other peers by the maximum number of neighboring peers at step S30, the neighboring-peer determining unit 128 compares the buffering amount of the candidate peers and the other candidate peers connected to the candidate peers with the threshold value And selects the second peers having the buffering amount equal to or higher than the threshold value among the candidate peers as neighboring peers (S50, S60). When a neighboring peer is selected, the neighboring peer selection unit 120 releases the connection between the selected second peers and connects the first peer with the second peers (S70, S80). Table 1 below shows an algorithm for selecting a neighboring peer for a peer who wishes to shift the playback point through a connection replacement.

A specific peer sends a move operation request message at the tracker server;
The tracker server specifies the peer playing at the nearest point in the sorted list based on the playback point;
while (1)
{
if (number of currently connected neighbors of the specified peer
<Maximum number of connectable peers)
{
Selected as neighboring peers;
}
else
{
if (buffered amount of specified peer> threshold)
{
for (the neighboring peer of the specified peer)
{
if (Buffering amount of the neighboring peer> Threshold &&
Buffering amount of each neighboring peer of the peer> threshold value)
Disconnect the specified peer from its neighboring peer
Connect with peer after request to move;
}
if (number of currently connected neighbors of the mobile requesting peer
> = Maximum connectable peers)
break;
The peer currently specified in the list based on the playback time
Specifies the peer of the next sequence of;
}

In one embodiment, when a particular peer requests a move operation, the neighboring peers can be searched in order to search for the peers playing at the closest point. First, a candidate peer is designated in the order closest to the desired point of view based on the reproduction time point. If the number of neighboring peers currently connected to the candidate peer is smaller than the maximum connectable number of peers, the neighboring peer is immediately selected as the neighboring peer. If this condition is not satisfied, the peer that can exchange the connection is checked without reducing the continuity of reproduction among the candidate peers. That is, it is checked whether the amount of buffering of the candidate peer is greater than a predetermined threshold value. If so, find a candidate peer to pair with the candidate peer among the neighboring peers associated with the candidate peer.

If the amount of buffering of the candidate peer is greater than the threshold and the amount of buffering of each neighboring peer of the candidate peer is greater than the threshold value, the connection between the candidate peer and the neighboring peer is released, . As described above, according to the embodiment of the present invention, peers closest to a desired point in time can be selected as neighboring peers through connection replacement even if peers at a desired reproduction time are already connected to the neighboring peers as many as possible. In this case, by selecting the peers to be connected in consideration of the current buffering state of each of the peers, the regeneration continuity of the target peers can be prevented from being decreased during the connection change. If there is no peer satisfying the condition of connection change, the peer connection is made in the same manner as the conventional neighboring peer selection method, and no further reduction of the reproduction continuity occurs.

5 is a conceptual diagram for explaining a neighboring peer selecting method according to an embodiment of the present invention. In Fig. 5, a circle symbol represents a peer, and a number of a peer is displayed in a circular shape. In FIG. 5, the peer 19 is a peer that has requested the reproduction time shift operation to the server reproduction time. Referring to FIG. 5, peer 1 disconnects from peer 3 satisfying the buffering condition and is connected to peer 19, although the number of already connectable peers is already the maximum. Similarly, Peer 5 and Peer 5 become neighbor peers of Peer 19 through a connection change. Unlike the playing peer 16, 17, 18 becoming a neighboring peer of the peer 19 at a time when the peer 19 is far away from the playback point at which the peer 19 wants to move, according to the embodiment of the present invention, Peers 1, 3, 5, and 10 playing at the nearest time point can be selected as neighboring peers of peer 19.

In the section where many peers are concentrated as in the live point, there is a high probability that there are many peers connected to the neighbor peers as many as the maximum number of connections. Therefore, in the case of the existing neighboring peer selection method, the probability that the peers move the viewpoint increases. On the other hand, in the case of the neighboring peer selecting method according to the embodiment of the present invention, even if neighboring peers are already connected to the maximum number of connectable peers, it is possible to connect peers close to a desired point through connection replacement, Much higher.

According to the embodiment of the present invention, since the peers moving to the live viewpoint can select neighboring peers closer to the playback point of the server than the conventional method through connection replacement, the playback time difference with the server is smaller than in the conventional method. Thus, according to the embodiment of the present invention, the reproduction time point distribution of the peers in the desired live reproduction interval can be further densified, and as a result, the degree of overlapping of the other peers with the reproduction interval becomes large, Data can be transmitted more quickly. In addition, since the target peer to be connected and replaced has a buffering amount exceeding the threshold value, there is a high possibility that it is possible to quickly receive necessary data at an early stage.

The neighboring peer selection method according to the embodiment of the present invention selects a peer having a buffering amount equal to or greater than a threshold value when designating a connection replacement target peer and selects a possibility that playback is interrupted even if data is not received during the connection replacement time Can be reduced to a minimum. Therefore, in the neighboring peer selecting method according to the embodiment of the present invention, the reproduction continuity is not substantially reduced due to the connection replacement operation of the peer, the accuracy of the reproduction time point movement can be improved, and the reproduction delay time after the movement calculation can be reduced.

As described above, the embodiment of the present invention proposes a method of selecting a neighboring peer so that the peer can move to a point nearest to a desired point in time when a peer performs a playback-point shift operation in a P2P live streaming system. In the embodiment of the present invention, even if the number of neighboring peers to which all of the peers being reproduced at a desired movement time is already the maximum, the connection between the existing peers can be released and the neighboring peers can be moved to a point closest to the desired point do. In addition, the peer that is buffering sufficient data is preferentially considered so that the renewal continuity of the peer to be replaced is not reduced. Therefore, according to the embodiment of the present invention, neighboring peers are selected through connection replacement, and the accuracy of the moving time is improved as compared with the conventional method, and the playback delay time after the moving operation is also improved.

The neighboring peer selection method according to an embodiment of the present invention can be implemented in a general-purpose digital computer that can be created as a program that can be executed in a computer and operates the program using a computer-readable recording medium. The computer readable recording medium may be a volatile memory such as SRAM (Static RAM), DRAM (Dynamic RAM), SDRAM (Synchronous DRAM), ROM (Read Only Memory), PROM (Programmable ROM), EPROM (Electrically Programmable ROM) Non-volatile memory such as EEPROM (Electrically Erasable and Programmable ROM), flash memory device, Phase-change RAM (PRAM), Magnetic RAM (MRAM), Resistive RAM (RRAM), Ferroelectric RAM But are not limited to, optical storage media such as CD ROMs, DVDs, and the like.

It is to be understood that the above-described embodiments are provided to facilitate understanding of the present invention, and do not limit the scope of the present invention, and it is to be understood that various modifications are possible within the scope of the present invention. It is to be understood that the technical scope of the present invention should be determined by the technical idea of the claims and the technical scope of protection of the present invention is not limited to the literary description of the claims, To the invention of the invention.

100: Neighboring peer selection device
120: Neighboring peer line
122: playback information manager
124: candidate peer selection unit
126:
128: Neighboring peer determination unit

Claims (9)

An apparatus for selecting a neighboring peer of a first peer requesting movement of a playback point in a P2P streaming system,
When all the candidate peers selected based on the reproduction time point at which the first peer requests movement are connected to other peers by a predetermined maximum number of neighboring peers, a second peer that satisfies a predetermined connection replacement condition among the candidate peers And a neighboring peer selecting unit for selecting the neighboring peers as the neighboring peers. The method according to claim 1,
Wherein the neighboring peer selecting unit selects the second peer as the neighboring peer, the neighboring peer being connected to each other among the candidate peers and each having a buffering amount equal to or greater than a preset threshold value. The method according to claim 1,
The neighboring-
A playback information management unit for collecting and managing playback time information of peers currently connected to the P2P system;
A candidate peer selecting unit for selecting the candidate peers based on a reproduction time point at which the first peer requests movement among the peers;
A determination unit for determining whether there is a candidate peer connected to another peer among the candidate peers less than the maximum neighboring peer number;
Comparing the amount of buffering of the candidate peers with other candidate peers connected to the candidate peers to a threshold value when all of the candidate peers are connected to other peers by the maximum number of neighboring peers, And a neighboring peer determining unit that selects a candidate peer having the threshold value or more as the neighboring peer. The method according to claim 1,
Wherein the neighboring peer selecting unit releases the connection between the second peers and connects the first peer to the second peers. A method for selecting a neighboring peer of a first peer requesting a playback point shift in a P2P streaming system,
Determining whether all candidate peers selected based on a reproduction time point at which the first peer requests movement are connected to other peers by a predetermined maximum number of neighboring peers; And
Selecting neighboring peers as second peers satisfying a predetermined connection replacement condition among the candidate peers when all the candidate peers are connected to other peers as many as the maximum number of neighboring peers . 6. The method of claim 5,
Wherein the selecting of the second peers comprises selecting a second peer as the neighboring peer, the second peer being connected to each other among the candidate peers and each having a buffering amount equal to or greater than a preset threshold value. 6. The method of claim 5,
Wherein the step of determining whether all of the candidate peers are connected to other peers by the maximum number of neighboring peers comprises:
Collecting and managing playback time information of peers currently connected to the P2P system;
Selecting the candidate peers based on a playback time point at which the first peer requests movement among the peers; And
Determining whether there is a candidate peer that is connected to another of the candidate peers less than the maximum neighboring peer number with another peer,
Wherein the selecting of the second peers comprises:
Comparing the amount of buffering of the candidate peers and other candidate peers connected to the candidate peers to a threshold if all of the candidate peers are connected to another peer by the maximum number of neighboring peers; And
And selecting a second peer whose buffering amount is greater than or equal to the threshold value among the candidate peers as the neighboring peer. 6. The method of claim 5,
Releasing a connection between the second peers; And
Further comprising: associating the first peer with the second peers. A computer-readable recording medium recording a program for executing the neighboring peer selecting method according to any one of claims 5 to 8.

Images