KR100836619B1 - Peer Management Server and Peer Management Method in P2P System - Google Patents

Abstract

The present invention relates to a peer management server in a P2P system, wherein the peer management server of the present invention establishes a connection with peers connected to a P2P system, receives a message from the peers, and receives a message from the peer for processing a message. A front end processor for generating corresponding query names and parameters; An SQL map processor including mapping information for mapping the query name and parameters into query statements and outputting query statements corresponding to the query names and parameters received from the front end processor; And a peer database that maintains information of peers operating as active peers and content information held by each peer, and updates data or extracts data according to a query statement output from the SQL map processor.

P2P, Database, Download

Description

Peer Management Server in P2P System and Peer Management Method}

1 is a diagram showing an example of a data structure of a tree structure for managing conventional peer information.

2 is a diagram illustrating a configuration of a P2P system to which a peer management server according to an exemplary embodiment of the present invention is applied.

3 is a block diagram showing the configuration of a peer management server according to an embodiment of the present invention.

4 is a block diagram showing a module configuration of an agent program according to an embodiment of the present invention.

5 is a block diagram showing a module configuration of a front end processor according to an embodiment of the present invention.

6 is a flowchart illustrating the overall operation of a P2P system according to an embodiment of the present invention.

7 is a diagram illustrating an operation structure of an SQL map processor according to an exemplary embodiment of the present invention.

  8 is a diagram illustrating an example of a connection structure between an SQL map processor and a database according to an embodiment of the present invention.

 9 is a flowchart illustrating a peer registration process according to an embodiment of the present invention.

10 is a flowchart illustrating a process of providing peer information in a peer management server according to an exemplary embodiment of the present invention.

11 is a flowchart illustrating a process for randomly selecting a peer having content requested by a user according to an exemplary embodiment of the present invention.

12 illustrates a field configuration of a peer registration request message according to an embodiment of the present invention.

The present invention relates to a peer management server of a P2P system, and more particularly, to a peer management server for providing peer information for file transmission and reception between peers and a peer management method thereof.

The P2P system is a communication system in which all participants are suppliers and consumers by directly connecting and searching between personal computers (peers) beyond the conventional client-server concept.

This P2P system was first attempted to share music files by services such as Napster in the US and Sori Sea in Korea. Recently, P2P systems are used in various services, not just music file sharing.

For example, P2P systems are also used to exchange game packets between clients in game systems, and are used as a way for content providers to reduce the burden on servers.

Such a P2P system should provide peer information for connection between individual clients, and the P2P service provider manages information of peers connected to the P2P system using a peer management server.

In the conventional case, the information of peers connected to the P2P system was generally managed by a tree structure data structure. 1 is a diagram showing an example of a data structure of a tree structure for managing conventional peer information.

As shown in FIG. 1, in the related art, information of peers connected by a tree structure list in which a parent node and a child node are organically connected is managed, and by an algorithm that processes connection and release of a peer. Peer information has been updated.

As such, when the information of peers connected by the data structure is managed, there is a problem in which some of the connected peer information are lost, and the problem of taking up too much memory space of the server by managing peer information by the data structure rather than the database. There was this.

In particular, when the peer information to be managed increases, the memory space of the server is limited, so managing the peer information by the data structure is inefficient.

In the past, only static information such as user ID and personal information was managed by the database, but the server for efficient processing when managing peer information in the database and managing peer information in the database to process peer information more efficiently. A process is required.

In order to solve the problems of the prior art as described above, a peer management server capable of efficiently managing peer information connected to a P2P system by a database and a P2P system using the same are proposed.

Another object of the present invention is to propose a process structure of a peer management server that can efficiently process a request message when managing peer information through a database, and a P2P system using the same.

Another object of the present invention is to propose a P2P system that can minimize the load of a user client when using a P2P system.

In order to achieve the above object, according to an aspect of the present invention, establishing a connection with the peers connected to the P2P system and receive a message from the peers, the query corresponding to the received message for message processing A front end processor for generating names and parameters; An SQL map processor including mapping information for mapping the query name and parameters into query statements and outputting query statements corresponding to the query names and parameters received from the front end processor; And a peer database that maintains information of peers operating as active peers and content information held by each peer, and includes a peer database that updates or extracts data according to a query statement output from the SQL map processor. A management server is provided.

