JP2007156736A - Information processor and coordinated processing method - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To perform a series of coordinated processing by optimum service, even at normal times, when a plurality of pieces of service providing identical functions are present. <P>SOLUTION: This information processor has a service characteristic information acquisition means; a flow information acquisition means; a virtual distance calculation means for calculating a virtual distance, when the service cooperates according to flow information and service characteristics information related to the usable service; and a processing request means for requesting processing to the service, according to the virtual distance calculated by the virtual distance calculation means. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to an information processing apparatus and a cooperation processing method.

  2. Description of the Related Art In recent years, copying machines having a plurality of functions such as a printing function, a scanner function, a FAX function, a mail transmission function, a character recognition function, and the like have been provided with an increase in performance of the copying machine. In addition, there are systems in which these functions are converted into services (Web services) in units of functions, and services (that is, functions) can be used between copiers connected via a network. To do.

  In such a system, for example, the copying machine A reads a paper document using the scanning function of the copying machine A, and prints the scanned document using the printing function of the copying machine B connected to the copying machine A via the network. A series of processing (cooperation processing) can be performed by linking each other.

  In addition, in order to cause a series of processing to be performed by linking such copiers, conventionally, for example, a system user or the like has previously specified an instruction for designating the order in which functions such as scanning and printing are linked in advance. Was made and a series of processing was performed. However, in the case of such a method, there is a problem that a series of linkage processing is interrupted when an error occurs in a certain service.

  In order to solve this problem, for example, there is a method in which a system user searches for an alternative service of a service in which an error has occurred, issues an instruction to continue the process, and continues a series of linkage processes (for example, , See Patent Document 1).

