{"title":"Call admission control policy for capacity-varying networks with increasing failure rate holding time distributions","authors":"J. Siwko, I. Rubin","doi":"10.1109/ICC.1998.685126","DOIUrl":null,"url":null,"abstract":"LEO satellite systems and many other connection-oriented networks have capacities which vary over time. Call admission control (CAC) policies which only use current capacity information may lead to intolerable dropping of admitted calls whenever network capacity decreases. We introduce a CAC policy for capacity-varying networks with call holding times that have increasing failure rate distributions. This policy uses knowledge about future capacity changes to admit only calls which can be adequately serviced not just at admission time, but throughout the call's lifetime. Using this policy, it is possible to trade off some additional call request blocking in order to greatly reduce call dropping. This new policy is optimal in the sense of blocking the fewest calls and thus achieving the highest throughput of any policy that meets, on an individual call basis, a given dropping probability threshold under any fixed order dropping policy.","PeriodicalId":218354,"journal":{"name":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.1998.685126","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
LEO satellite systems and many other connection-oriented networks have capacities which vary over time. Call admission control (CAC) policies which only use current capacity information may lead to intolerable dropping of admitted calls whenever network capacity decreases. We introduce a CAC policy for capacity-varying networks with call holding times that have increasing failure rate distributions. This policy uses knowledge about future capacity changes to admit only calls which can be adequately serviced not just at admission time, but throughout the call's lifetime. Using this policy, it is possible to trade off some additional call request blocking in order to greatly reduce call dropping. This new policy is optimal in the sense of blocking the fewest calls and thus achieving the highest throughput of any policy that meets, on an individual call basis, a given dropping probability threshold under any fixed order dropping policy.