JP2006139730A - Information processor, method and program for processing information, and peer-to-peer system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To enhance the usability of a user. <P>SOLUTION: A peer-to-peer system is constituted by connecting a plurality of peers Pa, Pb, .... Each peer Pa, Pb, ... holds the address of a place to store a plurality of job templates for designating sequences of respective processings, information to indicate the service of each peer, and notice information such as information to indicate a job state, etc. The peer having a scanner function acquires the plurality of job templates from the held address and displays them. When the user selects one of the job template, the address of the selected job plate and data obtained by scanning are transmitted to the peer to perform succeeding processing in conformity to the job template. <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

  The present invention relates to an information processing apparatus, an information processing method, an information processing program, and a peer-to-peer system.

  Conventionally, there are a client / server system and a peer-to-peer (hereinafter referred to as P2P) system as forms of network systems in which devices such as computers are connected to each other via a network.

  The client / server system is a system in which a server executes services for managing various information resources and providing various applications, which are used by clients, and is a system in which a master-slave relationship is fixed.

On the other hand, in the P2P system, a dedicated server is basically not provided, and each peer (for example, a personal computer) connected to the network provides a predetermined service to another peer in some cases. The system operates like a server, and in some cases operates like a client using a service provided by another peer, and each peer is an equivalent system. Various techniques have been proposed for such P2P systems (see, for example, Patent Document 1 and Patent Document 2).
JP 2002-335269 A JP 2003-256363 A

  In the P2P system, there are cases where it is desired to process a series of data such as scanning a document with a scanner, converting the format of image data obtained by scanning, and storing the converted data.

  In such a case, the user creates specified data for specifying a series of processes on his / her own personal computer, transmits the data to the scanner, and the scanner that receives the specified data scans the specified data and the document. It is conceivable to send the obtained image data to a peer for format conversion.

  However, as described above, it is troublesome for the user to create designation data for designating a series of these processes. If a series of processing is related to the partnership business, each of a plurality of users will create the same designated data, which is inefficient.

  In such a case, it is conceivable to store the created designated data in the scanner.

  However, when there are a plurality of scanners, in order for any of the scanners to perform the processing as described above, the designated data must be stored in each scanner, which is bothersome and inconvenient for the user. In addition, if the designated data is stored in only one scanner, the user must remember the scanner that stores the designated data, which is also inconvenient for the user.

  The present invention has been made in view of the above-described facts, and an object thereof is to provide an information processing apparatus, an information processing method, an information processing program, and a peer-to-peer system that can improve user convenience.

  In order to achieve the above object, the information processing apparatus according to the first aspect of the present invention includes a storage unit that stores an address of an external location that stores a plurality of designation data that respectively designate a plurality of processing orders, and the storage An acquisition unit that acquires a plurality of specified data from the external location based on the address that has been displayed, a display unit that displays the acquired plurality of specified data, and any one of the displayed plurality of specified data A selection means for selecting the designated data, the address of the selected designated data, and the data to be processed according to the designated data into an apparatus capable of executing the next process according to the designated data Transmitting means for transmitting.

  That is, the storage means stores an address of an external location that stores a plurality of designated data that designates the order of a plurality of processes. Note that the external location is a location outside the information processing apparatus.

  The acquisition means acquires a plurality of designated data from an external location based on the stored address, and the display means displays the obtained plurality of designated data.

  When a plurality of designated data is displayed on the display means in this way, the user selects designated data for designating the order of the plurality of processes to be executed on the data to be processed via the selecting means.

  Thus, when the designation data is selected by the selection means from among the plurality of designation data displayed on the display means, the transmission means determines the address of the selected designation data and the object to be processed according to the designation data. Is transmitted to a device capable of executing the next processing according to the designated data.

  The information processing apparatus can acquire data to be processed in accordance with the designated data as follows. For example, the apparatus may be obtained by reading a document, may be input or received from another peer or the like, and may be generated in the apparatus.

  As described above, since the address of the location where the designated data is stored is stored, a plurality of designated data can be displayed on the display means for any information processing device among the plurality of information processing devices, The user can select any information processing apparatus as the information processing apparatus for selecting the designated data, and convenience is improved.

  By the way, as described above, the address of the designated data and the data to be processed are transmitted to the information processing apparatus that can execute the next process according to the designated data. In the information processing apparatus that has received the data to be processed according to the data, as in claim 2, the acquisition unit acquires the specified data from the external location based on the address of the received specified data. .

  The processing execution means executes processing on the received processing target data according to the acquired designated data, and the transmitting means performs processing according to the received designation data address and the designated data. The data that has been processed in accordance with the specified data is transmitted to the device that can execute the next process in accordance with the specified data.

  By the way, the information processing apparatus may further include a process execution state storage unit that stores information indicating an execution state of a process according to specified data for the data to be processed.

  That is, for example, an information processing apparatus that acquires data to be processed from an external location according to the specified data (Claim 1 or the like), or an information processing apparatus that executes processing according to the specified data for the data (Claim 2). ) Transmits information indicating the execution state of the process according to the specified data for the data to be processed to another information processing apparatus. Accordingly, the other information processing apparatus can store information indicating the execution state of the process according to the specified data for the data to be processed.

  As described above, the information processing apparatus that stores information indicating the execution state of the process according to the designated data for the data to be processed displays the execution state of the process on the display unit based on the information. Also good. Thereby, the user can grasp | ascertain the execution state of a process.

  By the way, as described in claim 4, the information processing apparatus includes an executable process type storage unit that stores information indicating a type of process that can be executed in another information processing apparatus, and the stored executable process. Determining means for determining a device capable of executing the next process according to the specified data based on the information indicating the type and the next process according to the specified data; and the transmitting means, You may make it transmit the data which become the object of a process according to the address of the said designation | designated data, and this designation | designated data to the determined apparatus.

  Thus, since the information processing apparatus determines an information processing apparatus that can execute the next process, it is not necessary to transmit / receive information on the information processing apparatus that can execute the next process between the information processing apparatuses. The amount can be reduced.

  Furthermore, as in claim 5, the information processing device further includes an operation status information storage unit that stores information indicating an operation status of another information processing device, and the determination unit includes a plurality of information processing devices capable of executing the next process. If determined, a plurality of information processings capable of executing the next processing based on the stored information indicating the operation status of the other information processing devices and a plurality of information processing devices capable of executing the next processing An information processing apparatus that can complete the process most quickly among the apparatuses may be determined as an information processing apparatus that can execute the next process.

  In this way, the information processing device that completes the processing first among the plurality of information processing devices that can execute the next processing is determined as the information processing device that can execute the next processing. Can be completed.

  The information processing method according to claims 6 to 10 and the information processing program according to claims 11 to 15 also have the same operations and effects as those of claims 1 to 5, respectively. Is omitted.

  According to a sixteenth aspect of the present invention, in the peer-to-peer system configured by connecting a plurality of peers, each peer stores an address of an external location that stores a plurality of designation data each designating a plurality of processing orders. , At least one of the plurality of peers acquires a plurality of designated data from the external location based on the stored address, displays the obtained plurality of designated data on a display means, and displays the display Among the plurality of designated data displayed on the means, the address of the designated data selected by the selecting means and the data to be processed according to the designated data can be executed in accordance with the designated data. It is characterized by transmitting to a peer.

  That is, the present invention is a peer-to-peer system configured by connecting a plurality of peers.

  Each peer stores the address of an external location that stores a plurality of designation data that designates the order of a plurality of processes.

  At least one of the plurality of peers acquires a plurality of designated data from an external location based on the address stored as described above, and displays the obtained plurality of designated data on the display means.

  When a plurality of designated data is displayed on the display means in this way, the user selects designated data for designating the order of the plurality of processes to be executed on the data to be processed via the selecting means.

  As described above, when the designation data is selected by the selection means from among the plurality of designation data displayed on the display means, the peer determines the address of the selected designation data and the object to be processed according to the designation data. Is transmitted to a peer capable of executing the next processing according to the designated data.

  The peer can acquire data to be processed according to the specified data as follows. For example, it may be obtained by reading a document by the peer, may be input or received from another peer, or may be generated at the peer.

  As described above, since each peer holds the address of the external location where the designated data is stored, a plurality of designated data can be displayed on the display means for any of the plurality of peers. The user can select an arbitrary peer as a peer for selecting designated data, and convenience is improved.

  By the way, as described above, the address of the designated data and the data to be processed are transmitted to the peer capable of executing the next process according to the designated data, and therefore, according to the address of the designated data and the designated data. The peer that has received the data to be processed reads the specified data from an external location that stores the specified data based on the address of the received specified data, as in claim 17, and the received processing target The process is executed according to the read designated data.

  Then, the peer can execute the next process according to the specified data, using the address of the received specified data and the data processed according to the specified data as the data to be processed according to the specified data. Send to peer.

  By the way, each peer may hold information indicating the execution state of the process according to the designated data for the data to be processed, as in claim 18. That is, for example, a peer that has acquired data to be processed according to the specified data, or a peer that has executed processing according to the specified data for the data is an execution state of the process according to the specified data for the data to be processed Is sent to each peer. Thereby, each peer can hold information indicating the execution state of the process according to the specified data for the data to be processed.

  As described above, the peer that holds information indicating the execution state of the process according to the specified data for the data to be processed may display the execution state of the process on the display unit based on the information. . Thereby, the user can grasp | ascertain the execution state of a process.

  By the way, each peer may hold information indicating the type of processing that can be performed by each peer.

  In this case, the at least one peer (the peer that transmits the address and the data to be processed) includes the information indicating the type of processing that can be performed by each peer and the designated data, as in claim 19. A peer that can execute the next process according to the designated data is determined based on the next process according to the designated data, and an address of the designated data and a process according to the designated data are assigned to the determined peer. Send the target data.

  Thus, since the peer determines a peer that can execute the next process, it is not necessary to transmit / receive information on a peer that can execute the next process between the peers, and the amount of transmission / reception can be reduced.

  Furthermore, each peer may hold information indicating the processing execution status of other peers.

  In this case, the at least one peer (peer that transmits the address and the data to be processed) is determined as a plurality of peers that can execute the next processing according to the designated data, as in claim 20. In this case, the fastest completion of processing among the plurality of peers capable of executing the next processing is completed based on the information indicating the processing execution state of the other peer and the plurality of peers capable of executing the next processing. You may make it determine a peer as a peer which can perform the next process.

  In this way, the peer that completes the processing firstly among the plurality of peers that can execute the next processing is determined as the peer that can execute the next processing, so that the entire processing can be completed quickly.

  As described above, according to the present invention, since the address of the location where the designated data is stored is stored, a plurality of designated data is displayed on the display means for any information processing device among the plurality of information processing devices. The user can select any information processing apparatus as the information processing apparatus for selecting the designated data, and the convenience is improved.

  In addition, according to the present invention, since each peer stores the address of the external location where the designated data is stored, a plurality of designated data can be displayed on the display means for any of the plurality of peers. The user can select an arbitrary peer as a peer for selecting the designated data, and there is an effect that convenience is improved.

  Hereinafter, an example of an embodiment of the present invention will be described in detail with reference to the drawings.

  Hereinafter, embodiments of the present invention will be described.

  FIG. 1 conceptually shows the network configuration of the P2P network 10. As shown in FIG. 1, the P2P network 10 has a configuration in which the peers 12 </ b> A to 12 </ b> G are virtually connected to each other. In practice, for example, the peers 12 </ b> A to 12 </ b> C are peers that are under access restriction by the firewall 14. The peers 12C to 12E may be peers connected to the Internet, and the peers 12E to 12G may be peers whose addresses are translated by NAT (Network Address Translation).

  There are various connection methods between peers, such as using TCP (Transmission Control Protocol) connection using IPv4 (Internet Protocol version 4) or IPv6 (Internet Protocol version 6) functions, or using HTTP (HyperText Transfer Protocol). Or SMTP (Simple Mail Transfer Protocol) can be used.

  Here, the term “peer” refers to, for example, a computer such as a personal computer, a PDA (Personal Digital Assistance), a mobile phone, a printer, a copier, a hardware such as a multi-function machine having a plurality of these functions, or these functions. Software. Also, each peer can participate in a P2P network regardless of whether it is of the same type or a different type.

  As a form of the P2P network, as shown in FIG. 2, a pure P2P in which all of the peers 14A to 14K are in an equal relationship and a server 14S as shown in FIG. For other services, there is a hybrid P2P form in which the peers 14A to 14H are realized in an equal relationship with respect to other services, and the present invention can be applied to any form.

  Also, users or peers who log on to each peer that participates in the P2P network can configure groups according to the purpose, as shown in FIG. In FIG. 4, all of the peers 12A to 12G belong to the group 1, and the peers 12A, 12C, 12E, and 12F belong to the group 2, and the peers 12B, 12E, 12F, and 12G belong to the group 3. Each user or peer may belong to a single group or may belong to a plurality of groups. Also, a user or peer does not necessarily have to belong to a group.

  FIG. 5 shows the basic configuration of each peer participating in the P2P network 10. As illustrated in FIG. 5, the peer 12 includes a P2P infrastructure configuration unit 16, a P2P infrastructure management data storage unit 18, an application execution unit 20, and an application memory 22.

  The P2P infrastructure configuration unit 16 includes a message control unit 24, a data management unit 26, a transmission unit 28, and a reception unit 30.

  The transmission unit 28 transmits the message received from the message control unit 24 toward the network 32.

  The receiving unit 30 receives data necessary for its own peer among data transmitted and received in the P2P network 10. It is always in a reception standby state, receives various requests and data from other peers of the P2P network 10, and passes them to the message control unit 24. The transmitter 28 operates independently and in parallel.

  FIG. 6 shows a schematic configuration of the message control unit 24. As shown in FIG. 6, the message control unit 24 includes a service execution unit 34 and a message dispatch unit 36.

  The service execution unit 34 includes a peer search service unit 38, a notification information disclosure service unit 40, a notification information acquisition service unit 42, a group management service unit 44, a user management service unit 46, and a peer management service unit 48. Each service unit executes each service while exchanging information with each other.

  The peer search service unit 38 has a function of searching for a peer participating in the P2P network and a function of searching for a peer that can provide a service (function) required by the peer. The search range can be controlled by designating the name and attribute of the required service, the threshold value for the number of hops, and the like. Here, the number of hops is the number of peers through which a message is transmitted.

  The notification information disclosure service unit 40 has a function of notifying (disclosing) information such as services that can be provided by its own peer on the P2P network as notification information. Here, the services that can be provided include, for example, a group management service and a user management service, which will be described later, in addition to an application executed by the application execution unit 20. Notification of notification information may be executed, for example, when there is an inquiry from another peer or when the own peer is activated, or may be executed periodically, or a new peer is provided in the P2P network. It may be executed when it is received.

  In this way, the announcement information is published on the P2P network by the announcement information disclosure service unit 40 of each peer, so what kind of service each peer participating in the P2P network can use on the P2P network can be determined. I can grasp it.

  The notification information acquisition service unit 42 acquires the notification information transmitted from the peer searched by the peer search service unit 38 or the notification information spontaneously transmitted from another peer, and passes it to the data management unit 26. The data management unit 26 stores the acquired notification information in the P2P infrastructure management data storage unit 18 as peer information. Thereby, the peer can grasp what service is provided by other peers participating in the P2P network.

  The group management service unit 44 has a function of managing participation in or withdrawal from a group composed of peers having the same purpose, creation of a new group, and the like based on group information. The group information is, for example, information representing a correspondence relationship between at least a group ID and a user ID, and is stored in the P2P infrastructure management data storage unit 18. By referring to this group information, it is possible to grasp which user belongs to which group.

  The user management service unit 46 has a function of managing user information. User information includes, for example, logon information indicating the correspondence between a peer ID and a user ID logged on to the peer, information about the user himself such as the user name and email address, and the group ID of the group to which the user belongs. Information is stored in the P2P infrastructure management data storage unit 18.

  The peer management service unit 48 has a function of managing peer information of peers participating in the P2P network.

  The message dispatch unit 36 analyzes a message from the application execution unit 20 and a message transmitted / received to / from another peer, and passes control to a service unit that should perform processing related to the analyzed message in the service execution unit 34.

  As shown in FIG. 5, the P2P infrastructure management data storage unit 18 stores route information 18A, group information 18B, adjacent information 18C, peer information 18D, and user information 18E.

  The route information 18A includes information on a route in the P2P network, for example, information related to a spanning tree described later.

  As described above, the group information 18B is information representing a correspondence relationship between at least a group ID and a user ID, for example.

  The adjacency information 18C includes information on a peer adjacent to the own peer, for example, information such as a peer ID. Here, the adjacent peer can be, for example, a peer within a predetermined time that is a response time for a packet transmitted from the own peer. The adjacent information can be generated based on, for example, a response time obtained in a process of communicating with another peer, but may be set manually by an operator's operation or the like.

  The peer information 18D includes information related to the peer searched by the peer search service unit 38, for example, information such as a peer ID. Here, for example, an IP address or a URI (Uniform Resource Identifier) can be used as the peer ID. The peer information 18D includes notification information and the like notified by each peer on the P2P network acquired by the notification information acquisition service unit 42. First, the notification information includes notification information of services provided by the peer. Second, there is job status notification information to be described later, third is notification information indicating the status of each peer (power off, idle, busy, etc.), and fourth is job template notification information to be described later. The job template is data indicating a job processing procedure.

  As described above, the user information 18E includes user logon information, information about the user himself, and the like.

  The application execution unit 20 executes various applications, and transmits and receives messages to and from other peers via the message control unit 24. The application memory 22 is a memory for storing various types of information related to the execution of the application execution unit 20.

  Next, a specific example in the case where the target service is searched and executed in the P2P network will be described.

  First, in a P2P network comprising a peer with a transfer function that has a function of transferring a message to another peer and an end peer that does not have a transfer function and that transmits and receives messages to and from another peer via the peer with a transfer function Processing executed by the peer peer and end peer P2P infrastructure configuration unit 16 will be described. In addition, the peer with a transfer function has a configuration in which the service execution unit 34 includes a transfer function service unit (not shown).

  FIG. 7 shows a flowchart of processing executed by the end peer, and FIG. 8 shows a flowchart of processing executed by the peer with transfer function. These processes are executed when each peer is requested to operate. That is, when the peer is a computer, for example, it is executed when the computer is turned on.

  As shown in FIG. 7, in step 100, the end peer sends a search request for a peer with a forwarding function to, for example, another peer with a forwarding function set in the setting information stored in the peer in advance, It is transmitted to the peer-to-peer network with other transfer function peers by broadcasting. This is executed by the peer search service unit 38.

  In step 102, it is determined whether or not there is a transfer function peer. If there is a transfer function peer, the process proceeds to step 104. If there is no transfer function peer, the process proceeds to step 102. Return, for example, search for a peer with a transfer function again after a predetermined time.

  In step 104, a request is made to the searched peer with the forwarding function to acquire the notification information of the logged-on user or another user belonging to the group to which the own peer belongs. To do. This is executed by the notification information acquisition service unit 42.

  In step 106, it is determined whether or not the notification information has been received from the peer with transfer function. If not received, the process proceeds to step 110. If received, the received notification information is changed to step 108 in step 108. It is stored as peer information 18D in the P2P infrastructure management data storage unit 18.

  In step 110, it is determined whether a service request has occurred. For example, when an application is executed by the application execution unit 20 by an operation of a user logged in to the peer and a service request is generated, the service request is notified from the application execution unit 20 to the message control unit 24. In this case, the process proceeds to step 112. If a service request has not occurred, the process proceeds to step 116.

  In step 112, a message corresponding to the generated service request is created and transmitted to the searched peer with transfer function. For example, when the service request from the application execution unit 20 is a request to acquire a desired file, a file search including information for specifying the desired file such as a file name notified from the application execution unit 20 Send a request message to a peer with forwarding capability.

  In step 114, response processing for the transmitted message is performed. That is, a response message for the transmitted message is received, and processing corresponding to the content of the received response message is performed. For example, if the service request is a request to acquire a predetermined file, if there is a peer that owns the file, the peer information is received as a response message, and this is sent to the application execution unit 20. Notice. In this case, the application execution unit 20 requests the message control unit 24 to transmit a file transmission request to the peer that owns the desired file based on the received peer information. Thereby, a desired file can be acquired.

  In step 116, it is determined whether or not a request message for requesting some service provision or information provision from another peer is received from the peer with transfer function. If the request message has been received, the process proceeds to step 118. If the request message has not been received, the process returns to step 106 and the same processing as described above is repeated.

  In step 118, processing for the request is executed. In step 120, a message corresponding to the processing result is transmitted to the peer with transfer function. For example, when a file search request message is received from another peer, the request message is passed to the application execution unit 20 that executes file search. As a result, the file search is executed in the application execution unit 20 and the search result is notified to the message control unit 24. The message control unit 24 creates a response message based on the search result notified from the application execution unit 20, and transmits the response message to the transmission source peer of the file search request message. For example, if the file can be searched, a response message including information such as the peer ID of the own peer is created and transmitted to the peer that is the transmission source of the file search request message. Thus, the transmission source peer can confirm whether or not a desired file has been searched.

  Next, processing executed by the peer with a transfer function will be described.

  First, in step 200 shown in FIG. 8, the peer with a forwarding function is connected to another peer with a forwarding function set in the setting information stored in advance in its own peer, or another peer with a forwarding function by multicast or broadcast, for example. Requesting that various information such as group information, user information, and notification information be transmitted, and acquiring the information. The acquired information is stored in the P2P infrastructure management data storage unit 18. As a result, it is possible to obtain information on peers constituting the P2P network, information on logged-in users, and the notification information.

  In step 202, the adjacent information 18C stored in the P2P infrastructure management data storage unit 18 is notified to all peers with a transfer function adjacent to the peer. The adjacency information 18C includes at least information on a peer with a transfer function next to its own peer, and further includes adjacency information if adjacent information possessed by another peer has already been acquired. .

  In step 204, the neighboring peer with transfer function is requested to acquire the neighbor information and is acquired. In this way, neighbor information is exchanged with a peer with a transfer function next to the peer.

