Patent application number | Description | Published |
20100046371 | FEEDBACK-BASED ONLINE NETWORK CODING - A method, apparatus and computer program product for feedback-based online network coding is presented. In one embodiment, a transmitting node determines a linear combination of packets to transmit from a transmit queue. The transmitting node transmits the linear combination of packets. The transmitting node determines whether a packet can be removed from the transmit queue, wherein when a determination is made that a packet can be removed from the transmit queue then removing the packet from the transmit queue, and when a determination is made that a packet cannot be removed from the transmit queue then refraining from removing the packet from the transmit queue. | 02-25-2010 |
20100054164 | Random Linear Network Coding for Time Division Duplexing - A new random linear network coding scheme for reliable communications for time division duplexing channels is proposed. The setup assumes a packet erasure channel and that nodes cannot transmit and receive information simultaneously. The sender transmits coded data packets back-to-back before stopping to wait for the receiver to acknowledge (ACK) the number of degrees of freedom, if any, that are required to decode correctly the information. Provided herein is an analysis of this problem to show that there is an optimal number of coded data packets, in terms of mean completion time, to be sent before stopping to listen. This number depends on the latency, probabilities of packet erasure and ACK erasure, and the number of degrees of freedom that the receiver requires to decode the data. This scheme is optimal in terms of the mean time to complete the transmission of a fixed number of data packets. It is shown that its performance is very close to that of a full-duplex system, while transmitting a different number of coded packets can cause large degradation in performance, especially if latency is high. Also described herein is the throughput performance of the novel system and technique along with a comparison to existing half-duplex Go-back-N and Selective Repeat ARQ schemes. Numerical results, obtained for different latencies, show that the novel system and technique described herein has similar performance to the Selective Repeat in most cases and considerable performance gain when latency and packet error probability is high. | 03-04-2010 |
20100074492 | METHODS AND APPARATUS FOR AUTOMATED BASE-CALLING ON MULTIPLE DNA STRANDS - In some aspects, a method of automated base-calling using at least one image obtained from a chemical sequencing process performed simultaneously on a plurality of DNA strands, the at least one image including intensity information corresponding to locations of at least one base in the plurality of DNA strands is provided. The method comprises processing the at least image to obtain a function corresponding to the intensity information in the at least one image for the at least one base, the function incorporating intensity information corresponding to each of the plurality of DNA strands, identifying a plurality of peaks in the function, the plurality of peaks indicating possible locations for the at least one base in the plurality of DNA strands, assigning membership to each of the plurality of peaks by determining whether each of the plurality of peaks is believed to have resulted from none, one or multiple of the plurality of DNA strands, and computing a sequence for the at least one base for each of the plurality of DNA strands based, at least in part, on the membership assignment. | 03-25-2010 |
20100185768 | RESOURCE ALLOCATION AND MODIFICATION USING STATISTICAL ANALYSIS - 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. | 07-22-2010 |
20110131326 | Arrangements and Methods for Access to Stored Data - 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. | 06-02-2011 |
20110243324 | Secure Network Coding for Multi-Resolution Wireless Video Streaming - 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. | 10-06-2011 |
20120218891 | METHOD AND APPARATUS PROVIDING NETWORK CODING BASED FLOW CONTROL - A method, apparatus and computer program product for providing network based flow control is presented. A linear combination of packets to transmit from a transmit queue is determined. The linear combination of packets is transmitted across a network using a sliding window protocol. An acknowledgement (ACK) is generated, wherein a packet is acknowledged when a receiving node receives the linear combination of packets and determines which packet of the linear combination of packets has been newly seen. | 08-30-2012 |
20120236763 | Random Linear Network Coding for Time Division Duplexing - Subject matter disclosed herein relates to random linear network coding schemes for reliable communications for time division duplexing channels. In at least one embodiment, a transmitter node transmits M data packets through a half-duplex link using random linear network coding. The transmitter node transmits coded packets back-to-back through the link before stopping to wait for an acknowledgement (ACK) packet. An optimal number of coded packets N | 09-20-2012 |
20120307920 | Method and Apparatus to Perform Function Compression - A functional compression scheme involves determining a minimal entropy coloring of a characteristic graph of a random variable. Various scenarios are disclosed where the determination of the minimal entropy coloring of a characteristic graph is easy and tractable. | 12-06-2012 |
20130107764 | Traffic Backfilling Via Network Coding In A Multi-Packet Reception Network | 05-02-2013 |
20130114481 | Coding Approach For A Robust And Flexible Communication Protocol - 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. | 05-09-2013 |
20130114611 | Method and Apparatus for Efficient Transmission of Information to Multiple Nodes - 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. | 05-09-2013 |
20130117450 | ARRANGEMENTS AND METHODS FOR ACCESS TO STORED DATA - 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. | 05-09-2013 |
20130195106 | Multi-Path Data Transfer Using Network Coding - Techniques, devices, systems, and protocols are disclosed herein that relate to data transfer between communication nodes via multiple heterogeneous paths. In various embodiments, network coding may he used to improve data flow and reliability in a multiple path scenario. Transmission control protocol (TCP) may also be used within different paths to further enhance data transfer reliability. In some embodiments, multiple levels of network coding may be provided within a transmitter in a multiple path scenario, with one level being applied across ail paths and another being applied within individual paths. | 08-01-2013 |
20130259041 | NETWORK CODING FOR MULTI-RESOLUTION MULTICAST - 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. | 10-03-2013 |
20130326308 | PARTIAL PACKET RECOVERY IN WIRELESS NETWORKS - 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. | 12-05-2013 |
20140064296 | Method And Apparatus For Performing Finite Memory Network Coding In An Arbitrary Network - Techniques for performing finite memory network coding in an arbitrary network limit an amount of memory that is provided within a node of the network for the performance of network coding operations during data relay operations. When a new data packet is received by a node, the data stored within the limited amount of memory may be updated by linearly combining the new packet with the stored data. In some implementations, different storage buffers may be provided within a node for the performance of network coding operations and decoding operations. | 03-06-2014 |
20140184273 | Energy-Efficient Time-Stampless Adaptive Nonuniform Sampling - 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. | 07-03-2014 |
20140185803 | Secure Network Coding for Multi-Resolution Wireless Transmission - 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. | 07-03-2014 |
20140268398 | Method And Apparatus To Reduce Access Time In A Data Storage Device Using Coded Seeking - 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. | 09-18-2014 |
20140269485 | Wireless Reliability Architecture And Methods Using Network Coding - 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. | 09-18-2014 |
20140269503 | Wireless Reliability Architecture And Methods Using Network Coding - 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. | 09-18-2014 |
20140269505 | Wireless Reliability Architecture And Methods Using Network Coding - 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. | 09-18-2014 |
20140280395 | Network Coded Storage With Multi-Resolution Codes - 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. | 09-18-2014 |
20140280454 | Method and Apparatus for Implementing Distributed Content Caching In A Content Delivery Network - 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. | 09-18-2014 |