International Business Machines Corporation

Terence Dale Smetanka

Diane Phylis Pozefsky

James P Gray

Andrew Hilliard Arrowood

John E Drake, Jr

Geetha Vijayan

Stig Arne Olsson

John L Eisenbies

Kathryn E Clarke

Karla J Norsworthy

An example of a solution provided here comprises providing a generic task list, and applying the generic task list to a first business process and a second business process. Applying the generic task list includes mapping a transaction step in the first business process to a similar transaction step in the second business process. Another example of a solution comprises mapping a transaction step in a first application to a similar transaction step in a second application, a current threshold value, and a supporting application, inputting performance measures for the first and second applications, and outputting a performance comparison report, based on the mapping and the performance measures. The mapping, the inputting, and the outputting may be performed for a plurality of transaction steps in the first application and a plurality of transaction steps in the second application.

E-business competitive measurements

In a communications network, each network node can maintain its own list of network resources in a topology database. When the state of a resource 'owned' by a particular node changes, that node broadcasts a topology database update (TDU) message to adjacent nodes. Each adjacent node updates its own topology database and rebroadcasts the message. To minimize the amount of information that must be included in TDU messages when two nodes are reconnected after an outage, each node assigns flow reduction sequence numbers (FRSNs) to TDU meassages and keeps a record of the FRSN for the last TDU message sent to an adjacent node. The node also records, for each resource in its database, the FRSN of the last TDU message including that resource. When two nodes are reconnected, the sending node includes in the TDU message only those resources having a FRSN greater than the FRSN assigned to the last TDU sent to the adjacent node to which the TDU message is directed.

Method of reducing the amount of information included in topology

Growing community of inventors

Raleigh, NC, United States of America

Terence Dale Smetanka