| Patent application number | Description | Published |
|---|
| 20100174686 | Generating Equivalence Classes and Rules for Associating Content with Document Identifiers - A system of reducing the possibility of crawling duplicate document identifiers partitions a plurality of document identifiers into multiple clusters, each cluster having a cluster name and a set of document parameters. The system generates an equivalence rule for each cluster of document identifiers, the rule specifying which document parameters associated with the cluster are content-relevant. Next, the system groups each cluster of document identifiers into one or more equivalence classes in accordance with its associated equivalence rule, each equivalence class including one or more document identifiers that correspond to a document content and having a representative document identifier identifying the document content. | 07-08-2010 |
| 20100191856 | REDUCING NETWORK CONNECTION LATENCY - Methods, systems, and apparatus, including medium-encoded computer program products, for decreasing latency perceived by a user in retrieving data from a data server. A user-initiated interaction with a user interface can be detected and a user-generated request to retrieve data automatically predicted, based at least in part on the user-initiated interaction. Resolution of a domain name into a network address can be initiated, based on the predicted user-generated request to retrieve data, prior to receiving a user-initiated submission of the user-generated request to retrieve data. In certain instances, a network communication synchronization sequence with a data server associated with the predicted user-generated request to retrieve data can be initiated prior to receiving a user-initiated submission of the user-generated request to retrieve data. | 07-29-2010 |
| Patent application number | Description | Published |
|---|
| 20110063972 | Duplicate traffic avoidance in a point to multi-point network - Provided is a method for avoiding traffic duplication in a point to multi-point network, the method including monitoring a status of first interconnection links in a first data path from a source to a destination, the first data path including an ingress node, an egress node, and one or more intermediate nodes. The method further includes establishing a second data path if a link of the first interconnecting links is determined to be an inoperable link, the second data path including the ingress node, the egress node, at least one of the one or more intermediate nodes and second interconnecting links, the second interconnecting links including new interconnecting links and a subset of the first interconnecting links, the subset not including the inoperable link in the first interconnecting links. | 03-17-2011 |
| 20110063973 | Fast upstream source failure detection - One example embodiment of the method includes receiving first control packets, by a first node, from a source node. The first control packets indicate the status of the source node. Whether the source node is operational and if a connection path between the first node and the source node is operational is determined based on the received first control packets. The method further includes sending a second control packet to a downstream node if the source node is non-operational, or the connection is non-operational. The second control packet includes at least one value indicating the source node is unreliable. | 03-17-2011 |
| 20120026866 | METHOD AND APPARATUS FOR RAPID SWITCHOVER FROM PRIMARY TO STANDBY MULTICAST TREES - A capability is provided for switching between primary and standby multicast trees on a network egress node of a multicast network. The network egress node includes a first MPLS LABEL Record including a first tree identifier of the first multicast tree, a second MPLS LABEL Record including a second tree identifier of the second multicast tree, and a MULTICAST Record including a plurality of primary tree identifiers and a plurality of standby tree identifiers. The MPLS LABEL Records include parameters, respectively, where the values of the parameters are indicative of respective packet processing rules to be applied for determining whether to accept or discard packets. When the parameter of an MPLS LABEL Record is set to a first value, a determination as to whether to accept or discard a packet received via the associated multicast tree is performed by comparing the tree identifier of the MPLS LABEL Record only to primary tree identifiers of the MULTICAST Record. When the parameter of an MPLS LABEL Record is set to a second value, a determination as to whether to accept or discard a packet received via the associated multicast tree is performed by comparing the tree identifier of the MPLS LABEL Record to primary tree identifiers of the MULTICAST Record or standby tree identifiers of the MULTICAST Record. | 02-02-2012 |
| 20120033667 | METHOD AND APPARATUS FOR PERFORMING MULTICAST TRACES IN MPLS NETWORKS - A multicast path trace capability is provided for tracing a multicast path from a root node to a leaf node where the trace originates at the leaf node. The leaf node sends a multicast trace request to the root node. The root node receives the multicast trace request and initiates a path trace request for collecting path information associated with the multicast path. The root node receives at least one path trace response, in response to the path trace request, which includes path information associated with the multicast path. The root node sends a multicast trace response, including the collected path information, to the leaf node. The leaf node receives the multicast trace response including the path information. The leaf node derives end-to-end path information for the multicast path using the path information received in the multicast trace response. The multicast path trace capability may be used for tracing an MPLS multicast path (e.g., a P2MP LSP) from a root node to a leaf node of the MPLS multicast tree. The multicast path trace capability may be used for tracing multicast paths in other types of multicast networks. | 02-09-2012 |
| Patent application number | Description | Published |
|---|
| 20120005467 | Streaming Virtual Machine Boot Services Over a Network - Embodiments of the invention are directed to streaming virtual machine boot services over a network. An aspect of the invention includes booting a first virtual machine and recording data and metadata from a virtual machine boot image into a virtual machine boot file. The data and metadata are accessed in the process of booting the first virtual machine. The virtual machine boot image has setup information of the virtual machine type of the first virtual machine. The virtual machine boot file is configured for the virtual machine type of the first virtual machine. A descriptor is added to metadata of the virtual machine boot image, which references a location of the virtual machine boot file for the virtual machine type of the first virtual machine. When subsequently booting a second virtual machine of the same type of virtual machine as the first virtual machine, data are streamed from the virtual machine boot file to a virtual machine monitor of a second virtual machine without the need to stream data from the virtual machine boot image. | 01-05-2012 |
| 20120042033 | MIGRATING VIRTUAL MACHINES ACROSS NETWORK SEPARATED DATA CENTERS - Embodiments of the present invention provide an approach for migrating virtual machines across network (e.g., WAN) separated data centers (e.g., storage clouds). Specifically, under embodiments of the present invention, a first storage system associated with a first data center is synchronized with a second storage system associated with a second data center via a storage system link. Then, a minimal state of a virtual machine is migrated from a first computer in the first data center to a second computer in the second data center via a WAN link. Using the minimal state, the virtual machine is stored in the second computer. Thereafter, the storage system link is terminated. In addition, as updated pages are received in memory of the first computer, they are migrated to the second computer via the WAN link. Once this migration is complete, the WAN link can be terminated. Therefore, embodiments of the present invention provide at least two forms of synchronization: computational synchronization and storage synchronization. | 02-16-2012 |
| 20120047394 | HIGH-AVAILABILITY COMPUTER CLUSTER WITH FAILOVER SUPPORT BASED ON A RESOURCE MAP - Embodiments of the invention relate to handling failures in a cluster of computer resources. The resources are represented as nodes in a dependency graph in which some nodes are articulation points and the removal of any articulation point due to a resource failure results in a disconnected graph. The embodiments perform a failover when a resource corresponding to an articulation point fails. The failover is to a local resource if the failed resource does not affect all local resources. The failover is to a remote resource if no local resource can meet all resource requirements of the failed resource, and to a remote resource running in a degraded mode if the remote resource cannot meet all of the requirements. | 02-23-2012 |
| Patent application number | Description | Published |
|---|
| 20100185503 | Product Warranties Having a Residual Value - The present disclosure is directed to product warranties having a residual value and a potential rebate based on the residual value. The residual value can thus be inversely related to the number of claims filed against the warranty. | 07-22-2010 |
| 20110202382 | WORKFORCE PLANNING - Systems, methods, and other embodiments associated with workforce planning. One example method includes receiving a project data associated with a project opportunity. The project data includes a probability data. The probability data describes the likelihood of a project opportunity being selected. The project data includes a workforce demand. The example method may also include establishing an objective function that is based, at least in part, on the project data, and a set of constraints. The objective function concerns a workforce allocation plan. The example method may also include minimizing a workforce cost by solving the objective function in light of the set of constraints. Solving the objective function includes optimizing a tradeoff between labor utilization and project demand fulfillment. The example method may also include providing the workforce allocation plan. | 08-18-2011 |
| 20110208557 | Supply and Demand Consolidation in Employee Resource Planning - A method of employee resource planning includes consolidating and defining a demand for employee resources needed to accomplish a potential project in terms of a plurality of jobs and a supply of employee resources in terms of a plurality of employees, each job and each employee having a plurality of job attributes uniformly categorized into indices. Employees in the supply are mapped to corresponding jobs in the demand according to the job attributes. | 08-25-2011 |
| 20110231215 | OPTIMIZATION OF A RESOURCE MATCHING MODEL BY MAPPING A MODEL TO A BIPARTITE GRAPH - Example embodiments disclosed herein relate to a mechanism for optimizing a resource matching model. In particular, a mechanism is provided to access, in a resource matching system, input data for a mixed integer programming (MIP) model, which may include resource data describing resources and demand data describing corresponding demand instances. Mechanisms are also provided to convert the MIP model to a binary integer programming (BIP) model by redefining the input data to unary data and to map the BIP model to a bipartite graph using the unary data. The resulting bipartite graph may include a number of nodes including a first set corresponding to the resources and a second set corresponding to the demand instances, and a number of edges corresponding to decision variables of the BIP model, each edge representing a potential allocation of a resource in the first set to a demand instance in the second set. | 09-22-2011 |
