KR102372186B1 - Method of providing peer information and network management system of enabling the method - Google Patents

Abstract

A method of operating a server is disclosed. In one embodiment, when there is a request for information on a holding peer having a required piece from the requesting peer, a message corresponding to the request is generated, and the message is transmitted to a peer activity management server that manages information of a plurality of peers; , receiving, from the peer activity management server, a peer list including information on the possessing peer and generated based on the message, and transmitting the peer list to the requesting peer.

Description

METHOD OF PROVIDING PEER INFORMATION AND NETWORK MANAGEMENT SYSTEM OF ENABLING THE METHOD

The embodiments below relate to a method for providing peer information and a network management system for providing peer information.

A peer-to-peer network is a distributed network in which peers are directly connected to each other so that peers can send and receive content to and from peers other than servers. Accordingly, the peer may be a client that receives the content or a server that provides the content. In addition, the peer-to-peer network may be formed around shared content instead of being formed around a specific server. For this reason, in a peer-to-peer network, connections between peers and the size of the network are flexible.

According to one aspect, an operating method of a server includes: generating a message corresponding to the request when there is a request for information on a holding peer having a required piece from a requesting peer; transmitting the message to a peer activity management server that manages information of a plurality of peers; receiving, from the peer activity management server, a peer list including information on the possessed peer and generated based on the message; and sending the peer list to the requesting peer, wherein the message includes at least one of a peer activity status, the maximum number of holding peers, a peer sort criterion, and a condition of the required fragment. .

The peer activity state may include any one of a completion state indicating that the download activity of the peer is completed and a started state indicating that the download activity is in progress.

The peer sort criterion may include at least one of an amount of data uploaded by the peer, an amount of data downloaded by the peer, and an amount of data remaining for the peer to complete download.

The condition of the required piece may include any one of identification information of the required piece and identification information of the range of the required piece.

The generating of the message corresponding to the request may include generating the message by setting the peer activity state, the maximum number, the peer sort criteria, and the condition.

The holding peer may include at least one peer that is sorted based on the maximum number and the peer sorting criterion among a plurality of peers for which the peer activity state and the condition are satisfied.

The peer activity management server may use the status information received from the peer to check the fragment held by the peer.

A network management system according to one aspect includes: a network management unit for managing an overlay network in which a plurality of peers participate; and a peer activity management unit for managing information of the plurality of peers, wherein the network management unit generates a message corresponding to the request when there is a request for information on a holding peer having a required piece from the requesting peer; The message is transmitted to the peer activity manager, wherein the peer activity manager generates a peer list based on the message to include information on the possessed peer, transmits the peer list to the network manager, and the message , includes at least one of a peer activity state, the maximum number of holding peers, a peer sorting criterion, and a condition of the required fragment.

1 is a diagram for explaining a P2P network according to an embodiment.
2 is a flowchart illustrating a method of operating a server according to an exemplary embodiment.
3 is a flowchart illustrating an operation of a P2P network system according to an embodiment.
4 is a block diagram illustrating a network management system according to an embodiment.

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

Various modifications may be made to the embodiments described below. It should be understood that the embodiments described below are not intended to limit the embodiments, and include all modifications, equivalents, and substitutes thereto.

Terms used in the examples are used only to describe specific examples, and are not intended to limit the examples. The singular expression includes the plural expression unless the context clearly dictates otherwise. In the present specification, terms such as “comprise” or “have” are intended to designate that a feature, number, step, operation, component, part, or combination thereof described in the specification exists, but one or more other features It should be understood that this does not preclude the existence or addition of numbers, steps, operations, components, parts, or combinations thereof.

Unless defined otherwise, all terms used herein, including technical or scientific terms, have the same meaning as commonly understood by one of ordinary skill in the art to which the embodiment belongs. Terms such as those defined in commonly used dictionaries should be interpreted as having a meaning consistent with the meaning in the context of the related art, and should not be interpreted in an ideal or excessively formal meaning unless explicitly defined in the present specification. does not

In addition, in the description with reference to the accompanying drawings, the same components are given the same reference numerals regardless of the reference numerals, and the overlapping description thereof will be omitted. In describing the embodiment, if it is determined that a detailed description of a related known technology may unnecessarily obscure the gist of the embodiment, the detailed description thereof will be omitted.

1 is a diagram for explaining a P2P network according to an embodiment.

Referring to FIG. 1 , a peer-to-peer network according to an embodiment includes a server 110 and a plurality of peers 120 to 130 .

The server 110 may include an overlay management server (OMS) 111 and a peer activity management server (PAMS) 112 .

