Abstract: A method includes: receiving, by a processor set, a request for a web-based service; generating, by the processor set, a feature vector including values based on parameters of the request; generating, by the processor set, an endpoint selection vector including plural probabilities corresponding to plural endpoints, wherein the endpoint selection vector is generated using the feature vector with a machine learning model; selecting, by the processor set, one of the plural endpoints based on the plural probabilities; and invoking, by the processor set, the selected endpoint.

Abstract: A computer-implemented method for determining resources utilized by a service request in a data processing system. The method includes determining monitored relationship types from monitoring data, determining relationship domains, determining intra-domain relationships from relationships that are internal to the relationship domains and determining cross-domain relationships from the intra-domain relationships that are linked between pairs of the relationship domains, and determining resources utilized by the service request from the intra-domain and cross-domain relationships. The domains are derived from one of the relationship types that is monitored by a single monitoring application.

Abstract: Techniques are presented for managing execution of processes on a data processing system The data processing system comprises process instances that are each an execution of a corresponding process. Each process instance comprises activity instances. Business impacts are determined for the process instances, the activity instances, or both. Order of execution of the activity instances is managed by allocating resources to activity instances in order to achieve an objective defined in terms of the business impacts. In another embodiment, requests are received for the execution of the processes. For a given request, one or more of the operations of assigning, updating, aggregating, and weighting of first business impacts associated with the given request are performed to create second business impacts associated with the given request. Additionally, requests can be modified.

Abstract: A method to organize nodes into an overlay network and to disseminate multicast messages within this overlay both through an efficient tree embedded in the overlay and through gossips exchanged between overlay neighbors. Regardless of the size of the system, this invention incurs a constant low overhead on each node.

Abstract: A computer-implemented method for determining resources utilized by a service request in a data processing system. The method includes determining monitored relationship types from monitoring data, determining relationship domains, determining intra-domain relationships from relationships that are internal to the relationship domains and determining cross-domain relationships from the intra-domain relationships that are linked between pairs of the relationship domains, and determining resources utilized by the service request from the intra-domain and cross-domain relationships. The domains are derived from one of the relationship types that is monitored by a single monitoring application.

Abstract: A method to organize nodes into an overlay network and to disseminate multicast messages within this overlay both through an efficient tree embedded in the overlay and through gossips exchanged between overlay neighbors. Regardless of the size of the system, this invention incurs a constant low overhead on each node.

Abstract: A method to organize nodes into an overlay network and to disseminate multicast messages within this overlay both through an efficient tree embedded in the overlay and through gossips exchanged between overlay neighbors. Regardless of the size of the system, this invention incurs a constant low overhead on each node.

Abstract: A method to organize nodes into an overlay network and to disseminate multicast messages within this overlay both through an efficient tree embedded in the overlay and through gossips exchanged between overlay neighbors. Regardless of the size of the system, this invention incurs a constant low overhead on each node.

Abstract: A method and system for adjudicating measurement data in real time and re-adjudicating a segment of an input measurement data stream upon submission of a new adjudication instruction in a service level evaluation system. An adjudication instruction associated with a service level is received. Measurement data including a first measurement data point is received. The received adjudication instruction is applied in real time to the first measurement data point to generate a first adjudicated measurement data point. A service level is evaluated based on the first adjudicated measurement data point. To re-adjudicate the data stream segment, a new adjudication instruction is received and the segment is identified. The input data stream's adjudication is suspended and the stream is queued into storage. The segment of measurement data is retrieved and re-adjudicated by applying the new adjudication instruction. The input data stream's adjudication is resumed afterwards from the queued input stream.

Abstract: The present invention relates to the problem of scheduling work for employees and/or other resources in a help desk or similar environment. The employees have different levels of training and availabilities. The jobs, which occur as a result of dynamically occurring events, consist of multiple tasks ordered by chain precedence. Each job and/or task carries with it a penalty which is a step function of the time taken to complete it, the deadlines and penalties having been negotiated as part of one or more service level agreement contracts. The goal is to minimize the total amount of penalties paid. The invention consists of a pair of heuristic schemes for this difficult scheduling problem, one greedy and one randomized. The greedy scheme is used to provide a quick initial solution, while the greedy and randomized schemes are combined in order to think more deeply about particular problem instances.

Abstract: A method and system for adjudicating measurement data in real time and re-adjudicating a segment of an input measurement data stream upon submission of a new adjudication instruction in a service level evaluation system. An adjudication instruction associated with a service level is received. Measurement data including a first measurement data point is received. The received adjudication instruction is applied in real time to the first measurement data point to generate a first adjudicated measurement data point. A service level is evaluated based on the first adjudicated measurement data point. To re-adjudicate the data stream segment, a new adjudication instruction is received and the segment is identified. The input data stream's adjudication is suspended and the stream is queued into storage. The segment of measurement data is retrieved and re-adjudicated by applying the new adjudication instruction. The input data stream's adjudication is resumed afterwards from the queued input stream.