JP 2004-288067 A

  However, in the conventional technology described above, even when there are a plurality of services providing the same function, an alternative service is requested to perform processing only when an error occurs in the service, that is, when there is an abnormality. Therefore, there is a problem that a series of linkage processing is not always performed by an optimal service.

  The present invention has been made in view of the above points, and an object of the present invention is to perform a series of linkage processes using an optimal service even when there is a plurality of services that provide the same function.

  Therefore, in order to solve the above problem, the present invention is an information processing apparatus that communicates with a plurality of devices that provide a function as a service, and service characteristic information acquisition means that acquires service characteristic information indicating a characteristic of the service; A virtual distance for calculating a virtual distance when the services are linked according to the flow information acquisition means for acquiring the flow information indicating the execution order of the service, the service characteristic information regarding the available service, and the flow information. It has a calculation means, and a process request means for requesting a process to a service according to the virtual distance calculated by the virtual distance calculation means.

  By adopting such a configuration, for example, the service is requested to be processed in ascending order of the virtual distance. Therefore, when there are a plurality of services that provide the same function, a series of linkages are performed by an optimal service even in a normal state. Processing can be performed.

  In order to solve the above problem, the present invention may be a cooperative processing method, a cooperative processing program, and a recording medium.

  Note that the information processing apparatus corresponds to, for example, a copier or a device described later. Moreover, the number of requests described in the claims corresponds to, for example, the number of prefetches described later. Further, the recording medium described in the claims corresponds to, for example, a RAM 103, a ROM 104, a hard disk 109, or the like which will be described later.

  According to the present invention, when there are a plurality of services that provide the same function, a series of linkage processes can be performed with an optimal service even in a normal state.

  Embodiments of the present invention will be described below with reference to the drawings.

  FIG. 1 is a diagram showing an example of the configuration of a copying machine. Various devices described below are connected on the bus 101. The CPU 102 performs various controls, calculations, and the like according to its own functions such as print processing at the time of printing and image processing at the time of scanning. A RAM 103 is a volatile memory, and stores calculation results by the CPU 102, image data related to printing and scanning, font data, and the like. The ROM 104 is a nonvolatile memory and stores font data and the like. Note that the ROM 104 may be rewritable.

  The input unit 105 receives an instruction (instruction information) or an input (input information) from the user. For example, although not shown in FIG. 1, the input unit 105 receives an instruction or input from a user using a touch screen or the like mounted on a copying machine.

  The output unit 106 displays various information such as the status of the copying machine (status information), the function (function information), and information for receiving an instruction from the user. For example, although not shown in FIG. 1, the output unit 106 displays the above-described information on a touch screen or the like mounted on the copying machine.

  The network interface 107 connects the copying machine (or the CPU 102) to an external network such as a LAN (Local Area Network). The copying machine exchanges data such as images with external devices via the network interface 107.

  The disk interface 108 connects the CPU 102 and the hard disk 109. The hard disk 109 stores image data and the like. Data stored in the hard disk 109 is read into the RAM 103 and used in accordance with an instruction from the CPU 102 as necessary. A plurality of hard disks 109 may exist.

  Although not shown in FIG. 1, an apparatus that is hardware that executes various functions such as printing, scanning, and fax mounted in the copying machine is connected to the unit connection unit 110. Unit connection part 110 may exist individually for every function.

  It has an input unit, an output unit, and a network interface, provides its own functions as a service to an external device (for example, another copier), and the service can communicate with a service provided by the external device. The copying machine is not limited to the configuration shown in FIG.

  That is, the copier of the present embodiment provides the functions possessed by itself to the external device as a service, and each service can communicate with the service provided by the external device. In FIG. 1, a program for executing processing related to a service is stored in the hard disk 109 or the ROM 14. The CPU 102 reads the program from the hard disk 109 or the ROM 14, stores it in the RAM 103, and executes it. As a result, the copier receives a service list (service list list) of the external device via the network interface 107, provides its own functions as a service, or requests the external device to provide a service. When the CPU 102 executes the program, the copier outputs (displays) the service list received from the external device to the output unit 106 or receives a service selection from the user via the input unit 105. To do.

  FIG. 2 is a diagram showing an example of a service configuration of copiers connected to each other via a network. As shown in FIG. 2, a copying machine A (302), a copying machine B (303), and a copying machine C (304) are connected to each other via a network 301. The copier A (302) and the copier B (303) provide their own functions as services to other devices (external devices) connected via the network 301. That is, the copying machine A (302) provides the service A1 (305) and the service A2 (306), and the copying machine B (303) provides the service B1 (307). Each of the copiers 302, 303, and 304 has a function of acquiring information on what service can be executed by which device (or providing a service), that is, a service list.

  Here, taking as an example a case where the copier C (304) acquires information on services provided by other devices (other copiers) connected via a network, that is, a service list. Service list acquisition processing will be described.

  The copier C (304) transmits a broadcast message for requesting a service list together with its own IP address to other devices connected via the network. If there is a function (service) that can be provided by the device that has received the broadcast message, the device returns the service list to the IP address of the target device (copier C (304)) that sent the broadcast message. To do. That is, in the case of the copier A (302), a list of the service A1 (305) and the service A2 (306) is transmitted to the copier C (304) as a service list. In the case of the copying machine B (303), a list for the service B1 (307) is transmitted to the copying machine C (304) as a service list.

  Note that the copying machine may transmit a message for requesting a service list only to a device having a specific IP address instead of a broadcast message. By doing so, network traffic can be reduced.

  Further, the copying machine may transmit a message for requesting update information of a service provided by this device only to a device having a specific IP address. By doing so, network traffic can be reduced.

  An example of the service list is shown in FIG. FIG. 3 is a diagram illustrating an example of a service list. A service list as shown in FIG. 3 is transmitted from each device. FIG. 3 is a conceptual diagram of the service list, and the actual format of the service list may be any format that can be recognized between devices, such as an XML format or a binary format. Here, XML is an abbreviation for eExtensible Markup Language.

  401 is a device ID (device ID) indicating a device-specific value. For example, if the device is a copying machine, the ID is set for each copying machine. In the example of FIG. 3, this ID is “ABC112345”. Reference numeral 402 denotes an IP address of the device. In the example of FIG. 3, this IP address is “168.54.69.221”. If the device has a plurality of network interfaces and the IP address is different for each service, in this embodiment, a service list is issued for each IP address. However, the present invention is not limited to this, and a mechanism in which a plurality of IP addresses can be described in one service list.

  As described above, 401 and 402 are information related to the device, but the device (for example, a copier) describes information related to the device such as model name and model information not shown in FIG. 3 in the service list. May be.

  Next, descriptions 403 to 406 are descriptions regarding individual services. Reference numeral 403 denotes an ID uniquely set for the service. In the example of FIG. 3, this ID is “9642”. Reference numeral 404 denotes a service name. In the example of FIG. 3, this name is “service A1”. Reference numeral 405 denotes a charge for using the service. In the example of FIG. 3, this fee is “15 yen”. That is, it is described in the service list in FIG. 3 that a fee “15 yen” is necessary to execute the service ID “9642”. Reference numeral 406 denotes a service processing speed. Note that the processing speed is the processing capacity per page if the service is installed in the copying machine. In the example of FIG. 3, this processing speed is “3 Sec / Page”, that is, it takes 3 seconds per page.

  In addition to or in addition to the charge of 405 and the processing speed of 406, information that allows the copier or the like to compare services may be described in the service list. In 407, the same service as that described above is described for other services of this device. Information of at least one service is described in the service list.

  When creating a service list, a device that provides a function (copier) acquires information on the services of other devices connected via the network and stores the information on the services of other devices. It does not create the service list that contains it and send it to the requester. Such processing is performed by the copier that has requested acquisition of the service list using the service list obtained from each device (copier).

  The service list may be held and updated by each device or service. The service list may not be held by each device or service, but may be centrally managed by a server connected to a copier or the like via a network in order to maintain consistency.

  In addition, since only the services that can be used are described in the service list, information on services that cannot be used at that time, that is, services in which an error has occurred, is notified to the copier that transmitted the broadcast message. There is nothing.

  The copying machine collectively displays the service list received from each copying machine on the output unit 106. The output unit 106 displays an output screen related to the service list on, for example, a touch screen.

  FIG. 4 is a diagram illustrating an example of an output screen related to the service list displayed on the touch screen. The user gives an instruction to the copying machine by pressing a position corresponding to the button on FIG. Reference numeral 501 denotes an area showing a list of available services (functions). Reference numeral 501 has a scroll bar, and the user displays the function in the hidden area by clicking the scroll bar. In addition, buttons 506, 507, and 508 are displayed at 501 and are associated with function B, function M, and function C, respectively.

  The user selects a desired function and presses an add button 503 to move the selected function to the function area 502 to be executed. Although function selection is not shown, any function selection may be used as long as the user can determine that the function has been selected. In other words, the copying machine may invert the display of the selected function, put a mark indicating that the function has been selected, or change the color so that it can be determined that the function has been selected. May be. The copying machine may cancel the selection when the function is selected again by the user.

  The copying machine stores the selected (ordered) functions (services) by the method described with reference to FIG. 4 as a flow list as shown in FIG. FIG. 5 is a diagram illustrating an example of a flow list.

  Reference numeral 1101 denotes a Flow tag, which represents a flow list. The Flow tag has a deviceID attribute and a job attribute. In the device ID attribute, an ID for specifying a device (a copying machine that has created a flow list) is described. In the job attribute, a uniquely determined value for specifying a process (job) in the device is described. Note that an IP address may be described instead of the ID for specifying the device.

  The order of functions is indicated by 1102 and 1103 Service tags. For example, 1102 is a service that is executed first because the No attribute is 1, and its service ID is 6901. 1103 is a service performed after execution of the service ID 6901 because the No attribute is 2, and the service ID is 831.

  As shown in FIG. 5, the copier in this embodiment creates a flow list using a service ID assigned to a function, rather than creating an instruction sheet depending on a specific device. A copier that executes the first process of the linkage process creates a flow list, but a copier (or service) that executes the second and subsequent processes of the linkage process acquires the created flow list. Process. The same applies to a constraint condition list described later.

  The copier creates a restriction condition list based on an instruction from the user after creating a flow list for designating cooperation processing. The restriction condition list is a list describing which of the characteristics (conditions) of each service has priority. FIG. 6 is a diagram illustrating an example of the constraint condition list.

  Reference numeral 601 denotes a Constraint tag, which represents a constraint condition. Reference numerals 602 and 603 denote Priority tags, in which constraint conditions are described according to priority. As described in 610, 602 represents a constraint condition regarding “charge”, and 603 represents a constraint condition regarding “processing speed” as described in 611. The priority is described in the order attribute of the Priority tag. Since “1” is described in 604 and “2” is described in 605, 602 is the highest priority (“1”), and 603 is the next priority. ("2"). The Priority tag also describes a weight attribute and describes a weighting value. In this embodiment, it is assumed that priority is given to the weighting value that is positive and small. In FIG. 6, regarding the “charge” constraint, the weighting value is “0” as in 606, and for the “processing speed” constraint, the weighting value is “20” as in 607. "It is.

  Furthermore, a compare attribute is described in the Priority tag. The compare attribute 608 describes descending meaning descending order. The compare attribute 609 describes ascending meaning ascending order.

  In the example of FIG. 6, the constraint condition list is such that the constraint condition “fee” is given the highest priority, and then the constraint condition “processing speed” is given priority and the cooperative processing is performed. Further, in the example of FIG. 6, “charge” gives priority to a cheap one (that is, priority from a low value), and “processing speed” gives priority to a fast one (that is, priority from a high value). ) Is a restriction condition list indicating that. The copying machine stores the created or acquired restriction condition list in, for example, the RAM 103 or the hard disk 109, and refers to (or acquires) the information when necessary.

  FIG. 7 is a flowchart illustrating an example of processing for determining an optimum service to be executed next and requesting provision of a service in a series of linkage processing. In step S701, the copier acquires (or generates) a service characteristic list from a service list transmitted from another copier connected via the network. For more specific explanation, first, it is assumed that the service list as shown in FIG. 3 is described in the XML format as shown in FIG. FIG. 8 is a diagram showing an example of a service list written in the XML format.

  For each service, the copying machine uses device-specific information such as device ID and IP address (801 in FIG. 8) and individual service information (802 in FIG. 8) as shown in FIG. Generate a service property list. The copying machine stores the created service characteristic list in, for example, the RAM 103 or the hard disk 109.