The peer management server may further include a state determination unit that checks a user connection and message processing state and a query statement generation state; And a process generation controller configured to control generation and destruction of the front end processor for the user access and message processing and the SQL map processor for generating the query statement in response to the determination result of the state determination unit.

The peers are provided with an agent program for communication with the peer management server and other peers, and the agent program determines whether the peer is in a download state and registers a peer registration request message and peer for registering the peer as an active peer. Send the release request message.

The SQL map processor stores the mapping information for mapping the query name and parameters into a query statement as an XML document.

The registration request message includes a user ID, an address, and retained content information. The front end processor generates a preset query name corresponding to the peer registration request message and parameters for the user ID, address, and retained content information. The SQL map processor extracts peer information from the peer database by generating query statements by analyzing query names and parameters from the front end processor.

According to another aspect of the present invention, a peer information management method in a P2P system, comprising: receiving a registration request message from a peer connected to a P2P system; (B) analyzing a query name and a peer registration message corresponding to the peer registration request message to generate a parameter; (C) generating a query statement corresponding to the registration request message by using mapping information for mapping the query name and parameters into a query statement; And (d) registering the peer as an active peer in a peer information database by the query statement.

An agent program is installed in the peer, and the agent program determines whether the peer is in a content download state and transmits the registration request message.

The parameter generated by analyzing the peer registration request message may include a user ID, an address, and content information held.

The mapping information for mapping the query name and parameters to the query statement is preferably stored in XML format.

On the other hand, the above method comprises the steps of receiving a content request message from a specific peer; Generating parameters for a query name corresponding to the content request message and a content ID included in the content request message; Generating a query name corresponding to the content request message and a peer selection query statement corresponding to the parameter using the mapping information; And selecting a peer having content associated with the content ID from the peer database by the peer selection query statement.

According to another aspect of the present invention, there is provided a recording medium in which a program of instructions for performing the above-described methods is tangibly embodied and which is installed in a digital data processing apparatus and records a program that can be read by the digital data processing apparatus. .

According to another aspect of the present invention, a front-end server establishes a connection with peers connected to a P2P system, receives a message from the peers, and generates a query name and parameters corresponding to the received message for message processing. ; An SQL map server including mapping information for mapping the query name and the parameter to a query statement and outputting a query statement corresponding to the query name and the parameter received from the front-end server; And a peer database that maintains information of peers operating as active peers and content information held by each peer, and updates or extracts data according to a query statement output from the SQL map server.

Hereinafter, with reference to the accompanying drawings will be described in detail a preferred embodiment of a peer management server according to the present invention.

2 is a diagram illustrating a configuration of a P2P system to which a peer management server according to an exemplary embodiment of the present invention is applied.

2, a P2P system according to an embodiment of the present invention includes a plurality of user clients and a peer management server 200, and a P2P agent program is installed in each user client.

The P2P system to which the present invention is applied may be applied to various types of P2P services. The P2P system of the present invention can be applied to a file sharing service of a general music or video file. The file sharing service is a service that allows users accessing a P2P service system to check a list of files owned by a user and to download a specific file from a specific peer.

In addition to the general file sharing service, the present invention can be used for a content delivery service using P2P. In general, content providing from a content provider is performed using a content delivery network (CDN), but it is possible to provide content without using a CDN, which requires a predetermined cost, using a P2P system according to the present invention. In this case, a list of peers that stores the content that the user wants to receive from the service provider is provided to the user who requested the content, and the user downloads the content from a specific peer among the peers included in the peer list, thereby not using the CDN. It is possible to provide.

In addition to the above-described service, the present invention may be applied to various services that can be provided using P2P.

Hereinafter, the present invention will be described with a main example of a case where a content provider provides content requested by a user using P2P.

The user client can include any kind of device that can communicate over a network and can run a P2P agent program. As the user client, devices such as laptops, PDAs, and mobile terminals as well as general PCs may be used.

Each user client connected to the P2P system operates as one peer, and the terms peer and user client are used interchangeably herein.

When the user requests specific content, the peer management server 200 provides peer information for providing content requested by the user. For example, when a user requests a movie called "Moulin Rouge", the peer management server 200 functions to extract peer information capable of providing a movie file called "Moulin Rouge" and provide it to the corresponding client.

The peer management server 200 accesses a P2P system to provide peer information for providing content requested by a user, and manages a list of peers capable of providing content and content information stored by each peer.

