故障率保持时间分布增大时容量变化网络的呼叫允许控制策略

J. Siwko, I. Rubin
{"title":"故障率保持时间分布增大时容量变化网络的呼叫允许控制策略","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":"{\"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}","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

摘要

低轨道卫星系统和许多其他面向连接的网络具有随时间变化的能力。当网络容量减少时,仅使用当前容量信息的呼叫允许控制(CAC)策略可能导致无法忍受的已接受呼叫丢失。我们引入了一种CAC策略,用于具有不断增加的故障率分布的呼叫保持时间的容量变化网络。此策略使用有关未来容量变化的知识来只接收不仅在接收时而且在整个呼叫生命周期中都可以得到充分服务的呼叫。使用此策略,可以权衡一些额外的呼叫请求阻塞,以大大减少呼叫掉线。这个新策略在阻塞最少呼叫的意义上是最优的,因此在任何固定订单丢弃策略下,在单个呼叫的基础上满足给定丢弃概率阈值的任何策略中实现最高吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Call admission control policy for capacity-varying networks with increasing failure rate holding time distributions
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信