NeTS-NBD: Illuminating Congestion Control: Analytical Guidance and Practical Implementations

网络拥塞控制和避免的有效方法对于在具有共享资源的时变网络（例如当前的因特网）上运行的不同应用的成功共存是重要的。 具体地，拥塞控制和避免方法管理通过网络发送分组的应用调整其发送比特率的手段，以便避免或对以丢失分组、增加的分组传输延迟或来自内部网络路由器的明确拥塞警告的形式的网络拥塞指示符作出反应。 显然，在不同应用都共享相同网络资源的情况下，需要允许网络资源的有效和公平分配而不需要用于确定分配的集中机构的拥塞控制方法。 该研究为拥塞控制的分析和设计提供了一种新的方法。 通过使用网络演算的概念，这不会强加过于严格的建模假设的交通和服务流行的随机建模方法，这项研究将提供新的分析指导和实用的方法拥塞控制。 通过使用最近开发的方法来处理反馈时变延迟，最优拥塞控制器为不同的基于延迟的拥塞避免控制目标，可以得出。 初步结果表明，近似的某个最佳非因果控制器提供了更好的吞吐量或公平性比任何其他现有的基于延迟的计划。 在这项初步工作的基础上，研究人员将研究窗口和可变比特率控制器的基于延迟的拥塞避免的基本问题，以可以近似的最佳控制器的形式提供分析指导，从而实现实际应用。 此外，研究将探讨联合使用的延迟和数据包丢失/标记反馈一起在拥塞控制上下文中。 这将最终导致考虑在网络演算框架内的拥塞窗口控制器和主动队列管理方法的联合设计。 由于基于网络演算的控制器必须近似，控制参数估计的问题将在统计信号处理的范围内考虑。更广泛的影响：这项研究将在迈阿密大学进行，该大学被公认为西班牙裔服务机构和中学后少数民族机构，这意味着调查人员将能够让代表性不足的少数民族参与他们的努力，以整合研究和教育。

Effective methods of network congestion control and avoidance are important for the successful co-existence of different applications running on a time-varying network with shared resources such as the current Internet. In particular, congestion control and avoidance methods govern the means by which an application sending packets across a network adjusts its sending bit-rate in order to avoid or react to network congestion indicators in the form of lost packets, increased packet transport delay, or explicit congestion warnings from internal network routers. Clearly, with different applications all sharing the same network resources, congestion control methods that allow for the efficient and fair allocation of network resources without requiring a centralized authority for determining the allocations are needed. This research takes a new approach to the analysis and design of congestion control. Through the use of network calculus notions, which do not impose overly restrictive modeling assumptions on traffic and service endemic in stochastic modeling approaches, this research will provide new analytical guidance and practical methods for congestion control. Through the use of recently developed methods for handling feedback with time-variant delays, optimal congestion controllers for different delay-based congestion avoidance control objectives can be derived. Preliminary results indicate that an approximation of a certain optimal non-causal controller provides better throughput or fairness than any other existing delay-based scheme. Building upon this preliminary work, the investigators will examine the basic problem of delay-based congestion avoidance for both window and variable bit-rate controllers, providing analytical guidance in the form of optimal controllers that can be approximated, leading to practical implementations. In addition, the research will explore the joint use of both delay and packet loss/marking feedback together within a congestion control context. This will ultimately lead to the consideration of the joint design of congestion window controllers and active queue management methods within the network calculus framework. As the network calculus based controllers must be approximated, the issue of control parameter estimation will be considered within a statistical signal processing context. Broader Impact: This research will be performed at the University of Miami, which is recognized as a Hispanic Serving Institution and Postsecondary Minority Institution, meaning that the investigators will be able to involve underrepresented minorities in their efforts to integrate research and education.