In step 206, configuration information of the spanning tree is generated based on the exchanged adjacent information, and is stored as route information in the P2P infrastructure management data storage unit 18. Here, the spanning tree represents a route in which a message transfer route has a tree structure without a loop. For example, as shown in FIG. 9A, the P2P network has a transfer function that belongs only to group 1, a transfer function peer 50 ₁ that belongs only to group 2, a transfer function peer 50 ₂ that belongs only to group 2, and a transfer function that belongs to any of groups 1 and ₂ . It is assumed that the attached peer 50 ₁₂ , the peer 50 _n with a transfer function that does not belong to any group, and end peers (not shown in FIG. 9) that exist behind these peers with the transfer function. In this case, the spanning tree is a tree-structured path without a loop as shown in FIG.

  In the next step 208, it is determined whether or not a message transmission request from the end peer has been received. If received, the process proceeds to step 210. If not received, the process proceeds to step 212.

  In step 210, the message is transferred based on the path information as the configuration information of the spanning tree. For example, in the case where a network as shown in FIG. 9A is constructed, a case where the end peer belongs to, for example, group 1 and a request message for group 1 is transmitted to the peer with transfer function will be described. In this case, the forwarding peer includes all the forwarding peers responsible for forwarding messages to end peers belonging to group 1, and a spanning tree in which messages are forwarded to all the forwarding peers, for example, A spanning tree as shown in FIG. 9C is calculated based on the path information. Then, the forwarding function peer forwards the request message from the end peer to all the neighboring forwarding function peers based on the calculated spanning tree. As a result, the message is transferred to peers with a transfer function on the spanning tree shown in FIG. 9C, and the message is transferred to all end peers of group 1. When a message transmission request for group 2 is transmitted to a peer with a transfer function, a spanning tree as shown in FIG. 9D is calculated.

  In the next step 212, it is determined whether or not a message has been received from the adjacent peer with transfer function. If received, the process proceeds to step 214. If not received, the process returns to step 208 to return to the above. Similar processing is repeated. Note that it is also possible to periodically return to step 200 and periodically calculate the spanning tree.

  In step 214, if the message needs to be forwarded based on the calculated spanning tree, that is, if there is a peer with forwarding function that does not forward the message among neighboring peers with forwarding function on the spanning tree, The message is transferred to the peer with the transfer function. If the received message is addressed to the same group as the end peer that is responsible for transferring the message, the received message is transferred to the end peer.

  Thus, each peer with a forwarding function calculates a spanning tree and forwards a message according to this spanning tree calculation, whereby it is possible to send and receive messages between end peers in the same group.

  The peer with the transfer function also executes the above-described processing (steps 116 to 120 (FIG. 7)) executed by the end peer.

  The configuration of transferring a message by a peer with a transfer function as described above is suitable mainly when a P2P network is constructed with a relatively small network such as a LAN (Local Area Network). When configuring a P2P network, messages are transmitted and received between peers connected to different networks via a firewall, a gateway, or the like. Below, the form suitable when constructing a P2P network with such a comparatively large-scale network is demonstrated.

  A P2P network 11 illustrated in FIG. 10 includes a plurality of networks 52 to 58, and the network 52 is connected to the network 54 via routers 60 and 62 and is connected to the network 58 via a router 64. The network 56 is connected to the network 58 via the router 66.

  The network 52 is configured to include end peers 52A and 52B and a queuing function peer 52C, the network 54 is configured to include an end peer 54A, the network 56 is configured to include an end peer 56A, and the network 58 is a relay function peer. 58A is included. Note that the peer with waiting function has a configuration in which a service function unit (not shown) is provided in the service execution unit 34, and the peer 58A with relay function has a configuration in which the service execution unit 34 has a relay function service unit (not shown). .

  In the P2P network 11 configured as described above, the end peer executes substantially the same processing as that shown in the flowchart of FIG. That is, the process executed by the end peer in the P2P network 11 can be considered to execute the process in which the transfer function peer is replaced with the waiting function peer in the description of the flowchart of FIG.

  The peer with a relay function is basically a peer that operates as a so-called gateway. A peer with a relay function first has various information such as group information and user information for other peers set in advance in the setting information stored in its own peer, or for other peers by multicast or broadcast. Is requested to transmit the information. When a message is received from another peer, the message is transferred to the peer designated as the transmission destination.

  Next, processing executed by the peer with a waiting function will be described with reference to the flowchart shown in FIG.

  First, in step 300, for example, for other peers with transfer function preset in the setting information stored in the own peer, or for various peers such as group information and user information for other peers by multicast or broadcast. Request to send information.

  In step 302, it is determined whether or not any information from another peer, such as the group or user information requested in step 300, information such as the notification information, notification information from another peer, or the like is received. Shifts to step 304, and shifts to step 306 if not received.

  In step 304, the information received from the other peer is stored in the P2P infrastructure management data storage unit 18. For example, if the received information is group information, it is stored in the P2P infrastructure management data storage unit 18 as group information 18B, and if the received information is user information, it is stored in the P2P infrastructure management data storage unit 18 as user information 18E.

  In Step 306, it is determined whether or not a request message for requesting some service provision or information provision has been received from the end peer. If received, the process proceeds to Step 308. If not received, Step 306 is performed. Returning to 302, the same processing as described above is repeated.

  In step 308, it is determined whether or not information corresponding to the request message is stored in the P2P infrastructure management data storage unit 18 of the own peer. If it is stored, the process proceeds to step 310 and is not stored. If so, the process proceeds to step 312.

  In step 310, information corresponding to the request message is read from the P2P infrastructure management data storage unit 18 and transmitted to the requesting peer.

  On the other hand, in step 312, the request message is transferred to the adjacent peer. As a result, the request message is propagated to other peers. As a result, a response message is transmitted from a peer capable of executing processing corresponding to the request message.

  In step 314, a response message transmitted from a peer capable of performing processing corresponding to the request message is received and transmitted to the requesting end peer.

  Here, a case where the peer 54A of the network 54 makes a search request for notification information will be described. In this case, the peer 54A searches for a peer with a waiting function, and transmits a search request message for notification information to the searched peer 52C with a waiting function. As a result, the peer 52C with the waiting function transmits the notification information of the other peer to the peer 54A if it is stored in its own peer, and if not, for example, notifies the adjacent peers 52A, 52B, etc. Request to send information. At this time, the peer 52A waits for the notification information of its own peer and the notification information of the other peer stored in its own peer, for example, when the notification information of the peer 56A is already stored. To the attached peer 52C. The same applies to the peer 52C. The queuing function-equipped peer 54C accumulates the notification information transmitted from other peers and transmits it to the peer 54A.

  As described above, a peer with a waiting function accumulates various information such as notification information transmitted from other peers in its own peer, and information corresponding to a request from an end peer is stored in its own peer. Sends the information to the end peer. Therefore, the efficiency of message transmission / reception in a large-scale network such as the P2P network 11 can be improved.

  Next, as a specific example of application execution, processing of the application execution unit 20 when the application is a file sharing service will be described.

  In this case, the application execution unit 20 notifies the message dispatch unit 36 of the message control unit 24 of a file search request including at least information for specifying a desired file such as a file name. The message dispatch unit 36 requests the peer search service unit 38 to search for a peer that owns this file. As a result, the peer search service unit 38 searches for a peer that owns the desired file and notifies the application execution unit 20 of it. Then, the application execution unit 20 requests the acquired peer to transmit a file and acquires it. If the information of the peer that owns the desired file has already been acquired and stored in its own peer, a file transmission request is sent directly to that peer without performing peer search. Just get the file.

  As described above, the application execution unit 20 transmits and receives messages to and from other peers via the message control unit 24 to provide services.

  Next, the processing of steps 116 and 118 in FIG. 7 will be described in more detail.

  In the present embodiment, the notification information is shared by each peer as described above. As shown in FIG. 12, the notification information is sequentially propagated to the peer. For example, the information is sequentially transmitted to the peer by the processing in step 104 (FIG. 7) and step 200 (FIG. 8). The notification information propagated in this process is notification information of the service provided by the peer.

  There are various types of notification information on services provided by peers. FIG. 13A shows notification information for document conversion. In FIG. 13A, Type: 1 of service notification information indicates that the data is service notification information provided by the peer. Function: Convert indicates that the service provided by the peer is format conversion. Detail: (TIFF, PDF), (TIFF, PostScript) indicates the function details (conversion format) of the service. Stauts: idle indicates the status of the peer and indicates that it is currently idle. Address: A.B.C.D indicates the address of the peer.

  By sharing this announcement information with each peer, the peer existing in the peer address ABCD can be converted in format, and more specifically, each peer can convert TIFF into PDF or PostScript. Judgment can be made.

  FIG. 13B shows the notification information of the repository (file storage). Type: 1 shown in FIG. 13B indicates that the data is notification information of the service provided by the peer, as described above. Function: Repository indicates that the service provided by the peer is file storage. Detail: http, ftp, and SMB indicate the function details (access protocol) of the service. Stauts: idle indicates the status of the peer as described above. Address: A.B.C.E indicates the address of the peer.

  By sharing this notification information among the peers, each peer can determine that the file existing in the peer address A.B.C.E can be stored.

