Abstract: Methods, apparatus, and articles of manufacture are disclosed to sample signed weighted updates. Example methods disclosed herein include identifying a first key associated with a data update obtained by sampling a stream of data received from a plurality of nodes in a network, the first key being representative of a first node in the plurality of nodes, adjusting a first value associated with the first key based on a weight associated with the data update, the weight being positive when the data update corresponds to opening of a new data connection with the first node, the weight being negative when the data update corresponds to closing of an existing data connection with the first node, and estimating a status of the first node based on the first value.

Abstract: Described is a system and method for determining a classification of an application that includes initiating a stress test on the application, the stress test including a predetermined number of stress events, wherein the stress events are based on a network impairment. A response by the application to each stress event is identified and the application is classified as a function of the response into one of a first classification and a second classification, the first classification indicative of a normal application and the second classification indicative of an undesired application. If, the application is in the second classification, a network response procedure is executed.

Abstract: Described is a system and method for determining a classification of an application that includes initiating a stress test on the application, the stress test including a predetermined number of stress events, wherein the stress events are based on a network impairment. A response by the application to each stress event is identified and the application is classified as a function of the response into one of a first classification and a second classification, the first classification indicative of a normal application and the second classification indicative of an undesired application. If, the application is in the second classification, a network response procedure is executed.

Abstract: Disclosed are method and apparatus for characterizing the temporal loss characteristics of a packet data network by multicast-based inference. Multicast probes are transmitted from a source node to a plurality of receiver nodes, which record the arrivals of the multicast probes. From the aggregate data comprising recorded arrivals of the end-to-end paths from the source node to each receiver node, temporal loss characteristics of individual links within the network may be calculated. In a network with a tree topology, the complexity of calculations may be reduced through a process of subtree partitioning.

Abstract: Methods, apparatus, and articles of manufacture are disclosed to sample signed weighted updates. Example methods disclosed herein include identifying a first key associated with a data update obtained by sampling a stream of data received from a plurality of nodes in a network, the first key being representative of a first node in the plurality of nodes, adjusting a first value associated with the first key based on a weight associated with the data update, the weight being positive when the data update corresponds to opening of a new data connection with the first node, the weight being negative when the data update corresponds to closing of an existing data connection with the first node, and estimating a status of the first node based on the first value.

Abstract: Disclosed are method and apparatus for characterizing the temporal loss characteristics of a packet data network by multicast-based inference. Multicast probes are transmitted from a source node to a plurality of receiver nodes, which record the arrivals of the multicast probes. From the aggregate data comprising recorded arrivals of the end-to-end paths from the source node to each receiver node, temporal loss characteristics of individual links within the network may be calculated. In a network with a tree topology, the complexity of calculations may be reduced through a process of subtree partitioning.

Abstract: Disclosed are method and apparatus for characterizing the temporal loss characteristics of a packet data network by multicast-based inference. Multicast probes are transmitted from a source node to a plurality of receiver nodes, which record the arrivals of the multicast probes. From the aggregate data comprising recorded arrivals of the end-to-end paths from the source node to each receiver node, temporal loss characteristics of individual links within the network may be calculated. In a network with a tree topology, the complexity of calculations may be reduced through a process of subtree partitioning.

Abstract: Disclosed are method and apparatus for characterizing the temporal delay characteristics of a packet data network by multicast-based inference. Multicast probes are transmitted from a source node to a plurality of receiver nodes, which record the delays of the multicast probes. From the aggregate data comprising recorded delays of the end-to-end paths from the source node to each receiver node, temporal delay characteristics of individual links within the network may be calculated. In a network with a tree topology, the complexity of calculations may be reduced through a process of subtree partitioning.

Abstract: Disclosed are method and apparatus for characterizing the temporal loss characteristics of a packet data network by multicast-based inference. Multicast probes are transmitted from a source node to a plurality of receiver nodes, which record the arrivals of the multicast probes. From the aggregate data comprising recorded arrivals of the end-to-end paths from the source node to each receiver node, temporal loss characteristics of individual links within the network may be calculated. In a network with a tree topology, the complexity of calculations may be reduced through a process of subtree partitioning.