The OMS 111 may manage information on the P2P network so that the plurality of peers 120 to 130 can configure the P2P network, and may provide information on the P2P network to the plurality of peers 120 to 130 there is. In addition, the OMS may manage resources in the overlay network in which the plurality of peers 120 to 130 participate.

The PAMS 112 may manage information of a plurality of peers 120 to 130 . For example, the PAMS 112 may collect or manage status information of the plurality of peers 120 to 130 . Here, the state information may include static information and dynamic information of the peer. The static information may be information related to the configuration of the P2P network and the service policy of the P2P network. The dynamic information may be information related to the activities of the plurality of peers 120 to 130 . The plurality of peers 120 to 130 may report dynamic information to the PAMS 112 every reporting period. For example, each of the plurality of peers 120 to 130 may report an amount of data received from another peer, an amount of data transmitted to another peer, a data transmission/reception history, and the like to the PAMS 112 .

The static information of the peer may be shown in Table 1 below, and the dynamic information of the peer may be shown in Table 2 below.

information type information name meaning silence Maximum download BW The peer's global maximum download bandwidth silence Maximum download BW per overlay network Maximum download bandwidth per overlay network of peers silence Maximum upload BW The peer's global maximum upload bandwidth silence Maximum upload BW per overlay network Maximum upload bandwidth per overlay network of peers silence Maximum number of connections for upload per overlay network Maximum number of connections per overlay network of peers (for upload)

information type information name meaning dynamic OVERLAY_ID ID of the overlay network the peer is participating in dynamic OverlayEvent Overlay Network Participation Status dynamic Downloaded The total amount of downloads (in KB) from the overlay network in which the peers participated after the peer started operating. dynamic Uploaded After a peer starts operation, the total amount of uploads (in KB) from the overlay network in which the peer participated. dynamic Left The amount of additional download required to complete the download (in KB) dynamic Connections_for_up Number of connections currently being maintained for uploads dynamic Connections_for_dn Number of connections currently being held for download dynamic piece-event Transmitting/receiving result of unit fragment

A Piece-event of dynamic information may indicate a result of a peer transmitting and receiving a piece. In other words, the Piece-event may indicate piece information transmitted and received by the peer. For example, the Piece-event may include transmission information and/or reception information. The transmission information includes at least one of identification information of the fragment sent by the peer, identification information of the counterpart peer (that is, identification information of another peer that has received the fragment sent by the peer), and type information indicating that the peer has transmitted the fragment may include The reception information includes identification information of the fragment received by the peer, identification information of the counterpart peer (that is, identification information of another peer that sent the fragment), integrity information of the fragment, and type information indicating that the peer has received the fragment may include at least one of Transmission information and reception information included in a Piece-event may be shown in Table 3 below.

information type information name meaning send "piece-event-type":"uploaded" Send fragments. "piece-id":"piece ID" ID of the sent fragment "to":"opponent peer ID" Receiving Peer ID reception "piece-event-type":"downloaded" Received fragment. "piece-id":"piece ID" ID of the received fragment "piece-integrity":{true|false} Whether the piece is integrity "from":"opponent peer ID" Sending Peer ID

piece-event-type indicates the type information described above. When a peer receives a fragment request from another peer and sends a fragment to another peer, the peer sets the piece-event-type to uploaded, sets the piece-id to the identifying information of the sending fragment, and sets to to the other peer. set as identification information of The peer reports the Piece-event to the PAMS 112 . When a peer receives a piece from another peer, the peer sets piece-event-type to downloaded, sets piece-id to the identification information of the received piece, sets piece-integrity to true, and sets from to another Set as peer identification information. The peer reports the Piece-event to the PAMS 112 .

Since PAMS reports and receives Piece-events from peers, it can check which pieces the peer holds (posses). That is, since the PAMS reports and receives the transmission information and/or reception information of the peer, it can check which piece the peer has by using the transmission information and/or reception information. For example, when a peer receives a request for a piece from another peer and transmits a piece a to another peer, the peer may report transmission information to PAMS. Due to this, PAMS can confirm that the peer has a piece. If the peer does not receive a fragment a request from another peer, the peer does not send the fragment a to the other peer. For this reason, the peer does not report the transmission information for the a piece to PAMS. The fragment a owned by the peer is the previously received fragment, and the received information about the fragment a was reported to PAMS in the previous reporting cycle. Due to this, the PAMS can confirm that the peer has a piece by using the previously reported and received information.

The PAMS 112 may analyze the state information of the plurality of peers 120 to 130 , and may provide the analysis result to the OMS 111 .