Also, as described later, when a job is generated and processed, notification information of the job status is notified and shared with each peer. More specifically, the job status notification information indicates that Type: 2 shown in FIG. 14 is job status notification information. Job Id: ea850c-a674-554c090213513 indicates the job unique ID (identification information for the job). JobTemplateId: 151a-ef15-deadbeef indicates the unique ID (identification information in the job template) of the job template (JobTemplate) indicating the processing procedure of the job. Status: HYPERLINK mailto: pending @ 2 pending @ 2 indicates that the status of this job is waiting for the second processing. Location: ABCE indicates a peer address that is currently in charge of processing the job. DataLocation: HYPERLINK http: //ABCF/job/file.tiff http: //ABCF/job/file.tiff indicates the location of the job data file. JobName: Monthly report (2003/9) indicates the job name.

  By sharing this job status notification information to each peer, the job status identified by Job Id: ea850c-a674-554c090213513 is the first processing (scan) completed, and the data is http: / Each peer can determine that it is stored in a location that can be referred to by the URL /ABCF/job/file.tiff, and that it is waiting for processing in the second process (node ABCE).

Next, notification information of a job template (JobTemplate) will be described. Type: 3 shown in FIG. 15A indicates job template notification information. JobTemplateId: 151a-ef15-deadbeef indicates the unique ID (identification information) of the job template. JobTemplateDesc: Converted to PDF describes a job processing procedure using a job template. Location: HYPERLINK http: // ABC1 / JT / 151a-ef15-deadbeef http: // ABC1 / JT / 151a-ef15-deadbeef indicates the storage location of the job template.