Thus, if the service list is in the XML format, the copying machine generates a service characteristic list for each service using, for example, XSLT (XML Stylesheet Language Transformations). Here, you are given a number to each service, a service corresponding to the number n and S _n. Further, _let L _n be a service characteristic list corresponding to the service Sn. In step S701, the copying machine executes processing for obtaining L _n .

  Here, FIG. 9 shows an example of a service characteristic list generated from the device-specific information 801 and the individual service information 802 in FIG. FIG. 9 is a diagram illustrating an example of the service characteristic list. As shown in FIG. 9, information (characteristic information) about one service is described in the service characteristic list at the time when the service is converted from the service list to the service characteristic list by the copying machine. In the tag indicating Service, a unique number assigned to the service is described (no attribute, which is 1 in FIG. 9).

Note that the copying machine may describe not only the service characteristic information but also, for example, a service ID that must be executed in advance, in the service characteristic list L _n . Further, the copying machine may describe not only the service characteristic information but also, for example, a service ID that should be executed before and after the service, in the service characteristic list L _n . The copier may describe not only the service characteristic information but also the ID of a recommended service that combines several services when using the service, for example, in the service characteristic list L _n .

Here, FIG. 10 shows an example of processing in step S701, taking the system configuration of FIG. 2 as an example. FIG. 10 is a diagram illustrating an example of processing in step S701 in FIG. In the case of FIG. 2, for example, the copier C (304) displays a service list 1001 in which information about the services A1 (305) and A2 (306) provided by the copier A (302) is described. Obtained from the copier A (302) or the like and held. Further, the copier C (304) acquires from the copier B (303) and the like a service list 1002 in which information about the service B1 (307) provided by the copier B (303) is described. Hold. In such a case, the copier C (304) creates a service characteristic list for each service by the processing of S701. That is, the copier C (304) creates a service characteristic list L ₁ (1003) for the service A1. The copier C (304) creates a service characteristic list L ₂ (1004) for the service A2. Further, the copier C (304) creates a service characteristic list L ₃ (1005) for the service A1. Note that service A1, service A2, and service B1 in FIG. 2 correspond to service S1, service S2, and service S3 in step S701 of FIG. 7, respectively.

  In step S702, the copying machine obtains a service ID of a service to be executed next, that is, a service that must be performed first among unexecuted services, from the flow list in which the order of cooperation processing is described, and the SID ( Next).

