AitF: Full: Algorithms and Probabilistic Semantics for Next-Generation Networks

许多计算机网络中的一个共同目标是平衡多条路径上的流量，以便提高吞吐量、减少拥塞并实现更高的利用率。尽管有大量的理论文献说明如何通过容量有限的网络最好地路由流量，但现在的大多数网络都依赖于易于实施但在实践中并不总是表现良好的方案。这在一定程度上是由于研究高级路由方案的理论研究人员社区和设计、构建和运营网络的系统研究人员社区之间的差距。该项目将通过开发可以在现有硬件上实现的不经意和半不经意的路由算法来推动路由的理论和实践。这项研究的智力价值在于设计了基于概率语义的新的编程语言，可以用来表达和推理这些算法，并基于软件定义的网络平台对这些语言进行工程实现。该项目将产生广泛的社会影响，因为它生产的工具有助于在简化网络管理的同时提高网络的可靠性和效率。

A common objective in many computer networks is to balance traffic across multiple paths in order to improve throughput, reduce congestion, and achieve higher utilization. Although there is an extensive theoretical literature on how best to route traffic through a capacitated network, most networks today rely on schemes that are easy to implement but do not always perform well in practice. This is due, in part, to the gap between the community of theory researchers who study advanced routing schemes and the community of systems researchers who design, build, and operate networks.This project will advance the theory and practice of routing by developing oblivious and semi-oblivious routing algorithms that can be implemented on top of current hardware. The intellectual merit of this research lies in designing new programming languages based on probabilistic semantics that can be used to express and reason about these algorithms, and engineering implementations for these languages based on software-defined networking platforms. This project will have broad impact on society by producing tools that could help to make networks more reliable and efficient while simplifying network management.