Abstract: Described are methods, apparatus and computer programs for determining run-time dependencies between logical components of a data processing environment. Components of the data processing environment are monitored by monitoring agents accessing run-time activity data via APIs of the managed system. A dependency generator identifies correlations between the run-time activity of the monitored components. For synchronous monitored systems, the dependency generator calculates an activity period for monitored components and determines which component's activity periods contain the activity periods of other components. Containment is used as an indicator of a likely dependency relationship, and a weighting is computed for each dependency relationship based on the consistency of containment.

Abstract: Described are methods, apparatus and computer programs for determining run-time dependencies between logical components of a data processing environment. Components of the data processing environment are monitored by monitoring agents accessing run-time activity data via APIs of the managed system. A dependency generator identifies correlations between the run-time activity of the monitored components. For synchronous monitored systems, the dependency generator calculates an activity period for monitored components and determines which component's activity periods contain the activity periods of other components. Containment is used as an indicator of a likely dependency relationship, and a weighting is computed for each dependency relationship based on the consistency of containment.

Abstract: An exemplary method for identifying process elements includes the steps of obtaining a plurality of relevant request-response pairs including request identifiers, mapping the request identifiers to corresponding artifacts, identifying actions based on the artifacts, and mapping the actions to process elements such that each given one of the process elements has an associated artifact.

Abstract: Risks of change to a physical configuration are minimized. A request for a change to the physical system included in the physical configuration is detected, and all applications the physical systems that would be affected by the requested change are identified. All the applications and physical systems that would be affected by the requested change are replicated on a virtual system, including applications and the physical system to which the requested change is targeted and applications and physical systems that are dependent on the applications and the physical system to which the requested change is targeted. The requested change is applied to the virtual system. The virtual system is tested to determine whether the applied change produces desired results. If the applied change products the desired results, the requested change is applied to the physical system.

Abstract: A computer-implemented method, system, and program product for optimizing a distributed (software) application are provided. Specifically, a configuration of a target computing environment, in which the distributed application is deployed, is discovered upon deployment of the distributed application. Thereafter, based on a set of rules and the discovered configuration, one or more optimization techniques are applied to optimize the distributed application. In a typical embodiment, the set of rules can be embedded in the distributed application, or they can be accessed from an external source such as a repository.

Abstract: Described are methods, apparatus and computer programs for determining run-time dependencies between logical components of a data processing environment. Components of the data processing environment are monitored by monitoring agents accessing run-time activity data via APIs of the managed system. A dependency generator identifies correlations between the run-time activity of the monitored components. For synchronous monitored systems, the dependency generator calculates an activity period for monitored components and determines which component's activity periods contain the activity periods of other components. Containment is used as an indicator of a likely dependency relationship, and a weighting is computed for each dependency relationship based on the consistency of containment.

Abstract: Described are methods, apparatus and computer programs for determining run-time dependencies between logical components of a data processing environment. Components of the data processing environment are monitored by monitoring agents accessing run-time activity data via APIs of the managed system. A dependency generator identifies correlations between the run-time activity of the monitored components. For synchronous monitored systems, the dependency generator calculates an activity period for monitored components and determines which component's activity periods contain the activity periods of other components. Containment is used as an indicator of a likely dependency relationship, and a weighting is computed for each dependnecy relationship based on the consistency of containment.

Abstract: Described are methods, apparatus and computer programs for determining run-time dependencies between logical components of a data processing environment. Components of the data processing environment are monitored by monitoring agents accessing run-time activity data via APIs of the managed system. A dependency generator identifies correlations between the run-time activity of the monitored components. For synchronous monitored systems, the dependency generator calculates an activity period for monitored components and determines which component's activity periods contain the activity periods of other components. Containment is used as an indicator of a likely dependency relationship, and a weighting is computed for each dependency relationship based on the consistency of containment.

Abstract: An exemplary method for identifying process elements includes the steps of obtaining a plurality of relevant request-response pairs including request identifiers, mapping the request identifiers to corresponding artifacts, identifying actions based on the artifacts, and mapping the actions to process elements such that each given one of the process elements has an associated artifact