At step S703, the copying machine acquires the service ID in all service characteristics list L _n created in step S701, the service characteristic list SID (Next) and match determined in step S702. Then, the copier stores and holds the available service group (available service group information) including the acquired service characteristic list in, for example, the RAM 103 or the hard disk 109.

  In step S703, the copying machine determines whether a service characteristic list exists in the available service group. If the copier determines that the service characteristic list does not exist in the available service group, there is no service that can be executed, so the process proceeds to S708, performs error processing, and ends the processing. On the other hand, if the copier determines that there is a service characteristic list in the available service group, the process advances to step S705 to determine whether there is one service characteristic list in the available service group.

  If the copier determines that there is only one service characteristic list in the available service group, the process can be requested only to the service (device) described in the service characteristic list, so the process proceeds to step S707. Request service (device) for processing. On the other hand, if the copier determines that there are two or more service characteristic lists in the available service group, the process advances to step S706.

At step S706, the copying machine, and all the service characteristics list L _n that exists in the available service group, and a constraint list, obtains the virtual distance d _n for all service characteristic list L _n. Details of the processing for obtaining the virtual distance d _n are shown in FIG. 11 described later.

Proceeding to step S707 following step S706, the copying machine selects the service characteristic list L _min corresponding to the shortest virtual distance from the virtual distances d _n for the service characteristic list L _n calculated in S706. Then, a copying machine, based on the information of the IP address, etc. listed in L _min, requests processing to the service (device) according to L _min.

  FIG. 11 is a flowchart illustrating an example of processing for obtaining a virtual distance. In step S1201, the copying machine sets p to 1 (that is, sets variable p to 1). In step S1202, the copying machine determines whether a constraint condition with a priority level p (value of p) exists in the constraint condition list. More specifically, the copier determines whether or not there is a constraint condition where the order attribute in the Priority tag is p when the constraint condition list is in the XML format as shown in FIG. judge.

  If the copying machine determines that there is a constraint condition in which the order attribute in the Priority tag is p, the process advances to step S1203. On the other hand, if the copier determines that there is no constraint condition with the order attribute in the Priority tag of p, the process proceeds to step S1210, assuming that processing for all priorities has been completed.

  In step S1203, the copying machine determines whether the priority p characteristic (constraint condition) has a higher value (ie, descending order) or a lower value (ie, ascending order). judge. For example, when the constraint condition is “price” per process of the service, and the priority is set in the constraint condition list to give priority to the lower price, this constraint condition is in ascending order. Further, when the constraint condition is “processing speed” per page and the constraint condition list or the like is set to give priority to the faster processing speed, the constraint condition is in descending order.

  Referring to the example of FIG. 6, in step S1203, the copier determines whether the compare attribute of the constraint condition where the order attribute of the Priority tag is p is “descending”. If the copier determines that the compare attribute of the constraint condition with the order attribute of the Priority tag being p is “descending”, the process advances to step S1206. On the other hand, if the copier determines that the compare attribute of the constraint tag with the order attribute of the Priority tag is not “descending” (that is, “ascending”), the process advances to step S1204.

In S1204, the copying machine has a value (that is, a charge value if the restriction condition is a charge) with a characteristic (constraint condition) corresponding to the priority p among all the service characteristic lists existing in the available service group. ) is the V _max the maximum of things. For example, taking the case where the priority p = 1, that is, the order attribute in FIG. 6 is “1”, the copier uses all the service characteristics in the available service group for the “charge” characteristics (constraints). The charge having the maximum value in the list is V _max .

The copier, for example, compares the values of the characteristics (constraint conditions) corresponding to the priority p of all the service characteristic lists, determines the one with the maximum value, and _sets it to V _max .

In S1205, the copying machine obtains a quotient value of properties (constraints) corresponding to the priority p of all service characteristics in the list L _n divided by V _max. That is, the copying machine normalizes the value of the characteristic (constraint condition) corresponding to the priority p in the all service characteristic list L _n in the interval [0, 1]. That is, the copying machine has the largest value among the characteristics (constraint conditions) corresponding to the priority p in the all service characteristic list L _n (that is, the highest priority order in the priority p). The lower order is set to 1, and the smaller the value, the higher the priority order.

Here, the processing of step S1204 and step S1205 will be described using more specific values. For example, it is assumed that there are three types of services with the same ID of 10 yen, 20 yen, and 100 yen per service, where the priority p is a restriction condition. In such a case, the copying machine sets V _max = 100 in step S1204. Subsequently, in step S1205, copier, finds the quotient obtained by dividing the 10,20,100 each V _max. That is, the copying machine obtains 10/100 = 0.1, 20/100 = 0.2, and 100/100 = 1. That is, the copying machine normalizes the charge value in the interval [0, 1]. As a result, the value of the charge related to the service with the lower priority becomes 1, and the value of the charge related to the service with the higher priority becomes smaller.

On the other hand, in S1206, the copying machine has a characteristic (constraint condition) corresponding to the priority p from all the service characteristic lists existing in the available service group, that is, if the constraint condition is a processing speed, The one with the smallest processing speed value is defined as V _min . For example, the copying machine compares the values of the characteristics (constraint conditions) corresponding to the priority p of all the service characteristic lists, determines the one with the smallest value, and sets it to V _min . For example, in the case where the priority p = 2, that is, the order attribute in FIG. 6 is “2”, the copier uses all the services in the available service group for the “processing speed” characteristic (constraint condition). Let V _{min be} the processing speed with the smallest value in the characteristic list.

The copier, for example, compares the values of the characteristics (constraint conditions) corresponding to the priority p of all the service characteristic lists, determines the one with the smallest value, and _sets it to _Vmin .

