Abstract: The embodiments of the present invention provide a novel way of searching and interacting with content available via a network, such as the Internet, and the World Wide Web. In some embodiments, systems and methods provide a semantically-oriented structure for organizing and accessing content items. The semantic organization can be derived by leveraging user interactions with the content items. The systems and methods leverage the semantics of the content items and to help the user find content items that are consistent with the purpose of the user's search. In addition, the embodiments provide a novel navigation paradigm of search results and content items so that the user can more intuitively and more efficiently get information form an information space.

Abstract: A contextual and semantic analysis of network entities facilitates a mapping and comparison of the entities between network models. The system includes a plurality of refine handler and match handler pairs that use rules that are specific to the type of network entities being analyzed. The refine handler analyzes the network model to identify the entities for which its rules apply, and the match handler processes these identified entities to establish a pairing between corresponding entities in each model. A sequence of refine-match processes are applied to the network models, typically in accordance with a hierarchy of rules until each entity is identified as a matched, added, or removed entity. A difference handler processes the identified pairings to provide a difference analysis that facilitates a meaningful interpretation of the configuration changes, and a user interface provides an interactive environment to view the differences from different perspectives.

Abstract: The present invention relates to a system and method for assessing application performance. hi some embodiments, the analysis considers external factors, such as business hours, time zone, etc., to identify or recognize distinctive intervals of application performance. These distinctive intervals correspond to different periods of activity by an enterprise or business and may occur in a cyclical manner or other type of pattern. The distinctive intervals defined by external factors are employed in the analysis to improve aggregating of statistics, setting of thresholds for performance monitoring and alarms, correlating business and performance, and the modeling of application performance. The metrics measured can include, among other things, measures of CPU and memory utilization, disk transfer rates, network performance, queue depths and application module throughput. Key performance indicators, such as transaction rates and round-trip response times may also be monitored.

Abstract: The present invention relates to a direct contact racquet or “DCR.” In order to enhance the feel experienced by the player, the DCR is designed to maximize the contact between the player's hand and the ball, while still making use of a string-bed or other form of contact to provide a strike surface for the ball. In particular, a gripping surface for a player's hand is provided behind the string bed. The gripping surface may be shaped in various ways so that a player can comfortably grip it. In addition, the gripping surface may provide a clearance from the string bed when striking a ball. Therefore, the DCR places a user's hand directly behind the string bed surface used to strike the ball.

Abstract: The embodiments facilitate the analysis of application delays, including delays that occur on multiple paths. A trace file of an application's network events is processed to categorize the causes of delays incurred in the propagation and processing of these events. The system identifies the amount of delay that can be eliminated by eliminating each of the components of delay individually, as well as the amount of delay that can be eliminated by eliminating combinations of the delay components. A user interface displays the amount of reduction that can be achieved by eliminating various delays alone or in combination. The interface also allows the user to view the individual delay components contained in combinations of delay components. In this manner, the user is provided a view of each of the delay components that would need to be addressed, either individually or in combination, to improve the overall application delay.

Abstract: The present invention relates to a system and method for assessing application performance and user satisfaction. In one embodiment, the system and method calculates an Operational Index (OPdex) representing user satisfaction with an application. The OPdex may be a number quantifying user satisfaction with an application, such as a web application, and system performance. The OPdex may be based on one or more measurable metrics having a range of values that may affect user satisfaction or performance of an application. The OPdex may comprise calculating the index based on a soft threshold, a hard threshold, and measurements indicating a perceived application response time. The OPdex calculation may also account for sensitivity of user satisfaction to response time. Based on the OPdex, the system and methods also provide information indicating the relationship among application response time thresholds set by the users, the user satisfaction level, and the mean response time.

Abstract: Network survivability is quantified in such a way that failure cases can be compared and ranked against each other in terms of the severity of their impact on the various performance measures associated with the network. The degradation in network performance caused by each failure is quantified based on user-defined sets of thresholds of degradation severity for each performance measure. Each failure is simulated using a model of the network, and a degradation vector is determined for each simulated failure. A comparison function is defined to map the degradation vectors into an ordered set, and this ordered set is used to create an ordered list of network failures, in order of the network degradation caused by each failure.

Abstract: The embodiments relate to modeling wireless communications in a network. In wireless communications, the nodes share one or more wireless communication channels. When a node has data to transmit, it must contend with the other nodes for access to the wireless communication channel. In the embodiments, the model is configured to simulate the throughput effects of contention including delays caused by retransmissions due to interference and collisions, listen-and-backoff, unavailability of time slots, etc. The occurrence of failed/dropped transmissions due to buffer overflows, excessive retransmission attempts, and unintended collisions are modeled as well. In addition, the embodiments may simulate the effect of mobility by the nodes and the effect of the location of the nodes relative to each other.

Abstract: Traffic flow between each pair of nodes in a network are determined based on loads measured at each link and based on gravity measures. The gravity measures correspond to a likelihood of the node being a source or a sink of traffic and may be assigned based on characteristics associated with each node, such as the demographics of the region in which the node is located, prior sinking and sourcing statistics, and so on. The gravity measures are used to generate an objective function for solving a system of linear equations, rather than as criteria that must be satisfied in the solution. The measured link loads are allocated among the traffic flows between nodes to at least a given allocation efficiency criteria by solving a system of linear equations with an objective of minimizing a difference between the assigned gravities and the resultant gravities corresponding to the determined flows.

Abstract: Data representing application deployment attributes, network topology, and network performance attributes based on a reduced set of element attributes is utilized to simulate application deployment. The data may be received from a user directly, a program that models a network topology or application behavior, and a wizard that implies the data based on an interview process. The simulation may be based on application deployment attributes including application traffic pattern, application message sizes, network topology, and network performance attributes. The element attributes may be determined from a lookup table of element operating characteristics that may contain element maximum and minimum boundary operating values utilized to interpolate other operating conditions.