Abstract: A computer-implemented method, system, and program product for optimizing a distributed (software) application are provided. Specifically, a configuration of a target computing environment, in which the distributed application is deployed, is discovered upon deployment of the distributed application. Thereafter, based on a set of rules and the discovered configuration, one or more optimization techniques are applied to optimize the distributed application. In a typical embodiment, the set of rules can be embedded in the distributed application, or they can be accessed from an external source such as a repository.

Abstract: Described are methods, apparatus and computer programs for determining run-time dependencies between logical components of a data processing environment. Components of the data processing environment are monitored by monitoring agents accessing run-time activity data via APIs of the managed system. A dependency generator identifies correlations between the run-time activity of the monitored components. For synchronous monitored systems, the dependency generator calculates an activity period for monitored components and determines which component's activity periods contain the activity periods of other components. Containment is used as an indicator of a likely dependency relationship, and a weighting is computed for each dependency relationship based on the consistency of containment.

Abstract: Rate management in adaptive data rate wireless communication systems in which communicating stations move with respect to one another implements algorithms for calculation of the repetition rate. A rate management module is used for selecting a proper value of repetition rate to be communicated back to sending station and for a selecting proper value of repetition rate to encode the data at the sending station. The repetition rate calculation procedure enables each station to dynamically calculate the optimum rate with which each station should be receiving information from another station. The repetition rate calculation procedures take into consideration past and present measurements of the link quality, age of the link quality measurements, speed of change in the link quality, packet types, packet lengths, received signal strength, and pattern and correlation in the link quality measurements. The rate management module utilizes one or more tables which are accessible from either hardware or software.

Abstract: Fairness algorithms and access methods enable non-zero channel access for wireless communication systems operating in a random access channel environment. Fair access to a random access channel for each station in a wireless network is assured by each station calculating a priority or probability for accessing the channel based on logical connections among certain stations, based on other stations perception of the channel and based on each calculating station's own perception of the channel properties.

Abstract: The throughput of a Request-to-Send and Clear-to-Send (RTS/CTS) based distributed media access control protocol is improved by reserving the medium in a hierarchical fashion. The shared medium is reserved for two stations called the participants. During the reserved period, a master (or primary) attribute and a slave (or secondary) attribute are given to the participants and the medium is shared between them using any suitable coordination algorithm. During the reserved time, the secondary can signal the primary station that it has data to send to the primary station and request that the primary and secondary roles or attributes be exchanged. In the case that a role exchange takes place, control of the medium is transferred from one station to another and data transfer in an opposite direction can take place without requiring another reservation.

Abstract: In a wireless multi-rate communications system, a method for extending the range of communications in the system by dividing the physical layer frame into two portions: a robust header portion and a body, where the repetition rate of the data symbols in the header portion is greater than or equal to the repetition rate of the data symbols in the body of the frame. In this way the header can be received and decoded by all stations in the system with a high probability, while the body of the frame need only be received and decoded by the destination station to which the body of the frame is intended to be received and decoded.

Abstract: A method of delievering data in a wireless communications network using a combination of collision sensing and collision avoiidance protocols. More precisely, if there are no hidden nodes detected in the network, a collision sensing protocol is used; however, if there are hidden nodes, then a collision avoidance protocol is used. This invention also deals with methods of determining the presence or absence of hidden nodes.

Abstract: In the Checkpoint Mode Protocol (CPM), checkpoint frames are transmitted at regular intervals for acknowledging received information frames and individually requesting retransmission of missing information frames. The disclosed invention reduces the flow of checkpoint frames in situations where their information is not required. This is achieved by either sending a Stop Checkpointing frame from sender to receiver in particular situations, or by inserting, in the case of duplex transmission (i.e. both stations are sending and receiving), Request-Reply bits into normal checkpoint frames for suppressing the flow of checkpoint frames when they are not necessary. In each case, provisions are made to resume the transmission of checkpoint frames as soon as they are required again.