考虑多个联盟的互联网端到端QoS路径计算

R. Jacquet, Géraldine Texier, Alberto Blanc
{"title":"考虑多个联盟的互联网端到端QoS路径计算","authors":"R. Jacquet, Géraldine Texier, Alberto Blanc","doi":"10.1109/NETWKS.2014.6959248","DOIUrl":null,"url":null,"abstract":"Value added services like VoIP, videoconferencing and IPTV need end-to-end Quality of Service (QoS) guarantees in order to work correctly. As the Internet is a collection of Autonomous Systems (AS), most of the time the communication endpoints belong to different ASes, so that all the ASes traversed by the communication must cooperate in order to offer end-to-end guarantees. Yet each AS is usually unwilling to disclose any detail about its internal network. To address this confidentiality issue we propose a system where each AS publishes a list of offers, specifying the QoS guarantees between its entry and exit points, without specifying anything else about its internal network. As proposed in several works, it is also possible for ASes to form alliances, which can be seen as “macro ASes” that publish the available offers between the entry and exit points of the alliance. In this paper we present ACQA, an algorithm that can find end-to-end paths satisfying given QoS constraints by combining the offers of several alliances and/or ASes.","PeriodicalId":410892,"journal":{"name":"2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Computing end-to-end QoS paths in the Internet considering multiple alliances\",\"authors\":\"R. Jacquet, Géraldine Texier, Alberto Blanc\",\"doi\":\"10.1109/NETWKS.2014.6959248\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Value added services like VoIP, videoconferencing and IPTV need end-to-end Quality of Service (QoS) guarantees in order to work correctly. As the Internet is a collection of Autonomous Systems (AS), most of the time the communication endpoints belong to different ASes, so that all the ASes traversed by the communication must cooperate in order to offer end-to-end guarantees. Yet each AS is usually unwilling to disclose any detail about its internal network. To address this confidentiality issue we propose a system where each AS publishes a list of offers, specifying the QoS guarantees between its entry and exit points, without specifying anything else about its internal network. As proposed in several works, it is also possible for ASes to form alliances, which can be seen as “macro ASes” that publish the available offers between the entry and exit points of the alliance. In this paper we present ACQA, an algorithm that can find end-to-end paths satisfying given QoS constraints by combining the offers of several alliances and/or ASes.\",\"PeriodicalId\":410892,\"journal\":{\"name\":\"2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NETWKS.2014.6959248\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NETWKS.2014.6959248","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

像VoIP、视频会议和IPTV这样的增值服务需要端到端的服务质量(QoS)保证才能正常工作。由于Internet是自治系统(As)的集合,大多数情况下通信端点属于不同的As,因此通信所遍历的所有As必须协作才能提供端到端的保证。然而,每个自治系统通常都不愿透露其内部网络的任何细节。为了解决这个机密性问题,我们提出了一个系统,其中每个AS发布一个报价列表,指定其入口点和出口点之间的QoS保证,而不指定有关其内部网络的任何其他内容。正如几部著作中提出的那样,ase也可以组成联盟,可以将其视为“宏观ase”,发布联盟入口点和出口点之间的可用报价。在本文中,我们提出了ACQA,一种通过组合几个联盟和/或ase的提供来找到满足给定QoS约束的端到端路径的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Computing end-to-end QoS paths in the Internet considering multiple alliances
Value added services like VoIP, videoconferencing and IPTV need end-to-end Quality of Service (QoS) guarantees in order to work correctly. As the Internet is a collection of Autonomous Systems (AS), most of the time the communication endpoints belong to different ASes, so that all the ASes traversed by the communication must cooperate in order to offer end-to-end guarantees. Yet each AS is usually unwilling to disclose any detail about its internal network. To address this confidentiality issue we propose a system where each AS publishes a list of offers, specifying the QoS guarantees between its entry and exit points, without specifying anything else about its internal network. As proposed in several works, it is also possible for ASes to form alliances, which can be seen as “macro ASes” that publish the available offers between the entry and exit points of the alliance. In this paper we present ACQA, an algorithm that can find end-to-end paths satisfying given QoS constraints by combining the offers of several alliances and/or ASes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信