用于大规模分布式move服务的自治服务托管

B. V. D. Bossche, F. Turck, B. Dhoedt, P. Demeester
{"title":"用于大规模分布式move服务的自治服务托管","authors":"B. V. D. Bossche, F. Turck, B. Dhoedt, P. Demeester","doi":"10.1109/INM.2009.5188790","DOIUrl":null,"url":null,"abstract":"Massively Online Virtual Environments (MOVEs) have been gaining popularity for several years. Today, these complex networked applications are serving thousands of clients simultaneously. However, these MOVEs are typically hosted on specialized server clusters and rely on internal knowledge of the services to optimize the load balancing. This makes running MOVEs an expensive undertaking as it cannot be outsourced to third party hosting providers. This paper details two Integer Linear Programming approaches to optimize the MOVE deployment through load balancing and minimizing the delay experienced by the end-users. Optimization includes assigning MOVE components to resources and replication of components to increase the scalability. One approach assuming full application knowledge of a dedicated MOVE and one with no internal knowledge and geared toward a generic MOVE hosting platform. For both cases an optimizing heuristic is evaluated and the obtained results are compared.","PeriodicalId":332206,"journal":{"name":"2009 IFIP/IEEE International Symposium on Integrated Network Management","volume":"17 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Autonomic service hosting for large-scale distributed MOVE-services\",\"authors\":\"B. V. D. Bossche, F. Turck, B. Dhoedt, P. Demeester\",\"doi\":\"10.1109/INM.2009.5188790\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Massively Online Virtual Environments (MOVEs) have been gaining popularity for several years. Today, these complex networked applications are serving thousands of clients simultaneously. However, these MOVEs are typically hosted on specialized server clusters and rely on internal knowledge of the services to optimize the load balancing. This makes running MOVEs an expensive undertaking as it cannot be outsourced to third party hosting providers. This paper details two Integer Linear Programming approaches to optimize the MOVE deployment through load balancing and minimizing the delay experienced by the end-users. Optimization includes assigning MOVE components to resources and replication of components to increase the scalability. One approach assuming full application knowledge of a dedicated MOVE and one with no internal knowledge and geared toward a generic MOVE hosting platform. For both cases an optimizing heuristic is evaluated and the obtained results are compared.\",\"PeriodicalId\":332206,\"journal\":{\"name\":\"2009 IFIP/IEEE International Symposium on Integrated Network Management\",\"volume\":\"17 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 IFIP/IEEE International Symposium on Integrated Network Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INM.2009.5188790\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 IFIP/IEEE International Symposium on Integrated Network Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INM.2009.5188790","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

大规模在线虚拟环境(massive Online Virtual Environments, MOVEs)已经流行了好几年。如今,这些复杂的网络应用程序同时为数千个客户机提供服务。然而,这些move通常托管在专门的服务器集群上,并依赖于服务的内部知识来优化负载平衡。这使得运行MOVEs成为一项昂贵的工作,因为它不能外包给第三方托管提供商。本文详细介绍了两种整数线性规划方法,通过负载均衡和最小化最终用户所经历的延迟来优化MOVE部署。优化包括为资源分配MOVE组件和复制组件以提高可伸缩性。一种方法假定具有专用MOVE的全部应用程序知识,另一种方法不具备内部知识,并面向通用MOVE托管平台。对这两种情况进行了优化启发式评价,并对得到的结果进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Autonomic service hosting for large-scale distributed MOVE-services
Massively Online Virtual Environments (MOVEs) have been gaining popularity for several years. Today, these complex networked applications are serving thousands of clients simultaneously. However, these MOVEs are typically hosted on specialized server clusters and rely on internal knowledge of the services to optimize the load balancing. This makes running MOVEs an expensive undertaking as it cannot be outsourced to third party hosting providers. This paper details two Integer Linear Programming approaches to optimize the MOVE deployment through load balancing and minimizing the delay experienced by the end-users. Optimization includes assigning MOVE components to resources and replication of components to increase the scalability. One approach assuming full application knowledge of a dedicated MOVE and one with no internal knowledge and geared toward a generic MOVE hosting platform. For both cases an optimizing heuristic is evaluated and the obtained results are compared.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Policy-based self-management of wireless ad hoc networks A latency-aware algorithm for dynamic service placement in large-scale overlays A rule-based distributed system for self-optimization of constrained devices An efficient spectrum management mechanism for cognitive radio networks CHANGEMINER: A solution for discovering IT change templates from past execution traces
×
引用
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