基于优先级虚拟分区的蜂窝多业务网络呼叫准入控制

Shun-Ping Chung, Jin-Chang Lee
{"title":"基于优先级虚拟分区的蜂窝多业务网络呼叫准入控制","authors":"Shun-Ping Chung, Jin-Chang Lee","doi":"10.1109/ICON.2000.875761","DOIUrl":null,"url":null,"abstract":"With the tremendous growth of mobile users and the emergence of multimedia applications, an appropriate call admission control policy is expected to make efficient use of scarce wireless resource while supporting different services with diverse quality-of-service requirements. Also, the popularity of microcells makes the actual traffic load of a given cell deviates from the expected load more easily. Furthermore, handoff calls are normally given priority over new calls to reduce forced termination probability. Virtual partitioning with priority (VPP) is proposed to fulfil the aforesaid goals, whether the traffic is stationary or non-stationary. An approximation method is derived to calculate performance measures of interest. Numerical results show that VPP achieves a similar high multiplexing gain as complete sharing (CS) when all classes are behaving as expected. VPP also realizes a similar isolated effect as complete partitioning (CP) in regions of practical interest. It is also shown under non-stationary scenarios, VPP outperforms trunk reservation (TR).","PeriodicalId":191244,"journal":{"name":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Call admission control in cellular multiservice networks using virtual partitioning with priority\",\"authors\":\"Shun-Ping Chung, Jin-Chang Lee\",\"doi\":\"10.1109/ICON.2000.875761\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the tremendous growth of mobile users and the emergence of multimedia applications, an appropriate call admission control policy is expected to make efficient use of scarce wireless resource while supporting different services with diverse quality-of-service requirements. Also, the popularity of microcells makes the actual traffic load of a given cell deviates from the expected load more easily. Furthermore, handoff calls are normally given priority over new calls to reduce forced termination probability. Virtual partitioning with priority (VPP) is proposed to fulfil the aforesaid goals, whether the traffic is stationary or non-stationary. An approximation method is derived to calculate performance measures of interest. Numerical results show that VPP achieves a similar high multiplexing gain as complete sharing (CS) when all classes are behaving as expected. VPP also realizes a similar isolated effect as complete partitioning (CP) in regions of practical interest. It is also shown under non-stationary scenarios, VPP outperforms trunk reservation (TR).\",\"PeriodicalId\":191244,\"journal\":{\"name\":\"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICON.2000.875761\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings IEEE International Conference on Networks 2000 (ICON 2000). Networking Trends and Challenges in the New Millennium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICON.2000.875761","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

随着移动用户的急剧增长和多媒体应用的出现,需要一个合适的呼叫接纳控制策略来有效地利用稀缺的无线资源,同时支持具有不同服务质量要求的不同业务。此外,微单元的普及使得给定单元的实际流量负载更容易偏离预期负载。此外,切换呼叫通常优先于新呼叫,以减少强制终止概率。无论流量是静态的还是非静态的,都提出了优先级虚拟分区(VPP)来实现上述目标。导出了一种近似方法来计算感兴趣的性能度量。数值结果表明,在所有类都符合预期的情况下,VPP可以获得与完全共享(CS)相似的高复用增益。VPP在实际应用中也实现了与完全分割(CP)相似的隔离效果。在非平稳情况下,VPP优于中继预留(TR)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Call admission control in cellular multiservice networks using virtual partitioning with priority
With the tremendous growth of mobile users and the emergence of multimedia applications, an appropriate call admission control policy is expected to make efficient use of scarce wireless resource while supporting different services with diverse quality-of-service requirements. Also, the popularity of microcells makes the actual traffic load of a given cell deviates from the expected load more easily. Furthermore, handoff calls are normally given priority over new calls to reduce forced termination probability. Virtual partitioning with priority (VPP) is proposed to fulfil the aforesaid goals, whether the traffic is stationary or non-stationary. An approximation method is derived to calculate performance measures of interest. Numerical results show that VPP achieves a similar high multiplexing gain as complete sharing (CS) when all classes are behaving as expected. VPP also realizes a similar isolated effect as complete partitioning (CP) in regions of practical interest. It is also shown under non-stationary scenarios, VPP outperforms trunk reservation (TR).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信