As described above, in the related art, the peer management server managed a list of peers connected to a P2P system and content information stored by each peer in the form of a data structure. In the prior art, the peer list and the contents stored by each peer were managed in memory in the form of a data structure, and it was common to manage only static information that does not change, such as a user ID, in a database. In addition, when a request message is received from a user, such as a peer information message, the peer management server performs a predetermined algorithm on the data structure to process the user's request information.

However, the peer management server according to the preferred embodiment of the present invention manages the peer list connected to the P2P system and the content information stored by each peer in the database.

According to a preferred embodiment of the present invention, it is possible to manage peer information in multiple databases when the peer capacity to be managed increases by managing peer information in a database.

In addition, the peer management server according to the preferred embodiment of the present invention independently operates a process of processing a client connection and a message from a client and a process of generating a query statement of a database in order to manage information of connected peers in a database. .

In the conventional method of managing peer information using a data structure, client access, message processing, and algorithms for inserting, extracting, and updating data in the data structure were inevitably performed by a single process. In addition, in the conventional case, static information was managed in a database, but query statements for the database were also generated by the same single process. However, according to a preferred embodiment of the present invention, the functions performed by one process as described above are performed by separate processes.

A more detailed method of processing user access, message processing, and database query statement generation by a separate process and its advantages will be described with reference to other drawings.

The agent program installed in each user client performs peer registration through communication with the peer management server so that the client can operate as a peer in the P2P network.

According to a preferred embodiment of the present invention, the agent program performs peer registration and peer deregistration to operate as a peer only when the user client is downloading content from another peer.

In the conventional case, the agent program installed in the user client for P2P generally controls the user client to operate as a peer providing content during the operation of the user client.

However, when the user client is set to always operate as a peer, there is a problem that resources of the user client are excessively wasted by P2P communication. For example, processing of P2P connections may cause delays in processing of other tasks performed by the user or excessive load on the CPU.

In order to solve such a conventional problem, the present invention can operate as a peer providing content to other clients only when the user client is downloading content from another peer.

In addition to the above-described peer registration operation, the agent program receives peer information holding content requested by a user from the peer management server, establishes a connection with the corresponding peer, and performs a function of downloading content.

3 is a block diagram illustrating a configuration of a peer management server according to an exemplary embodiment of the present invention.

Referring to FIG. 3, a peer management server according to an embodiment of the present invention may include a state determination unit 300, a process generation control unit 302, a front end process unit 304, an SQL map process unit 306, and a peer database. 308.

In FIG. 3, the front end processor 304 is responsible for communicating with the agent program installed in each peer. The front end processor 304 functions to process the connection setup when the user client requests the connection setup. The front end processor 304 maintains a connection with the user clients, where the connection is preferably a TCP connection and may maintain a UDP connection as needed.

In addition, the front end processor 304 receives a request message from an agent program installed in each peer and processes the received request message. The request message that the front end processor 304 receives from the agent program may include a peer registration request message, a peer deregistration request message, and a content request message.

The peer registration request message is a message requesting a peer to register itself as an active peer capable of providing content. As described above, according to a preferred embodiment of the present invention, when the agent program detects that the user downloads content from another peer, the agent program generates a peer registration request message and transmits it to the front end processor 304.

The peer deregistration request message is a message for a peer that has registered itself as an active peer to request deregistration for registration. According to a preferred embodiment of the present invention, when the agent program is no longer downloading content from another peer, the agent program generates and sends a peer deregistration request message to the front end processor 304.

The content request message is a message for requesting peer information for storing specific content. When the user requests the download of specific content, the agent program generates a content request message including ID information of the corresponding content and transmits it to the front end processor 304.

In addition to the above-described messages, various kinds of messages may be delivered from the peer to the front end processor, and the front end processor 304 receives messages generated by the agent program and generates corresponding query names / parameters. Function

In the conventional case, when the peer management server receives the above-mentioned request messages from the peer, the peer management server performs an algorithm corresponding to the request to register a peer in the data structure data or select a peer from the data structure data. In addition, when communication with the database is required, the query statement is generated in one process by analyzing the user's request message.

However, when the front end processor 304 according to the preferred embodiment of the present invention receives a request message, the front end processor 304 does not directly generate a query statement, but generates only a query name and a parameter corresponding to the request message. To provide.

Here, the query name is a name of a query arbitrarily determined between the front end process 304 and the SQL map processor 306, and the parameter means information necessary for generating a query statement, such as a content ID and a user ID.

