KR20170134192A - Oeverlay management server and resource allcatiom method of thereof - Google Patents

Abstract

A resource allocation method of an overlay management server is disclosed. One embodiment transmits a remote peer list determined based on the network distance between each of the peers and the cache server to the cache server and identifies the peer receiving the content from the cache server Receiving, from the cache server, a peer list including an identifier of the peer if it is in the remote peer list; and selecting another cache server for the peer when receiving the peer list.

Description

[0001] DESCRIPTION [0002] OVERLAY MANAGEMENT SERVER AND RESOURCE ALLCATIOM METHOD OF THEREOF [

The embodiments described below relate to an overlay management server and a resource allocation method thereof.

A peer-to-peer (P2P) network is a distributed network where peers can directly communicate with peers other than the server. Accordingly, the peer can be a client that receives content, and can be a server that provides content. In addition, a P2P network can be formed around contents that are not formed around a specific server but are shared. As a result, peer-to-peer connections and the size of networks in a P2P network are flexible.

As a prior art related to the P2P network, Korean Patent Laid-Open No. 10-2014-0008065 entitled " Peer-to-peer network system with management function, Applicant: Korea Electronics and Telecommunications Research Institute " The disclosure discloses to the at least one peer at least one of the information on the state of the at least one peer, the information about the state of the base network, and the information about the user in terms of the service, A P2P network system is provided in which a service provider can stably provide a service to at least one peer and is given a management function for controlling the provided service.

A streaming service can be provided using such a P2P network. In other words, a P2P-based streaming service can be provided. At this time, if there is an idle resource in the P2P network but the content provider does not request the use of the idle resource, the peer tries to make a connection with only that content provider. In this case, the content provider may have difficulty distributing the content to the peers.

According to one aspect of the present invention, there is provided a resource allocation method of an overlay management server, including: transmitting a remote peer list determined based on a network distance between each of peers in a overlay network and a cache server to the cache server; Receiving, from the cache server, a peer list including an identifier of a peer interacting with the cache server after transmitting the remote peer list; And selecting another cache server to be added to the overlay network using the peer list.

Wherein selecting the other cache server comprises: obtaining a list of cache servers determined based on a network distance between each of the cache servers and the peer when receiving the peer list; And selecting the other cache server among the cache servers based on the cache server list.

The resource allocation method comprising: receiving resource utilization status information from the cache server; And determining whether to release resources of the cache server based on the resource utilization status information.

Wherein the resource utilization status information includes a start timestamp indicating a start time of the resource utilization status check of the cache server; An end timestamp indicating an end time of the resource utilization status check of the cache server; Storage usage of the cache server with respect to storage capacity; Upload traffic of the cache server; Download traffic of the cache server; An uplink bandwidth of the cache server; The downlink bandwidth of the cache server; The number of peer connections used when the cache server uploads traffic; And the number of peer connections used when the cache server downloads traffic.

The resource allocation method comprising: transmitting a request message to the another cache server to reserve resources of the other cache server; And receiving a response message from the other cache server.

The response message may include at least one of an identifier of a reserved resource, an identifier of a virtual peer of the other cache server, and a maximum time in which the reserved resource is allocated.

Wherein the cache server, when receiving the remote peer list, checks whether the peer is in the remote peer list and adds the peer to the peer list to be transmitted to the overlay management server if the peer is in the remote peer list can do.

The overlay management server according to one side comprises a communication interface; And a remote peer list determined based on a network distance between each of the peers in the overlay network and the cache server to the cache server via the communication interface, A controller that receives a peer list including an identifier of a peer interacting with the cache server from the cache server via the communication interface and selects another cache server to be added to the overlay network using the peer list .

Wherein the controller, when receiving the peer list, obtains a cache server list determined based on a network distance between each of the cache servers and the peer, and, based on the cache server list, Can be selected.

The controller may receive resource utilization status information from the cache server via the communication interface and determine whether to release resources of the cache server based on the resource utilization status information.

Wherein the resource utilization status information includes a start timestamp indicating a start time of the resource utilization status check of the cache server; An end timestamp indicating an end time of the resource utilization status check of the cache server; Storage usage of the cache server with respect to storage capacity; Upload traffic of the cache server; Download traffic of the cache server; An uplink bandwidth of the cache server; The downlink bandwidth of the cache server; The number of peer connections used when the cache server uploads traffic; And the number of peer connections used when the cache server downloads traffic.

The controller may send a request message to the other cache server via the communication interface to reserve resources of the other cache server and receive a response message from the other cache server via the communication interface.

The response message may include at least one of an identifier of a reserved resource, an identifier of a virtual peer of the other cache server, and a maximum time in which the reserved resource is allocated.

Wherein the cache server, when receiving the remote peer list, checks whether the peer is in the remote peer list and adds the peer to the peer list to be transmitted to the overlay management server if the peer is in the remote peer list can do.

A managed peer-to-peer network system according to one aspect includes a cache server; And a remote peer list determined based on a network distance between each of the peers and the cache server to the cache server, and after transmitting the remote peer list, And an overlay management server for receiving from the cache server a peer list including an identifier of a peer to be added, and selecting another cache server to be added to the overlay network using the peer list.

Wherein the overlay management server, when receiving the peer list, obtains a cache server list determined based on a network distance between each of the cache servers and the peer, and, based on the cache server list, You can choose a cache server.

The overlay management server may receive resource utilization status information from the cache server and may determine whether to release resources of the cache server based on the resource utilization status information.

Wherein the resource utilization status information includes a start timestamp indicating a start time of the resource utilization status check of the cache server; An end timestamp indicating an end time of the resource utilization status check of the cache server; Storage usage of the cache server with respect to storage capacity; Upload traffic of the cache server; Download traffic of the cache server; An uplink bandwidth of the cache server; The downlink bandwidth of the cache server; The number of peer connections used when the cache server uploads traffic; And the number of peer connections used when the cache server downloads traffic.

Embodiments can allocate an appropriate cache server by grasping status information of the peer and status information of the cache server when a situation where it is difficult for the peer to receive the content occurs.

In addition, embodiments may efficiently distribute streaming content by allocating a suitable cache server on the network distance with one or more peers receiving the content. Embodiments can also efficiently distribute streaming content by allocating an appropriate number of cache servers in a situation where the number of cache servers required due to peers joining or leaving the overlay network dynamically can not be accurately known.

In addition, the embodiments may release the allocated cache server if the allocated cache server is no longer utilized.

1 is a diagram for explaining a management type P2P network system according to an embodiment.
FIG. 2 is a diagram for explaining that in a managed P2P network system according to an embodiment, a cache server reports a list of peers for a remote peer among the peers served by the cache server itself.
3 is a diagram for explaining how an overlay management server selects a cache server in a managed P2P network system according to an exemplary embodiment.
4 is a view for explaining a resource utilization status report of a cache server in a management type P2P network system according to an embodiment.
5 is a flowchart illustrating a resource allocation method of an overlay management server in a managed P2P network system according to an exemplary embodiment.
FIG. 6 is a block diagram illustrating a management P2P network system overlay network according to an exemplary embodiment of the present invention. Referring to FIG.

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

Various modifications may be made to the embodiments described below. It is to be understood that the embodiments described below are not intended to limit the embodiments, but include all modifications, equivalents, and alternatives to them.

The terms used in the examples are used only to illustrate specific embodiments and are not intended to limit the embodiments. The singular expressions include plural expressions unless the context clearly dictates otherwise. In this specification, the terms "comprises" or "having" and the like refer to the presence of stated features, integers, steps, operations, elements, components, or combinations thereof, But do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, 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 this embodiment belongs. Terms such as those defined in commonly used dictionaries are to be interpreted as having a meaning consistent with the contextual meaning of the related art and are to be interpreted as ideal or overly formal in the sense of the art unless explicitly defined herein Do not.

In the following description of the present invention with reference to the accompanying drawings, the same components are denoted by the same reference numerals regardless of the reference numerals, and redundant explanations thereof will be omitted. In the following description of the embodiments, a detailed description of related arts will be omitted if it is determined that the gist of the embodiments may be unnecessarily blurred.

Prior to describing the embodiments, the terms are briefly described.

Overlay management server (OMS): OMS can manage managed P2P (MP2P) networks and help peers participate in MP2P networks. Through interaction with UNIS, the OMS can provide an optimal peer list to construct an optimal MP2P network.

Underlying network information server (UNIS): UNIS can represent a server that provides network distance information between peers in a managed P2P network. UNIS can interact with peers and OMS.

Overlay network: An overlay network is a virtual network running on top of another network. The overlay network includes a set of nodes and links between the nodes. These links are logical and can correspond to the physical links of the underlying network.

Cache server (CS): A cache server represents a dedicated server that caches all or a portion of content to achieve a certain purpose in a managed P2P network. The cache server has one or more virtual peers.

Overlay resource: An overlay resource represents a dedicated resource for the overlay network to improve the stability and performance of the overlay network. The overlay resource includes one or more virtual peers of the cache server and one or more relay instances of the relay server.

Relay instance: A relay instance represents an instance that relays traffic. The relay instance performs a traffic relay for a specific peer behind a NAT / FW (network address translation / firewall). All relay instances running on the relay server are uniquely identified. In other words, the relay instance may be assigned a unique identifier.

Relay server: A relay server represents a dedicated server that relays traffic to one or more peers behind a NAT / FW in a managed P2P network or relays traffic from one or more peers behind a NAT / FW. A relay server has one or more relay instances.

Virtual peer: A virtual peer represents an instance that acts as a peer running on a cache server. A virtual peer that acts as a peer participates in one or more overlay networks and exchanges fragments with other peers. Here, the fragment means a part of the content. Virtual peers running on the cache server are uniquely identified. In other words, a unique identifier may be assigned to the virtual peer.

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

Referring to FIG. 1, a managed peer to peer (MP2P) network system according to an embodiment includes a server 110 and peers 120-140.

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

PAMS 111 and OMS 112 may be physically separated. Depending on the implementation, the PAMS 111 and the OMS 112 may be logically separated within one server 110.

Although not shown in FIG. 1, the MP2P network system may further include at least one of CS, RS, and UNIS.

The PAMS 111 can manage the information of each of the peers 120 to 140. [ For example, the PAMS 111 may collect or manage the status information of each of the peers 120-140. In one embodiment, the status information may include static information. Table 1 below shows an example of static information.

Type of information Information name meaning silence Maximum download BW Maximum download bandwidth silence Maximum download BW per overlay network (BW _max ) Maximum download bandwidth per peer overlay network silence Maximum upload BW Maximum upload bandwidth silence Maximum upload BW per overlay network Maximum Upload Bandwidth per Overlay Network silence Maximum number of connections for upload per network (CONNECTION _max ) Maximum number of connections per peer overlay network

In addition, the status information may include dynamic information. The dynamic information may be information related to the activity of the peers 120-140. Peers 120-140 may report dynamic information to PAMS 111 every report period. Table 2 below shows an example of dynamic information.

Type of information Information name meaning dynamic OVERLAY_ID The ID of the overlay network that the peer is participating in dynamic OverlayEvent It is set to "COMPLETED" when the peer receives the entire contents, and is set to "STOPPED" when the peer stops exchanging data with the other peer. The status other than COMPLETED and STOPPED , It is set to STARTED. dynamic Downloaded The total amount (in KB) downloaded by the peer after reporting previous dynamic information. dynamic Uploaded The total amount uploaded (in kilobytes) after the peer reported previous dynamic information. dynamic Left Amount of additional download (KB) to complete the download dynamic Connections_for_up The number of connections you are currently maintaining for uploads. dynamic Connections_for_dn The number of connections you are currently maintaining for download

In one embodiment, assume that the peer 120 is currently acting as a content provider. In other words, let's say that peer 120 distributes content to peer 130 and peer 140. Here, when the peer 120 does not have enough resources, the peer 120 may have difficulty distributing the content to the peer 130 and the peer 140. In this case, the OMS 112 must allocate a CS (i.e., a cache server) by checking the load status of the content provider (i.e., peer 120) and the content reception status of each of peer 130 and peer 140 Can be determined. Hereinafter, how the OMS 112 confirms the load state of the peer 120 and how to confirm the content reception state of each of the peer 130 and the peer 140 will be described.

First, the OMS 112 confirms the load of the content provider, that is, the peer 120.

The OMS 112 may receive the status information of the peer 120 from the PAMS 111 and may check the load status of the peer 120 based on the status information of the peer 120. [ For example, when the uploaded information of the dynamic information of the peer 120 is close to the BW _max information of the static information of the peer 120, that is, when the OMS 112 enters the bandwidth threshold BW _THRESHOLD , It can be determined that a load occurs. In another example, when the Connections_for_up information of the dynamic information of the peer 120 is close to the CONNECTION _max information of the static information of the peer 120, that is, when the OMS 112 enters the threshold of the number of connections (CONNECTION _THRESHOLD ) 120 can be determined to have a load.

Next, the OMS 112 confirms the content reception state of each of the peer 130 and the peer 140.

The OMS 112 may receive status information of each of the peer 130 and the peer 140 from the PAMS 111 and may receive the status information of the peer 130 and the peer 140 based on the status information of the peer 130 and the peer 140, It is possible to confirm the contents reception state of each of the peers 140. In one example, the OMS 112 may calculate the current download speed of each of the peer 130 and the peer 140 according to Equation 1 below.

In Equation (1), D _CUR represents the current download speed of each of the peer 130 and the peer 140. In Equation (1), DIFF _DOWNLOADED represents the difference between Downloaded information of dynamic information reported at time t and Downloaded information of dynamic information reported at time t (t-1), which can be expressed by Equation 2 below . In Equation (1), PERIOD denotes a reporting period of dynamic information.

The OMS 112 calculates the D _CUR of each of the peer 130 and the peer 140 based on the comparison result between the maximum download rate D _MAX and the D _CUR of the peer 130 and the peer 140, 130 and the peer 140 can be checked. Here, D _MAX and peer 130 is higher than the D _THRESHOLD difference between D _CUR, OMS (112) may determine not good, the contents reception status of the peer (130), D of the D _MAX and peer 140 _If the difference between the _CURs is higher than D _THRESHOLD , the OMS 112 may determine that the content reception state of the peer 140 is not good.

In another example, if the difference between the F _rate corresponding to the _rate at which the content provider, that is, the peer 120 generates content, and the D _{CUR of} each of the peer 130 and the peer 140 is greater than or equal to the threshold value, May determine that the content reception state of each of the peer 130 and the peer 140 is not good.

The OMS 112 may determine whether to allocate a CS by considering the load status of the content provider peer 120 and the content receiving status of each of the content recipients peer 130 and peer 140. [

According to the implementation, the OMS 112 determines whether to allocate the CS in consideration of the load status of the peer 120, which is the content provider, or only considers the content reception state of each of the content recipients, that is, the peer 130 and the peer 140 CS < / RTI >

In one embodiment, if it is determined that a load has occurred on the peer 120 and the content reception state of each of the peer 130 and peer 140 is determined to be poor, then the OMS 112 may decide to allocate a CS . If there are more than two idle CSs in the overlay network, OMS 112 may select one or more CSs according to any of the following criteria and assign the selected CSs.

- first criterion: assigns a CS near the network distance to the content provider 120

When the number of allocated CSs in the overlay network is small and the load status of the content provider (i.e., peer 120) is identified, the OMS 112 may allocate the CS according to the first criteria. Here, if the difference between the "Connections_for_up" of the dynamic information of the peer 120 and the number of CSs already allocated to the overlay network is greater than a predetermined reference, then the OMS 112 may determine that the number of allocated CSs is small have.

For example, if it is determined that the number of CSs allocated in the overlay network is small and the peer 120 is burdened, the OMS 112 may provide the UNIS with information about the peer 120 and a CS list. UNIS may order the CS list based on the network distance between each of the CSs and the peer 120. Here, the CS lists may be sorted in order of closest network distances from the peers 120, or the CS lists may be sorted in descending order of network distances from the peers 120. The UNIS may provide an ordered CS list to the OMS 112. The OMS 112 may select a CS with a resource in the sorted CS list and allocate the selected CS.

- Second criterion: Allocate a CS located in an area where peers that do not receive the content properly gather

If the number of CSs allocated in the overlay network is large but the peers 130 and 140 in a specific area can not properly receive the content, the OMS 112 may allocate the CS according to the second criterion. For example, the OMS 112 may provide the UNIS with information about a particular geographical peer 130 and 140 and a CS list, and the UNIS may provide a CS list for each of the CSs and each of the peers 130 and 140 You can sort CS lists based on distance. The UNIS may provide an ordered CS list to the OMS 112. The OMS 112 may select a CS with a resource in the sorted CS list and allocate the selected CS.

The CS may distribute the content to the peers 130 and 140 instead of the peer 120. Thus, the content can be efficiently distributed.

In one embodiment, the peer at the remote location with the CS can not receive content well from the CS. In this case, the OMS 112 may assign another CS. Hereinafter, the allocation of other CSs will be described with reference to FIG. 2 and FIG.

FIG. 2 is a diagram for explaining that, in a managed P2P network system according to an embodiment, a cache server reports a list of peers for a remote peer among the peers served by the cache server itself.

Referring to FIG. 2, the CS requests the OMS for a peer list (210).

The OMS acquires an ordered peer list (211). Here, the aligned peer list may represent an ordered list of peers based on the network distance between each of the peers and the CS. For example, if Peer A is closest to CS and Peer C is farthest from CS, the peer list can be sorted in order of Peer C, Peer B, and Peer A, and the OMS can be arranged in order of Peer C, Peer B, A list of peers ordered in A can be obtained. Depending on the implementation, the OMS may obtain Peer A, Peer B, and Peer C ordered peer lists.

In one embodiment, the OMS may obtain an ordered list of peers by interfacing with the UNIS. In other words, the OMS can interface with the UNIS to obtain an ordered list of peers.

The OMS sends a remote peer list to the CS (212). In one embodiment, the OMS obtains an ordered peer list and can determine the remote peer list by comparing the network distance and the critical distance between each of the peers and the CS. 2, if the network distance between peers A and CS is less than the threshold distance and the network distance between peers B and CS and the network distance between peers C and CS is greater than the threshold distance, C < / RTI > list containing the respective identifiers, and send the corresponding remote peer list to the CS. In other words, the OMS can send a "(remote) peer list = {peer B, peer C}" to the CS.

The CS stores the remote peer list (213). When the CS receives the list of remote peers, it can know one or more peers that are far from it. In the example shown in FIG. 2, if the CS receives a "(remote) peer list = {Peer B, Peer C}" from the OMS, it can be seen that Peer B and Peer C are far from themselves.

Let CS send content to peer A (214) and send content to peer B (215). In other words, let's assume that the CS is now serving or serving Peer A and Peer B.

The CS determines a notify remote peer list (216). Here, the notification remote peer list may indicate the list of peers to which the CS will notify the OMS. In one embodiment, the CS can check that the peer it is currently serving is in the remote peer list, and if the peer that it is serving is on the remote peer list, the peer list to notify the OMS (i.e., The remote peer list). In the example shown in FIG. 2, since the CS is currently serving Peer A and Peer B and Peer B is in the remote peer list among the serving peers, the CS adds Peer B to the peer list to notify OMS . Thus, the CS can determine "(notification remote) peer list = {peer B} ".

The CS sends the notification remote peer list to the OMS (217). In other words, the CS may report to the OMS a peer list containing identifiers of remote peers among the serving peers. In other words, the CS may send information to the OMS about the remote peer among the serving peers. In the example shown in FIG. 2, the CS may send a "(notification remote) peer list = {peer B}" to the OMS. As a result, the OMS can know that the CS is transmitting content to a peer (i.e., a remote peer) that is far from the current CS.

The CS initializes the notification remote peer list (218).

When the OMS receives the notification remote peer list from the CS, it can know that the CS is transmitting content to the remote peer. Since the remote peer is far from the CS, it can not receive the content from the CS well. In this case, the OMS can select one or more other CSs for the remote peer and assign the selected one or more other CSs to the remote peer. Hereinafter, referring to FIG. 3, how the OMS selects another CS will be described.

3 is a diagram for explaining how an overlay management server selects a cache server in a managed P2P network system according to an exemplary embodiment.

Referring to FIG. 3, CS 1 sends a notification remote peer list to the OMS (310). In the example shown in FIG. 3, assume that CS 1 transmits a "(notification remote) peer list = {Peer B, Peer C}". In other words, CS 1 can inform OMS that peer B and peer C are being served in a distant location.

The OMS can interact with UNIS to find an adequate CS to service both Peer B and Peer C. In one embodiment, the OMS acquires an ordered CS list (311). Here, the sorted CS list may represent a CS list sorted based on the network distances between each of the CSs other than CS 1 and one or more peers in the notification remote peer list. In the example shown in FIG. 3, the OMS can align CS lists based on the network distances between each of the peers B and C and CSs other than CS 1, by interworking with UNIS. The OMS can select one or more CSs by referring to the sorted CS list. Here, when CS is selected, even if there is a close CS, the CS is excluded if the CS can not support Peer B or Peer C. The OMS can find one or more appropriate CSs considering the distance criteria and the state of the resource (e.g., the resource utilization status information of the CS to be described later). For example, when CS 2 and CS 3 satisfy the distance criteria (i.e., CS 2 and CS 3 are close to the network distance to both Peer B and Peer C), CS 3 is idle through the resource utilization status information of CS 3 If not, the OMS may not choose CS 3.

In the example shown in FIG. 3, let OMS select CS 2.

The OMS sends a request message to reserve CS 2 resources (312).

CS 2 participates in the overlay network (313), and transmits a response message to the OMS in response to the request message (314). Here, the response message may include at least one of the identifier of the resource to be reserved, the identifier of the virtual peer of the selected CS, and the maximum time to which the reserved resource is allocated. For example, the response message may include the identifier "vp_abcd1235" of the virtual peer of CS 2 and the maximum time "1024 minutes ".

CS 2 sends the content to peer B (315) and transmits the content to peer C (316). The content can be efficiently distributed by transmitting the content to the peer B and the peer C, respectively, instead of the CS 2 most suitable for the peer B and the peer C, instead of the CS 1. In other words, an efficient streaming service may be possible.

4 is a view for explaining a resource utilization status report of a cache server in a management type P2P network system according to an embodiment.

Referring to FIG. 4, the CS collects resource utilization status information (410). The CS reports the resource utilization status information to the OMS (411). In other words, the CS can transmit resource utilization status information to the OMS using the ORCP_USAGE_REPORT message.

The resource utilization status information includes, for example, a start timestamp indicating a start time of the CS resource utilization status check, an end time indicating an end time of the CS resource utilization status check, A storage usage of the CS, upload traffic of the CS, download traffic of the CS, uplink bandwidth of the CS, downlink bandwidth of the CS, a peer used when the CS uploads the traffic, The number of connections, and the number of peer connections used when the CS downloads the traffic, or a combination thereof.

The OMS checks the resource utilization of the CS based on the resource utilization status information (412). In other words, the OMS can analyze resource utilization status information to determine whether to release or allocate overlay resources. Here, if the OMS decides to allocate an overlay resource (i.e., a new virtual peer), it may consider factors such as the network distance from the peers, the network distance from the source peer to select the appropriate CS. Here, the source peer may represent the content provider described with reference to FIG.

OMS can know the resource utilization status or resource usage status of CS by receiving and reporting the resource utilization status information from the CS.

In one embodiment, the OMS may determine whether the CS is idle based on the resource utilization status information of the CS. For example, the OMS can determine whether the CS is idle based on the resource utilization status information of the CS described in FIG. In addition, the OMS can determine whether CS 2 is idle based on the resource utilization state information of CS 2 described with reference to FIG.

The OMS can release or return the resources of the CS when the CS is idle. As a result, resource utilization can be further improved.

5 is a flowchart illustrating a resource allocation method of an overlay management server in a managed P2P network system according to an exemplary embodiment.

Referring to FIG. 5, the OMS sends the remote peer list to the CS (510). Here, the remote peer list can be determined based on the network distance between each of the peers and the CS.

After transmitting the remote peer list, the OMS receives 520 a peer list containing the identifier of the peer interacting with the cache server from the CS. For example, if the identifier of the peer receiving content from the CS is in the remote peer list, the OMS may receive a peer list containing the peer's identifier from the CS. In other words, the CS may inform the OMS of peers that are common between the peers in the remote peer list and the content receiving peers.

The OMS selects another CS to add to the overlay network using the peer list (530). For example, if the OMS receives a "(Notification Remote) peer list = {Peer B, Peer C}" from the CS, it will interact with the UNIS to find the most appropriate CS to serve both Peer B and Peer C. . In other words, the OMS can interact with the UNIS to sort the cache server list based on the network distance between each of the cache servers and peer B and the network distance between each of the cache servers and peer C, The most suitable CS for serving both peer B and peer C can be selected.

1 through 4 can be applied to the matters described with reference to FIG. 5, so that a detailed description will be omitted.

6 is a block diagram for explaining an overlay management server in a managed P2P network system according to an embodiment.

Referring to FIG. 6, the overlay management server 600 includes a communication interface 610 and a controller 620.

The controller 620 transmits the remote peer list determined based on the network distance between each of the peers and the cache server to the CS via the communication interface 610. [

After sending the remote peer list, the controller 620 receives the content from the CS via the communication interface 610 with the peer list containing the identifier of the peer interacting with the CS.

The controller 620 selects another CS to be added to the overlay network using the peer list.

1 through 4 can be applied to the matters described with reference to FIG. 6, so that a detailed description will be omitted.

The apparatus described above may be implemented as a hardware component, a software component, and / or a combination of hardware components and software components. For example, the apparatus and components described in the embodiments may be implemented within a computer system, such as, 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), a microprocessor, or any other device capable of executing and responding to instructions. The processing device may execute an operating system (OS) and one or more software applications running on the operating system. The processing device may also access, store, manipulate, process, and generate data in response to execution of the software. For ease of understanding, the processing apparatus may be described as being used singly, but those skilled in the art will recognize that the processing apparatus may have a plurality of processing elements and / As shown in FIG. For example, the processing unit may comprise a plurality of processors or one processor and one controller. Other processing configurations are also possible, such as a parallel processor.

The software may include a computer program, code, instructions, or a combination of one or more of the foregoing, and may be configured to configure the processing device to operate as desired or to process it collectively or collectively Device can be commanded. The software and / or data may be in the form of any type of machine, component, physical device, virtual equipment, computer storage media, or device , Or may be permanently or temporarily embodied in a transmitted signal wave. The software may be distributed over a networked computer system and stored or executed in a distributed manner. The software and data may be stored on one or more computer readable recording media.

The method according to an embodiment may be implemented in the form of a program command 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, and the like, alone or in combination. The program instructions to be recorded on the medium may be those specially designed and configured for the embodiments or may be available to those skilled in the art of computer software. Examples of computer-readable media include magnetic media such as hard disks, floppy disks and magnetic tape; optical media such as CD-ROMs and DVDs; magnetic media such as floppy disks; Magneto-optical media, and hardware devices specifically configured to store and execute program instructions such as ROM, RAM, flash memory, and the like. Examples of program instructions include machine language code such as those produced by a compiler, as well as high-level language code 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.

While the present invention has been particularly shown and described with reference to exemplary embodiments thereof, it is to be understood that the invention is not limited to the disclosed exemplary embodiments. For example, it is to be understood that the techniques described may be performed in a different order than the described methods, and / or that components of the described systems, structures, devices, circuits, Lt; / RTI > or equivalents, even if it is replaced or replaced.

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

Claims (18)

Sending a remote peer list to the cache server based on a network distance between each of the peers in the overlay network and the cache server;
Receiving, from the cache server, a peer list including an identifier of a peer interacting with the cache server after transmitting the remote peer list; And
Selecting another cache server to be added to the overlay network using the peer list
/ RTI >
A method of resource allocation of an overlay management server.
The method according to claim 1,
Wherein the selecting the different cache server comprises:
Obtaining a cache server list determined based on a network distance between each of the cache servers and the peer; And
Selecting the other cache server from the cache server list
/ RTI >
A method of resource allocation of an overlay management server.
The method according to claim 1,
Receiving resource utilization status information from the cache server; And
Determining whether to release resources of the cache server based on the resource utilization state information
≪ / RTI >
A method of resource allocation of an overlay management server.
The method of claim 3,
Wherein the resource utilization status information comprises:
A start timestamp indicating a start time of resource utilization status check of the cache server;
An end timestamp indicating an end time of the resource utilization status check of the cache server;
Storage usage of the cache server with respect to storage capacity;
Upload traffic of the cache server;
Download traffic of the cache server;
An uplink bandwidth of the cache server;
The downlink bandwidth of the cache server;
The number of peer connections used when the cache server uploads traffic; And
The number of peer connections used when the cache server downloads traffic
/ RTI >
A method of resource allocation of an overlay management server.
The method according to claim 1,
Sending a request message to the other cache server to reserve resources of the other cache server; And
Receiving a response message from the other cache server
≪ / RTI >
A method of resource allocation of an overlay management server.
6. The method of claim 5,
The response message includes:
The identifier of the resource to be reserved, the identifier of the resource to be reserved, the identifier of the virtual peer of the other cache server, and the maximum time to which the reserved resource is allocated.
A method of resource allocation of an overlay management server.
The method according to claim 1,
The cache server,
Further comprising: if the remote peer list is received, checking whether the peer is in the remote peer list and adding the peer to the peer list to send to the overlay management server if the peer is in the remote peer list,
A method of resource allocation of an overlay management server.
Communication interface; And
Transmitting a remote peer list determined based on a network distance between each of the peers in the overlay network and the cache server to the cache server via the communication interface and transmitting the remote peer list A controller that receives a peer list including an identifier of a peer interacting with the cache server from the cache server via the communication interface and selects another cache server to be added to the overlay network using the peer list,
Containing
Overlay management server.
9. The method of claim 8,
The controller comprising:
Obtaining a cache server list determined based on a network distance between each of the cache servers and the peer, and selecting the other cache server among the cache servers based on the cache server list,
Overlay management server.
9. The method of claim 8,
The controller comprising:
Receiving resource utilization status information from the cache server via the communication interface and determining whether to release resources of the cache server based on the resource utilization status information;
Overlay management server.
11. The method of claim 10,
Wherein the resource utilization status information comprises:
A start timestamp indicating a start time of resource utilization status check of the cache server;
An end timestamp indicating an end time of the resource utilization status check of the cache server;
Storage usage of the cache server with respect to storage capacity;
Upload traffic of the cache server;
Download traffic of the cache server;
An uplink bandwidth of the cache server;
The downlink bandwidth of the cache server;
The number of peer connections used when the cache server uploads traffic; And
The number of peer connections used when the cache server downloads traffic
/ RTI >
Overlay management server.
9. The method of claim 8,
The controller comprising:
Transmitting a request message to the other cache server via the communication interface to reserve resources of the other cache server and receiving a response message from the other cache server via the communication interface;
Overlay management server.
13. The method of claim 12,
The response message includes:
The identifier of the resource to be reserved, the identifier of the resource to be reserved, the identifier of the virtual peer of the other cache server, and the maximum time to which the reserved resource is allocated.
Overlay management server.
9. The method of claim 8,
The cache server,
Further comprising: if the remote peer list is received, checking whether the peer is in the remote peer list and adding the peer to the peer list to send to the overlay management server if the peer is in the remote peer list,
Overlay management server.
Cache server; And
The method comprising: transmitting a remote peer list determined based on a network distance between each of the peers and the cache server to the cache server, List, a list of peers including an identifier of the peer is received from the cache server, and when receiving the peer list, an overlay management server for selecting another cache server for the peer
Containing
Managed peer - to - peer network system.
16. The method of claim 15,
The overlay management server,
Obtaining a cache server list determined based on a network distance between each of the cache servers and the peer, and selecting the other cache server among the cache servers based on the cache server list,
Managed peer - to - peer network system.
16. The method of claim 15,
The overlay management server,
Receiving resource utilization status information from the cache server and determining whether to release resources of the cache server based on the resource utilization status information;
Managed peer - to - peer network system.
18. The method of claim 17,
Wherein the resource utilization status information comprises:
A start timestamp indicating a start time of resource utilization status check of the cache server;
An end timestamp indicating an end time of the resource utilization status check of the cache server;
Storage usage of the cache server with respect to storage capacity;
Upload traffic of the cache server;
Download traffic of the cache server;
An uplink bandwidth of the cache server;
The downlink bandwidth of the cache server;
The number of peer connections used when the cache server uploads traffic; And
The number of peer connections used when the cache server downloads traffic
/ RTI >
Managed peer - to - peer network system.

Images