CIF: Small: Fountain Coding Theory for Content Sharing and Multimedia Broadcasting in Overlay Networks

CIF：小：覆盖网络中内容共享和多媒体广播的喷泉编码理论

• 批准号: 1016985
• 负责人: Jie Luo
• 金额: $ 24.07万
• 依托单位: Colorado State University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2010
• 资助国家: 美国
• 起止时间: 2010-09-01 至 2014-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1016985&HistoricalAwards=false
• 关键词: CIF; Small; Fountain; Coding; Theory

AbstractMulticast applications, such as content sharing and multimedia broadcasting, is the single most important class of applications over the internet. Multicast applications assume overlay network models, which consist of relevant nodes connected by abstracted virtual logical links. While scalable multicasting in such a network requires error-correction coding, classical coding approaches are highly inefficient due to the fact that virtual links do not enjoy known statistical channel models. To overcome this challenge, this project will develop a systematic coding theory based on a new fountain communication model for efficient multicasting in overlay networks. In fountain communication, the source node encodes a message into an infinite number of packets, a destination decodes the message after the number of received packets exceeds certain threshold. The investigator will first develop a fountain coding framework for end-to-end multicast transmission over virtual network links. For delay nonsensitive traffic, fountain codes will be developed to achieve ideal rate-error performance with a linear coding complexity. For delay sensitive traffic, fountain coding will be integrated with flow control algorithms to ensure timely information delivery over channels with arbitrary distortions and erasures. The objectives are characterizing fundamental performance limitations and developing practical coding schemes. The project will then investigate multiuser cooperative communication for multicast applications in node-capacitated overlay networks, where the sum upload rate of each node is kept below a predetermined bound. For delay sensitive communication, the objective is to overcome the challenge that network nodes may randomly access or disconnect from the network. For delay nonsensitive communication, the objective is to overcome the "selfish-peer-node" challenge where a peer node disconnects from the network whenever its desired messages become fully decodable.

AbstractMulticast应用程序（例如内容共享和多媒体广播）是Internet上最重要的一类应用程序。多播应用程序假设覆盖网络模型，该模型由通过抽象的虚拟逻辑链接连接的相关节点组成。尽管在这种网络中可扩展的多播需要错误校正编码，但由于虚拟链接不享受已知的统计渠道模型，因此经典的编码方法效率很低。为了克服这一挑战，该项目将基于新的喷泉通信模型开发系统的编码理论，以在覆盖网络中有效地进行多播。在喷泉通信中，源节点将消息编码为无限数量的数据包，目的地在接收到的数据包数量超过某些阈值之后将消息解码。研究人员将首先开发一个喷泉编码框架，用于通过虚拟网络链接上的端到端多播变速器。对于延迟非敏感的流量，将开发喷泉代码，以实现线性编码复杂性实现理想的率率性能。对于延迟敏感的流量，喷泉编码将与流控制算法集成，以确保通过任意扭曲和擦除的通道进行及时的信息传递。这些目标正在表征基本的绩效限制并制定实用的编码方案。然后，该项目将调查节点启用覆盖网络中多播应用程序的多源合作通信，在该网络中，每个节点的总和上传率都保持在预定的界限以下。对于延迟敏感的通信，目的是克服网络节点可以随机访问或与网络断开连接的挑战。为了延迟非敏感的交流，目的是克服“自私的节点”挑战，在这些挑战中，每当其所需的消息都可以完全解码时，对等节点与网络断开连接。