The SQL map processor 306 receives a query name / parameter from the front end processor 304 and generates a query statement corresponding to the query name / parameter. The generated query statement is provided to the peer database 308 as a language recognizable by the peer database 308.

As described above, an embodiment of the present invention which separates a process corresponding to a request message from a user from a process of receiving and processing a request message from a user has various advantages.

First, by separating the message and connection processing process from the query process, it is possible to efficiently create a process according to the state of the server. For example, when there are more connection processing and message processing requests than query requests, the peer management server may generate and operate a larger number of front end processes. In addition, when more resources are required to generate query statements than message processing, the peer management server may generate and operate a larger number of SQL map processors. In other words, by properly generating the front-end process unit and the SQL map process unit according to the state of the server, it is possible to efficiently utilize the server limited resources.

In addition, even if the database is changed, only the SQL map process unit is updated, and the front-end process unit does not need to be updated, thereby reducing the time and cost required for updating the database. Management becomes easy.

The peer database 308 adds, deletes, or updates information of peers connected according to a query statement of the SQL map processor. According to an embodiment of the present invention, the peer database 308 may store a user ID of a registered peer, a peer address, and content information stored by the peer. In addition, the peer database 308 stores random ID information for each peer to be described later.

The state determination unit 300 functions to determine the state of the peer management server, where the state determination determines whether server resources are consumed for message and connection processing or server resources are generated for query statement generation. do.

The processor generation controller 302 functions to generate or destroy the front end processor 304 or the SQL map processor 306 according to the determination result of the state determination unit 300.

Although FIG. 3 illustrates a case in which the peer management server performs both the front end process unit and the SQL map process unit, a system in which the front end process unit and the SQL map process unit are performed by separate servers may be implemented. It will be obvious to you.

4 is a block diagram illustrating a module configuration of an agent program according to an exemplary embodiment of the present invention.

Referring to FIG. 4, the agent program according to an embodiment of the present invention includes a download check module 400, a connection establishment module 402, a peer registration / release module 404, a peer information receiving module 406, and a peer connection. It may include a configuration module 408 and a content storage module 410.

The download check module 400 checks whether the agent program is in a state of downloading content from another peer. As described above, according to the preferred embodiment of the present invention, the download check module 400 continuously checks whether the agent program is in the download state as the peer is registered in the active or inactive state according to whether it is in the download state. .

The connection establishment module 402 functions to establish a connection with a peer management server. Typically, the P2P agent program transmits a peer registration request message when establishing a connection, but according to a preferred embodiment of the present invention, the connection establishment module 402 performs only connection establishment with a peer management server and registers a peer when establishing a connection. It does not send a request message. As described above, the connection establishment module 402 may perform TCP connection establishment with the peer management server 402 and may establish a UDP connection as necessary.

The peer registration / release module 404 functions to generate and transmit a peer registration request message or a peer deregistration request message according to the download check result of the download check module 400.

When the download status is detected in the download check module 400, the peer registration / release module 404 sends a peer registration request message to the peer management server and the peer management server performs a peer registration procedure. In the peer registration request, content information stored in the client is included in the peer registration request message.

When the download completion status is detected by the download check module 400, the peer registration / deactivation module 404 transmits a peer deregistration request message to the peer management server, and the peer management server performs a peer deregistration procedure.

The peer information receiving module 406 functions to request content from the peer management server and to receive peer information from the peer management server. The peer information receiving module 406 generates and sends a content request message to the peer management server, and the content request message includes content ID information for identifying the content. Peer information receiving module 406 receives peer information from the peer management server in response to the content request message. Here, the peer information may include only one peer or may include a plurality of peer lists.

The peer connection establishment module 408 establishes a connection with the peer to receive the content and downloads the content based on the peer information received by the peer information receiving module 406. Since downloading a content by establishing a connection with a peer is a general P2P technology, a detailed description thereof will be omitted.

The content storage module 410 functions to store content information received from another peer in a preset area. The content storage module 410 preferably encrypts and stores the received content so that the received content is not illegally useful.

5 is a block diagram illustrating a module configuration of a front end process unit according to an exemplary embodiment of the present invention.

Referring to FIG. 5, the front end process unit according to an embodiment of the present invention may include an authentication module 500, a connection establishment module 502, an agent communication module 504, a random ID allocation module 506, and a query name / parameter. It may include a generation module 508 and a random range setting module 510.