In S1207, the copying machine obtains a quotient value of properties (constraints) corresponding to the priority p of all service characteristics in the list L _n divided by V _min. That is, the copying machine normalizes the value of the characteristic (constraint condition) corresponding to the priority p in the all service characteristic list L _n in the interval [1, ∞]. That is, the copying machine has the smallest value among the characteristics (constraint conditions) corresponding to the priority p in the all service characteristic list L _n (that is, the highest priority order in the priority p). 1) is set to 1, and the higher the value, the higher the priority order.

In step S1208, the copying machine obtains the reciprocal of the quotient obtained in step S1207. That is, the copying machine normalizes the value of the characteristic (constraint condition) corresponding to the priority p in the all service characteristic list L _n in the interval [0, 1]. That is, the copying machine has the smallest value among the characteristics (constraint conditions) corresponding to the priority p in the entire service characteristic list L _n (that is, the priority order is the highest in the priority p). The lower order is set to 1, and the smaller the value, the higher the priority order.

Here, the processing from step S1206 to step S1208 is illustrated using more specific values. For example, it is assumed that there are three types of services with the same ID of 1 page, 2 pages, and 3 pages per second as the constraint condition of the priority level p is the processing speed. In such a case, the copying machine sets V _min = 1 in step S1206. Subsequently, in step S1207, copier, finds the quotient obtained by dividing the 2,4,5 respectively V _min. That is, the copying machine calculates 2/2 = 1, 4/2 = 2, and 5/2 = 2.5. That is, the copying machine normalizes the processing speed value in the interval [1, ∞]. In step S1208, the copying machine obtains the reciprocal of the quotient obtained in step S1207. That is, the copying machine obtains 1/1 = 1, 1/2 = 0.5, and 1 / 2.5 = 0.4. That is, the copying machine normalizes the processing speed in the interval [0, 1]. As a result, the value of the charge related to the service with the lower priority becomes 1, and the value of the charge related to the service with the higher priority becomes smaller.

  In step S1209, the copying machine increments the value of p by 1 and returns to step S1202. That is, in the loop processing from step S1202 to step S1209, the copier normalizes the values (normalized in the section [0, 1]) for all priority characteristics (constraint conditions) written in the constraint condition list ( Find the distance.

In step S1210, the copying machine determines the values normalized in the interval [0, 1] as described above for the entire service characteristic list L _n according to the weight of each characteristic (constraint condition) in the constraint condition list. Weight. Details of the weighting process are shown in FIG. Through the processing in step S1210, virtual distances (virtual distances) are obtained for all priority characteristics (constraint conditions).

Processing from step S1211 Step S1217 is a loop process for obtaining the virtual distance for service execution in each of the service from all service characteristics list L _n.

In step S1211, the copying machine selects a service characteristic list L _i that has not been selected from all the service characteristic lists L _n . In step S1212, copier, a virtual distance d _i service S _i to the service characteristics list L _i to 0. In step S1213, the copying machine sets p to 1 (that is, sets 1 to the variable p).

  In step S1214, the copying machine determines whether or not there is a characteristic (constraint condition) having a priority level p in the constraint condition list. The copying machine proceeds to step S1215 when it is determined that a characteristic (constraint condition) having a priority level p exists in the constraint condition list, and proceeds to step S1218 when it is determined that the characteristic does not exist.

In step S1215, the copying machine determines the characteristic value corresponding to the priority p (that is, the value normalized in the interval [0, 1] and weighted in step S1210 as described above) from the service characteristic list L _i. Take it out and let it be dp. In step S1216, copier, a plus dp to d _i and d _i. In step S1217, the copying machine increments the value of p by 1 and returns to step S1214.

In the processing from S1214 to S1216, the virtual distance d _i service S _i to the service characteristics list L _i is calculated.

In step S1218, the copier determines whether there is a service characteristic list L _i that has not been selected in step S1211 among all the service characteristic lists L _n . Copier, among all service characteristics list L _n, yet if it is determined that the service characteristics list L _i is not selected is present in step S1211, the flow returns to step S1211, if it is determined non-existent and, to end the process.

  FIG. 12 is a flowchart illustrating an example of the weighting process. Here, in the weighting process shown in FIG. 12, a larger weight is given to a constraint condition (characteristic) having a low priority. More specifically, the weight (value of the weight attribute) described in the constraint condition list is added to the constraint condition (characteristic). The value of the weight attribute in the constraint condition list is positive, and is a monotonically increasing value that increases as the priority is lower (as the order attribute value is larger).

  In step S1301, the copying machine sets p to 2 (that is, sets 2 to the variable p). In step S1302, the copying machine determines whether there is a constraint condition with a priority p (value of p) in the constraint condition list. If the copying machine determines that a characteristic (constraint condition) having a priority level p exists in the constraint condition list, the process advances to step S1303. If the copier determines that the characteristic does not exist, the process ends. Here, weighting processing is not performed for the constraint condition with the highest priority (that is, p is 1). This is because the virtual distance is used when the copier or the like selects the next service.

  In step S1303, the copying machine sets wp as the weight of the constraint condition of the priority p in the constraint condition list. That is, the copying machine acquires the value of the weight attribute of the constraint condition with the priority p in the constraint condition list and sets it in the variable p.

In step S1304, copier, the value (normalized value in the interval [0,1] as described above) of the characteristic (constraints) corresponding to the priority p of all service characteristics in the list L _n of wp Add the values. In step S1305, the copier increments the value of p by 1 and returns to step S1302.

  In the example shown in FIG. 12, the copying machine adds the weight (value of wp) to the value normalized in the interval [0, 1] as described above in step S1304. The value normalized by [0, 1] may be multiplied by a weight. In step S1304, the copying machine normalizes the weights, sets the weights to a certain ratio, and adds the values normalized in the interval [0, 1] as described above. Or you may make it multiply.

  In the example shown in FIG. 12, the copying machine does not perform the weighting process for the value of the highest priority constraint condition (characteristic), but for the value of the highest priority constraint condition (characteristic). Alternatively, weighting processing may be performed.

Even when there are a plurality of services providing the same function (for example, printing function) in the same device (same copying machine), the service characteristics list is different for each service. The virtual distance d _n can be obtained by, for example. Then, it is possible to request processing for an optimal service (that is, a service with a short virtual distance d _n ) and to quickly perform a series of linkage processing.

  Each service may communicate and exchange data and the like according to SOAP (Simple Object Access Protocol). For example, a service list, a flow list, and a constraint list are stored in the Body part of the SOAP so that data or the like is exchanged between devices or services, and control of services is performed according to SOAP. Good.

  By performing processing according to SOAP, not only devices or services connected to a LAN, but also data exchanges between devices or services connected via the Internet, such as a proxy server between devices or services. Can be done.

  However, when devices or services are connected via the Internet, the copier requests, for example, acquisition of a service list from a preset target device or service. Further, for example, the copying machine may request acquisition of a service list for a certain network range (within an IP address range).

  In addition, when the copying machine cannot exchange data (for example, a service list) using binary data, the data may be exchanged by encoding the data using Base 64 or the like. Further, the copying machine may improve security by using data encryption, electronic signature, or the like in communication according to SOAP.

  That is, the present embodiment is not limited to a local network, but can be applied to a global network (Internet). Although the present embodiment has been described using a copying machine, this does not limit the implementation of the present invention.

  As described above, according to the first embodiment, the copier can obtain the virtual distance of the service for performing the next process in the cooperation process. Therefore, the copying machine can request the next process for the service with the shortest virtual distance.

  In the first embodiment, an example is shown in which the copying machine obtains the virtual distance of the service for performing the following processing. In the following, the second embodiment shows an example in which a plurality of copying machines connected via a copying machine or a network obtains a virtual distance of a service for performing the subsequent processing. In the present embodiment, description of the same contents as in the first embodiment will be omitted.

  First, the copier (or service) obtains information (virtual distance list) of a list arranged in ascending order of virtual distances for services providing the same function. Here, the virtual distance list of the x-th service in the flow list is VDL (x).

In the obtained virtual distance list VDL (x), the copying machine requests the virtual distance list VDL (x + 1) in the execution of the next service in order from the service with the shortest virtual distance. For example, the virtual distance list in the execution of the next service created by the service having the i-th shortest virtual distance (copier associated with the service) in the virtual distance list VDL (x) is VDL _i (x + 1). As described above, each copying machine (each service) calculates the virtual distance list, so that the processing path with the shortest virtual distance for the entire series of processes finally becomes the optimum processing path.

  In this embodiment, it is assumed that the estimated number m and the prefetch number n are stored in, for example, the hard disk 109 of the copying machine so that the virtual distance estimation and prefetching are not performed without limit. Note that the value of the estimated number m and / or the prefetch number n is stored in the hard disk 109 or the like according to an instruction from the user using a touch screen or the like, for example. In addition, the copier passes the request for the virtual distance list and the estimated number and the value of the number of prefetches to the requested copier. The copier that has received the estimated number and the value of the prefetch number together with the request for obtaining the virtual distance list stores the estimated number and the value of the prefetch number in the hard disk 109 or the like. Further, the copying machine may change the value of the estimated number m and / or the prefetch number n stored in the hard disk 109 or the like in accordance with an instruction from the user using a touch screen or the like.

  The estimated number is a number for which a virtual distance list is obtained in the next service to be executed. More specifically, if there are 10 candidates (that is, services) in the virtual distance list and the estimated number is 3, the copier will start from the service with the short virtual distance in the virtual distance list. Select one service. Then, the copier requests the three services (or copiers corresponding to the service) to estimate the virtual distance of the next service (that is, create a virtual distance list). If the service in the virtual distance list is less than the estimated number m, the copier requests all the services in the virtual distance list to create a virtual distance list.

  Further, the number of prefetches is a number indicating how many steps (services) in the flow list the virtual distance list is calculated from the current process (service). If the process (service) in the flow list does not include the process (service) up to the number of prefetches, the copier (or system) obtains the virtual distance list until the last process (service) in the flow list.

  FIG. 13 is a diagram illustrating an example of the virtual distance list. The virtual distance list shown in FIG. 13 is an example of the virtual distance list of the x-th service in the flow list when the estimated number is 2 and the prefetch number is 3.

In the virtual distance list VDL (x), the copier performs the estimation of the virtual distance of the next service (that is, the creation of the virtual distance list) for two services (estimated number) from the services with the short virtual distance. Make a request. Each service (or copier) that receives this request creates a virtual distance list VDL ₁ (x + 1) or a virtual distance list VDL ₂ (x + 1). For example, when a service (or copying machine) creates a virtual distance list in response to a request, the service (or copying machine) transmits the created virtual distance list to the request source.

In addition, the copying machine estimates the virtual distance of the next service (that is, the virtual distance list in the virtual distance list) with respect to two services (estimated number) of the virtual distance list VDL ₁ (x + 1) having the short virtual distance. Request). Each service (or copying machine) that has received this request creates a virtual distance list VDL ₁ (x + 2) or a virtual distance list VDL ₂ (x + 2). Since the prefetch number is 3, the service (or copier) does not continue the prefetch process any more. Similarly, the service (or copier) does not process the estimated number exceeding the limit.

