Connection admission control for differentiating priority traffic on public networks

C. C. Beard, V. Frost
{"title":"Connection admission control for differentiating priority traffic on public networks","authors":"C. C. Beard, V. Frost","doi":"10.1109/MILCOM.1999.821434","DOIUrl":null,"url":null,"abstract":"The public network has traditionally been unable to adequately deal with defense and disaster recovery communications, because overloads that occur during crises cause degraded resource access to all users, no matter how important. For public broadband networks to be effective for defense and disaster recovery multimedia communications, they must dynamically recognize some connections as having greater importance than others and allocate resources accordingly. A new approach to connection admission control is proposed that uses an upper limit policy to optimize the admission of connections based on the weighted sum of blocking across traffic classes. This optimization approach can be used for arbitrarily large networks and numbers of traffic classes and results in a very simple algorithm that could be implemented on standard network hardware. This work is also the first to demonstrate that the use of an upper limit policy is superior to traditional approaches of adding extra capacity or partitioning capacity, both in the amount of resources required and in sensitivity to load variations. An upper limit policy is also shown to be much faster to implement where a large overload occurs from a disaster event.","PeriodicalId":334957,"journal":{"name":"MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MILCOM.1999.821434","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

The public network has traditionally been unable to adequately deal with defense and disaster recovery communications, because overloads that occur during crises cause degraded resource access to all users, no matter how important. For public broadband networks to be effective for defense and disaster recovery multimedia communications, they must dynamically recognize some connections as having greater importance than others and allocate resources accordingly. A new approach to connection admission control is proposed that uses an upper limit policy to optimize the admission of connections based on the weighted sum of blocking across traffic classes. This optimization approach can be used for arbitrarily large networks and numbers of traffic classes and results in a very simple algorithm that could be implemented on standard network hardware. This work is also the first to demonstrate that the use of an upper limit policy is superior to traditional approaches of adding extra capacity or partitioning capacity, both in the amount of resources required and in sensitivity to load variations. An upper limit policy is also shown to be much faster to implement where a large overload occurs from a disaster event.
用于区分公网上优先级流量的连接允许控制
公共网络传统上无法充分处理防御和灾难恢复通信,因为在危机期间发生的过载会导致对所有用户的资源访问降低,无论这些用户有多重要。为了使公共宽带网络有效地用于防御和灾难恢复多媒体通信,它们必须动态地识别某些连接比其他连接更重要,并相应地分配资源。提出了一种新的连接允许控制方法,该方法采用基于流量分类阻塞加权和的上限策略来优化连接允许。这种优化方法可以用于任意大的网络和大量的流量类,并产生一个非常简单的算法,可以在标准网络硬件上实现。这项工作也首次证明,在所需资源的数量和对负载变化的敏感性方面,上限策略的使用优于添加额外容量或分区容量的传统方法。在灾难事件导致大量过载的情况下,上限策略的实现速度也要快得多。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信