{"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