As shown in FIG. 13, in the virtual distance list VDL ₁ (x + 1) 1601, information related to services (or information related to service candidates to be executed next) 1602 and 1603 arranged in ascending order of the virtual distance. Is included. In addition, the service information 1602 includes service information 1604 for uniquely identifying the service and a virtual distance 1605 to the service.

In FIG. 13, for example, there are a plurality of VDL ₁ (x + 2). However, since they are specified by an ordered set from the first virtual distance list, the same name may exist. For example, VDL ₁ (x + 2) 1606 is identified by [VDL (x), VDL ₁ (x + 1), VDL ₁ (x + 2)], and VDL ₁ (x + 2) 1607 is [VDL (x), VDL ₂ (x + 1). ), VDL ₁ (x + 2)]. Such an ordered set of virtual distance lists is called a linked virtual distance list.

  FIG. 14 is a flowchart illustrating an example of a process for obtaining a route for the cooperation process. In step S1401, the copying machine obtains a linked virtual distance list. Details of the process for obtaining the linked virtual distance list are shown in FIG.

  In step S1402, the copying machine determines the route with the shortest virtual distance in the combination of services as the route for cooperation processing.

FIG. 15 is a flowchart illustrating an example of processing for obtaining a linked virtual distance list. Note that the flowchart of FIG. 15 shows an example of obtaining a linked virtual distance list of the xth service in the flow list when the estimated number is m and the prefetch number is n. In the following, the order of the flow list of services at the time the copying machine executes the first seek concatenated virtual distance list processing and x _0.

