基于激励的离线跨域流量工程服务质量感知算法

Kin-ho Ho, G. Pavlou, M. Howarth, Ning Wang
{"title":"基于激励的离线跨域流量工程服务质量感知算法","authors":"Kin-ho Ho, G. Pavlou, M. Howarth, Ning Wang","doi":"10.1109/IPOM.2004.1547589","DOIUrl":null,"url":null,"abstract":"This paper focuses on incentive-based offline inter-AS traffic engineering with end-to-end quality of service (QoS) guarantees. We investigate a key inter-AS traffic engineering problem, the \"egress router selection problem\". The objective is to select an egress router for each expected aggregate inter-AS traffic flow so that the required end-to-end QoS is provided and the capacity constraint of each inter-AS link is met while minimizing the total inter-AS transit cost. The problem is NP-hard and we propose a genetic algorithm to solve it. Simulation results show that our proposed approach performs better than conventional greedy-based approaches.","PeriodicalId":197627,"journal":{"name":"2004 IEEE International Workshop on IP Operations and Management","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"An incentive-based quality of service aware algorithm for offline inter-AS traffic engineering\",\"authors\":\"Kin-ho Ho, G. Pavlou, M. Howarth, Ning Wang\",\"doi\":\"10.1109/IPOM.2004.1547589\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper focuses on incentive-based offline inter-AS traffic engineering with end-to-end quality of service (QoS) guarantees. We investigate a key inter-AS traffic engineering problem, the \\\"egress router selection problem\\\". The objective is to select an egress router for each expected aggregate inter-AS traffic flow so that the required end-to-end QoS is provided and the capacity constraint of each inter-AS link is met while minimizing the total inter-AS transit cost. The problem is NP-hard and we propose a genetic algorithm to solve it. Simulation results show that our proposed approach performs better than conventional greedy-based approaches.\",\"PeriodicalId\":197627,\"journal\":{\"name\":\"2004 IEEE International Workshop on IP Operations and Management\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"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.1547589\",\"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.1547589","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

摘要

本文主要研究基于激励的端到端服务质量保证的离线as间流量工程。我们研究了一个关键的as间流量工程问题,即“出口路由器选择问题”。目标是为每个预期的as间聚合流量选择一个出口路由器,以便提供所需的端到端QoS,并满足每个as间链路的容量约束,同时最小化as间的总传输成本。这个问题是np困难的,我们提出了一种遗传算法来解决它。仿真结果表明,该方法优于传统的基于贪婪的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An incentive-based quality of service aware algorithm for offline inter-AS traffic engineering
This paper focuses on incentive-based offline inter-AS traffic engineering with end-to-end quality of service (QoS) guarantees. We investigate a key inter-AS traffic engineering problem, the "egress router selection problem". The objective is to select an egress router for each expected aggregate inter-AS traffic flow so that the required end-to-end QoS is provided and the capacity constraint of each inter-AS link is met while minimizing the total inter-AS transit cost. The problem is NP-hard and we propose a genetic algorithm to solve it. Simulation results show that our proposed approach performs better than conventional greedy-based approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信