JP2007018415A - Network element search method and network element search program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To enable a quick and accurate search for a network element such as a community in a social network. <P>SOLUTION: A network element search method for searching for one or more network elements from two or more network elements registered in a social network that are assigned one or more attributes representing characteristics of the network elements receives any of the attributes assigned to the network elements, as a search key (S11), and searches for the network elements that are assigned the attribute represented by the received search key (S13, S15). <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a network element search method and a network element search program for searching for one or more network elements from two or more network elements registered in a social network.

  In recent years, there has been a community-type website (social networking site) established for the purpose of introducing new friendships by introducing friends to each other, and a network service (social network service) provided thereby Are provided and spread on communication networks.

  It is said that a social network service cannot participate in a social network without an invitation from an existing participant. As such a social network service, for example, a server-intensive service called “orkut” (for example, see Non-Patent Document 1) or “green” (for example, see Non-Patent Document 2) is known.

  Here, the procedure for building a social network will be described. First, a person is invited to the social network in the form of being introduced by a close person who is an existing participant of the social network. Next, a person invited to the social network joins the social network by registering his / her personal information. In addition, a new person who is invited to a social network invites them to the social network by introducing another close friend. By repeating these steps, a social network linked from person to person is created. In addition, the user registered in the social network introduces himself / herself by inputting his / her profile in a format prepared in advance.

  As mentioned above, in social networks, new participation is not allowed unless there is an introduction from an acquaintance. Therefore, the person who introduced the person will be responsible for solidarity regarding the content of the newly joined person. . For this reason, even a newly joined person makes a responsible statement, and the accuracy of the information transmitted by the participant is naturally increased. As described above, the social network is characterized by a large amount of effective information as compared with other free participation type networks.

  By the way, typical functions provided in many social networking sites include a friend book function and a community function.

  The “friend book function” is a function for searching for an acquaintance from the social network after a series of invitations to the social network and registering it in a list of acquaintances (friend book).

  The friend book function also includes a function for promoting registration of acquaintances in the friend book. Specifically, for example, a user who has newly joined a social network searches for other already-acquainted acquaintances using the acquaintance's friend's book that he / she has already joined, and registers it in his / her friend's book There is a function to go. This function is constructed in consideration of the fact that the acquaintances of the person who acquainted himself and the acquaintances of the person who invited him often share the same person's network in many cases.

  “Community function” refers to various community-related communities in social networks, such as new registration of communities (communities) where people gather with a sense of community, participation in existing communities (registration), and remarks in participating communities. It is a function.

  The community in the social network includes, for example, a community composed of people who share a hobby, a community composed of people who are currently in school or who have graduated school, and a community composed of people who share a common area.