In step S1501, the copying machine determines whether x satisfies x> x ₀ + n−1. The processing in step S1501 is processing for determining whether or not the copying machine has performed processing exceeding the range of the number of prefetches. If the copying machine determines that x satisfies x> x ₀ + n−1, the copying machine ends the process. If the copying machine determines that x does not satisfy x> x ₀ + n−1, the process proceeds to step S1502.

  In step S1502, the copying machine determines whether the x-th process (service) exists in the flow list. If the copying machine determines that the x-th process exists in the flow list, the process advances to step S1503. If the copying machine determines that there is no x-th process, the process ends.

  In step S1503, the copying machine obtains the virtual distance list VDL (x) of the x-th process (service) in the flow list. Note that the processing in step S1503 is equivalent to the processing in the flowcharts shown in FIGS. 7, 11, and 12 of the first embodiment.

  In step S1504, the copying machine sets i to 1 (that is, sets variable i to 1). In step S1505, the copying machine determines whether i satisfies i> m. That is, in step S1505, the copying machine determines whether i exceeds the estimated number m, and performs control so that processing does not exceed the estimated number.

  If it is determined that i satisfies i> m, the copying machine proceeds to step S1510. If the copying machine determines that i does not satisfy i> m, the copying machine proceeds to step S1506. In step S1506, the copier estimates the virtual distance for the x + 1th process (service) in the flow list to the execution destination of the service having the i-th virtual distance that is the shortest in the virtual distance list VDL (x) (that is, Request creation of a virtual distance list. Upon receiving this request, the service (or copier) creates a virtual distance list for the (x + 1) -th process (service) in the flow list, and transmits the created virtual distance list to the request source.

For example, when the prefetch number n is exceeded, the virtual distance list VDL _i (x + 1) (or the requested virtual distance list) is not returned (transmitted) from the estimated service (or copier). Shall not be).

In step S1507, the copier determines whether a virtual distance list (or linked virtual distance list) VDL _i (x + 1) is returned from the requested service (or copier). If the copier determines that the virtual distance list VDL _i (x + 1) is returned from the requested service (or copier), the process proceeds to step S1508. If the copier determines that it is not returned, the process proceeds to step S1510.

In step S1508, the copier detects the virtual distance list (or linked virtual distance list) VDL _i (x + 1) returned from the requested service (or copier) in step S1506 and the VDL (x) obtained in step S1503. The connection process is performed. In step S1508, the copying machine creates a linked virtual distance list as described above. In step S1509, the copying machine increments the value of i by 1 and returns to step S1505. That is, the copying machine executes processing for the service with the next shortest virtual distance.

  In step S1510, the copying machine deletes information related to the i-th and subsequent services in the linked virtual distance list (or virtual distance list). That is, in step S1510, the copying machine deletes information (service information and virtual distance) related to unnecessary services such as exceeding the estimated number.

  In step S1511, the copying machine determines whether the linked virtual distance list (or virtual distance list) is empty. If the copier determines that the linked virtual distance list (or virtual distance list) is empty, the process ends. If the copier determines that it is not empty, the process advances to step S1512. That is, the copying machine ends the process when there is no linked virtual distance list (or virtual distance list) to be processed. In step S1512, the copying machine returns the requested linked virtual distance list (or virtual distance list) to the request source.

  By passing the finally obtained route (concatenated virtual distance list) between the services (or copiers) together with the constraint condition list, the flow list, etc., each service (or each copier) follows the route. The service that performs the process is determined and the process is requested. The service (or copier) obtains the optimum route again at that time when there is no route obtained in advance.

  The service (or the copying machine) may execute the next prefetching process again after the processing for the number of prefetching is completed for the prefetching for obtaining the optimum route. The service (or copier) performs the next prefetch process again after processing for the number of prefetches, that is, because the process is divided, the optimal route without taking time for the prefetch process. Can be requested.

  Also, the service (or copier) may always obtain an optimum route while executing the prefetching process sequentially before the processing for the number of prefetching is completed. Such a process may be performed every time or may be a number of times less than or equal to the number of prefetches. The service (or copier) is more optimal for prefetching because it performs sequential prefetching processing before the processing for the number of prefetching is completed, that is, it searches for the optimum route sequentially. A simple route.

  In addition, each of the embodiments described above may be used for searching for an optimum alternative route when there is an infeasible service. The service (or copying machine) passes the linked virtual distance list to the device (copying machine) that requests the provision of the function (service). Therefore, even if there is an infeasible service in the middle of the route, for example, a service (copying machine) that has requested a non-executable service uses the linked virtual distance list to determine the next virtual distance. Seeking a short service. That is, for example, a service (copying machine) that has requested a service that cannot be executed can obtain an alternative route using the linked virtual distance list, and can request a service that provides the same function. Note that, for example, a service (copier) is an infeasible service, such as when information indicating that the service has been provided does not return from the requested service (copier) after a certain period of time. Judge that there is.

  In the present embodiment, the copying machine has both the number of pre-reads and the estimated number and performs processing. However, only one of the information may be processed and processing may be performed. .

  As described above, according to each embodiment, when there are a plurality of identical services, the copier (or service) can perform the cooperation process on the optimum route according to the conditions required by the user.

  The preferred embodiments of the present invention have been described in detail above, but the present invention is not limited to such specific embodiments, and various modifications can be made within the scope of the gist of the present invention described in the claims.・ Change is possible.