The authentication module 500 determines whether the user requesting connection establishment is an authenticated user. For example, the authentication module 500 may determine whether the user is an authenticated user by using user ID and password information. Of course, a variety of well-known authentication methods, such as an authentication method using a certificate, may be used. The authentication module 500 may process user authentication in association with a separate authentication server.

The connection establishment module 502 performs connection establishment with a user client that wants to connect to a P2P network. Connection establishment may be performed in such a way that a user client controlled by an agent program sends a TCP connection request message and the connection establishment module 502 accepts it. Of course, UDP connections can be set up as needed.

The agent communication module 504 functions to receive request messages generated by the agent program and transmit a response message to the user client. As described above, the request message may include a peer registration request message, a peer deregistration request message, and a content request message, and the agent communication module 504 transmits a response message to the above-described messages to the corresponding user client. .

The random ID assignment module 506 functions to assign a random ID to each peer when receiving a peer registration request message. Random ID assignment is a task performed to randomly provide peer information when providing peer information to a client. According to an embodiment of the present invention, when dynamically changing peer information is stored in a database, it is impossible to randomly extract peer information corresponding to a user's request through a database query statement. The random ID assignment module 506 is a task for solving such a problem.

The random range setting module 510 functions to randomly set a number range for peer selection when a message for requesting peer selection, such as a content request message, is received. The randomly set range is output as a parameter, and the SQL map processor generates a peer selection query using the range set in the random range setting module when selecting a peer.

FIG. 5 illustrates an embodiment in which each peer is also randomly assigned a number and a range for randomly selecting a peer is also set.

However, the peers may be randomly selected according to an embodiment in which the number of peers is sequentially assigned but the ranges are randomly set, and the number of peers is randomly set but the range is fixedly set.

A more detailed method for random selection of peers will be described with reference to separate drawings.

The query name / parameter generation module 508 generates a query name and parameters for processing a message received by the agent communication module. As described above, the front end process unit does not directly generate a query statement for processing a message, but generates only a query name and a parameter corresponding to the received message and transfers it to the SQL map process unit.

For example, when receiving a peer registration request message, the query name / parameter generation module 508 generates a parameter corresponding to a user ID, address, and content information, which is a preset query name called RegisterPeer and included in the peer registration request message. Passed to the SQL map process part.

7 is a diagram illustrating an operation structure of an SQL map processor according to an exemplary embodiment of the present invention.

Referring to FIG. 7, the SQL map processor receives the query name and parameters from the front end processor. In Fig. 7, the query name "GetUserInfo" and the parameter "junny" are displayed.

As such, the SQL map processor has information for mapping the query name and the parameter to the SQL statement, and the SQL map processor receiving the query name and the parameter outputs the query statement which is a database language using the mapping information.

These query statements include database definition statements that define the relationships between schemas or objects in the database, database operations for operations such as inserting / deleting / updating database data, and database control statements to correctly maintain data and ensure integrity. It can include both.

According to an embodiment of the present invention, the mapping information may be stored as a document in XML format.

As shown in FIG. 7, an XML document for mapping to the query name “GetUserInfo” may be defined as follows.

<select name = "GetUserInfo">

 <param name = "id" type = "string" />

<! [CDATA [

SELECT ..... WHERE ID ....: id

]]>

</ select>

As shown in FIG. 7, the query statements SELECT ... WHERE ID +: id and: id = foo are generated and provided to the peer database using the XML mapping information as described above.

The peer database receives the above-described query statement and extracts user information of the user foo.

8 is a diagram illustrating an example of a connection structure between an SQL map processor and a database according to an embodiment of the present invention.

As illustrated in FIG. 8, the SQL map processor may be connected to a plurality of databases independently of the front end processor. In addition, even if a database is added, the code of the agent program of the front end and the client does not need to be changed, and only the code of the SQL map processing unit is changed.

 In addition, SQL is managed in the SQL Map process section without mixing code and SQL, allowing centralized management of SQL. In particular, it is easy to calculate monitoring and statistical information, and abnormal query statements with a long execution time can be easily detected.

6 is a flowchart illustrating the overall operation of a P2P system according to an embodiment of the present invention.

Referring to FIG. 6, first, a user client transmits a content request message for requesting a specific content to a peer management server through an agent program (S600).

