摘要:
Described is a distributed peer-assisted multicast content delivery system (e.g., a multiparty conferencing application) that uses an adaptive link rate control protocol to discover and adapt to an arbitrary topology quickly and converge to efficient link rate allocations allowed by an underlying network. Link rates are regularly obtained and used to determine trees for sending packets to other nodes. Network coding is used to implement data multicast so that mixtures (i.e., linear combinations) of the packets are transmitted in the network. The redundant packets may be differentiated from non-redundant (“innovative”) packets such that network conditions may be measured by link innovation and/or session innovation.
摘要:
Described is a distributed peer-assisted multicast content delivery system (e.g., a multiparty conferencing application) that uses an adaptive link rate control protocol to discover and adapt to an arbitrary topology quickly and converge to efficient link rate allocations allowed by an underlying network. Link rates are regularly obtained and used to determine trees for sending packets to other nodes. Network coding is used to implement data multicast so that mixtures (i.e., linear combinations) of the packets are transmitted in the network. The redundant packets may be differentiated from non-redundant (“innovative”) packets such that network conditions may be measured by link innovation and/or session innovation.
摘要:
Content synchronization in a file sharing environment is described. A node in a circle share maintains a version vector that represents that node's knowledge of file synchronization events. Version vector data may be transmitted between nodes of the circle share via a presence service in the form of short notification messages. The version vector data is compared to identify one or more nodes to be synchronized. A resource-aware overlay representing the circle share is computed, and is used to initiate communication to determine which of the available nodes with which to synchronize will provide the most synchronization value to other nodes in the circle share.
摘要:
Content synchronization in a file sharing environment is described. A node in a circle share maintains a version vector that represents that node's knowledge of file synchronization events. Version vector data may be transmitted between nodes of the circle share via a presence service in the form of short notification messages. The version vector data is compared to identify one or more nodes to be synchronized. A resource-aware overlay representing the circle share is computed, and is used to initiate communication to determine which of the available nodes with which to synchronize will provide the most synchronization value to other nodes in the circle share.
摘要:
A local network coding framework and method including techniques to improve efficiency in a wireless network by reducing overhead. The local network coding method includes exchanging data availability between nodes on the wireless network by sending Bloom filters of lists of packets to neighboring nodes. Based on data availability, optimized mixing of pure packets is performed to form mixture packets for output. A separate acknowledgement buffer keeps track of the pure packets transmitted but not acknowledged. If an acknowledgement does not arrive after a certain time period, the packet is assumed to be lost and is retransmitted. An optimized packet mixing process generates mixture packets and decides which nodes to send the mixture packets. The local network coding framework and method also includes methods for representing the composition of a mixture packet and using mixing at a wireless access point to improve the performance of the wireless local area network.
摘要:
A system and method that can receive, buffer, and asynchronously combine data from various incoming data packets is disclosed. The system and method can do so by, first, receiving incoming packets of one or multiple generations that have incoming data and incoming metadata, with the incoming data of each of the incoming packets that are of a first generation being a combination of a first, original set of data vectors, and the incoming metadata of each of the first generation of incoming packets including an indicator for the first generation. Second, once these incoming packets are received, the system and method can buffer them based on the indicator and, asynchronously from the receiving and buffering, combine the incoming data in the buffered, first generation incoming packets into outgoing data in an outgoing packet.
摘要:
A system and method that can receive, buffer, and asynchronously combine data from various incoming data packets is disclosed. The system and method can do so by, first, receiving incoming packets of one or multiple generations that have incoming data and incoming metadata, with the incoming data of each of the incoming packets that are of a first generation being a combination of a first, original set of data vectors, and the incoming metadata of each of the first generation of incoming packets including an indicator for the first generation. Second, once these incoming packets are received, the system and method can buffer them based on the indicator and, asynchronously from the receiving and buffering, combine the incoming data in the buffered, first generation incoming packets into outgoing data in an outgoing packet.
摘要:
A local network coding framework and method including techniques to improve efficiency in a wireless network by reducing overhead. The local network coding method includes exchanging data availability between nodes on the wireless network by sending Bloom filters of lists of packets to neighboring nodes. Based on data availability, optimized mixing of pure packets is performed to form mixture packets for output. A separate acknowledgement buffer keeps track of the pure packets transmitted but not acknowledged. If an acknowledgement does not arrive after a certain time period, the packet is assumed to be lost and is retransmitted. An optimized packet mixing process generates mixture packets and decides which nodes to send the mixture packets. The local network coding framework and method also includes methods for representing the composition of a mixture packet and using mixing at a wireless access point to improve the performance of the wireless local area network.
摘要:
A system and method that can receive, buffer, and asynchronously combine data from various incoming data packets is disclosed. The system and method can do so by, first, receiving incoming packets of one or multiple generations that have incoming data and incoming metadata, with the incoming data of each of the incoming packets that are of a first generation being a combination of a first, original set of data vectors, and the incoming metadata of each of the first generation of incoming packets including an indicator for the first generation. Second, once these incoming packets are received, the system and method can buffer them based on the indicator and, asynchronously from the receiving and buffering, combine the incoming data in the buffered, first generation incoming packets into outgoing data in an outgoing packet.
摘要:
Rebinning methods and arrangements are provided that significantly improve the 3D wavelet compression performance of the image based rendering data, such as, e.g., concentric mosaic image data. Through what is essentially a selective cutting and pasting process the image data is divided into stripes that are then used to form a set of multi-perspective panoramas. The rebinning process greatly improves the performance of the cross shot filtering, and thus improves the transform and coding efficiency of 3D wavelet codecs. While the region of support after rebinning may cease to be rectangular in some cases, a padding scheme and an arbitrary shape wavelet coder can be implemented to encode the result data volume of the smart rebinning. With an arbitrary shape wavelet codec, the rebinning outperforms MPEG-2 by 3.7 dB, outperforms direct 3D wavelet coder by 4.3 dB, and outperforms a reference block coder (RBC) by 3.2 dB on certain tested concentric mosaic image scenes. Hence, the rebinning process nearly quadruples the compression ratio for selected scenes. Additional methods and arrangements are provided that include selectively dividing the image data into slits and rebinning the slits into a huge 2D array, which is then compressed using conventional still image codecs, such as, JPEG.