Finding an optimal mirror site

M. Swain, Young-Gyun Kim
{"title":"Finding an optimal mirror site","authors":"M. Swain, Young-Gyun Kim","doi":"10.1109/SECON.2005.1423293","DOIUrl":null,"url":null,"abstract":"Mirror sites help to reduce the load at individual servers and enable client requests to be serviced by any of the servers. Typically, a client requests service from a single mirror site. When there are more servers (mirror sites) to provide the same services, the client has to choose one randomly to get served. Without prior knowledge about the reliability and performance of mirror sites, the client might not be successful in accessing the resources on their first attempt. As an extension of our previous research (Y. Kim and M. Swain, \"The role of Intelligent Model for Data Source Selection in Distributed Server Environment\", submitted to ACMSE, GA, 2005), we propose a system enabling a client to access files from the mirror sites with confidence using intelligent agents in a multiagent environment. In this research, we have considered factors like bandwidth, availability and capacity of servers for our agent model in choosing a more probable data source in an intelligent way. Also discussions on the agent communications based on web services have been given.","PeriodicalId":129377,"journal":{"name":"Proceedings. IEEE SoutheastCon, 2005.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. IEEE SoutheastCon, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECON.2005.1423293","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Mirror sites help to reduce the load at individual servers and enable client requests to be serviced by any of the servers. Typically, a client requests service from a single mirror site. When there are more servers (mirror sites) to provide the same services, the client has to choose one randomly to get served. Without prior knowledge about the reliability and performance of mirror sites, the client might not be successful in accessing the resources on their first attempt. As an extension of our previous research (Y. Kim and M. Swain, "The role of Intelligent Model for Data Source Selection in Distributed Server Environment", submitted to ACMSE, GA, 2005), we propose a system enabling a client to access files from the mirror sites with confidence using intelligent agents in a multiagent environment. In this research, we have considered factors like bandwidth, availability and capacity of servers for our agent model in choosing a more probable data source in an intelligent way. Also discussions on the agent communications based on web services have been given.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
寻找最佳镜像站点
镜像站点有助于减少单个服务器上的负载,并使客户端请求能够由任何服务器提供服务。通常,客户机从单个镜像站点请求服务。当有更多的服务器(镜像站点)提供相同的服务时,客户端必须随机选择一个来获得服务。如果事先不了解镜像站点的可靠性和性能,客户机第一次尝试访问资源时可能无法成功。作为我们之前研究的延伸(Y. Kim和M. Swain,“分布式服务器环境中数据源选择的智能模型的作用”,提交给ACMSE, GA, 2005),我们提出了一个系统,使客户端能够在多代理环境中使用智能代理自信地从镜像站点访问文件。在本研究中,我们为我们的代理模型考虑了带宽、可用性和服务器容量等因素,以智能的方式选择更可能的数据源。并对基于web服务的代理通信进行了讨论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Use of an artificial neural network to detect anomalies in wireless device location for the purpose of intrusion detection Electrical characterization of GaN based blue light emitting diodes Maximizing network lifetime under a fixed energy budget in mobile ad hoc networks Predictive management algorithm for ad hoc networks A generic AHB bus for implementing high-speed locally synchronous islands
×
引用
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