Abstract: A method and system for adjudicating measurement data in real time and re-adjudicating a segment of an input measurement data stream upon submission of a new adjudication instruction in a service level evaluation system. An adjudication instruction associated with a service level is received. Measurement data including a first measurement data point is received. The received adjudication instruction is applied in real time to the first measurement data point to generate a first adjudicated measurement data point. A service level is evaluated based on the first adjudicated measurement data point. To re-adjudicate the data stream segment, a new adjudication instruction is received and the segment is identified. The input data stream's adjudication is suspended and the stream is queued into storage. The segment of measurement data is retrieved and re-adjudicated by applying the new adjudication instruction. The input data stream's adjudication is resumed afterwards from the queued input stream.

Abstract: The present invention relates to the problem of scheduling work for employees and/or other resources in a help desk or similar environment. The employees have different levels of training and availabilities. The jobs, which occur as a result of dynamically occurring events, consist of multiple tasks ordered by chain precedence. Each job and/or task carries with it a penalty which is a step function of the time taken to complete it, the deadlines and penalties having been negotiated as part of one or more service level agreement contracts. The goal is to minimize the total amount of penalties paid. The invention consists of a pair of heuristic schemes for this difficult scheduling problem, one greedy and one randomized. The greedy scheme is used to provide a quick initial solution, while the greedy and randomized schemes are combined in order to think more deeply about particular problem instances.

Abstract: A method to organize nodes into an overlay network and to disseminate multicast messages within this overlay both through an efficient tree embedded in the overlay and through gossips exchanged between overlay neighbors. Regardless of the size of the system, this invention incurs a constant low overhead on each node.

Abstract: A computer-implemented method for determining resources utilized by a service request in a data processing system. The method includes determining monitored relationship types from monitoring data, determining relationship domains, determining intra-domain relationships from relationships that are internal to the relationship domains and determining cross-domain relationships from the intra-domain relationships that are linked between pairs of the relationship domains, and determining resources utilized by the service request from the intra-domain and cross-domain relationships. The domains are derived from one of the relationship types that is monitored by a single monitoring application.

Abstract: A method to organize nodes into an overlay network and to disseminate multicast messages within this overlay both through an efficient tree embedded in the overlay and through gossips exchanged between overlay neighbors. Regardless of the size of the system, this invention incurs a constant low overhead on each node.

Abstract: Techniques are presented for managing execution of processes on a data processing system The data processing system comprises process instances that are each an execution of a corresponding process. Each process instance comprises activity instances. Business impacts are determined for the process instances, the activity instances, or both. Order of execution of the activity instances is managed by allocating resources to activity instances in order to achieve an objective defined in terms of the business impacts. In another embodiment, requests are received for the execution of the processes. For a given request, one or more of the operations of assigning, updating, aggregating, and weighting of first business impacts associated with the given request are performed to create second business impacts associated with the given request. Additionally, requests can be modified.

Abstract: A method and system for adjudicating measurement data in real time and re-adjudicating a segment of an input measurement data stream upon submission of a new adjudication instruction in a service level evaluation system. An adjudication instruction associated with a service level is received. Measurement data including a first measurement data point is received. The received adjudication instruction is applied in real time to the first measurement data point to generate a first adjudicated measurement data point. A service level is evaluated based on the first adjudicated measurement data point. To re-adjudicate the data stream segment, a new adjudication instruction is received and the segment is identified. The input data stream's adjudication is suspended and the stream is queued into storage. The segment of measurement data is retrieved and re-adjudicated by applying the new adjudication instruction. The input data stream's adjudication is resumed afterwards from the queued input stream.

Abstract: One or more SLA-specified service-level monitors and/or one or more provider-owned service-level management monitors are used by the invention to monitor one or more quality measures of one or more QoS-assured service systems and to generate one or more service-level monitoring events when the monitored system does not conform to the respective quality measures. The invention includes a cross-SLA event manager that receives the monitoring events and determines which one or more SLA contracts are affected by the events. Then one or more SLA management objects (SMOs) track the SLA-specific events generated by the event manager according to each of the respective SLA contracts. The SMOs also determine how to allocate/deallocate/configure SLA management resources and/or to determine the effect of these changes on the service system operation to assure the contracted quality of service.

Abstract: Topically relevant objects in an object database are first identified using any generally known methods to obtain a set of topically relevant objects (topically relevant set). Parents, and in alternative embodiments other ancestors, of one or more of the topically relevant objects are identified according to directional structural relationships that the parents have with respect to the topically relevant objects. These objects form a set of structurally relevant objects (structurally relevant set). In some embodiments, the user query identifies one or more of these structural relationships. The topically relevant objects are then organized under one or more of their respective parents to form a hierarchy level of both (topically relevant and structurally relevant) sets of objects. In some preferred embodiments, the process can iterate to create more than one hierarchy level.