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 ms的延迟。实现这一点的一种方式是构建覆盖网络：少量的计算机，战略性地放置在世界各地的计算机中心，这些网络在因特网上相互通信，在保持及时性的同时提高可靠性。本项目力求通过在选定的网络子集上而不是沿着最佳路径发送消息，并选择具有成本效益的子集，来提供及时性和可靠性。成功地设计这样的技术将使应用程序需要及时，可靠的服务，远远超出了目前的最先进的可以提供的互联网。除了实际的好处，这项研究也将显着提高我们的理解理论的覆盖网络和网络设计：现有的算法和技术不给所需的强有力的保证，所以我们将需要开发新的算法和新的数学工具来分析这些算法。 因此，这项研究也将有显着的影响，在最先进的数学和理论的网络。这个项目将开发新的理论和实用架构的弹性路由。从那时起，已经有大量的工作设计近似算法相关的可靠性下的随机故障问题，以及研究它们的特定图形类。 然而，几乎没有工作的网络设计版本的这些问题，形成了这个建议的理论方面。 因此，这项工作的结果将是一个重要的一步，在容错网络设计。此外，拟议的研究将推进如何模拟实际的网络问题，以及如何将理论解决方案转化为具体的系统，通过评估在完全现实的环境下不同层次的抽象开发的解决方案的理解。