JP2004102531A - Network system, node, node control process, node control program - Google Patents

Network system, node, node control process, node control program Download PDF

Info

Publication number
JP2004102531A
JP2004102531A JP2002261868A JP2002261868A JP2004102531A JP 2004102531 A JP2004102531 A JP 2004102531A JP 2002261868 A JP2002261868 A JP 2002261868A JP 2002261868 A JP2002261868 A JP 2002261868A JP 2004102531 A JP2004102531 A JP 2004102531A
Authority
JP
Japan
Prior art keywords
node
message
group
score
step
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
JP2002261868A
Other languages
Japanese (ja)
Inventor
Kunihiro Fujii
藤井 邦浩
Original Assignee
Ntt Docomo Inc
株式会社エヌ・ティ・ティ・ドコモ
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Ntt Docomo Inc, 株式会社エヌ・ティ・ティ・ドコモ filed Critical Ntt Docomo Inc
Priority to JP2002261868A priority Critical patent/JP2004102531A/en
Publication of JP2004102531A publication Critical patent/JP2004102531A/en
Pending legal-status Critical Current

Links

Images

Abstract

An object of the present invention is to reduce the trouble of a user (information sender / searcher) searching for a target group.
A storage unit for configuring a Peer-to-Peer network together with another node and storing a message relayed by the own node for a predetermined period to a node that mutually transmits and receives a search request message and a response message to the search request message. Are provided, and when a message conforming to the search request received from another node is stored in the storage unit 13-1, recommendation information indicating that a search result exists at the node is returned to the node. Sending the recommendation information makes it easier for other nodes to find the target group or information. Also, among the messages stored in the storage units 13-1..., The score is calculated according to the message to which the own node responds as a search result, and the group to which the own node belongs is changed according to the score. You can always belong to the best group.
[Selection diagram] Fig. 1

Description

