AitF: EXPL: Wide-area Dissemination under Strict Timeliness, Reliability, and Cost Constraints

AitF：EXPL：严格时效性、可靠性和成本约束下的广域传播

• 批准号: 1535887
• 负责人: Michael Dinitz
• 金额: $ 40万
• 依托单位: Johns Hopkins University
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2015
• 资助国家: 美国
• 起止时间: 2015-09-01 至 2019-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=1535887&HistoricalAwards=false
• 关键词: AitF; EXPL; Wide; area; Dissemination

Many new Internet applications have extremely strict reliability and timeliness constraints. For example, when trying to remotely manipulate an object (such as in remote robotic surgery), in order to provide seamless feedback the connection needs to be essentially uninterrupted and have delay of at most 130 ms. One way of achieving this is to build an overlay network: a small number of computers, strategically positioned in datacenters around the world, which communicate with each other over the Internet in a way designed to improve reliability while maintaining timeliness.This project seeks to provide timeliness and reliability by sending messages over a select subset of the network, rather than along the best path, and to select subsets that are cost-effective. Successfully designing such techniques will enable applications that require timely, reliable service, well beyond what the current state-of-the-art can provide over the Internet. In addition to the practical benefits, this research will also significantly improve our understanding of the theory of overlay networks and network design: existing algorithms and techniques do not give the strong guarantees that are required, so we will need to develop both new algorithms and new mathematical tools to analyze these algorithms. Hence this research will also have significant impact on the state of the art in the mathematics and theory of networking.This project will develop new theory and a practical architecture for resilient routing. There has since been extensive work on designing approximation algorithms for related reliability-under-random-faults problems, as well as studying them for specific graph classes. However, there has been almost no work on the network design versions of these problems, which form the theoretical aspects of this proposal. Thus the results of this work will be a significant step forward in fault-tolerant network design. Moreover, the proposed research will advance the understanding of how to model practical networking problems and how to translate theoretical solutions into concrete systems, by evaluating solutions developed under different levels of abstraction in a fully realistic setting.

许多新的互联网应用都有极其严格的可靠性和及时性约束。 例如，当尝试远程操纵对象时（例如在远程机器人手术中），为了提供无缝反馈，连接需要基本上不间断，并且延迟最多为 130 毫秒。实现这一目标的一种方法是建立一个覆盖网络：少量计算机，战略性地分布在世界各地的数据中心，它们通过互联网相互通信，旨在提高可靠性，同时保持及时性。该项目旨在提供通过通过网络的选定子集而不是沿着最佳路径发送消息来确保及时性和可靠性，并选择具有成本效益的子集。成功设计此类技术将使需要及时、可靠服务的应用程序成为可能，这远远超出了当前最先进的互联网所能提供的服务。除了实际的好处外，这项研究还将显着提高我们对覆盖网络理论和网络设计的理解：现有的算法和技术不能提供所需的强有力的保证，因此我们需要开发新的算法和新的技术。分析这些算法的数学工具。 因此，这项研究也将对网络数学和理论的最新技术产生重大影响。该项目将为弹性路由开发新的理论和实用的架构。此后，人们在设计相关随机故障可靠性问题的近似算法以及针对特定图类研究它们方面开展了大量工作。 然而，几乎没有关于这些问题的网络设计版本的工作，这些问题构成了该提案的理论方面。 因此，这项工作的结果将是容错网络设计向前迈出的重要一步。此外，所提出的研究将通过评估在完全现实的环境中不同抽象级别下开发的解决方案，增进对如何对实际网络问题进行建模以及如何将理论解决方案转化为具体系统的理解。