CAIP:基于diffserver感知的MPLS流量工程的恢复路由体系结构

Fahad R. Dogar, Z. Uzmi, Shahab Baqai
{"title":"CAIP:基于diffserver感知的MPLS流量工程的恢复路由体系结构","authors":"Fahad R. Dogar, Z. Uzmi, Shahab Baqai","doi":"10.1109/DRCN.2005.1563843","DOIUrl":null,"url":null,"abstract":"The authors proposed an architecture for MPLS restoration routing of DiffServ traffic. This architecture, namely per class aggregate information with preemption (CAIP), facilitates provisioning of two key QoS features for multimedia traffic: prioritized guaranteed bandwidth and fast restoration in the event of an element failure. The CAIP architecture is scalable and requires propagating only per-class aggregate link usage information; such information can be readily piggybacked on link state routing packets using traffic engineering extensions to link state routing protocols (Katz et. al). CAIP results in improved bandwidth sharing compared to simple aggregate information scenario (SAIS), resulting in fewer LSP rejected requests and a greater amount of active bandwidth placed on the network. On average, CAIP rejects 881 LSP requests compared to 1010 rejected LSP requests in SAIS for a typical ISP network. Similarly, CAIP is able to place 220 units of bandwidth compared to 180 units of bandwidth placed in SAIS, thus showing an average improvement of about 22%. CAIP allows precise computation of preemptable bandwidth for an arbitrary set of prioritization requirements put forth by the service providers. A case study of service provider requirements and computation of preemptable bandwidth for those requirements were presented. CAIP can be integrated with those restoration routing schemes that make use of propagating aggregate link usage information. Furthermore, existing preemption schemes can be used with CAIP in order to decide the actual LSPs which need to be preempted.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"CAIP: a restoration routing architecture for DiffServ aware MPLS traffic engineering\",\"authors\":\"Fahad R. Dogar, Z. Uzmi, Shahab Baqai\",\"doi\":\"10.1109/DRCN.2005.1563843\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors proposed an architecture for MPLS restoration routing of DiffServ traffic. This architecture, namely per class aggregate information with preemption (CAIP), facilitates provisioning of two key QoS features for multimedia traffic: prioritized guaranteed bandwidth and fast restoration in the event of an element failure. The CAIP architecture is scalable and requires propagating only per-class aggregate link usage information; such information can be readily piggybacked on link state routing packets using traffic engineering extensions to link state routing protocols (Katz et. al). CAIP results in improved bandwidth sharing compared to simple aggregate information scenario (SAIS), resulting in fewer LSP rejected requests and a greater amount of active bandwidth placed on the network. On average, CAIP rejects 881 LSP requests compared to 1010 rejected LSP requests in SAIS for a typical ISP network. Similarly, CAIP is able to place 220 units of bandwidth compared to 180 units of bandwidth placed in SAIS, thus showing an average improvement of about 22%. CAIP allows precise computation of preemptable bandwidth for an arbitrary set of prioritization requirements put forth by the service providers. A case study of service provider requirements and computation of preemptable bandwidth for those requirements were presented. CAIP can be integrated with those restoration routing schemes that make use of propagating aggregate link usage information. Furthermore, existing preemption schemes can be used with CAIP in order to decide the actual LSPs which need to be preempted.\",\"PeriodicalId\":415896,\"journal\":{\"name\":\"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DRCN.2005.1563843\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DRCN.2005.1563843","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

提出了一种用于diffserver流量MPLS恢复路由的体系结构。这种架构,即带抢占的每类聚合信息(CAIP),有助于为多媒体流量提供两个关键的QoS特性:优先保证带宽和元素故障时的快速恢复。CAIP体系结构是可伸缩的,只需要传播每个类的聚合链接使用信息;这些信息可以很容易地搭载在链路状态路由数据包上,使用流量工程扩展到链路状态路由协议(Katz等)。与SAIS (simple aggregate information scenario)方案相比,CAIP方案改善了带宽共享,减少了LSP拒绝请求,增加了网络上的活动带宽。在典型ISP网络中,CAIP平均拒绝881个LSP请求,而SAIS平均拒绝1010个LSP请求。同样,CAIP能够放置220个单位的带宽,而SAIS放置180个单位的带宽,因此显示出大约22%的平均改进。CAIP允许为服务提供商提出的任意一组优先级要求精确计算可抢占带宽。给出了服务提供商需求的实例研究和针对这些需求的可抢占带宽的计算。CAIP可以与那些利用传播聚合链路使用信息的恢复路由方案集成。此外,现有的抢占方案可以与CAIP一起使用,以确定实际需要抢占的lsp。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
CAIP: a restoration routing architecture for DiffServ aware MPLS traffic engineering
The authors proposed an architecture for MPLS restoration routing of DiffServ traffic. This architecture, namely per class aggregate information with preemption (CAIP), facilitates provisioning of two key QoS features for multimedia traffic: prioritized guaranteed bandwidth and fast restoration in the event of an element failure. The CAIP architecture is scalable and requires propagating only per-class aggregate link usage information; such information can be readily piggybacked on link state routing packets using traffic engineering extensions to link state routing protocols (Katz et. al). CAIP results in improved bandwidth sharing compared to simple aggregate information scenario (SAIS), resulting in fewer LSP rejected requests and a greater amount of active bandwidth placed on the network. On average, CAIP rejects 881 LSP requests compared to 1010 rejected LSP requests in SAIS for a typical ISP network. Similarly, CAIP is able to place 220 units of bandwidth compared to 180 units of bandwidth placed in SAIS, thus showing an average improvement of about 22%. CAIP allows precise computation of preemptable bandwidth for an arbitrary set of prioritization requirements put forth by the service providers. A case study of service provider requirements and computation of preemptable bandwidth for those requirements were presented. CAIP can be integrated with those restoration routing schemes that make use of propagating aggregate link usage information. Furthermore, existing preemption schemes can be used with CAIP in order to decide the actual LSPs which need to be preempted.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信