Resource Availability Optimization for Priority Classes in a Website

V. Koutras, A. Platis
{"title":"Resource Availability Optimization for Priority Classes in a Website","authors":"V. Koutras, A. Platis","doi":"10.1109/PRDC.2006.54","DOIUrl":null,"url":null,"abstract":"High resource availability in computer networks has become a critical issue as it can be affected by the increasing number of network users. A methodology based on classifying Website visitors into priority groups is proposed, assuring high availability for priority classes, based on reserved Website resources that can be accessed only by these groups and simultaneously providing as many resources as possible to lower priority visitors. A birth-death process is proposed to model Website visitors' arrival and service. An optimization problem is solved to determine the optimal trade off between resource availability for high priority visitors and free resource access to lower priority visitors. The major contribution of this paper consists in deriving formulas for the probability that a Website visitor has no further access to resources and in determining the optimal reserved resources assuring the above trade off","PeriodicalId":314915,"journal":{"name":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 12th Pacific Rim International Symposium on Dependable Computing (PRDC'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PRDC.2006.54","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

High resource availability in computer networks has become a critical issue as it can be affected by the increasing number of network users. A methodology based on classifying Website visitors into priority groups is proposed, assuring high availability for priority classes, based on reserved Website resources that can be accessed only by these groups and simultaneously providing as many resources as possible to lower priority visitors. A birth-death process is proposed to model Website visitors' arrival and service. An optimization problem is solved to determine the optimal trade off between resource availability for high priority visitors and free resource access to lower priority visitors. The major contribution of this paper consists in deriving formulas for the probability that a Website visitor has no further access to resources and in determining the optimal reserved resources assuring the above trade off
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
网站优先级类的资源可用性优化
计算机网络中资源的高可用性已成为一个关键问题,因为它可能受到日益增加的网络用户数量的影响。提出了一种基于将网站访问者划分为优先级组的方法,该方法基于仅由这些优先级组访问的保留网站资源,同时为较低优先级的访问者提供尽可能多的资源,以保证优先级类的高可用性。提出了一个出生-死亡过程来模拟网站访问者的到达和服务。解决了一个优化问题,以确定高优先级访问者的资源可用性和低优先级访问者的自由资源访问之间的最优权衡。本文的主要贡献在于推导了网站访问者无法再访问资源的概率公式,并确定了保证上述权衡的最佳保留资源
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Restoration Strategies In Mesh Optical Networks: Cost Vs. Service Availability A New Approach to Improving the Test Effectiveness in Software Testing Using Fault Collapsing Quantum Oblivious Transfer and Fair Digital Transactions Design Trade-Offs and Deadlock Prevention in Transient Fault-Tolerant SMT Processors Evaluating the Impact of Fault Recovery on Superscalar Processor Performance
×
引用
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