“Orkut web site”, [online], [searched on June 23, 2005], Internet <URL: http://www.orkut.com> “Green web site”, [online], [searched on June 23, 2005], Internet <URL: http://www.gree.jp>

  In the conventional social network described above, communities are classified for each category. However, since an active social network has hundreds of thousands of communities, the existing community is browsed and a desired community is searched. Difficult to do. As described above, in the conventional social network, there is a problem that the search for the community cannot be performed quickly and accurately.

  Conventionally, as a function used for community search in the community function, a function for displaying a list of communities, a function for searching for a community name (title), and a community to which an acquaintance registered in a friend book belongs And a function for searching for communities to which other users belonging to the community to which the user belongs belong. However, for example, when searching for an unknown community, even if each of the above functions is used, the search operation becomes complicated, and it is still difficult to search for a community quickly and accurately.

  Furthermore, since the community registered in the social network is added and updated, every time a community search is performed, a very complicated operation of searching all users and all communities is forced.

  An object of the present invention is to solve the above-described problems and to be able to quickly and accurately search for a network element such as a community in a social network.

  In order to achieve the above object, the present invention provides a network element search method for searching one or more network elements from two or more network elements registered in a social network, wherein the network elements include the network elements. One or more attributes indicating the characteristics of the network element are given, and any of the attributes given to the network element is accepted as a search key, and the network element to which the attribute indicated by the accepted search key is given is searched. Is a network element search method characterized by

  In the network element search method, it is preferable that an attribute assigned to the network element is given an evaluation level derived according to a predetermined algorithm based on an evaluation of the attribute. By assigning the evaluation level, it is possible to determine which attribute represents the characteristic of the network element. In addition, by deriving using a predetermined algorithm based on the evaluation, it is possible to level the evaluation from a large number of users, and to prevent an event in which an attribute that is a characteristic of a network element is determined by the evaluation of a specific user Can do. In this case, the network element search method preferably displays the searched network elements side by side in a rank corresponding to the evaluation level, and the network elements include two or more network elements related to each other. When searching for one network element among the two or more network elements related to each other, the other network elements related to the searched network may be displayed in order according to the evaluation level. preferable. For example, two or more network elements include a community registered in a social network and a user registered in the community. When a community is searched as a network element, it belongs to one or more searched communities. Are displayed in order according to the evaluation level. In this case, the evaluation level of the attribute of the same user as the attribute indicated by the search key used for the community search may be used as the evaluation level. That is, as the evaluation level, the evaluation level of the attribute of another related network element that is the same as the attribute indicated by the search key used for searching for one network element may be used. It is possible to refer to a community of users who have the same attribute and a high evaluation level, and it is possible to extract a community desired by a searcher. In this case, the evaluation level may be determined comprehensively from the evaluation levels of a plurality of attributes of the user. For example, weights corresponding to the attributes may be weighted on the evaluation levels of a plurality of attributes, and the weighted evaluation level values may be added. On the other hand, for example, when a user is searched for as a network element, the communities to which one or more searched users belong may be displayed in order according to the evaluation level. Further, it is preferable that a predetermined range of the evaluation level is further accepted as a search key, and network elements of the evaluation level in the predetermined range are extracted from the network elements searched using the attribute as a search key. In this way, by using the evaluation level as a search key, it is possible to provide a search result that meets the requirements. For example, the searcher can extract a community to which a user with the highest evaluation level belongs or a community to which a predetermined range of users belongs, such as within the top three evaluation levels.

  Furthermore, in the network element search method according to the present invention, it is preferable that the network element is registered in a distributed hash table on a P2P network.

  In order to achieve the above object, the present invention provides a network element search program for searching for one or more network elements from a plurality of network elements registered in a social network. One or more attributes indicating the characteristics of the network element are given, a step of accepting any of the attributes given to the network element as a search key, and an attribute indicated by the accepted search key are given A network element search program for causing a computer to execute a step of searching for a network element.

  In the network element search program according to the present invention, it is preferable that an attribute assigned to the network element is given an evaluation level derived according to a predetermined algorithm based on an evaluation of the attribute. In this case, it is preferable that the network element search program according to the present invention further causes the computer to execute a step of arranging and displaying the searched network elements in a rank according to the evaluation level. Includes two or more network elements related to each other, and when searching for one network element among the two or more network elements related to each other, the other network elements related to the searched network are evaluated. It is preferable to further cause the computer to execute the step of arranging and displaying in order according to the level. Further, the computer further includes a step of further accepting a predetermined range of the evaluation level as a search key, and a step of extracting a network element of the evaluation level in the predetermined range from the network elements searched using the attribute as a search key. It is preferable to make it execute.

  In the network element search program according to the present invention, it is preferable that the network element is registered in a distributed hash table on a P2P network, and the computer is a computer constituting the P2P network.

  In the network element search method and the network element search program according to the present invention, examples of the network element include a community registered in a social network and a user registered in the community.

  As described above, according to the present invention, when searching for a network element from two or more network elements (for example, community, user), any of the attributes assigned to the network element is accepted as a search key and accepted search Since the network element to which the attribute indicated by the key is assigned as the characteristic of the network element is searched, the network element search in the social network can be performed quickly and accurately.

  Next, embodiments of a network element search method and a search program according to the present invention will be described with reference to the drawings. FIG. 1 is a conceptual diagram illustrating a configuration example of a P2P network in which a social internet network in which a network element search program according to the present embodiment operates is constructed. The social internet network refers to a network that shares the friend book information and community information of each social network as a whole on a distributed hash table (Distributed Hash Table, DHT). Details will be described below. FIG. 2 is a conceptual diagram showing a state of data sharing in the social internetwork 100.

  In the P2P network shown in FIG. 1, a plurality of user terminals 1 to N (N is an arbitrary positive integer) are connected via a communication network 30 such as the Internet or an intranet, and stored in each P2P (Peer− (To-Peer) network program.

  Each of the user terminals 1 to N is configured by an information processing apparatus such as a personal computer or a mobile communication terminal, and includes an environment for connecting to the communication network 30 such as a LAN card or a modem. In addition, each of the user terminals 1 to N includes control programs 11 to 1N and DHTs 21 to 2N constituting a DHT 110 described later.

  The control programs 11 to 1N are stored in storage media included in the user terminals 1 to N, respectively. Each of the user terminals 1 to N performs various controls according to the control programs 11 to 1N stored in the storage medium provided therein. The control programs 11 to 1N include a network element search program and a P2P network program according to the present embodiment. That is, the network element search program according to the present embodiment is stored in each user terminal 1 to N.

  Data constituting the social network 100 is distributed to the DHTs 21 to 2N provided in the user terminals 1 to N constituting the DHT 110, respectively. That is, the social internetwork 100 is constructed by data stored on a DHT which is a virtual hash table on a P2P network constituted by DHTs 21 to 2N provided to participating user terminals 1 to N, respectively.

  Data storage using the DHT 110 is generally performed by creating and storing a key by using a Hash function, and passing the data to the user terminals 1 to N in charge of the created key area to hold the data in a distributed manner.

  This DHT 110 includes a user information table 111 that includes personal information and friend book information of each user, a community information table 112 that includes various information related to the community registered in the social internet network 100, and a user and community. An attribute information table 113 that includes various information related to the attribute to be assigned is stored. The shared data stored in the DHT 110 is distributed and held by the user terminals 1 to N by the DHT as described above, thereby realizing virtual data sharing. The attribute information table 113 includes a user attribute information table including user attribute information indicating user characteristics, a community attribute information table including community attribute information indicating community characteristics, and the like.

  The user attribute information table includes a plurality of user attributes that can be given to the user, such as “humorous”, “bright”, “serious”, “hot blood”, “cool”, etc., as shown in FIG. User attributes that are assumed to be assigned to the users are selected and registered in advance. As shown in FIG. 3, an attribute code for uniquely identifying each user attribute is assigned to these user attributes.

  In the community attribute table, a plurality of community attributes that can be given to communities registered in the social internetwork 100, for example, “full of humor”, “bright”, “serious”, “hot blood” ”,“ Cool ”, and other community attributes that are supposed to be given to the community are selected and registered in advance. Further, as shown in FIG. 4, an attribute code for uniquely identifying each community attribute is assigned to these community attributes.

  In the examples shown in FIGS. 3 and 4, the contents of each user attribute registered in the user attribute table and each community attribute registered in the community attribute table are the same, but different attributes are registered. May be. Each of the attributes shown in FIGS. 3 and 4 is an example, and may include other attributes such as “car lover” and “baseball lover”. In addition, a user attribute and a community attribute can be added using each user terminal 1-N.

  In this embodiment, the contents of the attribute evaluation include five types of evaluations A to E as shown in FIG. Each of these evaluations A to E includes, for example, a method of selecting one from a plurality of evaluation contents such as 5 levels of 1 to 5 and a method of scoring according to the score. Adopts a five-step evaluation.

  “Evaluation A” is an evaluation of whether each community attribute assigned to a community is appropriate as an attribute of the community. This evaluation is made by each user belonging to the community, for example.

  “Evaluation B” is an evaluation of whether each user attribute assigned to the user is appropriate as the attribute of the user. This evaluation is made by other users in the community to which the user to be evaluated belongs, for example. Note that the user who performs the evaluation evaluates, for example, the user attribute having the same content as the community attribute of the community to which the user and the user to be evaluated belong, and does not evaluate the user attribute having the content different from the community attribute.

  “Evaluation C” is an evaluation of each attribute by ranking each community attribute assigned to the community from the order that seems to well represent the characteristics. This evaluation is made by each user belonging to the community, for example.

  “Evaluation D” is an evaluation based on the degree of attachment of each community attribute assigned to the community. This evaluation is made by each user belonging to the community, for example.

  “Evaluation E” is an evaluation based on the degree of attachment of each user attribute assigned to the user. This evaluation is made by the user himself / herself, for example.

  The ranks (1 to 5 levels) of the evaluations A to E registered by each user are aggregated using a known algorithm such as the SET (Secure Eigen Trust) algorithm, for example, as a comprehensive evaluation value. An evaluation level is derived. The SET algorithm is an algorithm using DHT, and is an algorithm used for obtaining an evaluation value evaluated by each user on the P2P network as a comprehensive reputation.

  In the user information table 111, in addition to the personal information and friend book information of each user, attributes assigned to each user as shown in FIG. 6 and evaluation levels related to the attributes are registered. For example, the user A has at least a user attribute whose attribute code is “Pe002”, a user attribute whose attribute code is “Pe008”, a user attribute whose attribute code is “Pe024”, and a user whose attribute code is “Pe055”. Attributes are registered, and evaluation levels of “evaluation B” and “evaluation E”, which are user evaluations, are registered respectively. As the evaluation level of “evaluation B”, the evaluation level processed by the above-described SET algorithm is registered.

  Such attribute and evaluation level registration processing of the user information table 111 is performed as follows. That is, other users in the community to which the user belongs select an attribute adapted to the user from the user attribute table, and the rank (1 to 5) of “evaluation B” regarding the attribute for the user is selected. When registered, the rank of the registered “evaluation B” is processed as an evaluation level by the SET algorithm and registered in the user information table 111. Next, with respect to an attribute already registered by another user or a new attribute selected from the user attribute table, the rank (1 to 5 levels) of “evaluation B” regarding the attribute for the user is registered. The rank of the processed “evaluation B” is processed by the SET algorithm together with the rank registered before that, and is registered in the user information table 111 as an evaluation level. By repeating such registration processing, a plurality of attributes and more objective evaluation levels are registered. On the other hand, when the user registers the rank (1-5 levels) of “evaluation E” for each attribute and the evaluation level of other users related thereto, the rank of “evaluation E” is registered in the user information table 111. The

  In the community information table 112, in addition to user information belonging to the community, information on the community itself, and the like, attributes assigned to each community and evaluations regarding the attributes are registered as shown in FIG. For example, the community A includes at least a community attribute with an attribute code “Co003”, a community attribute with an attribute code “Co011”, a community attribute with an attribute code “Co051”, and a community with an attribute code “Co113”. The attributes are registered, and the evaluation levels of “evaluation A” and “evaluation C”, which are evaluations regarding the attributes of the community, are registered respectively. Each community is registered with an evaluation level of “evaluation D”, which is an evaluation of the community itself. As the evaluation levels of “evaluation A”, “evaluation C”, and “evaluation D”, those processed by the above-described SET algorithm are registered.

  Such attribute and evaluation level registration processing of the community information table 112 is performed as follows. That is, a user belonging to the community selects an attribute to which the community adapts from the community attribute table, and the rank (1 to 5 levels) of the “evaluation A” regarding the attribute and the rank of the attribute “ When “Evaluation C” is registered, the rank of the evaluation that has been registered is processed by the SET algorithm and registered in the community information table 112 as an evaluation level. Next, for the attributes already registered or newly selected from the community attribute table by other users belonging to the community, the ranks of “evaluation A” and “evaluation C” related to the attribute are registered. Then, the rank of the evaluation that has been registered is processed by the SET algorithm together with the evaluation rank that has been registered before, and is registered in the community information table 112 as an evaluation level. By repeating such registration processing, a plurality of attributes and more objective evaluation levels are registered. On the other hand, when the rank of “evaluation D” related to the community is registered by each user who belongs to the community, the rank of the evaluation that has been registered is processed by the SET algorithm and is used as an evaluation level in the community information table 112. Registered in

  Next, the operation of the network element search program according to this embodiment will be described. Here, an operation performed by the network search program stored in the user terminal 1 in response to an instruction based on an operation of the input device by the user X managing the user terminal 1 will be described. The other user terminals 2 to N operate similarly.

  First, a case where attribute search processing is executed by the network element search program according to the present embodiment will be described based on a flowchart shown in FIG. In the attribute search process, the network element search program first receives an input of an attribute to be a search key (hereinafter referred to as “search key attribute”) (step S11). At this time, it is assumed that the user X inputs an attribute code indicating a user attribute or a community attribute by operating an input device (for example, a keyboard, a mouse, a numeric keypad, etc.) (not shown) provided in the user terminal 1.

  If the search key attribute accepted in step S11 is a user attribute (step S12), the network element search program registers a user attribute that is a search key attribute from the user attributes registered in the user information table 111. Each user is searched (step S13), a list of each searched user is created, and a list showing search results is displayed on a display device (not shown) provided in the user terminal 1 (step S14). In the present embodiment, the display device displays a list of search results arranged in order from the user whose search key attribute evaluation level is high.

  If the search key attribute received in step S11 is a community attribute (step S15), the network element search program registers a community attribute that is a search key attribute from the community attributes registered in the community information table 112. Each community is searched (step S16), a list of each searched community is created, and a list showing search results is displayed on a display device (not shown) provided in the user terminal 1 (step S17). In the present embodiment, the display device displays a list of search results arranged in order from a community having a high evaluation level of the search key attribute.

  As described above, the network element search program according to the present embodiment uses the user attribute or community attribute as a search key attribute, and the user group to which the user attribute is assigned or the community group to which the community attribute is assigned. Since the search is performed and the search key attributes having a high evaluation level are displayed in order, the desired user or community can be easily searched.

  Next, a case where the network element search program according to the present embodiment executes attribute and evaluation level search processing will be described based on the flowchart shown in FIG. In the attribute and evaluation level search process, the network element search program first accepts input of an attribute and a predetermined range of evaluation levels (for example, 4 or more) as search keys (step S21).

  If the attribute of the search key received in step S21 is a user attribute (step S12), the network element search program registers a user attribute that is a search key attribute from the user attributes registered in the user information table 111. In addition to searching for each user, a user having an evaluation level of 4 or more is extracted from each searched user (step S23), a list of each extracted user is created, and the display device (not shown) provided in the user terminal 1 is provided. A list showing the search results is displayed (step S24). In the present embodiment, the display device displays a list of search results arranged in order from the user whose search key attribute evaluation level is high.

  If the search key attribute accepted in step S21 is a community attribute (step S15), the network element search program registers a community attribute that is a search key attribute from the community attributes registered in the community information table 112. Each community is searched, and communities with an evaluation level of 4 or more are extracted from each searched community (step S16), a list of each extracted community is created, and a search device (not shown) provided in the user terminal 1 is searched. A list showing the results is displayed (step S17). In the present embodiment, in the present embodiment, the display device displays a list of search results arranged in order from a community having a high evaluation level of the search key attribute.

  As described above, the network element search program according to the present embodiment can display a list of only users or communities in a predetermined range of evaluation levels for a certain attribute by using attributes and evaluation levels as search keys. Therefore, it is possible to easily search for a desired user and community.

  When searching for a community, the network element search program according to the present embodiment may display a list in order from the user with the highest evaluation level or the total evaluation level as a search result. When a search is performed, a list may be displayed in order from the community having the highest evaluation level or the total evaluation level as a search result. For example, when searching for a desired community, it is possible to quickly search for a user having a characteristic indicated by an attribute designated by the user and having a high evaluation level for the attribute. This search result can be said to be a list of experts for the corresponding attribute. For this reason, it becomes possible to search a community to which a user with a high evaluation level belongs, and to quickly and accurately perform a community search in a social network.

  Since the network element search program according to the present embodiment is configured to search for users and communities using user attributes and community attributes, it becomes possible to easily search for users and communities having the characteristics indicated by the attributes. , Community searches in social networks can be performed quickly and accurately. As described above, since the search is performed using the attribute, it is possible to search from a feature of a community in a field different from the field in which he is good or a community who does not know the name.

  In addition, the network element search program according to the present embodiment uses the user attribute and community attribute, the user attribute is assigned and the user has a high evaluation level, the community attribute is assigned and the evaluation level is Since it is configured to search for a high community, a community search in a social network can be performed quickly and accurately.

  In addition, when trying to search for a desired community, it is possible to quickly search for a community having the characteristics indicated by the attribute designated by itself and having a high evaluation level for the attribute. This search result can be said to be a list of communities that have the characteristics of the corresponding attribute. For this reason, community search in a social network can be performed quickly and accurately. In addition, it is possible to search for users who belong to a community with a high evaluation level, and to search other communities to which the user belongs. Can be performed quickly and accurately.

  As described above, because the attributes specified in the search have the characteristics indicated, and users and communities with high evaluation levels can be searched quickly, it is originated from users and communities with such high evaluation levels. It is possible to use highly reliable information. That is, the S / N of information can be improved. Using such highly reliable information, for example, it becomes possible to search for other users and communities.

   Conventionally, there is a system that performs an evaluation when searching for information (for example, Patent Document 1: Japanese Patent Application Laid-Open No. 2001-14349), but does not evaluate information attributes. You cannot search without knowing the name of. In contrast, in the network element search program according to the present embodiment, even a community that does not know the name of information can be searched from its characteristics.

  In addition, since the social internetwork 100 in the above-described embodiment is configured by a P2P network realized by P2P application software, initial and maintenance costs can be reduced.

  In the above-described embodiments, the community registered in the social network and the users belonging to the community are listed as network elements. However, there are a plurality of social networks on the social internetwork 100. In this case, the social network may be a network element, an attribute may be assigned to the social network, and a search using the attribute may be performed.

  The present invention is useful for quickly and accurately searching one or more network elements from two or more network elements registered in a social network.

It is a conceptual diagram which shows the structural example of the P2P network in which the social network where the Example of the network element search program which concerns on this invention operates is constructed | assembled. It is a conceptual diagram which shows the mode of the data sharing in the social internetwork. It is a conceptual diagram which shows the example of the registration state of the user attribute in a user attribute table. It is a conceptual diagram which shows the example of the registration state of the community attribute in a community attribute table. It is explanatory drawing which shows the kind and content of evaluation for evaluating an attribute. It is a conceptual diagram which shows the example of a data structure of a user information table. It is a conceptual diagram which shows the example of a data structure of a community information table. It is a flowchart which shows the operation | movement in which the network element search program based on a present Example performs an attribute search process. It is a flowchart which shows the operation | movement which the network element search program based on a present Example performs the search process of an attribute and evaluation rank.

Explanation of symbols

1 to N user terminals 11 to 1N control program 21 to 2N distributed hash table (DHT)
30 communication network 100 social internet network 110 distributed hash table (DHT)
111 User information table 112 Community information table 113 Attribute information table

Claims (12)

A network element search method for searching one or more network elements from two or more network elements registered in a social network,
The network element is provided with one or more attributes indicating characteristics of the network element,
Accept any of the attributes given to the network element as a search key,
A network element search method, wherein a network element to which an attribute indicated by the received search key is assigned is searched.        The network element search method according to claim 1, wherein an attribute assigned to the network element is assigned an evaluation level derived according to a predetermined algorithm based on an evaluation of the attribute.        3. The network element search method according to claim 2, wherein the searched network elements are displayed side by side in a rank corresponding to the evaluation level. The network element includes two or more network elements related to each other,
2. When searching for one network element among the two or more network elements related to each other, other network elements related to the searched network are displayed in order according to the evaluation level. 2. The network element search method according to 2. Further accepting a predetermined range of the evaluation level as a search key,
5. The network element search method according to claim 2, wherein a network element having an evaluation level in the predetermined range is extracted from network elements searched using the attribute as a search key.



       6. The network element search method according to claim 1, wherein the network element is registered in a distributed hash table on a P2P network. A network element search program for searching for one or more network elements from a plurality of network elements registered in a social network,
The network element is given one or more attributes indicating the characteristics of the network element,
Receiving any of the attributes given to the network element as a search key;
Searching for a network element to which an attribute indicated by the received search key is given;
Network element search program for causing a computer to execute the program.         8. The network element search program according to claim 7, wherein the attribute assigned to the network element is given an evaluation level derived according to a predetermined algorithm based on an evaluation of the attribute.        9. The network element search program according to claim 8, further causing the computer to execute a step of arranging and displaying the searched network elements in an order corresponding to the evaluation level. The network element includes two or more network elements related to each other,
When searching for one network element among the two or more network elements related to each other, the computer further executes a step of displaying other network elements related to the searched network in order according to the evaluation level. 9. The network element search method according to claim 8, wherein: Further receiving a predetermined range of the evaluation level as a search key;
11. The computer according to claim 8, further comprising: extracting a network element having an evaluation level in the predetermined range from network elements searched using the attribute as a search key. Network element search program. The network element is registered in a distributed hash table on a P2P network,
12. The network element search program according to claim 7, wherein the computer is a computer constituting the P2P network.

Images