[0001]
TECHNICAL FIELD OF THE INVENTION
The present invention relates to a network system, a node, a node control method, and a node control program, and more particularly to a peer-to-peer network system, a node for configuring the system, a control method of the node, and a node control program.
[0002]
[Prior art]
In a Peer-to-Peer (hereinafter abbreviated as P2P) network system, a network is configured by nodes relaying messages without relying on a specific central server. In this case, only adjacent nodes (adjacent nodes) establish connections. Then, adjacent nodes that have established a connection relay the message by the bucket brigade method. There are various types of relayed messages, such as a search request / search response message and a control message.
[0003]
The node that has received the search request returns a search response if the node itself has suitable information, and relays the search request to an adjacent node if it does not.
The search response is relayed along a route reverse to the route followed by the search request.
Each message has a value of Time To Live (TTL), and the number of relays is limited to the value of TTL at the maximum.
[0004]
As a message route control, when the same message as the message relayed once is received again, it is discarded.
Here, a technique for forming groups according to hobbies and purposes on a P2P network has been proposed in JXTA (http://www.jxta.org). Non-Patent Literature 1 and Non-Patent Literature 2 describe an outline of a group using this technology. The implementation of the group is described in Non-Patent Document 3.
[0005]
FIG. 8 shows a configuration example of a network system configured using the technology described in each of the above non-patent documents. As shown by the solid line in the figure, a connection (for example, a TCP connection) is established between the nodes. Referring to the figure, there are four nodes N1 to N4 as groups belonging to (participating in) a group ID (GroupID): 1234.
[0006]
The nodes N1 to N4 exchange messages with each other. The message M sent from the nodes N1 to N4 has a group ID to which the node belongs added.
Each node can belong to the group by having the group ID. Each group has an identifier (group ID) uniquely determined. Each node acquires a group ID and belongs to a target group. Further, a new group can be arbitrarily created by defining a new group ID. Each node can belong to a plurality of groups by acquiring a plurality of group IDs. Each node has one or more arbitrary group IDs.
[0007]
In this conventional system, messages are exchanged only between nodes having the same ID as the group ID added to the message M in a bucket brigade manner. Therefore, when the group IDs are different, the messages M are not exchanged. For example, as shown in the figure, the message M is exchanged within the range of the nodes N1 to N4 having the group ID: 1234, and the nodes N5 and N6 having only the different group ID: 9876 are exchanged. Can not receive.
[0008]
[Non-patent document 1]
PeerGroups <URL: http: // spec. <Br> of the fourth page of "JXTA protocol" (JXTA protocols.pdf). jxta. org / project / www / white_papers. html>
[Non-patent document 2]
"Frequently Asked Questions About Peer Groups and Services" (Peer Groups and Services FAQ) <URL: http: // search. jxta. org / project / www / docs / DomainFAQ. html>
[Non-Patent Document 3]
“Small Tutorial for Creating and Joining Peer Groups in JXTA's Java Implementation” <URL: http://spec.com/small-tutorial-for-creating-and-joining-peer-groups. jxta. org / project / www / Tutorials. html>
[0009]
[Problems to be solved by the invention]
If the technology described in the above-mentioned document is adopted, a P2P network can be configured. However, the network system described in the above document has the following problems. That is, when there are many groups on the P2P network, the user (information sender / searcher) has to search for a target group.
[0010]
Further, once a group is formed, it is not reconfigured. For this reason, a case may arise where the user continues to belong to an unsuitable group.
The present invention has been made to solve the above-mentioned drawbacks of the prior art, and has as its object to autonomously reconfigure a group on a P2P network so that a user (information sender / searcher) can achieve the object. It is an object of the present invention to provide a network system, a node, and a node control method which can reduce the trouble of searching for a group.
[0011]
[Means for Solving the Problems]
A network system according to a first aspect of the present invention is a network system that configures a peer-to-peer network and exchanges a search request message and a response message to the search request message between the nodes. Means for storing a message to be searched for a predetermined period of time, and when a message matching the search request received from another node is stored in the storage means, recommendation information indicating that a search result exists in the node is transmitted to the node. And a recommendation information sending means for replying to the request. Sending the recommendation information makes it easier for other nodes to find the target group or information.
[0012]
The network system according to claim 2 of the present invention, according to claim 1, further comprises means for controlling each node so that its own node belongs to a group corresponding to the content of recommendation information received from another node. It is characterized by. Receiving recommendation information makes it easier to belong to other groups.
A network system according to a third aspect of the present invention is a network system that constitutes a peer-to-peer network, and transmits and receives a search request message and a response message to the search request message between the nodes. Storage means for storing a message to be executed for a predetermined period of time; point calculation means for calculating a score in accordance with a message to which the own node has responded as a search result among messages stored in the storage means; Group changing means for changing the group to which the own node belongs. By changing the group to which the user belongs based on the score calculated according to the search response, the user can always belong to the optimum group.
[0013]
According to a fourth aspect of the present invention, in the network system according to the third aspect, the score calculation unit determines the number and storage time of the messages that the node responds as a search result among the messages stored in the storage unit. The score is calculated according to the following. By changing the group to which the message belongs according to the number of messages and the storage time thereof, it is possible to always belong to the optimum group.
[0014]
According to a fifth aspect of the present invention, in the network system according to the third or fourth aspect, the belonging group changing unit determines that a group to which the own node belongs when the score calculated by the score calculating unit is equal to or less than a predetermined value. It is characterized by withdrawal from. When the calculated score is equal to or less than the predetermined value, by leaving the group, it is possible to avoid belonging to an unsuitable group.
[0015]
A node according to claim 6 of the present invention constitutes a peer-to-peer network together with other nodes, and exchanges a search request message and a response message to the search request message with each other. When a message that matches a search request received from another node is stored in the memory, a recommendation indicating that a search result is present at the node is returned to the node. And information transmitting means. Sending the recommendation information makes it easier for other nodes to find the target group or information.
[0016]
The node according to claim 7 of the present invention is characterized in that in claim 6, the node further includes means for controlling the own node to belong to a group corresponding to the content of the recommendation information received from another node. Receiving recommendation information makes it easier to belong to other groups.
The node according to claim 8 of the present invention constitutes a peer-to-peer network together with other nodes, and exchanges a search request message and a response message to the search request message with each other. Storage means for storing a period; point calculation means for calculating a score in accordance with a message to which the own node has responded as a search result among messages stored in the storage means; And a belonging group changing means for changing a group to which the user belongs. By changing the group to which the user belongs based on the score calculated according to the search response, the user can always belong to the optimum group.
[0017]
According to a ninth aspect of the present invention, in the node according to the ninth aspect, the score calculation unit determines the number and the storage time of the messages that the own node responds as a search result among the messages stored in the storage unit. The score is calculated in accordance with this. By changing the group to which the message belongs according to the number of messages and the storage time thereof, it is possible to always belong to the optimum group.
[0018]
A node according to claim 10 of the present invention is the node according to claim 8 or 9, wherein the belonging group changing unit changes the group to which the own node belongs when the score calculated by the score calculating unit is equal to or less than a predetermined value. It is characterized by withdrawal. When the calculated score is equal to or less than the predetermined value, by leaving the group, it is possible to avoid belonging to an unsuitable group.
[0019]
A node control method according to claim 11 of the present invention is a control method for a node that configures a peer-to-peer network together with another node and mutually exchanges a search request message and a response message to the search request message. Storing a message to be relayed, and, in the storing step, when a message conforming to a search request received from another node is stored, recommendation information indicating that a search result exists in that node is transmitted to the node. And sending a recommendation information to the user. Sending the recommendation information makes it easier for other nodes to find the target group or information.
[0020]
The node control method according to a twelfth aspect of the present invention, according to the eleventh aspect, further includes a step of controlling the own node to belong to a group corresponding to the content of the recommendation information received from another node. . Receiving recommendation information makes it easier to belong to other groups.
A node control method according to claim 13 of the present invention is a control method for a node which configures a peer-to-peer network with other nodes and mutually exchanges a search request message and a response message to the search request message. A storing step of storing a message to be relayed, a point calculating step of calculating a score according to a message to which the own node has responded as a search result among the messages stored in the storing step, and a step of calculating a score according to the calculated point. A belonging group change step of changing a group to which the own node belongs. By changing the group to which the user belongs based on the score calculated according to the search response, the user can always belong to the optimum group.
[0021]
According to a fourteenth aspect of the present invention, in the node control method according to the thirteenth aspect, in the score calculation step, among the messages stored in the storage step, the number of the messages to which the own node responds as a search result and the storage thereof The score is calculated according to the time. By changing the group to which the message belongs according to the number of messages and the storage time thereof, it is possible to always belong to the optimum group.
[0022]
In the node control method according to claim 15 of the present invention, in claim 13 or 14, in the belonging group changing step, the own node belongs if the score calculated in the score calculating step is equal to or less than a predetermined value. It is characterized in that it is controlled to withdraw from a group. When the calculated score is equal to or less than the predetermined value, by leaving the group, it is possible to avoid belonging to an unsuitable group.
[0023]
A node control program according to claim 16 of the present invention is a control program for a node which configures a peer-to-peer network together with other nodes and mutually exchanges a search request message and a response message to the search request message. Storing a message to be relayed, and, in the storing step, when a message conforming to a search request received from another node is stored, recommendation information indicating that a search result exists in that node is transmitted to the node. And sending a recommendation information to the user. Sending the recommendation information makes it easier for other nodes to find the target group or information.
[0024]
The node control program according to claim 17 of the present invention, according to claim 16, further comprises a step of controlling the own node to belong to a group corresponding to the content of the recommendation information received from another node. . Receiving recommendation information makes it easier to belong to other groups.
A node control program according to claim 18 of the present invention is a control program for a node which configures a peer-to-peer network with other nodes and mutually exchanges a search request message and a response message to the search request message. A storing step of storing a message to be relayed, a point calculating step of calculating a score according to a message to which the own node has responded as a search result among the messages stored in the storing step, and a step of calculating a score according to the calculated point. A belonging group change step of changing a group to which the own node belongs. By changing the group to which the user belongs based on the score calculated according to the search response, the user can always belong to the optimum group.
[0025]
The node control program according to claim 19 of the present invention is the node control program according to claim 18, wherein, in the score calculation step, among the messages stored in the storage step, the number of the messages to which the own node responds as a search result and the storage thereof The score is calculated according to the time. By changing the group to which the message belongs according to the number of messages and the storage time thereof, it is possible to always belong to the optimum group.
[0026]
The node control program according to claim 20 of the present invention is the node control program according to claim 18 or 19, wherein in the belonging group changing step, the own node belongs when the score calculated in the score calculating step is equal to or less than a predetermined value. It is characterized in that it is controlled to withdraw from a group. When the calculated score is equal to or less than the predetermined value, by leaving the group, it is possible to avoid belonging to an unsuitable group.
[0027]
To reconfigure a group, it is necessary to realize “discovery of an unknown group” and “withdraw from an unnecessary group”. Therefore, in the present invention, a mechanism for discovering an unknown group based on recommendation information obtained from nodes belonging to a plurality of groups, and whether a belonging group is suitable for the node itself and autonomously withdrawing We propose a mechanism.
[0028]
BEST MODE FOR CARRYING OUT THE INVENTION
Next, an embodiment of the present invention will be described with reference to the drawings. In the drawings referred to in the following description, the same parts as those in the other drawings are denoted by the same reference numerals.
(Configuration example of each node)
FIG. 1 is a block diagram showing an embodiment of a node used in a network system according to the present invention. As shown in the figure, each node used in the network system of the present example has a message processing unit 11 for connecting to the P2P network 10 and exchanging messages with other nodes, and the node itself. A storage unit 12 for storing information, cache storage units 13-1, 13-2, 13-3,... For storing the contents of responses to search requests from other nodes for each group for a certain period of time; And a score calculation / comparison unit 14 for comparing the calculation result with a threshold value, and a group belonging control unit 15 for determining whether to leave the group based on the comparison result.
[0029]
The message processing unit 11 receives the message sent from the P2P network 10 and sends the message to the P2P network 10.
The message processing unit 11 searches the storage content of the storage unit 12 in response to a search request from another node, and sends the search result to the P2P network 10 as a message. When the node itself does not have the information, the message processing unit 11 searches the storage contents of the cache storage units 13-1, 13-2, 13-3,. Then, as a result of this search, if it is found that another node has the information, the message processing unit 11 sends recommendation information indicating that nodes belonging to the group have the information to the P2P. Send it to the network 10. To the recommendation information, information of a matching search result and a group having the information is added. For example, it returns that the file “report.txt” is in the group “sales department”.
[0030]
Note that the message processing unit 11 stores the group ID of the group to which the own node currently belongs, and the cache storage units 13-1, 13-2, and 13-2 correspond to each of the stored group IDs. 13-3 are prepared.
The score calculating / comparing unit 14 reads the contents stored in the cache storage units 13-1, 13-2, 13-3,... Then, the score calculation / comparison unit 14 calculates the score based on the read storage contents, and compares the calculated score with a predetermined threshold. If the comparison result is equal to or less than the predetermined threshold, the group belonging control unit 15 controls the own node to leave the group. In this case, for example, the group is deleted from the group by deleting the stored group ID. That is, the group belonging control unit 15 controls the group to which the own node belongs.
(Example of P2P network system configuration using nodes)
FIGS. 2 and 3 show an example in which a P2P network system is configured using the nodes having the above configuration. Hereinafter, a mechanism in which each node finds an unknown group will be described with reference to FIG. Further, a mechanism in which each node autonomously leaves the group will be described with reference to FIG.
[0031]
First, in FIG. 2, the node 3 belonging to the group 9876 has information of “A”. Node 2 stores the message relayed in group 9876 in its own cache storage unit, and thus knows that node 3 has "A".
Node 1 searches for “A” in group 1234. The node 2 that has received the search request message M refers to the cache storage unit in the own node, and responds with the recommendation information indicating that “A” exists in the group 9876 (“Hit” in the figure). Based on the recommendation information returned from node 2, node 1 can know that group 9876 has "A". That is, the node 1 can find an unknown group by referring to the recommendation information.
[0032]
As described above, each node stores a message relayed by the node itself in the cache storage unit for a certain period for each group to which the node belongs. The node that has received the search request message performs predetermined message processing, and checks whether the requested information is stored in its own node. As a result of the check, if the data is not stored in the own node, the storage contents of the cache storage unit are checked to determine whether the data is stored in another node. If there is a message that matches the search request, a search response is returned as recommendation information. The node that has received the recommendation information can acquire information of an unknown group (such as a group ID) from the recommendation information. By exchanging the recommendation information in this manner, each node can discover an unknown group.
[0033]
Next, in FIG. 3, node 1 belongs to both group 1234 and group 9876. The node 1 stores the message M relayed by the node 1 in the cache storage unit for each group for a certain period. From the messages stored in the cache storage unit, a message to which node 1 has responded is extracted. Then, a score is calculated according to the response time and the number of responses. This score becomes the contribution of the own node in the group. When the contribution in the group 1234 is calculated to be 0.80 and the contribution in the group 9876 is calculated to be 0.02, the user leaves the group 9876 having a low contribution.
[0034]
For example, it is assumed that a group whose score is equal to or less than a certain threshold autonomously withdraws. In this case, if the score is low, it is considered that the node has not contributed to the target group. The threshold value may be arbitrarily set by the user.
As described above, each node stores a message relayed by the node itself in the cache storage unit for a certain period for each group to which the node belongs. This cache storage unit shares the cache storage unit used in the case of FIG. The information that the node itself has responded to is extracted from the cache storage unit, and the score is calculated for each group from the number and time of the response. In the calculation of the score, the number of responses is large, and the score is higher as the timing is later.
[0035]
The calculation formula of the score may be arbitrarily selected for each user. The calculation of the score will be described with reference to FIG. FIG. 7A is a conceptual diagram illustrating a configuration example of a cache storage unit corresponding to one group, and FIG. 7B is an example of a score calculation formula corresponding to FIG.
FIG. 9A shows the storage contents of the search response result regarding Group A (Group-A). In the figure, “cool_mp3”, “hot_mp3”, “mild_mp3”, “MY.MP3”..., “Old_mp3” are stored. Then, when “fresh_mp3” is newly added and stored, “old_mp3” that is the oldest (the longest elapsed time after being stored) is deleted instead. Even if there is no newly added one, erasing may be performed for a certain period of time.
[0036]
In the figure, “n” is an integer of 1 or more, and indicates the size (storage capacity) of the cache storage unit of the node. The smaller this value is, the more recently stored information is stored in the cache storage unit. “K” is an integer of 1 or more and n or less, and indicates the position of the search response (MY.MP3) returned by the node.
In such a storage state of the cache storage unit, the sum of the values indicated by point (MyReply) is obtained according to the calculation formula shown in FIG. That is,
point (MyReply) = ln (1 + 1 / k) / ln (n + 1)
And the sum of
MyContribution (GroupA) = Σpoint (MyReply)
Represents the contribution of the own node in the group A. Therefore, the higher the score, the more the node contributes (returns many search responses) in the target group. As described above, in this example, the contribution is calculated by calculating the score according to the number of stored search response messages and the storage time.
[0037]
By the way, in the example shown in the figure, the threshold is a real number between 0 and 1. The higher this threshold is, the easier it is to leave the group to which it belongs. As the threshold, a fixed value may be determined in advance, or the user may set a different value for each group.
Similarly, the score is calculated for the other groups to which the own node belongs, and the node is withdrawn from the group according to the degree of contribution.
(Control contents of each node)
Here, the control contents of each node are shown in FIGS. FIG. 5 is a flowchart showing a case in which control for sending recommendation information is performed, and FIG. 6 is a flowchart showing a case in which it is determined whether to withdraw from a group to which the user belongs.
[0038]
In FIG. 5, the node stores a message to be relayed by itself in the cache storage unit for each group (step S601). The contents stored in the cache storage unit are searched, and it is determined whether there is one that matches the contents of the search request (step S602). If there is a match, recommendation information to that effect is sent out as a message (step S602 → S603). On the other hand, if there is no suitable one, it is determined whether or not there is any information stored in the cache storage unit for which a predetermined period has elapsed from the start of storage (step S602 → S604). If a predetermined period has elapsed since the start of the storage, it is deleted (step S604 → S605).
[0039]
After the above processing, it is determined whether recommendation information has been received from another node (step S604 → S606). If the recommendation information has not been received, the process returns to step S601 (step S606 → S601).
If the recommendation information has been received, it newly belongs to the group (steps S606 → S607). Specifically, the group belongs to the group by storing the group ID included in the recommendation information. Thereafter, the process returns to step S601 (step S607 → S601).
[0040]
In FIG. 6, the score calculation / comparison unit reads the contents stored in the cache storage unit for each group by the node itself (step S701). Then, the score calculation / comparison unit calculates the score based on the read storage contents (step S702). This score is calculated based on, for example, the number of stored items and the storage time. If the calculated score is equal to or smaller than the predetermined threshold, the own node leaves the group by the group belonging control unit (step S703 → S704). Thereafter, the process returns to step S701, and the process is continued (step S704 → S701).
[0041]
On the other hand, if the calculated score is not equal to or smaller than the predetermined threshold value, the content stored in the cache storage unit is read again and the processing is continued (step S703 → S701).
(P2P network system configuration example)
By using the nodes configured as described above, a P2P network system as shown in FIG. 7 can be configured. In the figure, a third-generation mobile phone 71, a PDA (personal digital assistant) 72, a PC (Personal Computer) 73, a web server (WEB Server) 74, a UDDI (Universal Description, Discovery Delivery, and Delivery Information) A P2P network is configured by terminals (nodes) such as a Web service description language (WSDL) server 75, a WSDL (Web Service Description Language) server 76, and a mail server (Mail Server) 77.
[0042]
On the configured P2P network 10, each node belongs to a group suitable for the purpose and purpose and performs information search and disclosure. The present system is used to reconfigure a group on the P2P network 10. This system is used for autonomously withdrawing from the group to which each node belongs.
[0043]
In FIG. 7, the information searcher / sender uses each node to search for a target group or information. The group is formed by defining the group ID as described above. Since information sharing between groups is performed as described with reference to FIG. 2, each node can find an unknown group. Further, as described with reference to FIG. 3, each node autonomously withdraws from the group to which it belongs, and reconfigures the group.
(Concrete example)
As shown in FIG. 7, by integrating data of various terminals on the P2P network 10, various data 100 can be handled regardless of the format. For example, HTML and XML format data, word processing and spreadsheet allocation files, mail data (text data), streaming data, MP3 (MPEG-1 / Audio Layer-3) and JPEG (Joint Photographic Experts Group) data, etc. Can be handled.
[0044]
By configuring the P2P network as described above, the following effects can be obtained.
{Circle around (1)} By using the present system for various applications and services using the P2P network, it becomes easier to find the target group or information.
{Circle over (2)} The need to manage groups on the P2P network is unnecessary or can be reduced.
{Circle around (3)} With a general text-based search system, it is difficult to distinguish between homonyms. For example, it is difficult to distinguish between an animal "mouse" and a computer "mouse" as a pointing device. However, even for such homonyms, semantic distinction is automatically made by the present system.
{Circle around (4)} When a user (information sender / searcher) discloses his / her own information, a group having a similar purpose and purpose can be automatically found.
(Node control method)
By the way, in each node described above, the following control method is adopted. That is, a control method for a node that configures a Peer-to-Peer network together with other nodes and exchanges a search request message and a response message to the search request message, and stores a message relayed by the own node; In the storage step, when a message matching the search request received from another node is stored, a recommendation information sending step of returning recommendation information indicating that a search result exists to the node to the node is included. A node control method is employed. Sending the recommendation information makes it easier for other nodes to find the target group or information.
[0045]
The method may further include the step of controlling the own node to belong to a group corresponding to the content of the recommendation information received from another node. Receiving recommendation information makes it easier to belong to other groups.
In each node, the following control method is also employed. That is, a control method for a node that configures a Peer-to-Peer network together with other nodes and exchanges a search request message and a response message to the search request message, and stores a message relayed by the own node; A point calculation step of calculating a score according to a message that the own node has responded as a search result among the messages stored in the storage step, and a belonging group that changes a group to which the own node belongs according to the calculated score And a node control method including a changing step. By changing the group to which the user belongs based on the score calculated according to the search response, the user can always belong to the optimum group.
[0046]
In the score calculation step, the score is calculated according to the number and the storage time of the messages that the node responded as a search result among the messages stored in the storage step. By changing the group to which the message belongs according to the number of messages and the storage time thereof, it is possible to always belong to the optimum group.
[0047]
Further, in the belonging group change step, control is performed so as to leave the group to which the own node belongs when the score calculated in the score calculating step is equal to or less than a predetermined value. By changing the group to which the message belongs according to the number of messages and the storage time thereof, it is possible to always belong to the optimum group.
(Node control program)
By preparing a program for realizing the operations shown in FIGS. 5 and 6 and controlling a computer by using the program, it is possible to control each node in the same manner as described above to configure the network system. It is obvious.
[0048]
That is, a control program that configures a peer-to-peer network together with other nodes, and controls a node that exchanges a search request message and a response message to the search request message, and stores a message relayed by the own node. In the storing step, when a message matching the search request received from another node is stored, a recommendation information sending step of returning recommendation information indicating that a search result exists to the node to the node is provided. A node control program may be prepared to control the computer. Sending the recommendation information makes it easier for other nodes to find the target group or information.
[0049]
The program may further include a step of controlling the own node to belong to a group corresponding to the content of the recommendation information received from another node. Receiving recommendation information makes it easier to belong to other groups.
A storage program for configuring a peer-to-peer network together with other nodes and controlling a node that exchanges a search request message and a response message to the search request message with each other, and stores a message relayed by the own node; A point calculation step of calculating a score according to a message that the own node has responded as a search result among the messages stored in the storage step, and a belonging group that changes a group to which the own node belongs according to the calculated score A node control program including a change step may be prepared to control the computer. By changing the group to which the user belongs based on the score calculated according to the search response, the user can always belong to the optimum group.
[0050]
In the score calculation step, the score is calculated according to the number and the storage time of the messages that the node responded as a search result among the messages stored in the storage step. By changing the group to which the message belongs according to the number of messages and the storage time thereof, it is possible to always belong to the optimum group.
[0051]
Further, in the belonging group change step, control is performed so as to leave the group to which the own node belongs when the score calculated in the score calculating step is equal to or less than a predetermined value. By changing the group to which the message belongs according to the number of messages and the storage time thereof, it is possible to always belong to the optimum group.
[0052]
As a recording medium for recording the above-mentioned program, various recording media can be used in addition to a semiconductor memory, a magnetic disk, an optical disk, and the like not shown in FIG.
[0053]
【The invention's effect】
As described above, the present invention has an effect that by transmitting recommendation information, a target group or information can be easily found in a node using the P2P network. In addition, since each node autonomously discovers a group and withdraws, there is an effect that the trouble of managing the group on the P2P network is unnecessary or can be reduced.
[Brief description of the drawings]
FIG. 1 is a block diagram showing an embodiment of a node used in a network system according to the present invention.
FIG. 2 is a diagram showing a mechanism in which each node discovers an unknown group.
FIG. 3 is a diagram illustrating a mechanism in which each node autonomously leaves a group.
4A is a conceptual diagram illustrating a configuration example of a cache storage unit corresponding to one group, and FIG. 4B is an example of a score calculation formula corresponding to FIG.
FIG. 5 is a flowchart illustrating a case where control for transmitting recommendation information is performed.
FIG. 6 is a flowchart illustrating a case of determining whether to withdraw from a group to which the user belongs.
FIG. 7 is a diagram illustrating an example of a P2P network system that can be configured by using the nodes in FIG. 1;
FIG. 8 is a diagram illustrating a configuration example of a conventional network system.
[Explanation of symbols]
1-3, N1-N6 nodes
10 P2P network
11 Message processing unit
12 Storage unit
13 Cache storage unit
14 Comparison section
15 Group belonging control unit
100 data
M message

Claims (20)

  1. A network system that configures a peer-to-peer network and transmits and receives a search request message and a response message thereto between nodes, wherein each node stores a message relayed by its own node for a predetermined period, When a message matching the search request received from another node is stored in the storage unit, recommendation information sending unit that returns recommendation information indicating that a search result exists at the node to the node. A network system, characterized in that:
  2. 2. The network system according to claim 1, wherein each of the nodes further includes means for controlling the own node to belong to a group corresponding to the content of the recommendation information received from another node.
  3. A network system that configures a peer-to-peer network and transmits and receives a search request message and a response message thereto between nodes, wherein each node stores a message relayed by its own node for a predetermined period, A point calculating means for calculating a score according to a message to which the own node has responded as a search result among messages stored in the storage means, and an affiliation for changing a group to which the own node belongs according to the calculated score A network system comprising: a group changing unit.
  4. 4. The point calculation unit according to claim 3, wherein, among the messages stored in the storage unit, for a message to which the own node responds as a search result, the score calculation unit calculates a score according to the number and the storage time. Network system.
  5. The network system according to claim 3, wherein the belonging group changing unit leaves the group to which the own node belongs when the score calculated by the score calculating unit is equal to or less than a predetermined value.
  6. A storage means for forming a Peer-to-Peer network together with another node and mutually exchanging a search request message and a response message to the search request message, the storage means for storing a message relayed by the own node for a predetermined period; And a recommendation information sending means for returning recommendation information indicating that a search result is present at the node to the node when a message conforming to the search request received from the storage means is stored in the storage means. Node to be.
  7. 7. The node according to claim 6, further comprising means for controlling the own node to belong to a group corresponding to the content of the recommendation information received from another node.
  8. Storage means for forming a peer-to-peer network together with another node and mutually exchanging a search request message and a response message to the search request message, and storing a message relayed by the own node for a predetermined period of time; Score calculating means for calculating a score according to a message which the own node responds as a search result among the messages stored in the server, and belonging group changing means for changing a group to which the own node belongs according to the calculated score And a node comprising:
  9. 9. The score calculation unit calculates a score according to the number and the storage time of messages that the node responds as a search result among the messages stored in the storage unit. 10. Nodes.
  10. 10. The node according to claim 8, wherein the belonging group changing unit leaves the group to which the own node belongs when the score calculated by the score calculating unit is equal to or less than a predetermined value.
  11. A control method for a node that configures a peer-to-peer network together with another node and mutually exchanges a search request message and a response message to the search request message, wherein a storage step of storing a message relayed by the own node; In a storage step, when a message matching the search request received from another node is stored, a recommendation information sending step of returning recommendation information indicating that the search result exists to the node to the node is included. A node control method characterized by the following.
  12. The node control method according to claim 11, further comprising a step of controlling the own node to belong to a group corresponding to the content of the recommendation information received from another node.
  13. A control method for a node that configures a peer-to-peer network together with another node and mutually exchanges a search request message and a response message to the search request message, wherein a storage step of storing a message relayed by the own node; A point calculation step of calculating a score according to a message that the own node has responded as a search result among the messages stored in the storage step, and a belonging group change that changes a group to which the own node belongs according to the calculated score And a step of controlling the node.
  14. 14. The point calculating step, wherein, among the messages stored in the storing step, for the messages to which the own node responds as a search result, the points are calculated according to the number and the storing time thereof. Node control method.
  15. 15. The method according to claim 13, wherein in the belonging group changing step, when the score calculated in the score calculating step is equal to or less than a predetermined value, control is performed so as to leave the group to which the own node belongs. The described node control method.
  16. A control program for a node that configures a peer-to-peer network together with another node and mutually exchanges a search request message and a response message to the search request message, wherein a storage step of storing a message relayed by the own node; In a storage step, when a message matching the search request received from another node is stored, a recommendation information sending step of returning recommendation information indicating that the search result exists to the node to the node is included. A node control program characterized by the following.
  17. 17. The node control program according to claim 16, further comprising a step of controlling the own node to belong to a group corresponding to the content of the recommendation information received from another node.
  18. A control program for a node that configures a peer-to-peer network together with another node and mutually exchanges a search request message and a response message to the search request message, wherein a storage step of storing a message relayed by the own node; A point calculation step of calculating a score according to a message that the own node has responded as a search result among the messages stored in the storage step, and a belonging group change that changes a group to which the own node belongs according to the calculated score And a node control program.
  19. 19. The score calculating step, wherein, among the messages stored in the storing step, a score is calculated according to the number of the messages to which the own node responds as a search result and the storage time thereof. Node control program.
  20. 20. The method according to claim 18, wherein, in the belonging group changing step, when the score calculated in the score calculating step is equal to or less than a predetermined value, control is performed so as to leave the group to which the own node belongs. Described node control program.
JP2002261868A 2002-09-06 2002-09-06 Network system, node, node control process, node control program Pending JP2004102531A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP2002261868A JP2004102531A (en) 2002-09-06 2002-09-06 Network system, node, node control process, node control program

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP2002261868A JP2004102531A (en) 2002-09-06 2002-09-06 Network system, node, node control process, node control program

Publications (1)

Publication Number Publication Date
JP2004102531A true JP2004102531A (en) 2004-04-02

Family

ID=32262116

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2002261868A Pending JP2004102531A (en) 2002-09-06 2002-09-06 Network system, node, node control process, node control program

Country Status (1)

Country Link
JP (1) JP2004102531A (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2010170580A (en) * 2010-04-21 2010-08-05 Sony Corp Data circulation system, server, and terminal device
US7987360B2 (en) 2004-04-28 2011-07-26 Lenovo (Beijing) Limited Method for implementing grouping devices and interacting among grouped devices
KR20150145383A (en) * 2014-06-19 2015-12-30 네이버 주식회사 Providing Social Network Service And Providing Contents For The Same

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7987360B2 (en) 2004-04-28 2011-07-26 Lenovo (Beijing) Limited Method for implementing grouping devices and interacting among grouped devices
JP2010170580A (en) * 2010-04-21 2010-08-05 Sony Corp Data circulation system, server, and terminal device
KR20150145383A (en) * 2014-06-19 2015-12-30 네이버 주식회사 Providing Social Network Service And Providing Contents For The Same
KR102053980B1 (en) * 2014-06-19 2019-12-12 네이버 주식회사 Providing Social Network Service And Providing Contents For The Same

Similar Documents

Publication Publication Date Title
CN102523256B (en) Content management method, device and system
US8358641B2 (en) Method for improving peer to peer network communication
Su et al. Haggle: Seamless networking for mobile applications
US8984096B2 (en) Method and apparatus for transmitting data in a peer-to-peer network
EP1429517B1 (en) Access relaying apparatus
JP5536120B2 (en) Optimize communication using scalable peer groups
EP1161051B1 (en) Dynamic proxy server apparatus
US8924460B2 (en) Method and system of administrating a peer-to-peer file sharing network
EP1542409B1 (en) Protocol for multi-hop ad-hoc networks
US7644167B2 (en) Identifying a service node in a network
Ahlgren et al. Design considerations for a network of information
KR100505265B1 (en) Semantic information network(SION)
US8463936B2 (en) Method and device for distributing digital data in particular for a peer-to-peer network
CN102299954B (en) For the context-specific network resource addressing system and method for Distributed Services
US8171171B2 (en) Data synchronization method and system between devices
US7613770B2 (en) On-demand file transfers for mass P2P file sharing
RU2490809C2 (en) System and method of transmitting file from multiple sources in instant messaging
EP2997747B1 (en) Systems and methods for enhanced discovery
KR100576935B1 (en) Ontology-based service discovery system and method for ad hoc networks
Datta et al. Resource discovery in Internet of Things: Current trends and future standardization aspects
CN102612829B (en) Method and system for supporting the selection of communication peers in an overlay network
US7782866B1 (en) Virtual peer in a peer-to-peer network
US8341293B2 (en) Peer-to-peer (P2P) network system and method of operating the same based on region
JP2013546280A (en) Terminals and intermediate nodes in a content-oriented networking environment, and their communication methods
US7978631B1 (en) Method and apparatus for encoding and mapping of virtual addresses for clusters

Legal Events

Date Code Title Description
A131 Notification of reasons for refusal

Free format text: JAPANESE INTERMEDIATE CODE: A131

Effective date: 20060124

A521 Written amendment

Free format text: JAPANESE INTERMEDIATE CODE: A523

Effective date: 20060327

A02 Decision of refusal

Free format text: JAPANESE INTERMEDIATE CODE: A02

Effective date: 20060425