Optimizing Long-Lived CloudNets with Migrations

Gregor Schaffrath, S. Schmid, A. Feldmann
{"title":"Optimizing Long-Lived CloudNets with Migrations","authors":"Gregor Schaffrath, S. Schmid, A. Feldmann","doi":"10.1109/UCC.2012.7","DOIUrl":null,"url":null,"abstract":"This paper attends to the problem of embedding flexibly specified virtual networks connecting cloud resources (e.g, storage or computation) on a given substrate (e.g., a data center, an ISP backbone, a router site, or a virtual provider network). We study a scenario where a substrate provider (or a potential intermediate broker or reseller) wants to optimize the embedding of these so-called CloudNets by migrating them to more suitable locations. For instance, such re-embeddings can be useful if the CloudNets were requested at short notice and initially placed heuristically. Subsequent optimizations can, e.g., reduce the peak resource loads in the network by spreading CloudNets across the infrastructure or save energy by moving CloudNets together and switching off unused components. We present the generic mathematical programming algorithm used in our CloudNet prototype to compute optimal embeddings. For example, this algorithm supports different objective functions (such as load minimization or energy conservation), arbitrary resource combinations and the mapping of multiple virtual nodes of a CloudNet to a single substrate node, cost-aware migrations, and it can deal with all link types that arise in practice (e.g., fullduplex or even wireless or wired broadcast links with multiple endpoints). Of course, such rigorous CloudNet optimizations are time consuming, and we report on the time complexities obtained from our experiments with our network virtualization prototype architecture. It turns out that optimizing CloudNets over moderate sized infrastructures is feasible, even for scenarios with high flexibility and without tuning the solver software to speed up computations further.","PeriodicalId":122639,"journal":{"name":"2012 IEEE Fifth International Conference on Utility and Cloud Computing","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"53","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Fifth International Conference on Utility and Cloud Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UCC.2012.7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 53

Abstract

This paper attends to the problem of embedding flexibly specified virtual networks connecting cloud resources (e.g, storage or computation) on a given substrate (e.g., a data center, an ISP backbone, a router site, or a virtual provider network). We study a scenario where a substrate provider (or a potential intermediate broker or reseller) wants to optimize the embedding of these so-called CloudNets by migrating them to more suitable locations. For instance, such re-embeddings can be useful if the CloudNets were requested at short notice and initially placed heuristically. Subsequent optimizations can, e.g., reduce the peak resource loads in the network by spreading CloudNets across the infrastructure or save energy by moving CloudNets together and switching off unused components. We present the generic mathematical programming algorithm used in our CloudNet prototype to compute optimal embeddings. For example, this algorithm supports different objective functions (such as load minimization or energy conservation), arbitrary resource combinations and the mapping of multiple virtual nodes of a CloudNet to a single substrate node, cost-aware migrations, and it can deal with all link types that arise in practice (e.g., fullduplex or even wireless or wired broadcast links with multiple endpoints). Of course, such rigorous CloudNet optimizations are time consuming, and we report on the time complexities obtained from our experiments with our network virtualization prototype architecture. It turns out that optimizing CloudNets over moderate sized infrastructures is feasible, even for scenarios with high flexibility and without tuning the solver software to speed up computations further.
通过迁移优化长寿命的云网络
本文关注在给定的基板(如数据中心、ISP骨干网、路由器站点或虚拟提供商网络)上嵌入灵活指定的连接云资源(如存储或计算)的虚拟网络的问题。我们研究了一个场景,其中一个底层提供商(或潜在的中间代理或经销商)希望通过将这些所谓的CloudNets迁移到更合适的位置来优化它们的嵌入。例如,如果CloudNets在短时间内被请求并且最初是启发式地放置,这种重新嵌入可能是有用的。后续的优化可以,例如,通过在基础设施中分散CloudNets来减少网络中的峰值资源负载,或者通过将CloudNets一起移动并关闭未使用的组件来节省能源。我们提出了在我们的CloudNet原型中使用的通用数学规划算法来计算最优嵌入。例如,该算法支持不同的目标函数(如负载最小化或节能),任意资源组合和将CloudNet的多个虚拟节点映射到单个基板节点,成本感知迁移,并且它可以处理在实践中出现的所有链路类型(例如,全双工甚至具有多个端点的无线或有线广播链路)。当然,这种严格的CloudNet优化非常耗时,我们报告了使用网络虚拟化原型体系结构进行实验所获得的时间复杂度。事实证明,在中等规模的基础设施上优化CloudNets是可行的,即使对于具有高灵活性的场景,也不需要调整求解器软件来进一步加快计算速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信