The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jun. 11, 2013

Filed:

Jul. 27, 2011
Applicants:

Gueyoung Jung, Rochester, NY (US);

Hua Liu, Fairport, NY (US);

Ramses V. Morales, Rochester, NY (US);

Inventors:

Gueyoung Jung, Rochester, NY (US);

Hua Liu, Fairport, NY (US);

Ramses V. Morales, Rochester, NY (US);

Assignee:

Xerox Corporation, Norwalk, CT (US);

Attorney:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06Q 40/00 (2012.01);
U.S. Cl.
CPC ...
Abstract

A service workflow including ordered services is received, and a heuristic utility value is calculated for each service. A best node having a smallest heuristic utility value for a service is selected, and a best node identifier is placed in a node list. If the best node includes a parallel sub-workflow, potential next nodes are identified by generating potential next nodes from a data center that can perform a service associated with the best node with a minimum run-time value. Otherwise, potential next nodes are generated based on a data center associated with the service. A heuristic utility value is determined for each potential next node, and a new best node is selected based on the heuristic utility values. The identifying, determining, and selecting operations are repeated until the best node contains only the last ordered service. Data centers for each ordered service are identified based on the best node.


Find Patent Forward Citations

Loading…