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

该研究项目旨在探索下一代互联网区分服务领域中的几个悬而未决的问题。特别是，在存在多条可选物理路径的情况下路由SLA的问题一直是一个很少研究的话题。这是一个重要的问题，因为目标是在不选择过度配置的情况下最大化SLA的成功概率。此外，在大型网络中通常存在多条物理路径的情况下，需要根据适当的标准选择最佳路径。拟议的研究直接解决了这一关键问题。目前，还没有用于分层服务质量路由的标准方案。在分层服务质量路由中，最关键的问题之一是在网络状态信息过时或过时的情况下做出智能决策。建议的研究将通过使用在每个路由器收集的本地统计数据并获得网络状态信息的时间历史来解决这一问题。此外，每个域都将具有有限的流量处理能力。此容量受域拓扑和最大链路带宽的限制。在计算可行路径时，现有的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.