CAREER: Integrated Traffic Management Based on Accurate and Practical Packet Fair Queueing Algorithms

多种网络服务包括保证实时服务、预测实时服务和尽力而为服务。虽然针对每个单独的服务设计流量管理算法已经有了广泛的研究，但目前还不清楚这些算法如何集成到一个网络中，以及它们如何相互作用。当网络还需要支持链路共享时，这个问题变得更加复杂，链路共享允许在需要不同网络服务但属于同一管理类的应用程序之间共享资源。 在交换节点的服务纪律，它决定了数据包的服务顺序，在控制不同的业务流，不同的服务类别，和不同的链路共享类之间的相互作用发挥了关键作用。假设的流体公平分配（FFQ）规则可以根据预先指定的服务份额同时服务于多个业务流，提供了一个理想的框架来集成针对不同服务和链路共享的业务管理算法。由于FFQ使用了一个理想化的流体模型，无法在现实世界中实现，因此需要分组公平分配（PFQ）算法来近似其行为。以前提出的PFQ算法，包括最流行的加权公平分配都引入了大量的近似FFQ的不准确性，这显着影响流量管理和链路共享算法。目前还不清楚是否存在精确的PFQ，如果存在，它们是否足够简单，可以高速实现。 本研究的目标是证明，准确和实用的PFQ算法可以设计，他们提供了一个框架下，不同的服务和链路共享的流量管理算法可以支持在一个集成的方式的基础。（B）将不同的流量管理算法和链路共享集成到一个框架中的问题，以及PFQ算法的准确性与链路共享和流量管理算法的效率之间的基本权衡;（d）接纳控制算法，用于不仅在速率成比例而且在一般资源分配下使用PFQ算法来提供端到端性能保证; e）更灵活的实时业务，如基于PFQ算法的重协商业务和速率自适应业务。 该研究是通过分析，模拟和实施相结合。这项工作的结果将有一个显着的影响，在互联网和ATM环境中的综合业务管理算法的设计。

Multiple network services include guaranteed real-time service, predicted real-time service, and best-effort service. While there has been extensive research on designing traffic management algorithms for each individual service, it is unclear how these algorithms can be integrated into one network and how they will interact with each other. This problem becomes more complex when the network also needs to support link-sharing, which allows resource sharing among applications that require different network services but belong to the same administrative class. The service disciplines at the switching nodes, which determine the order in which packets are serviced, play a critical role in controlling the interactions among different traffic streams, different service classes, and different link sharing classes. The hypothetical Fluid Fair Queueing (FFQ) discipline, which can serve multiple traffic streams simultaneously according to pre-specified service shares, provides an ideal framework to integrate traffic management algorithms for different services and link sharing. Since FFQ uses an idealized fluid model that cannot be implemented in the real-world, Packet Fair Queueing (PFQ) algorithms are needed to approximate its behavior. Previously proposed PFQ algorithms including the most popular Weighted Fair Queueing all introduce substantial inaccuracy in approximating FFQ, which significantly affects traffic management and link sharing algorithms. It is unclear whether accurate PFQ's exist, and if they do, whether they can be simple enough to be implementable at high speed. The goal of this research is to demonstrate that accurate and practical PFQ algorithms can be designed and that they provide the foundation for a framework under which traffic management algorithms for different services and link sharing can be supported in an integrated fashion. Aspects treated include (a) the fundamental tradeoff between complexity and accuracy of PFQ algorithms; (b) issues in integrating different traffic management algorithms and link-sharing into one framework and fundamental tradeoffs between accuracy of PFQ algorithms and the efficiency of link-sharing and traffic management algorithms; (d) admission control algorithms for providing end-to-end performance guarantees using PFQ algorithms under not only rate-proportional but also general resource assignments; e) more flexible real-time services such as renegotiated service and rate-adaptive service based on PFQ algorithms. The study is conducted via a combination of analysis, simulation, and implementation. The results of this work will have a significant impact on the design of integrated traffic management algorithms in both the Internet and ATM environments.