Topology Design of Service Overlay Network with a Generalized Cost Model

Ling Zhou, Arunabha Sen
{"title":"Topology Design of Service Overlay Network with a Generalized Cost Model","authors":"Ling Zhou, Arunabha Sen","doi":"10.1109/GLOCOM.2007.22","DOIUrl":null,"url":null,"abstract":"Service Overlay Network (SON) was proposed to alleviate the difficulties encountered in providing end-to-end Quality of Service (QoS) guarantees. SON is able to provide QoS guarantees by purchasing bandwidth from individual network domains and building a logical end-to-end data delivery infrastructure on top of the existing Internet. We focus on SON topology design problems under a generalized cost model. Earlier research in this topic considered two distinct cost models - fixed (leased) cost model and variable (usage-based) cost model. However in most applications, the costs of both nodes and links have a fixed component as well as a variable component that often depends on usage. Our generalized cost model takes this fact into account and our topology design algorithm uses this cost model to And the optimal topology. Since the SON topology design problem is NP-complete, we provide approximation algorithm with guaranteed performance bound. We validate the effectiveness of our algorithm through extensive simulation.","PeriodicalId":370937,"journal":{"name":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2007.22","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

Abstract

Service Overlay Network (SON) was proposed to alleviate the difficulties encountered in providing end-to-end Quality of Service (QoS) guarantees. SON is able to provide QoS guarantees by purchasing bandwidth from individual network domains and building a logical end-to-end data delivery infrastructure on top of the existing Internet. We focus on SON topology design problems under a generalized cost model. Earlier research in this topic considered two distinct cost models - fixed (leased) cost model and variable (usage-based) cost model. However in most applications, the costs of both nodes and links have a fixed component as well as a variable component that often depends on usage. Our generalized cost model takes this fact into account and our topology design algorithm uses this cost model to And the optimal topology. Since the SON topology design problem is NP-complete, we provide approximation algorithm with guaranteed performance bound. We validate the effectiveness of our algorithm through extensive simulation.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于广义成本模型的业务覆盖网络拓扑设计
服务覆盖网络(SON)的提出是为了缓解在提供端到端服务质量(QoS)保证方面遇到的困难。SON能够通过从单个网络域购买带宽并在现有Internet之上构建逻辑端到端数据传输基础设施来提供QoS保证。我们主要研究广义成本模型下的SON拓扑设计问题。这一主题的早期研究考虑了两种不同的成本模型——固定(租赁)成本模型和可变(基于使用)成本模型。然而,在大多数应用程序中,节点和链接的成本都有固定组件和可变组件,后者通常取决于使用情况。我们的广义成本模型考虑了这一事实,我们的拓扑设计算法使用该成本模型来确定最优拓扑。由于SON拓扑设计问题是np完全的,我们提供了具有保证性能界的近似算法。我们通过大量的仿真验证了算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Soft Combination and Detection for Cooperative Spectrum Sensing in Cognitive Radio Networks A Multiuser Detection Perspective on Medium Access Control in Ad Hoc Networks Fast ML Decoding of SPC Product Code by Linear Programming Decoding Theoretical Lower Bound for UWB TDOA Positioning The Design and Analysis of Protocol Sequences for Robust Wireless Accessing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1