1 is a diagram illustrating an example of a configuration of a copying machine. 1 is a diagram illustrating an example of a service configuration of copiers connected to each other via a network. FIG. It is a figure which shows an example of a service list. It is a figure which shows an example of the output screen which concerns on the service list displayed on the touch screen. It is a figure which shows an example of a flow list. It is a figure which shows an example of a constraint condition list. It is a flowchart which shows an example of the process which determines the optimal service which should be performed next in a series of cooperation processes, and requests provision of a service. It is a figure which shows an example of the service list list described in the XML format. It is a figure which shows an example of a service characteristic list. It is a figure which shows an example of the process in step S701 of FIG. It is a flowchart which shows an example of the process which calculates | requires virtual distance. It is a flowchart which shows an example of a weighting process. It is a figure which shows an example of a virtual distance list | wrist. It is a flowchart which shows an example of the process which calculates | requires the path | route of a cooperation process. It is a flowchart which shows an example of the process which calculates | requires a connection virtual distance list | wrist.

Explanation of symbols

102 CPU
103 RAM
104 ROM
105 Input Unit 106 Output Unit 107 Network Interface 108 Disk Interface 109 Hard Disk 110 Unit Control Unit

Claims (13)

An information processing apparatus that communicates with a plurality of devices that provide functions as services,
Service characteristic information acquisition means for acquiring service characteristic information indicating service characteristics;
Flow information acquisition means for acquiring flow information indicating the execution order of services;
A virtual distance calculating means for calculating a virtual distance when the service cooperates according to the service characteristic information related to the available service and the flow information;
Processing request means for requesting processing to a service according to the virtual distance calculated by the virtual distance calculation means;
An information processing apparatus comprising:   The information processing apparatus according to claim 1, wherein the virtual distance calculation unit calculates a value indicating a priority when requesting a service to be processed as a virtual distance of a service related to the cooperation process.   The information processing apparatus according to claim 1, wherein the virtual distance calculation unit calculates the virtual distance by performing weighting according to characteristics of each service.   The information processing apparatus according to any one of claims 1 to 3, further comprising virtual distance information creating means for creating virtual distance information in which services having the same function are arranged in ascending order of the virtual distance.   The virtual distance information creation requesting unit that requests the service or a device related to the service to create virtual distance information related to the service in the next execution order of the cooperation processing in the order of the virtual distance information. Item 5. The information processing apparatus according to Item 4.   The information processing apparatus according to claim 4, further comprising a linked virtual distance information creating unit that creates linked virtual distance information that is a set of the virtual distance information with the execution order of the linkage processing.   The information processing apparatus according to claim 5, further comprising: a request number specifying unit that specifies a service requesting creation of the virtual distance information or a number of devices related to the service.   The information processing apparatus according to claim 6, further comprising estimated number designation means for designating a number of the virtual distance information included in the connected virtual distance information.   The process requesting unit requests a service having the next shortest virtual distance according to the virtual distance calculated by the virtual distance calculating unit when there is a service that cannot be executed in the cooperation process. The information processing apparatus according to any one of claims 1 to 8. It further has a constraint condition information acquisition means for acquiring constraint condition information indicating a constraint condition related to the characteristic,
The virtual distance calculating means calculates a virtual distance when the service is linked according to the service characteristic information related to the available service, the flow information, and the constraint condition information. The information processing apparatus according to any one of claims 1 to 9. A cooperation processing method in an information processing apparatus that communicates with a plurality of devices that provide a function as a service,
Service characteristic information acquisition step for acquiring service characteristic information indicating the characteristics of the service;
A flow information acquisition step for acquiring flow information indicating a service execution order;
A virtual distance calculating step of calculating a virtual distance when the services cooperate in accordance with the service characteristic information relating to an available service and the flow information;
A process requesting step for requesting a service to process according to the virtual distance calculated by the virtual distance calculating means;
The cooperation processing method characterized by having.   A cooperation processing program for causing a computer to execute the cooperation processing method according to claim 11.   The computer-readable recording medium which recorded the cooperation processing program of Claim 12.

Images