基于抢占感知的diffserver /MPLS网络选路算法

Yu-Kung Ke, Zhang Lin, Hui-min Zhang
{"title":"基于抢占感知的diffserver /MPLS网络选路算法","authors":"Yu-Kung Ke, Zhang Lin, Hui-min Zhang","doi":"10.1109/IPOM.2004.1547604","DOIUrl":null,"url":null,"abstract":"In a multi-service network in which multiple classes with different priorities and different QoS requirements exist, preemption is an efficient mechanism for bandwidth allocation and management. By considering preemption-related information in the path selection procedure, we can minimize rerouting and improve network stability. In this paper, we propose a preemption-aware bandwidth-constrained path selection algorithm for DiffServ-enabled MPLS networks. The basic idea is that the available resource reservation information of lower priority LSPs, i.e. the bandwidth to be preempted and the affected highest priority level, is introduced in the path selection. Simulations show that our proposed algorithm can achieve preemption minimization as well as load balancing, and efficiently improve overall network performance.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A preemption-aware path selection algorithm for DiffServ/MPLS networks\",\"authors\":\"Yu-Kung Ke, Zhang Lin, Hui-min Zhang\",\"doi\":\"10.1109/IPOM.2004.1547604\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In a multi-service network in which multiple classes with different priorities and different QoS requirements exist, preemption is an efficient mechanism for bandwidth allocation and management. By considering preemption-related information in the path selection procedure, we can minimize rerouting and improve network stability. In this paper, we propose a preemption-aware bandwidth-constrained path selection algorithm for DiffServ-enabled MPLS networks. The basic idea is that the available resource reservation information of lower priority LSPs, i.e. the bandwidth to be preempted and the affected highest priority level, is introduced in the path selection. Simulations show that our proposed algorithm can achieve preemption minimization as well as load balancing, and efficiently improve overall network performance.\",\"PeriodicalId\":197627,\"journal\":{\"name\":\"2004 IEEE International Workshop on IP Operations and Management\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2004 IEEE International Workshop on IP Operations and Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPOM.2004.1547604\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 IEEE International Workshop on IP Operations and Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPOM.2004.1547604","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

在多业务网络中,存在多个具有不同优先级和不同QoS要求的类,抢占是一种有效的带宽分配和管理机制。通过在路径选择过程中考虑抢占相关信息,可以最大限度地减少重路由,提高网络的稳定性。在本文中,我们提出了一种支持diffserv的MPLS网络的抢占感知带宽约束路径选择算法。其基本思想是在路径选择中引入低优先级lsp的可用资源预留信息,即要抢占的带宽和受影响的最高优先级。仿真结果表明,该算法能够实现抢占最小化和负载均衡,有效提高网络整体性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A preemption-aware path selection algorithm for DiffServ/MPLS networks
In a multi-service network in which multiple classes with different priorities and different QoS requirements exist, preemption is an efficient mechanism for bandwidth allocation and management. By considering preemption-related information in the path selection procedure, we can minimize rerouting and improve network stability. In this paper, we propose a preemption-aware bandwidth-constrained path selection algorithm for DiffServ-enabled MPLS networks. The basic idea is that the available resource reservation information of lower priority LSPs, i.e. the bandwidth to be preempted and the affected highest priority level, is introduced in the path selection. Simulations show that our proposed algorithm can achieve preemption minimization as well as load balancing, and efficiently improve overall network performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信