Upon receiving the content request message, the peer management server extracts the peer information storing the content requested by the user client, transmits the peer information to the user, and the user receives the peer information (S602). According to a preferred embodiment of the present invention, it is preferable to randomly select a peer so that peer information storing specific content can be uniformly provided to user clients, and a detailed embodiment thereof will be described later.

Upon receiving the peer information, the user client establishes a connection with the corresponding peer by using the address information included in the peer information by the agent program (S604). When the connection with the corresponding peer is established, the user client downloads content from the peer with which the connection is established (S606).

If it is detected to start downloading from another peer, the agent program performs a peer registration procedure so that the user client is registered as an active peer (S608).

When registered as an active peer, another user client may request content, and performs a procedure of transmitting content in response to the content request of the other user client (S610).

The agent program monitors whether the download of the user client is completed (S612).

When the download is completed, the agent program releases the peer active state by transmitting a peer deregistration request message to the peer management server (S614).

 9 is a flowchart illustrating a peer registration process according to an embodiment of the present invention.

Referring to FIG. 9, the agent program installed in the user client monitors whether the user client downloads content from another peer (S900).

When the content download is detected, the agent program generates a peer registration request message (S902). 12 illustrates a field configuration of a peer registration request message according to an embodiment of the present invention.

Referring to FIG. 12, the peer registration request message may include an identifier 1200, a user ID 1202, an address 1204, and a content ID 1206.

The identifier 1200 is preset code information for identifying the peer registration request message.

The user ID 1202 is ID information of a user requesting peer registration, and the address 1204 may include an IP address and a port number of a user client. The content ID 1206 is ID information for identifying content held by the user client. The content may include not only content provided by the service provider but also user created content (UCC).

The generated peer registration request message is received by the front end processor (S904), and the front end processor receives the query name corresponding to the peer registration request message and parameters for the user ID, address, and content ID included in the peer registration request message. It generates (S906).

The generated query name and parameters are transferred to the SQL map process unit, and the SQL map process unit generates a query statement corresponding to the transmitted query name and parameters using the mapping information (S910), and the generated query statement is a new peer information. Query statement for inserting (user ID, address, content ID) into the database.

10 is a flowchart illustrating a process of providing peer information in a peer management server according to an exemplary embodiment of the present invention.

Referring to FIG. 10, the user client transmits a content request message including ID information of specific content to the front end processor (S1000).

 The front end processor generates a parameter for a query name corresponding to the content request message and a content ID included in the content request message (S1002).

The generated query name and parameters are transferred to the SQL map processor, and the SQL map processor generates a query statement for randomly selecting a peer that holds the requested content using the parameters and the query name (S1006). A query statement for random selection will be described later with reference to FIG. 11.

The SQL map process unit receives the peer information of the database corresponding to the generated query statement (1008), and the received peer information is provided to the front end process unit (S1010).

The front end processor transmits the peer information to the user client (S1012), and the user client establishes a connection with the corresponding peer using the provided peer information and downloads the content (S1014).

11 is a flowchart illustrating a process for randomly selecting a peer having content requested by a user according to an exemplary embodiment of the present invention.

As described above, when dynamically changing peer information, such as the present invention, is managed by a database, it is difficult to randomly select a peer so that the connection to each peer is kept uniform. This is because the database is configured to extract data corresponding to a specific condition, and a database query statement for random selection is not provided.

To this end, according to a preferred embodiment of the present invention, the user client randomly assigns a number ID to each user at the time of peer registration (S1100). The front end process unit is a process unit irrelevant to a database and a query statement, so it is possible to assign a random number ID to each peer using a general random function.

If a random ID is given, the SQL map processor adds the user ID, address, and content information included in the peer information so that the random ID is stored together in the database (S1102).

When peer information storing a specific content is requested (S1104), the front end process unit randomly sets a range for peer selection, outputs a parameter specifying a randomly set range, and the SQL map process unit sets the parameter. In operation S1106, a query statement for selecting a peer within a specified range is generated.

Such a query statement can be generated by using the general SELECT statement and the range specification (<=.> =, Between) provided by the SELECT statement. For example, a query statement for selecting peers having random IDs 10 to 20 may be generated, and a query statement for selecting peers having random IDs 5 or less may be generated.

 The peer database selects and provides a peer corresponding to the SELECT statement (S1108).

As described above, random selection may be possible by randomly processing any one of random ID grant and random range setting. For example, the number ID may be assigned sequentially rather than randomly, but random selection of a peer may be possible by randomly setting a number range for peer selection.

