Server Replication in Multicast Networks

H. S. Kia, S. Khan
{"title":"Server Replication in Multicast Networks","authors":"H. S. Kia, S. Khan","doi":"10.1109/FIT.2012.67","DOIUrl":null,"url":null,"abstract":"This paper studies and proposes heuristic algorithms to solve the problem of replicated server placement (RSP) with Quality of Service (QoS) constraints. Although there has been much work on RSP in multicast networks, in most of them a simplified replication model is used, therefore, their proposed solutions may not be applicable to real systems. In this paper, we use a more realistic, and generalized model for replica placement, which considers the latency restriction of the receivers (QoS), bandwidth, and storage constraints of the links and nodes. We present a mathematical formulation and propose four heuristics that are benched marked using BRITE network generator, and discuss the benefits and drawbacks of the static and dynamic approaches. The proposed heuristics are experimentally compared through simulations with respect to their performance and computational complexity under different QoS constraints. The simulation results show interesting characteristics of the studied heuristics.","PeriodicalId":166149,"journal":{"name":"2012 10th International Conference on Frontiers of Information Technology","volume":"59 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 10th International Conference on Frontiers of Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FIT.2012.67","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

This paper studies and proposes heuristic algorithms to solve the problem of replicated server placement (RSP) with Quality of Service (QoS) constraints. Although there has been much work on RSP in multicast networks, in most of them a simplified replication model is used, therefore, their proposed solutions may not be applicable to real systems. In this paper, we use a more realistic, and generalized model for replica placement, which considers the latency restriction of the receivers (QoS), bandwidth, and storage constraints of the links and nodes. We present a mathematical formulation and propose four heuristics that are benched marked using BRITE network generator, and discuss the benefits and drawbacks of the static and dynamic approaches. The proposed heuristics are experimentally compared through simulations with respect to their performance and computational complexity under different QoS constraints. The simulation results show interesting characteristics of the studied heuristics.
组播网络中的服务器复制
本文研究并提出了一种启发式算法来解决具有服务质量(QoS)约束的复制服务器放置问题。尽管对多播网络中的RSP进行了大量的研究,但其中大多数都采用了简化的复制模型,因此所提出的解决方案可能并不适用于实际系统。在本文中,我们使用了一个更现实、更广义的副本放置模型,该模型考虑了接收器的延迟限制(QoS)、带宽以及链路和节点的存储约束。我们提出了一个数学公式,并提出了使用BRITE网络生成器进行基准标记的四种启发式方法,并讨论了静态和动态方法的优缺点。通过仿真实验比较了不同QoS约束下启发式算法的性能和计算复杂度。仿真结果显示了所研究的启发式算法的有趣特性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信