The OMS 111 may update the status information of the overlay network to keep the status of the overlay network managed by the OMS 111 up to date. More specifically, the OMS 111 may request status information of the plurality of peers 120 to 130 participating in the overlay network from the PAMS 112 . The PAMS 112 may respond to a request for status information based on the information it owns.

The OMS 111 and the PAMS 112 shown in FIG. 1 may be devices that are physically distinct from the server 110 . Also, according to implementation, the OMS 111 and the PAMS 112 shown in FIG. 1 may be logically divided within one physical device.

In content transmission through the P2P network, the server 110 may provide information of other peers participating in the P2P network to a peer participating in the P2P network. For example, the server 110 may provide information of the peer 130 to the peer 120 . The peer 120 may access the peer 130 based on the information of the peer 130 , and may request data or pieces necessary for the peer 120 itself. Here, the peer 130 may not have the data or fragments required by the peer 120 . Due to this, the peer 120 must exchange data retention information (or fragment retention information) with the peer 130 before the peer 120 itself requests the necessary data or fragments. In the case of a file sharing application, as the content download of the peer 120 approaches completion, the download speed decreases. In order to prevent a decrease in the download speed, the peer 120 requests a necessary fragment from all peers 130 known to the peer 120 and cancels the request for a received fragment whenever a necessary fragment is received. Here, the peer 120 signals the cancellation of the request for the received fragment to all peers 130 , and the peer 130 does not transmit the fragment received by the peer 120 to the peer 120 through signaling. Eventually, traffic for signaling occurs until the reception of all necessary fragments is completed.

The server according to an embodiment may inform the peer 120 of a peer having a necessary fragment or a peer expected to have a necessary fragment. Due to this, the peer 120 may request data from the peer informed by the server without exchanging data retention information, and may not signal with a peer not informed by the server, or in other words, a peer that does not possess a required piece.

2 is a flowchart illustrating a method of operating a server according to an exemplary embodiment.

The server according to an embodiment may be the OMS described with reference to FIG. 1 .

Referring to FIG. 2 , when there is a request for information on a holding peer having a required piece from a requesting peer, the server generates a message corresponding to the request ( 210 ). Here, the message may include the piece-condition of Table 4 below. For example, the requesting peer may request the holding peer information from the OMS based on the condition of the fragment. The server transmits a message to a peer activity management server that manages information of a plurality of peers ( 220 ). In the preceding example, the OMS may communicate the condition of the fragment to the PAMS.

The requesting peer may request information of the holding peer with a specific fragment or a specific range of fragments from the server. When there is an information provision request from the requesting peer, the server may generate a message corresponding to the information provision request. Here, the message may include at least one of a peer activity status, the maximum number of peers possessed, a peer alignment criterion, and a condition of a required fragment.

The peer activity state may indicate a state in which the peer is active in the overlay network. For example, the activity state may include a completed state and a started state, and the server may generate a message by setting the peer's activity state to any one of the completed state and the started state. Here, the completion state indicates that the peer's download activity (eg, content reception) has been completed, and the start state indicates that the peer's download activity is in progress. As will be described later, the peer activity management server may identify a peer corresponding to an activity state set by the server.

In addition, the server may generate a message by setting the maximum number of peers. For example, the server may request the peer activity management server to provide information of up to 100 holding peers. As will be described later, when the number of retained peers sorted according to the sorting criterion is 100 or more, the peer activity management server may select the top 100 retained peers from among the sorted retained peers.

In addition, the server may generate a message by setting peer ordering criteria. The peer sort criteria may include, for example, at least one of an amount of data uploaded by a peer (uploaded), an amount of data downloaded by a peer (downloaded), and an amount of data left by the peer to complete the download. can The peer alignment criteria may be dynamic information reported by peers. The server may set the sorting criteria, and the peer activity management server may sort a plurality of peers satisfying the activity state and a necessary fragment condition to be described later according to the sorting criteria.

In addition, the server can set the conditions for the required fragment. The condition of a required piece may include, for example, identification information of a required piece and identification information of a required piece range. The identification information of the fragment range may include identification information of a start piece and identification information of an end piece. The server may generate a message by setting the condition of the required fragment to any one of the identification information of the required fragment and the identification information of the range of the required fragment. As will be described later, the peer management server may receive a message including the condition of the fragment, and may find a peer that satisfies the condition of the fragment.

As an example, the message generated by the server may be shown in Table 4 below.