Abstract: Simulation models of media access control and physical layer characteristics facilitate the simulation/emulation of a variety of phenomena that affect transmissions via a wireless media. Such phenomena include media access contention delays, packet drops, and retransmissions that are generally dependent upon changes in transmitter/receiver locations. Each wireless environment is characterized by a model of the communication channel that characterizes transmission effects based on the number of competing transmitters in the environment, which is dynamically determined based on the location of each node in the environment. Additionally, the location of nodes is used to simulate the effects of ‘hidden nodes’, nodes that are unknown to a transmitting node but can interfere with the reception of transmissions at a receiving node. Each device/node model in the wireless environment preferably accesses the same model of the communication channel, thereby minimizing the amount of detail required at each device model.

Abstract: Traffic flow between each pair of nodes in a network are determined based on loads measured at each link and based on gravity measures. The gravity measures correspond to a likelihood of the node being a source or a sink of traffic and may be assigned based on characteristics associated with each node, such as the demographics of the region in which the node is located, prior sinking and sourcing statistics, and so on. The gravity measures are used to generate an objective function for solving a system of linear equations, rather than as criteria that must be satisfied in the solution. The measured link loads are allocated among the traffic flows between nodes to at least a given allocation efficiency criteria by solving a system of linear equations with an objective of minimizing a difference between the assigned gravities and the resultant gravities corresponding to the determined flows.

Abstract: A simulator simulates routing system protocols to build routing tables corresponding to a modeled network, and a comparator compares the routing tables in the actual network to these simulator-created routing tables. Because the modeled system represents a fault-free version of the actual system, and assuming that the modeled routing system protocols are representative of the algorithms used in the actual routers, these simulator-produced routing tables can represent steady-state routing tables that should be present in the routers of the actual network at steady state. By querying each router in the actual network for its routing table and comparing each routing table to the corresponding simulator-produced routing table, any differences from the steady state can be identified.

Abstract: Network survivability is quantified in such a way that failure cases can be compared and ranked against each other in terms of the severity of their impact on the various performance measures associated with the network. The degradation in network performance caused by each failure is quantified based on user-defined sets of thresholds of degradation severity for each performance measure. Each failure is simulated using a model of the network, and a degradation vector is determined for each simulated failure. A comparison function is defined to map the degradation vectors into an ordered set, and this ordered set is used to create an ordered list of network failures, in order of the network degradation caused by each failure.

Abstract: A simulator simulates routing system protocols to build routing tables corresponding to a modeled network, and a comparator compares the routing tables in the actual network to these simulator-created routing tables. Because the modeled system represents a fault-free version of the actual system, and assuming that the modeled routing system protocols are representative of the algorithms used in the actual routers, these simulator-produced routing tables will represent the ‘ideal’ routing tables that should be present in the routers of the actual network. By querying each router in the actual network for its routing table and comparing each routing table to the corresponding simulator-produced routing table, any differences from the ‘ideal’ can be identified.

Abstract: A multi-functional graphical user interface facilitates the analysis and assessment of application delays, including delays that occur on multiple paths. A trace file of an application's network events is processed to categorize the causes of delays incurred in the propagation and processing of these events. The system identifies the amount of delay (‘component delay’) that can be eliminated by eliminating each of the components of delay individually, as well as the amount of delay (‘parallel delay’) that can be eliminated by eliminating combinations of the delay components. A user interface displays the amount of reduction that can be achieved by eliminating each component delay individually and the amount of reduction that can be achieved by eliminating combinations of the individual component delays.

Abstract: A system and method for analyzing network traffic activity by displaying a collection of flow objects and receiving a user's selection of a traffic operation that is to be applied to a set of selected flow objects. Thereafter, the results of applying the traffic operation to the selected flow objects are displayed. The traffic operation may include a merge operation that provides statistics related to an aggregation of the flow objects. The traffic operation may also include a modification operation that modifies the selected flow objects, including, for example, a modification based on predicted traffic flow. Other traffic operations may also be provided, including providing access to plug-in traffic operation applications.

Abstract: A system and method optimizes the information flow regarding node location across a network by controlling the propagation of this information based on distance from the node. Location servers that are near to a node receive detailed information regarding the node's location; location servers that are farther from the node receive less detailed information. In like manner, periodic updates are provided less frequently to distant location servers, and preferably also based on the velocity of a mobile node, or on a priority associated with the mobile node. The location information provided in a message addressed to a node can be minimal when the message is transmitted, and additional detail can be added to this location information by routing nodes as the message is routed closer to its destination, based on information provided by the location servers.

Abstract: A network configuration is processed to identify each policy and the criteria associated with each policy. The criteria of the policies are processed to identify a non-overlapping set of ranges of the criteria parameter, each range being associated with a particular policy or set of policies. In a preferred embodiment, the criteria include the protocol, the source and destination IP addresses, and the source and destination ports, and a default range is defined for each criteria parameter.

Abstract: A system and method optimizes the information flow regarding node location across a network by controlling the propagation of this information based on distance from the node. Location servers that are near to a node receive detailed information regarding the node's location; location servers that are farther from the node receive less detailed information. In like manner, periodic updates are provided less frequently to distant location servers, and preferably also based on the velocity of a mobile node, or on a priority associated with the mobile node. The location information provided in a message addressed to a node can be minimal when the message is transmitted, and additional detail can be added to this location information by routing nodes as the message is routed closer to its destination, based on information provided by the location servers.