Optimal design of service overlay networks

Antonio Capone, J. Elias, F. Martignon
{"title":"Optimal design of service overlay networks","authors":"Antonio Capone, J. Elias, F. Martignon","doi":"10.1109/ITNEWS.2008.4488128","DOIUrl":null,"url":null,"abstract":"Service Overlay Networks (SONs) are currently one of the most promising architectures envisioned to provide end-to- end Quality of Service guarantees in the Internet, without requiring significant changes to the underlying network infrastructure. A SON is an application-layer network operated by a third- party Internet Service Provider (ISP) that owns a set of overlay nodes, residing in the underlying ISP domains, interconnected by overlay links. The deployment of a SON can be a capital-intensive investment, and hence its planning requires careful decisions, including the overlay nodes' placement, the capacity provisioning of overlay links as well as of access links that connect the end-users to the SON infrastructure. In this paper we propose two novel optimization models for the planning of Service Overlay Networks which aim to select the number and positions of overlay nodes, as well as the capacity reserved for each overlay link, while taking into account in an accurate way traffic routing. The first model minimizes the SON installation cost while providing full coverage to all network's users. The second model maximizes the SON revenue by further choosing which users to serve, based on the expected gain, and taking into consideration budget constraints that the SON operator could specify. We provide the optimal solutions of the proposed problem formulations on a set of realistic-size instances and discuss the effect of different parameters on the characteristics of the planned networks.","PeriodicalId":255580,"journal":{"name":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","volume":"305 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITNEWS.2008.4488128","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

Service Overlay Networks (SONs) are currently one of the most promising architectures envisioned to provide end-to- end Quality of Service guarantees in the Internet, without requiring significant changes to the underlying network infrastructure. A SON is an application-layer network operated by a third- party Internet Service Provider (ISP) that owns a set of overlay nodes, residing in the underlying ISP domains, interconnected by overlay links. The deployment of a SON can be a capital-intensive investment, and hence its planning requires careful decisions, including the overlay nodes' placement, the capacity provisioning of overlay links as well as of access links that connect the end-users to the SON infrastructure. In this paper we propose two novel optimization models for the planning of Service Overlay Networks which aim to select the number and positions of overlay nodes, as well as the capacity reserved for each overlay link, while taking into account in an accurate way traffic routing. The first model minimizes the SON installation cost while providing full coverage to all network's users. The second model maximizes the SON revenue by further choosing which users to serve, based on the expected gain, and taking into consideration budget constraints that the SON operator could specify. We provide the optimal solutions of the proposed problem formulations on a set of realistic-size instances and discuss the effect of different parameters on the characteristics of the planned networks.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
业务覆盖网络的优化设计
服务覆盖网络(SONs)是目前最有前途的体系结构之一,它被设想为在Internet中提供端到端服务质量保证,而不需要对底层网络基础设施进行重大更改。SON是由第三方互联网服务提供商(ISP)运营的应用层网络,该网络拥有一组位于底层ISP域中的覆盖节点,通过覆盖链路相互连接。SON的部署可能是一项资本密集型投资,因此其规划需要仔细决策,包括覆盖节点的放置、覆盖链路的容量供应以及将最终用户连接到SON基础设施的访问链路。本文提出了两种新的服务覆盖网络规划优化模型,其目的是选择覆盖节点的数量和位置,以及为每条覆盖链路保留的容量,同时准确地考虑流量路由。第一种模式最大限度地降低了SON的安装成本,同时为所有网络用户提供全面覆盖。第二个模型根据预期收益,并考虑到SON运营商可能指定的预算限制,进一步选择服务的用户,从而使SON收益最大化。我们在一组实际尺寸的实例上给出了所提出问题公式的最优解,并讨论了不同参数对规划网络特性的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A push-based scheduling algorithm for large scale P2P live streaming Novel traffic engineering scheme based upon application flows for QoS enhancement Quality of provisioning as an OPEX-related issue in research networks Coping with distributed monitoring of QoS-enabled heterogeneous networks Multi-chip multicast schedulers in input-queued switches
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1