As another example, each peer may be randomly assigned a number ID, but the range for peer selection may be fixed so that random selection of peers may be possible.

In this way, it is possible to randomly select a peer having content by assigning a random ID to each peer and managing the assigned random ID together in the database, which makes it difficult to make a random selection in the database. At this time, it is possible to control the connection to be uniformly distributed without biasing the connection to a specific peer.

As described above, according to the preferred embodiment of the present invention, there is an advantage in that peer information connected to a P2P system can be efficiently managed by a database.

By generating the map process unit according to the server state, there is an advantage that can utilize the server resources more efficiently.

In addition, according to a preferred embodiment of the present invention, by dualizing the management of the database and the message processing of the client, there is an advantage that can be expanded and upgraded with minimal modification when the database is expanded and the system upgrade.

Furthermore, according to a preferred embodiment of the present invention, the user client operates as an active peer only at the time of downloading, thereby minimizing the load of the user client when using the P2P system.

Claims (13)

A front end processor configured to establish a connection with peers connected to a P2P system, receive a message from the peers, and generate a query name and a parameter corresponding to the received message for message processing; An SQL map processor including mapping information for mapping the query name and parameters into query statements and outputting query statements corresponding to the query names and parameters received from the front end processor; And A peer-to-peer system comprising: a peer database that maintains information of peers operating as active peers and content information held by each peer, and updates or extracts data according to a query statement output from the SQL map processor. Peer Management Server on. The method of claim 1, A state determination unit which checks a user connection and message processing state and a query statement generation state; And P2P further comprises a process generation control unit for controlling the generation and destruction of the front end processor for the user connection and message processing and the SQL map processor for generating the query statement in accordance with the determination result of the state determination unit Peer management server on the system. The method of claim 1, The peers are provided with an agent program for communication with the peer management server and other peers, and the agent program determines whether the peer is in a download state and registers a peer registration request message and peer for registering the peer as an active peer. Peer management server in a P2P system, characterized in that for transmitting a release request message. The method of claim 1, The SQL map processor is a peer management server in a P2P system, characterized in that for storing the mapping information for mapping the query name and parameters to a query statement as an XML document. The method of claim 3, The registration request message includes a user ID, an address, and retained content information. The front end processor generates a preset query name corresponding to the peer registration request message and parameters for the user ID, address, and retained content information. And the SQL map processor extracts peer information from the peer database by generating a query by analyzing query names and parameters from the front end processor. As a method of managing peer information in a P2P system, (A) receiving a registration request message from a peer connected to the P2P system; (B) analyzing a query name and a peer registration message corresponding to the peer registration request message to generate a parameter; (C) generating a query statement corresponding to the registration request message by using mapping information for mapping the query name and parameters into a query statement; And (d) registering the peer as an active peer in a peer information database by the query statement. The method of claim 6, An agent program is installed in the peer, and the agent program determines whether the peer is in a content download state and transmits the registration request message. The method of claim 7, wherein The parameter generated by analyzing the peer registration request message includes a user ID, an address, and content information retained. The method of claim 6, The mapping information for mapping the query name and the parameter to the query statement is stored in the form of XML. The method of claim 6, After step (d), (e) receiving a content request message from a particular peer; generating parameters for a query name corresponding to the content request message and a content ID included in the content request message; (g) generating a query name corresponding to the content request message and a peer selection query statement corresponding to the parameter using the mapping information; And (h) selecting a peer having content associated with the content ID from the peer database by the peer selection query statement. The method of claim 6, The step (b) and the step (c) are processed by a separate process unit, and the step of controlling the generation and destruction of the process unit for the process (b) and the process unit for the process (c) Peer information management method further comprising. A front end server establishing a connection with peers connected to a P2P system, receiving a message from the peers, and generating a query name and a parameter corresponding to the received message for message processing; An SQL map server including mapping information for mapping the query name and the parameter to a query statement and outputting a query statement corresponding to the query name and the parameter received from the front-end server; And Peer information management, comprising: a peer database that maintains information of peers acting as active peers and content information held by each peer, and updates or extracts data according to query statements output from the SQL map server. system. A recording medium on which a program of instructions for performing the method of any one of claims 6 to 11 is tangibly embodied and which is installed in a digital data processing apparatus and records a program that can be read by the digital data processing apparatus.

Images