In FIG. 15B, it is identified by JobTemplateId: 151a-ef15-deadbeef and stored in HYPERLINK http: // ABC1 / JT / 151a-ef15-deadbeef http: // ABC1 / JT / 151a-ef15-deadbeef The specific contents of the job template are shown. As shown in FIG. 15B, in this job template, first, Scan (document reading), then Convert (PDF) (file conversion to PDF), and Repository (file store) are sequentially executed. It is specified to be processed.

  With reference to FIGS. 16 and 17, detailed description will be given of how the processing in steps 116 and 118 in FIG. 7 is specifically performed using the notification information described above.

  In step 116, it is determined whether there is a certain request from another peer, but the present invention is not limited to this. For example, as shown in FIG. 15B, a job template for sequentially processing Scan (document reading), Convert (PDF) (file conversion to PDF), and Repository (file store) is selected and processed. An example will be described in the case of specifying.

  As described above, since the notification information of the job template is shared by each peer, an arbitrary scanner (peer) displays a list of job templates from the notification information of the shared job template, and the user can select a desired job template. Can be selected to instruct the processing.

  In this way, when the user arbitrarily instructs the scanner (peer) to display a list of job templates, step 116 is started. That is, the process of FIG. 16 is started. First, in step 402 of FIG. 16, a list of shared job templates (JT) is displayed based on the shared job template notification information.

  Since the job templates (JT) are displayed as a list in this way, the user can grasp the job template (JT) that instructs the processing desired by the user.

  In step 404, the user determines whether any job template (JT) has been selected by touching the touch panel (selecting means) or operating a predetermined key (selecting means), and any job template is selected. When (JT) is selected, for example, when the job template (JT) shown in FIG.

  When the user selects the job template (JT) as described above, the user sets a document and instructs the scanner (peer) to start scanning. Thereby, step 406 is started. That is, the document is scanned according to the selected job template (JT). The original image data is obtained by scanning the original and a job is generated. In step 408, the job (image data) is stored.

  In step 410, job state notification information (FIG. 14) is created, and in step 412, the job state notification state is transmitted to other peers for sharing.

  In step 414, it is determined whether there is a next process based on the job template (JT). If there is a next process, in step 416, a peer capable of executing the next process is searched. That is, as shown in FIG. 15B, the job template (JT) shown in FIG. 15A is composed of Scan (document reading), Convert (PDF) (file conversion to PDF), and Repository ( (File store) is specified in order, and now it is at the stage where Scan (document reading) is completed, and it can be recognized that the next process is Convert (PDF) (file conversion to PDF). . In addition, since each peer shares the notification information of the service provided by each peer, this scanner (peer) also shares the notification information of the service provided by each peer. Can recognize whether Convert (PDF) (file conversion to PDF) is possible. That is, the scanner (peer) can search for a peer that can execute the next processing based on the job template (JT) and the notification information of the service provided by each peer.

  By the way, when a plurality of peers capable of executing the next process can be searched, it is conceivable that any one of these peers is determined as a final peer capable of executing the next process.

  However, in this embodiment, as described above, the notification information indicating the state of each peer (power OFF, idle, busy, etc.) is also shared. Therefore, when multiple peers that can execute the next process can be searched, the state of these peers is determined from the above notification state, and is not a power-off or busy peer, but an idle (standby) state. May be determined as the final peer.

  Further, when the processing capability of each peer is also shared as notification information of the service provided by each peer, if there are a plurality of idle (standby) peers, the processing is completed earliest from the processing capability. A possible peer may be determined as the final peer. If a plurality of peers capable of executing the next process are all busy, a peer that can complete the process earliest from the processing capability may be determined as the final peer.

  Note that if an idle (waiting) peer and a busy peer are obtained as peers that can execute the next process, the currently executing process may be almost complete even in the busy state. Thus, the peer that can complete the processing earliest may be determined as the final peer.

  In step 418, the job (image data), information on the next process to be executed, and job template (JT) identification information are transmitted to the determined peer.

  As described above, since the peer that has received the job (image data), the information on the processing to be executed next, and the identification information of the job template (JT) has received a certain request from the other peer, the above step 116 is performed. Is affirmative, and the requested processing is executed in step 118. More specifically, each process shown in FIG. 17 is executed.

  That is, in step 502 of FIG. 17, based on the identification information of the job template (JT), the job template (JT) is read from the storage location, the job template (JT) is acquired, and the above-described input should be executed. In consideration of the processing information (job progress information), the processing to be executed is grasped, and in step 504, the processing is executed on the received job (image data). That is, in the above example, it is converted into a PDF file.

In step 410, job status notification information, ie, in this processing, job status notification information is created as Status : HYPERLINK mailto: Status @ 3 Status @ 3 (the third is waiting for processing) In step 412, the created job status notification information is transmitted to each peer to be shared. As a result, the status of the job status notification information is updated at each peer.

  In addition, since the following steps 510-518 are the same as the said steps 414-418, the description is abbreviate | omitted. In the job template (JT) in the above example, the data converted into the PDF is finally stored in a predetermined location ("http: //ABC3/JobData/data.pdf) for processing. Is completed.

  In the embodiment described above, since each peer holds the address of the location where the designated data is stored, a plurality of job templates can be displayed for an arbitrary peer (scanner). As a peer for selecting, any peer can be selected, which improves convenience. Therefore, routine work can be processed using an arbitrary scanner without the trouble of management.

  In the above embodiment, the job is executed by the peer capable of executing each process in the P2P network according to the order of the processes specified by the job template (JT), so that the predetermined format conversion and storage to the file server are performed. It can also be used with scanners that do not have such advanced functions.

  In the above embodiment, since each peer shares the notification information of the job template (JT), the job template (JT) is not sent to the peer executing the next process, instead of the job template (JT) data. ) Can be acquired from the notification information, and as a result, the amount of transmission during communication can be reduced.

  Furthermore, in the above embodiment, functions provided in the P2P network (format conversion, etc.) are dynamically updated and shared. Therefore, management can be performed simply by connecting a machine having a new function to the P2P network. This new function can be used without bothering the user.

  In the above embodiment, the peer node status (power OFF / idle / busy) can also be acquired in the P2P network. For this reason, when performing format conversion with a large amount of calculation, resources can be used effectively by requesting the peer node, which is an idle, to perform processing. Furthermore, in the above-described embodiment, when processing is possible with a plurality of nodes, the job is routed avoiding the power-off node, so that high availability can be realized.

  In the above embodiment, each peer stores job status notification information and updates the job status notification information in accordance with the job processing execution status. Therefore, the job status notification information is displayed. Thus, the user can grasp the execution state of the process.

  In the embodiment described above, a user searches for a job template that can be used in this P2P network on a scanner or a personal computer (PC; peer), and if a job template that performs a desired process is found, this is used. Process. However, if the desired job template is not found, search for the functions published in the P2P network, combine the necessary functions (for example, format conversion to PDF and store it in the file server, etc.) You may create it. The newly created job template is also shared with the scanner through the P2P network. The user can obtain a desired result by selecting a job template and scanning a document with an arbitrary scanner in the P2P network.

  In the above embodiment, the series of processing starts from the scanner, but the present invention is not limited to this, and other peers, for example, a device having a facsimile function may be used. That is, when image data is received in an apparatus having a facsimile function, a series of processes may be executed on this data according to a job template. Moreover, a user's personal computer may be sufficient. In other words, a series of processing may be executed according to the job template for data created on the user's personal computer.

  Note that the above is an example of the construction of the P2P network. For example, the protocol described in Patent Document 1, the PX (Peer Discovery Protocol) of the JXTA protocol, the PRP (Peer Resolver Protocol), Known protocols such as PIP (Peer Information Protocol), PMP (Peer Membership Protocol), PBP (Peer Binding Protocol), PEP (Peer Endpoint Protocol) May be used to construct a P2P network.

It is a network block diagram of a P2P network. It is a network block diagram of pure P2P. It is a network block diagram of hybrid P2P. It is a conceptual diagram for demonstrating the group of a P2P network. It is a block diagram of the basic composition of a peer. It is a block diagram of a message control part. It is a flowchart of the process performed by an end peer. It is a flowchart of the process performed by the peer with a transfer function. It is an image figure of a spanning tree. It is a network block diagram of the other form of a P2P network. It is a flowchart of the process performed by the peer with a waiting function. It is the figure which showed a mode that notification information was propagated. It is the figure which showed the notification information of the service which a peer provides, (A) is the figure which showed the notice information of document conversion, (B) is the figure which showed the notification information of a repository (file preservation) is there. It is the figure which showed the notification information of the state of a job. (A) is the figure which showed the notification information of the job template, (B) is the figure which showed the data content of the job template. It is the flowchart which showed the process of steps 16 and 18 in case a scanner (peer) performs. It is the flowchart which showed the process of steps 16 and 18 when the peer which received the job from the other peer performs.

Explanation of symbols

10, 11 P2P network 12 Peer 16 P2P infrastructure configuration unit 18 P2P infrastructure management data storage unit 20 Application execution unit 22 Application memory 24 Message control unit 26 Data management unit 28 Transmission unit 30 Reception unit 32 Network 34 Service execution unit 36 Message dispatch unit 38 Peer Search Service Unit 40 Notification Information Acquisition Service Unit 42 Notification Information Acquisition Service Unit 44 Group Management Service Unit 46 User Management Service Unit 48 Peer Management Service Unit

Claims (20)

Storage means for storing addresses of external locations for storing a plurality of designation data for designating a plurality of processing orders, respectively;
Obtaining means for obtaining a plurality of designated data from the external location based on the stored address;
Display means for displaying the acquired plurality of designated data;
A selection means for selecting any of the designated data displayed among the plurality of designated data displayed;
Transmitting means for transmitting the address of the selected designated data and the data to be processed according to the designated data to a device capable of executing the next process according to the designated data;
An information processing apparatus comprising: Receiving means for receiving an address of an external location for storing designated data for designating the order of a plurality of processes and data to be processed according to the designated data;
Obtaining means for obtaining designated data from the external location based on the address of the received designated data;
Processing execution means for executing processing according to the acquired designated data for the data to be processed;
The address of the received designated data and the data processed according to the designated data as data to be processed according to the designated data are transmitted to a device capable of executing the next process according to the designated data. A transmission means;
An information processing apparatus comprising:   The information processing apparatus according to claim 1, further comprising a process execution state storage unit that stores information indicating an execution state of a process according to specified data for the data to be processed. An executable process type storage unit that stores information indicating a type of process that can be executed in another information processing apparatus;
Determining means for determining a device capable of executing the next process according to the specified data based on the stored information indicating the type of executable process and the next process according to the specified data;
Further comprising
The transmission means transmits the address of the designated data and the data to be processed according to the designated data to the determined device.
The information processing apparatus according to claim 1, wherein the information processing apparatus is an information processing apparatus. An operation status information storage unit for storing information indicating the operation status of another information processing apparatus;
In the case where a plurality of information processing apparatuses capable of executing the next process are determined, the determination means stores information indicating an operation status of the other information processing apparatus stored and a plurality of information capable of executing the next process Determining an information processing device capable of completing the earliest processing among a plurality of information processing devices capable of executing the next processing as an information processing device capable of executing the next processing based on the processing device;
The information processing apparatus according to claim 4. Storing an address of an external location for storing a plurality of designation data each designating a plurality of processing orders;
An acquisition step of acquiring a plurality of designated data from the external location based on the stored address;
Displaying the obtained plurality of designated data on a display means;
Selecting any one of the displayed plurality of designated data;
Transmitting the address of the selected designated data and the data to be processed according to the designated data to a device capable of executing the next process according to the designated data;
An information processing method comprising: Receiving an address of an external location for storing designated data designating a plurality of processing orders and data to be processed according to the designated data;
Obtaining designated data from the external location based on the address of the received designated data;
Executing a process in accordance with the acquired designated data for the received data to be processed;
The address of the received designated data and the data processed according to the designated data as data to be processed according to the designated data are transmitted to a device capable of executing the next process according to the designated data. Steps,
An information processing method comprising:   8. The information processing according to claim 6, further comprising a step of storing information indicating an execution state of a process according to designated data for the data to be processed in a process execution state storage unit. Method. Storing in the executable process type storage means information indicating the type of process that can be executed in another information processing apparatus;
A determination step for determining a device capable of executing the next process according to the specified data based on the stored information indicating the type of executable process and the next process according to the specified data;
Further comprising
In the transmission step, an address of the designated data and data to be processed according to the designated data are transmitted to the determined device.
The information processing method according to any one of claims 6 to 8, wherein: A step of storing information indicating an operation status of another information processing apparatus in the operation status information storage means;
In the determining step, when a plurality of information processing apparatuses capable of executing the next process are determined, information indicating an operation status of the stored other information processing apparatus and a plurality of information processing apparatuses capable of executing the next process are determined. Determining an information processing device capable of completing the earliest processing among a plurality of information processing devices capable of executing the next processing as an information processing device capable of executing the next processing based on the information processing device;
The information processing method according to claim 9. A program that causes a computer to execute the following information processing:
The process is
Storing an address of an external location for storing a plurality of designation data each designating a plurality of processing orders;
An acquisition step of acquiring a plurality of designated data from the external location based on the stored address;
Displaying the obtained plurality of designated data on a display means;
Selecting any one of the displayed plurality of designated data;
Transmitting the address of the selected designated data and the data to be processed according to the designated data to a device capable of executing the next process according to the designated data;
Information processing program with A program that causes a computer to execute the following information processing:
The process is
Receiving an address of an external location for storing designated data designating a plurality of processing orders and data to be processed according to the designated data;
Obtaining designated data from the external location based on the address of the received designated data;
Executing a process in accordance with the acquired designated data for the received data to be processed;
The address of the received designated data and the data processed according to the designated data as data to be processed according to the designated data are transmitted to a device capable of executing the next process according to the designated data. Steps,
Information processing program with   13. The process according to claim 11 or 12, further comprising a step of storing, in a process execution state storage unit, information indicating an execution state of a process according to designated data for data to be processed. The information processing program described. The process is
Storing in the executable process type storage means information indicating the type of process that can be executed in another information processing apparatus;
A determination step of determining a device capable of executing the next process according to the specified data based on the stored information indicating the type of executable process and the next process according to the specified data;
Further comprising
In the transmission step, an address of the designated data and data to be processed according to the designated data are transmitted to the determined device.
14. The information processing program according to claim 11, wherein the information processing program is any one of claims 11 to 13. A step of storing information indicating an operation status of another information processing apparatus in the operation status information storage means;
In the determining step, when a plurality of information processing apparatuses capable of executing the next process are determined, information indicating an operation status of the stored other information processing apparatus and a plurality of information processing apparatuses capable of executing the next process are determined. Determining an information processing device capable of completing the earliest processing among a plurality of information processing devices capable of executing the next processing as an information processing device capable of executing the next processing based on the information processing device;
The information processing program according to claim 14. In a peer-to-peer system where multiple peers are connected,
Each peer stores an address of an external location that stores a plurality of designated data that designates the order of a plurality of processes.
At least one of the plurality of peers is
Obtaining a plurality of designated data from the external location based on the stored address;
Displaying the obtained plurality of designated data on a display means;
Of the plurality of designated data displayed on the display means, the address of the designated data selected by the selecting means and the data to be processed according to the designated data are executed in accordance with the designated data. Send to possible peers,
A peer-to-peer system characterized by that. At least one of the plurality of peers is
Receives the address of the designated data and the data to be processed according to the designated data from another peer,
Based on the address of the received designated data, the designated data is read from the location where the designated data is stored,
For the received data to be processed, processing is performed according to the read specified data,
The address of the received designated data and the data processed according to the designated data as data to be processed according to the designated data are transmitted to a peer capable of executing the next process according to the designated data. ,
The peer-to-peer system of claim 16.   18. The peer-to-peer system according to claim 16, wherein each peer holds information indicating an execution state of processing according to designated data for data to be processed. Each peer has information that indicates the type of processing each peer can perform,
The at least one peer is
Based on the information indicating the type of processing that can be executed by each peer and the next processing according to the specified data, determine a peer that can execute the next processing according to the specified data;
Transmitting the address of the designated data to the determined peer and data to be processed according to the designated data;
The peer-to-peer system according to any one of claims 16 to 18, characterized in that: Each peer
Holds information indicating the processing execution status of other peers,
The at least one peer is
When a plurality of peers capable of executing the next process according to the specified data are determined, the next process is performed based on information indicating the process execution status of the other peer and the plurality of peers capable of executing the next process. A peer that can complete the earliest processing among a plurality of peers that can perform the processing is determined as a peer that can perform the next processing;
The peer-to-peer system of claim 19.

Images