Abstract: Disclosed herein is a computer implemented technique for discovering the information technology resources that are involved in a particular networked business transaction. The system comprises three basic components. A robotic transaction playback client records the various steps in a particular transaction and can repetitively execute these steps to analyze the results. A network record collector observes the traffic throughout the network in response to the repeated instances of the transaction executed by the robotic transaction playback client. A backend processor analyzes the observations of network traffic to determine which ones are possibly tied to the transaction, and from this information determine which network components are part of the transaction being analyzed. Event timing information from a plurality of executions of a particular transaction are used to determine resource usage and paths.

Abstract: Server-side techniques to selectively compress data for transmission to a client application are described. Characteristics such as the effective transmission rate between the server computer system and a client computer system requesting the data are used to determine if data compression is beneficial. In addition, characteristics of the server computer system such as its processor utilization, for example, may be used to determine if data compression is beneficial. Selective compression in accordance with these techniques provide improved user-responsiveness without the need to install, configure or maintain a client-side application. Accordingly, selective compression in accordance with the invention is particularly beneficial in large, distributed networks in which one or a few “server” computers provide data access service to a large number of “client” computer systems.

Abstract: A method in accordance with the invention is implemented via a novel computer program referred to for convenience as NEWPROG. NEWPROG resides (executes) in one or more communication controllers on a SNA network “front end” processor for the NCP executing in that controller. NEWPROG makes it possible for the NCP memory management routines to dynamically increase the number of control blocks by scavenging available NCP memory. Those control blocks created by NEWPROG may also be deleted. Use of the method permits the NCP to improve its resource availability by generating user requested control block structures as needed (within total NCP load memory limitations).

Abstract: A method in accordance with the invention is implemented via a set of novel computer programs referred to for convenience as NEWPROG. A "controller NEWPROG," resides in one or more communication controllers on an SNA network as a "front end" processor for the NCP executing in that controller. The controller NEWPROG uses interception techniques to monitor the controller's incoming and outgoing messages and thereby 1) collect statistical information about network performance, and 2) exchange "backchannel" messages with controller NEWPROGs operating in adjacent controllers. The controller NEWPROG can alter dynamically the tuning parameters in that NCP. A "host NEWPROG" executes in a host computer to provide a monitoring and control station for a network administrator. The host NEWPROG communicates with controller NEWPROGs on the network via a virtual logical unit (VLU) executing within at least one controller.

Abstract: An optimizer system optomizes and validates data streams in whcih double-byte character set data may be transmitted. The optimizer, maintaining an image or map of data contained in a peripheral device buffer, sets and monitors the status of three flags located in extended attribute planes for the purpose of processing data stream orders when a double-byte character set is in use.

Abstract: A mapping-type data signal optimizer performs a code-point sorting function to optimize downloading of programmed symbols. A present-state list of values of programmed symbols already downloaded to a peripheral device is sorted, and a similar intended-state list of programmed symbols intended to be downloaded is likewise sorted. A search is performed to detect any commonalities that might exist between the present-state and intended-state programmed-symbol values, even under differing programmed-symbol designators. When such a commonality is detected, the intended- state designator is altered to be equal to the present-state designator; thus, that particular programmed symbol value need not be redownloaded.