Abstract: A method, a system and a computer program product for resolving conflicts between data for database integration. Data is integrated from first and second data sources to produce integrated data, and the presence of a conflict is determined between data from the first data source and data from the second data source, where one or more sets of prioritized policies for resolving conflicts is associated with data of the first and second data sources. A policy is selected from the set of prioritized policies associated with the conflicted data, where the selected policy is appropriate to resolve the conflict and includes the greatest priority. The selected policy is applied to resolve the conflict and to produce a resulting data value for the integrated data.

Abstract: Methods and protocols coordinate enforcement of application traffic shaping limits within clusters of middleware appliance information handling systems (MA IHSs). The protocols dynamically set the local traffic shaping requirements at each entry point of an MA IHS. Each MA IHS receives from other MA IHSs runtime statistics containing local shaping requirements and rates of requests. The method uses runtime statistics to measure performance against specified traffic shaping goals, and based on this comparison uses unique protocols to dynamically adjust the local shaping requirements in each MA IHS. The method may eliminate the need to statistically bind service domains to particular MA IHSs. Additional MA IHSs activate and/or deactivate service domains to accommodate service domain (server farm) CPU resource demands.

Abstract: Methods and protocols coordinate enforcement of application traffic shaping limits within clusters of middleware appliance information handling systems (MA IHSs). The protocols dynamically set the local traffic shaping requirements at each entry point of an MA IHS. Each MA IHS receives from other MA IHSs runtime statistics containing local shaping requirements and rates of requests. The method uses runtime statistics to measure performance against specified traffic shaping goals, and based on this comparison uses unique protocols to dynamically adjust the local shaping requirements in each MA IHS. The method may eliminate the need to statistically bind service domains to particular MA IHSs. Additional MA IHSs activate and/or deactivate service domains to accommodate service domain (server farm) CPU resource demands.

Abstract: A method, a system and a computer program product for resolving conflicts between data for database integration. Data is integrated from first and second data sources to produce integrated data, and the presence of a conflict is determined between data from the first data source and data from the second data source, where one or more sets of prioritized policies for resolving conflicts is associated with data of the first and second data sources. A policy is selected from the set of prioritized policies associated with the conflicted data, where the selected policy is appropriate to resolve the conflict and includes the greatest priority. The selected policy is applied to resolve the conflict and to produce a resulting data value for the integrated data.

Abstract: In a method and system for creating a federation of a plurality of enterprise service buses (ESBs), a plurality of ESB nodes provide connectivity to one or more services. According to a protocol, at least a portion of the ESB nodes transmit policy-based service advertisement messages to other ESB nodes, wherein the policy-based service advertisement messages include service state information. In response to receiving the policy-based service advertisement messages, each of the ESB nodes stores the service state information received from other ESB nodes in respective distributed registries to create a local view of routable service endpoints in the federation. Each of the ESB nodes then uses its respective distributed registry to make routing decisions when routing service requests.

Abstract: In a method and system for creating an interconnection between autonomous enterprise service buses (ESB) federations, each one of the ESB federations comprise at least one ESB deployment, which further include a plurality of ESB nodes that provide connectivity to one or more services. According to a protocol, a first ESB node is designated in each of the ESB federations as a boundary node that is responsible for establishing and maintaining an interconnection between at least two of the ESB federations. Advertisement messages are transmitted between the boundary nodes that include routing information. In response to receiving the advertisement messages, each of the boundary nodes store the routing information received from other boundary nodes in respective distributed registries to create a local view of routable service endpoints in the federation. Each of the boundary nodes then use the respective distributed registries to make routing decisions when routing service requests.

Abstract: In a method and system for creating a federation of a plurality of enterprise service buses (ESBs), a plurality of ESB nodes provide connectivity to one or more services. According to a protocol, at least a portion of the ESB nodes transmit policy-based service advertisement messages to other ESB nodes, wherein the policy-based service advertisement messages include service state information. In response to receiving the policy-based service advertisement messages, each of the ESB nodes stores the service state information received from other ESB nodes in respective distributed registries to create a local view of routable service endpoints in the federation. Each of the ESB nodes then uses its respective distributed registry to make routing decisions when routing service requests.

Abstract: Methods and systems for controlling scheduling in a packet switching node in a network are provided which enable the scheduling of packets from different sources in an earliest deadline first order. The packets are assigned timestamp deadlines and placed in input queues. The timestamps are determined according to maximum delay or minimum throughput quality of service requirements specified for the packets. The packets are scheduled in the earliest deadline first order in an output packet store. The packet closest to its timestamp deadline is selected from the output packet store by using an index.

Abstract: Methods and systems for controlling scheduling in a packet switching node in a network are provided which enable the scheduling of packets from different sources in an earliest deadline first order. The packets are assigned timestamp deadlines and placed in input queues. The timestamps are determined according to maximum delay or minimum throughput quality of service requirements specified for the packets. The packets are scheduled in the earliest deadline first order in an output packet store. The packet closest to its timestamp deadline is selected from the output packet store by using an index.