International Business Machines Corporation

Vitesse Semiconductor Corporation

Ioannis Viniotis

Kyle Gene Brown

Robert David Callaway

Adolfo Francisco Rodriguez

Richard A Robinson

O Raif Onvural

Rada Chirkova

Robin O'Connor

Richard Robinson

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.

Resolving database integration conflicts using data provenance

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.

Protocol for enabling dynamic and scalable federation of enterprise service buses

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.

Time based packet scheduling and sorting system

Growing community of inventors

Cary, NC, United States of America

Ioannis Viniotis