CRII: CIF: Towards a Systematic Interference Alignment Approach for Network Information Flow

CRII：CIF：迈向网络信息流的系统干扰对齐方法

• 批准号: 1464336
• 负责人: Viveck Cadambe
• 金额: $ 17.44万
• 依托单位: Pennsylvania State Univ University Park
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2015
• 资助国家: 美国
• 起止时间: 2015-08-01 至 2018-07-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1464336&HistoricalAwards=false
• 关键词: CRII; CIF; Towards; Systematic; Interference

Communication and storage networks play an integral role in various aspects of modern life. The design of an efficient infrastructure of communication and storage relies significantly on algorithms for efficient information flow among its various components. The multiple unicast network capacity characterization problem is an information theoretic abstraction that captures the fundamental challenges in information flow in several communication and storage systems. Despite its importance, development of optimal codes in multiple unicast networks is a challenging unsolved problem in information theory. Recently the idea of interference alignment, which was originally discovered in the context of wireless systems, has been shown to be an important tool in multiple unicast network coding. However, uncovering interference alignment based achievable coding schemes remains an art; alignment-based solutions typically must be carefully handcrafted based on the specific network scenario under consideration. A dearth of systematic alignment based approaches has restricted the impact of this idea to a narrow class of network topologies and configurations. The objective of this project is to fill this gap by developing systematic interference alignment based algorithms for multiple unicast network coding. The project will include the study of several toy models of networks, which are tailor-made to expose the role of alignment. Insights obtained from the toy models will be incorporated into network coding algorithms for general networks over directed acyclic graphs. The performance of the algorithms developed will be studied through analytical and numerical methods.The proposed work involves fundamental contributions to the field of network information theory, specifically to the sub-topic of network coding, through the study of canonical problems in the field. The developments of the project will impact the design of data centers, content distribution networks and wireless communication networks. The research developed will be disseminated through peer-reviewed conferences and journals. The source code for algorithms developed will be made available to the public.

沟通和存储网络在现代生活的各个方面起着不可或缺的作用。 有效的通信和存储基础结构的设计显着取决于其各个组件之间有效信息流的算法。多个单播网络容量特征问题是一个信息理论抽象，可捕捉几种通信和存储系统中信息流的基本挑战。尽管它很重要，但在多个单播网络中开发最佳代码是信息理论中的一个具有挑战性的未解决问题。最近，最初在无线系统的背景下发现的干涉对齐的概念已被证明是多个单播网络编码中的重要工具。但是，发现基于干扰一致性的可实现的编码方案仍然是一门艺术。基于对齐的解决方案通常必须根据所考虑的特定网络方案进行仔细手工制作。缺乏基于系统的一致性方法已限制了这一想法对狭窄类别的网络拓扑和配置的影响。该项目的目的是通过为多个单播网络编码开发系统的干扰算法来填补这一空白。该项目将包括对几种网络玩具模型的研究，这些网络是量身定制的，以揭示对齐的作用。从玩具模型获得的洞察力将通过定向无环形图纳入通用网络的网络编码算法中。开发的算法的性能将通过分析和数值方法研究。拟议的工作涉及对网络信息理论领域的基本贡献，特别是针对网络编码的子主题，通过研究该领域的规范问题。该项目的发展将影响数据中心，内容分销网络和无线通信网络的设计。开发的研究将通过同行评审的会议和期刊传播。开发的算法源代码将提供给公众。