ITR: Routing of Dynamic Service Level Agreements between Inter-domain Bandwidth Brokers

本研究计划旨在探讨在下一代网际网路的差异化服务领域中几个尚未解决的问题。特别是，在存在多个可选物理路径的情况下路由sla的问题是一个很少被研究的主题。这是一个重要的问题，因为目标是在不选择过度供应的情况下最大化SLA成功的可能性。此外，在存在多条物理路径的情况下（这在大型网络中很常见），需要根据适当的标准选择最优路径。拟议的研究直接解决了这一关键问题。目前，分级QoS路由还没有标准的方案。分层QoS路由中最关键的问题之一是如何在网络状态信息过期或过时的情况下做出智能决策。本研究将利用在每个路由器上收集的本地统计数据，并获得网络状态信息的时间历史来解决这一问题。此外，每个域都有有限的流量处理能力。该容量受域拓扑和最大链路带宽的限制。对于可行路径的计算，目前的QoS路由方案只考虑单个链路带宽作为约束，而不考虑整个域的容量。本研究将在路径计算算法中加入域容量作为约束来解决这一缺陷。此外，本研究也将以最大限度地利用领域资源为目标，研究运输域中聚合流的分割问题。其动机来自这样一个事实，即对聚合流进行拆分将导致更好地利用网络带宽。

This proposed research project aims to explore several unanswered questions in the area of differentiated services for next generation Internet. In particular, the issue of routing SLAs in the presence of multiple alternative physical paths is a topic that has been seldom researchedupon. It is an important issue since the objective is to maximize the probability of success for an SLA without opting for over-provisioning. Also, in the presence of multiple physical paths, which is typical in large networks, there is a need to choose the optimal path based on appropriate criteria. The proposed research directly addresses this critical issue. Currently, there are no standard schemes for hierarchical QoS routing. One of the most crucial problems in hierarchical QoS routing is to make intelligent decisions in the presence of out-of-date or stale network stateinformation. The proposed research will address this issue by making use of local statistics collected at each router and obtaining a time history of the network state information. Furthermore, every domain will have a finite traffic handling capacity. This capacity is bound above by the domain topology and the maximum link bandwidth. For computing feasible paths, current QoS routing schemes take only the individual link bandwidth into account as a constraint but not the domain capacity as a whole. The research will address this shortcoming by incorporating the domain capacity as a constraint in the path computation algorithms. Additionally, this research project will also study the problem of splitting aggregated flows in a transit domain with the goal of maximizing the domain resource utilization. The motivation comes from the fact that splitting of aggregated flows will lead to better utilization of the network bandwidth.