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

ITR：域间带宽代理之间动态服务级别协议的路由

• 批准号: 0219747
• 负责人: Raj Acharya
• 金额: $ 44.69万
• 依托单位: Pennsylvania State Univ University Park
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2002
• 资助国家: 美国
• 起止时间: 2002-09-15 至 2005-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0219747&HistoricalAwards=false
• 关键词: ITR; Routing; Dynamic; Service; Level

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.

该建议的研究项目旨在探索下一代互联网差异化服务领域的几个未解决问题。特别是，在存在多个替代物理路径的情况下，路由SLA的问题是很少研究的主题。这是一个重要的问题，因为目的是最大程度地提高SLA成功的可能性，而无需选择过度提供。同样，在大型网络中典型的多个物理路径的存在下，需要根据适当的标准选择最佳路径。拟议的研究直接解决了这个关键问题。当前，没有用于层次QoS路由的标准方案。层次QoS路由中最关键的问题之一是在存在过时或陈旧的网络状态信息的情况下做出明智的决策。拟议的研究将通过利用每个路由器收集的本地统计信息并获得网络状态信息的时间历史记录来解决此问题。此外，每个域都将具有有限的交通处理能力。该容量在域拓扑和最大链路带宽上方结合。为了计算可行的路径，当前的QoS路由方案仅将单个链路带宽视为约束，但不是整个域的容量。该研究将通过将域容量作为路径计算算法中的约束来解决这一缺点。此外，该研究项目还将研究在运输域中拆分聚合流的问题，目的是最大化域资源利用率。动机源于以下事实：汇总流的分裂将导致更好地利用网络带宽。