information name meaning "overlay-status" : string {"completed"|"started"} Peer activity status "max-peer-num" : integer , maximum number "ordering" : string {"uploaded"|"downloaded"|"left"} Peer Sort Criteria "piece-condition" : {
"piece-list" : {
"piece-id" : [integer]
},
"piece-range": {
"start-piece-id":integer,
"end-piece-id":integer
}
} As a condition of a piece, it is distinguished whether to request information of a peer with a specific piece-id or a peer with a specific range of pieces (piece-range).

In one embodiment, the server may request a plurality of pieces from the peer activity management server. In this case, if the identification information of the pieces is continuous, the server may generate a message including a piece-range, and if the identification information of the pieces is not continuous, the server includes the non-continuous identification information message can be created. In addition, the server requests a plurality of pieces from the peer activity management server, and the plurality of pieces may include a first piece set in which identification information of a piece is continuous and a second piece set in which identification information of a piece is not consecutive. In this case, the start-piece-id of the piece-range may be identification information of the start piece of the first piece set, the end-piece-id of the piece-range may be identification information of the last piece of the first piece set, , piece-list may include identification information of one or more pieces included in the second piece set.

The peer activity management server receiving the message may create a peer list using the message. For example, the peer activity management server says that it has received a message with the activity status set to the complete status, the maximum number set to 100, the sort criterion set to uploaded, and the required fragment conditions set to the required fragment identification information. lets do it. The peer activity management server may find a peer that satisfies the condition of the fragment. The peer activity management server may check the peer holding the fragment corresponding to the identification information included in the condition of the fragment, that is, the possessing peer. Here, when the number of possessing peers is 50 and the activity status of the 50 possessing peers is a complete state, the peer activity management server may sort the 50 possessing peers in the order of the highest uploaded. When the 50 holding peers are sorted, a peer list is created, and the peer activity management server may send the peer list to the server. When the number of retained peers is 200, the peer activity management server receives a request for information of 100 retained peers, so the peer activity management server can select 100 retaining peers using the activity status and sorting criteria, and 100 retaining peers A peer list including peer information can be created.

The server receives the peer list from the peer activity management server (230), and transmits the peer list to the requesting peer (240). As described above, the peer activity management server may generate a peer list based on the message to include information on the possessing peer.

The requesting peer may identify the holding peer using the peer list, and may request the required fragment from the holding peer.

3 is a flowchart illustrating an operation of a P2P network system according to an embodiment.

Referring to FIG. 3 , the peer-to-peer network system includes a peer 310 , an OMS 320 , and a PAMS 330 .

The peer 310 may request information about a holding peer having a specific fragment or a specific range of fragments from the OMS 320 ( 311 ).

When there is a request from the peer 310 , the OMS 320 may request information on the possessing peer from the PAMS 330 ( 321 ). For example, the OMS 320 may generate a message corresponding to the request of the peer 310 and transmit the message to the PAMS 330 .

PAMS 330 may use the message to create a peer list. The PAMS 330 may transmit the requested information, ie, a peer list, to the OMS 320 ( 331 ).

The PAMS 330 may collect and manage state information of a plurality of peers included in the P2P network. As described above, state information may include dynamic information and static information. Here, the dynamic information may include a Piece-event.

PAMS can check the pieces owned by each of a plurality of peers by using the Piece-event. The PAMS 330 may identify the holding peer with the fragments needed by the peer 310 . The PAMS 330 may generate a peer list including information about the possessing peers.

The OMS 320 may receive the peer list from the PAMS 330 and transmit the peer list to the peer 310 ( 322 ).

Since the matters described with reference to FIGS. 1 and 2 may be applied to the matters described with reference to FIG. 3 , a detailed description thereof will be omitted.

4 is a block diagram illustrating a network management system according to an embodiment.

Referring to FIG. 4 , the network management system 400 according to an embodiment includes a network manager 410 and a peer activity manager 420 .

The network manager 410 manages an overlay network in which a plurality of peers participate.

The peer activity manager 420 manages information of a plurality of peers.

More specifically, when there is a request from the requesting peer for information on the possessing peer having the required fragment, the network manager 410 generates a message corresponding to the request. Here, the message may include at least one of a peer activity status, the maximum number of peers possessed, a peer alignment criterion, and a condition of the required fragment. The network manager 410 transmits the message to the peer activity manager 420 . The peer activity manager 420 generates a peer list based on the message, and transmits the peer list to the network manager 410 . The network manager 410 transmits the peer list to the requesting peer. The requesting peer uses the peer list to request a fragment from the holding peer.

Since the matters described with reference to FIGS. 1 to 3 may be applied to the matters described with reference to FIG. 4 , a detailed description thereof will be omitted.

