Abstract: Congestion aware load balancing for distributed storage may be provided. First, a read request for data may be received. The data may have redundancy through coding or through copying. Then it may be determined which K of M possible storage nodes to direct the received read request. K and M may be integers and M may be greater than K. In response to determining which K of M possible storage nodes to direct the received read request, the received read request may be copied into K read requests respectively corresponding to the determined K of M possible storage nodes. The copied K read requests may then be transmitted to the determined respective K storage nodes. And, in response to transmitting the copied K read requests, a client may receive data replies from each of the determined respective K storage nodes.

Abstract: Methods and systems are disclosed for calculating and applying a VQ metric which operates during the decoding of compressed video. As such, this metric is appropriate for all formats of compressed video codecs (e.g., MPEG-2, AVC and HEVC). The VQ metric relies on the decoded quantization parameter (Qp) together with analysis of both the compressed and decoded video. As such, the VQ metric does not require a reference video, and is less cumbersome to use for multiple channels, e.g., statistically multiplexed channels.

Abstract: In an example, there is disclosed a computing apparatus, having one or more logic elements, including at least one hardware logic element, comprising a network-aware data repair engine to compute a feasible repair log for n fragments of an original data structure, comprising: receiving a predictive failure scenario; identifying at least one repair ?i for the failure scenario; determining that ?i is feasible; and logging ?i to a feasible repair log. When a node failure occurs, a network cost may be computed for each repair in the feasible repair log, and an optimal repair may be selected.

Abstract: Congestion aware load balancing for distributed storage may be provided. First, a read request for data may be received. The data may have redundancy through coding or through copying. Then it may be determined which K of M possible storage nodes to direct the received read request. K and M may be integers and M may be greater than K. In response to determining which K of M possible storage nodes to direct the received read request, the received read request may be copied into K read requests respectively corresponding to the determined K of M possible storage nodes. The copied K read requests may then be transmitted to the determined respective K storage nodes. And, in response to transmitting the copied K read requests, a client may receive data replies from each of the determined respective K storage nodes.

Abstract: Methods and systems are disclosed for calculating and applying a VQ metric which operates during the decoding of compressed video. As such, this metric is appropriate for all formats of compressed video codecs (e.g., MPEG-2, AVC and HEVC). The VQ metric relies on the decoded quantization parameter (Qp) together with analysis of both the compressed and decoded video. As such, the VQ metric does not require a reference video, and is less cumbersome to use for multiple channels, e.g., statistically multiplexed channels.

Abstract: In an example, there is disclosed a computing apparatus, having one or more logic elements, including at least one hardware logic element, comprising a network-aware data repair engine to compute a feasible repair log for n fragments of an original data structure, comprising: receiving a predictive failure scenario; identifying at least one repair ?i for the failure scenario; determining that ?i is feasible; and logging ?i to a feasible repair log. When a node failure occurs, a network cost may be computed for each repair in the feasible repair log, and an optimal repair may be selected.

Abstract: Methods and systems are disclosed for calculating and applying a VQ metric which operates during the decoding of compressed video. As such, this metric is appropriate for all formats of compressed video codecs (e.g. MPEG-2, AVC and HEVC.) The VQ metric relies on the decoded quantization parameter (Qp) together with analysis of both the compressed and decoded video. As such, the VQ metric does not require a reference video, and is less cumbersome to use for multiple channels, e.g., statistically multiplexed channels.

Abstract: In one embodiment, a method comprises receiving a stream of transport packets encapsulating media packets, and generating a reference to the point-of-interest media packet relative to the location of the point-of-interest within the transport packet stream. The reference is generated for each media packet that is identified as a point-of-interest.

Abstract: Methods and systems are disclosed for calculating and applying a VQ metric which operates during the decoding of compressed video. As such, this metric is appropriate for all formats of compressed video codecs (e.g. MPEG-2, AVC and HEVC.) The VQ metric relies on the decoded quantization parameter (Qp) together with analysis of both the compressed and decoded video. As such, the VQ metric does not require a reference video, and is less cumbersome to use for multiple channels, e.g. statistically multiplexed channels.

Abstract: In one embodiment, a method comprises receiving a stream of transport packets encapsulating media packets, and generating a reference to the point-of-interest media packet relative to the location of the point-of-interest within the transport packet stream. The reference is generated for each media packet that is identified as a point-of-interest.

Abstract: In one embodiment, a method comprises receiving a stream of transport packets encapsulating media packets, and generating a reference to the point-of-interest media packet relative to the location of the point-of-interest within the transport packet stream. The reference is generated for each media packet that is identified as a point-of-interest.

Abstract: In one embodiment, a network device having a plurality of network interfaces maintains a database tracking multicast memberships associated with the network interfaces. The network device then uses the database for load balancing received multicast traffic over the network interfaces.

Abstract: In one embodiment, a network device having a plurality of network interfaces maintains a database tracking multicast memberships associated with the network interfaces. The network device then uses the database for load balancing received multicast traffic over the network interfaces.

Abstract: In one embodiment, a method comprises receiving a stream of transport packets encapsulating media packets, and generating a reference to the point-of-interest media packet relative to the location of the point-of-interest within the transport packet stream.