Abstract: A system and method to reduce the number of data transmissions between nodes in a network is described. In one embodiment, a system and method for reducing the amount of ACK and NAK traffic in a network is described.

Abstract: A method, apparatus and computer program product for -based, delay-efficient data transmission for broadcasting a single file is presented. A file (ƒ) comprised of K packets to be broadcast to a plurality of receivers is determined. A plurality of packets (Pk) of the file are selected for transmission during a timeslot (t). Next, a linear combination of the selected packets (P[t]) are produced, the linear combination of packets are selected at random within the file. The linear combination of selected packets is then transmitted to a plurality of receivers over unreliable channels.

Abstract: In one aspect, a computer-implemented method includes generating a workload using at least one schema defined by combinations of ranges of each of at least two attributes. The computer-implemented method also includes receiving a request to provide content. The computer-implemented method further includes provisioning the content based upon the workload.

Abstract: A system and method to reduce the number of data transmissions between nodes in a network is described. In one embodiment, a system and method for reducing the amount of ACK and NAK traffic in a network is described.

Abstract: Data blocks to be stored on a disk-based data storage device (e.g., a hard disk drive, etc.) are coded together to form a plurality of linearly independent network coded blocks. The network coded blocks are then stored on the data storage device. Coded seeking may then be used to retrieve the original data blocks from the data storage device in a time-efficient manner. A read request may be sent to the data storage device requesting an innovative coded packet associated with the original data blocks. In response to the read request, the data storage device may read an innovative coded packet from the disk that is closest to current position of a read element of the device.

Abstract: A method, apparatus and computer program product for using advertisements as keys for streaming protected content is presented. Protected content is received at a user computer system, wherein the protected content is not viewable by the user. Appended content, such as an advertisement, is also received at the user computer system. The user views the appended content, wherein the viewing of the appended content results in the protected content being viewable by the user. The user then views the protected content.

Abstract: A method, apparatus and computer program product for a peaky binning Relaying Scheme for Wideband/Low Signal-To-Noise Ratio (SNR) Wireless Communications is presented. In a computer system having a source node (S), a relay node (R) and a destination node (D), the method includes transmitting by S a message (m), wherein a first subset of m (m1) is transmitted to R and wherein a second subset of m (m2) is transmitted to D. The method further includes decoding by R a bin index from the m1 and forwarding the bin index to D. Additionally the method includes receiving the bin index at D and decoding the bin index and receiving at D the m2 and decoding the m2. The method also includes determining by D the value of m from decoded values of the bin index and the m2.

Abstract: Distributed content caching is implemented in an efficient, low cost manner within a content delivery network (CDN). In various embodiments, content is identified for caching at a number of gateway devices within a CDN by minimizing a cost function associated with content delivery in the network. The cost function may take into consideration costs of delivering content to users from gateway devices as well as costs associated with delivering content to users from centralized locations of a CDN.

Abstract: Data blocks to be stored on a disk-based data storage device (e.g., a hard disk drive, etc.) are coded together to form a plurality of linearly independent network coded blocks. The network coded blocks are then stored on the data storage device. Coded seeking may then be used to retrieve the original data blocks from the data storage device in a time-efficient manner. A read request may be sent to the data storage device requesting an innovative coded packet associated with the original data blocks. In response to the read request, the data storage device may read an innovative coded packet from the disk that is closest to current position of a read element of the device.

Abstract: Network-coding-enabled reliability architectures and techniques are provided that are capable of enhancing data transfer reliability and efficiency in next generation wireless networks. In some embodiments, the techniques and architectures utilize a flexible thread-based coding approach to implement network coding. The techniques and architectures may also, or alternatively, utilize systematic intra-session random linear network coding as a packet erasure code to support reliable data transfer.

Abstract: Multi-resolution encoded files are stored on a plurality of disk drives using systematic network coded storage. In some embodiments, the stored files are used to provide video streaming services for users.

Abstract: Network-coding-enabled reliability architectures and techniques are provided that are capable of enhancing data transfer reliability and efficiency in next generation wireless networks. In some embodiments, the techniques and architectures utilize a flexible thread-based coding approach to implement network coding. The techniques and architectures may also, or alternatively, utilize systematic intra-session random linear network coding as a packet erasure code to support reliable data transfer.

Abstract: Network-coding-enabled reliability architectures and techniques are provided that are capable of enhancing data transfer reliability and efficiency in next generation wireless networks. In some embodiments, the techniques and architectures utilize a flexible thread-based coding approach to implement network coding. The techniques and architectures may also, or alternatively, utilize systematic intra-session random linear network coding as a packet erasure code to support reliable data transfer.

Abstract: An access server generates a handshake with storage servers resulting in more rapid access to the stored data, for example, video data, by a user. The handshake also results in load balancing effects.

Abstract: A coding approach for a robust and flexible network communication protocol is described. By using coding, it is possible to eliminate the need to track packet identities, and hence, it is possible to reduce coordination overhead associated with many conventional protocols. The method and system described herein takes advantage of multiple paths, interfaces, mediums, servers, and storage locations available in a network. The proposed protocol allows quick response to congestion by load balancing over different network resources. The method also enables soft vertical hand-overs across heterogeneous networks. In one embodiment, a media file is divided into chunks and transmitted using a transport protocol tailored to meet delay requirements of media streaming applications. Also described are different coding strategies for chunk delivery based upon an urgency level of each chunk.

Abstract: Described herein is a method and system for hierarchical wireless video with network coding which limits encryption operations to a critical set of network coding coefficients in combination with multi-resolution video coding. Such a method and system achieves hierarchical fidelity levels, robustness against wireless packet loss and efficient security by exploiting the algebraic structure of network coding.

Abstract: Described herein is a sampling system and related sampling scheme. The system and sampling scheme is based upon a framework for adaptive non-uniform sampling schemes. In the system and schemes described herein, time intervals between samples can be computed by using a function of previously taken samples. Therefore, keeping sampling times (time-stamps), except initialization times, is not necessary. One aim of this sampling framework is to provide a balance between reconstruction distortion and average sampling rate. The function by which sampling time intervals can be computed is called the sampling function. The sampling scheme described herein can be applied appropriately on different signal models such as deterministic or stochastic, and continuous or discrete signals. For each different signal model, sampling functions can be derived.

Abstract: Systems and methods for improved packet throughput using partial packets are provided in which data recovery of partial packets of a plurality of received coded packets is performed across the plurality of received coded packets. The plurality of received coded packets, including the received partial packets, can be buffered in a memory and used in recovering the data for the partial packets. As soon as the total number of received packets (including valid and partial) becomes greater than the generation size, a decoding process can be attempted utilizing the partial packets as part of the redundancy used for data recovery. During the decoding process, the received packets are evaluated across packets instead of on a per-packet basis.

Abstract: Described herein is a method and system for hierarchical wireless video with network coding which limits encryption operations to a critical set of network coding coefficients in combination with multi-resolution video coding. Such a method and system achieves hierarchical fidelity levels, robustness against wireless packet loss and efficient security by exploiting the algebraic structure of network coding.

Abstract: A method, apparatus and computer program product for utilizing network coding for multi-resolution multicast is presented. A network source partitions source content into a base layer and one or more refinement layers. The network source receives a respective one or more push-back messages from one or more network destination receivers, the push-back messages identifying the one or more refinement layers suited for each one of the one or more network destination receivers. The network source computes a network code involving the base layer and the one or more refinement layers for at least one of the one or more network destination receivers, and transmits the network code to the one or more network destination receivers in accordance with the push-back messages.