The device described above may be implemented as a hardware component, a software component, and/or a combination of the hardware component and the software component. For example, devices and components described in the embodiments may include, for example, a processor, a controller, an arithmetic logic unit (ALU), a digital signal processor, a microcomputer, a field programmable gate array (FPGA). , a programmable logic unit (PLU), microprocessor, or any other device capable of executing and responding to instructions, may be implemented using one or more general purpose or special purpose computers. The processing device may execute an operating system (OS) and one or more software applications running on the operating system. A processing device may also access, store, manipulate, process, and generate data in response to execution of the software. For convenience of understanding, although one processing device is sometimes described as being used, one of ordinary skill in the art will recognize that the processing device includes a plurality of processing elements and/or a plurality of types of processing elements. It can be seen that can include For example, the processing device may include a plurality of processors or one processor and one controller. Other processing configurations are also possible, such as parallel processors.

Software may comprise a computer program, code, instructions, or a combination of one or more thereof, which configures a processing device to operate as desired or is independently or collectively processed You can command the device. The software and/or data may be any kind of machine, component, physical device, virtual equipment, computer storage medium or apparatus, to be interpreted by or to provide instructions or data to the processing device. , or may be permanently or temporarily embody in a transmitted signal wave. The software may be distributed over networked computer systems and stored or executed in a distributed manner. Software and data may be stored in one or more computer-readable recording media.

The method according to the embodiment may be implemented in the form of program instructions that can be executed through various computer means and recorded in a computer-readable medium. The computer-readable medium may include program instructions, data files, data structures, etc. alone or in combination. The program instructions recorded on the medium may be specially designed and configured for the embodiment, or may be known and available to those skilled in the art of computer software. Examples of the computer-readable recording medium include magnetic media such as hard disks, floppy disks and magnetic tapes, optical media such as CD-ROMs and DVDs, and magnetic media such as floppy disks. - includes magneto-optical media, and hardware devices specially configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like. Examples of program instructions include not only machine language codes such as those generated by a compiler, but also high-level language codes that can be executed by a computer using an interpreter or the like. The hardware devices described above may be configured to operate as one or more software modules to perform the operations of the embodiments, and vice versa.

As described above, although the embodiments have been described with reference to the limited embodiments and drawings, various modifications and variations are possible from the above description by those skilled in the art. For example, the described techniques are performed in an order different from the described method, and/or the described components of the system, structure, apparatus, circuit, etc. are combined or combined in a different form than the described method, or other components Or substituted or substituted by equivalents may achieve an appropriate result.

Therefore, other implementations, other embodiments, and equivalents to the claims are also within the scope of the following claims.

Claims (8)

When there is a request from the requesting peer for information on at least one holding peer having the required fragment, a message in which the peer activity status, the maximum number of peers, the peer sort criteria, and the condition of the required fragment are set generating;
transmitting the message to a peer activity management server that manages information of a plurality of peers;
receiving, from the peer activity management server, a peer list generated using the peer activity status, the maximum number of peers, the peer sort criteria, and the condition; and
transmitting the peer list to the requesting peer
including,
the requesting peer uses the peer list to request the necessary fragment from a holding peer possessing the necessary fragment;
How the server works.
According to claim 1,
The peer activity state is
a completion state indicating that the download activity of the holding peer is complete and a started state indicating that the download activity is in progress;
How the server works.
According to claim 1,
The peer sorting criterion is,
comprising at least one of an amount of data uploaded by the holding peer, an amount of data downloaded by the holding peer, and an amount of data remaining by the holding peer to complete the download,
How the server works.
According to claim 1,
The conditions for the necessary pieces are,
Containing any one of identification information of the required piece and identification information of the range of the required piece,
How the server works.
delete delete According to claim 1,
The peer activity management server,
Using the state information received from the holding peer to check the fragment held by the holding peer,
How the server works.
a network manager for managing an overlay network in which a plurality of peers participate; and
A peer activity management unit that manages information of the plurality of peers
including,
The network management unit,
When there is a request from the requesting peer for information about the holding peer having the required fragment, a message is generated in which the peer activity status, the maximum number of peers, the peer sort criteria, and the condition of the required fragment are set, and the message is transmitted forward to the peer activity management unit,
The peer activity management unit,
generating a peer list using the peer activity status, the maximum number of peers, the peer sort criteria, and the condition, and transmitting the peer list to the network manager;
The network management unit,
sending the peer list to the requesting peer;
The requesting peer is
requesting the necessary fragment from a holding peer possessing the necessary fragment by using the peer list;
network management system.

Images