蜂窝网络中基于MAHO的优先切换排队方案

V. Goswami, P. K. Swain
{"title":"蜂窝网络中基于MAHO的优先切换排队方案","authors":"V. Goswami, P. K. Swain","doi":"10.1109/ICOAC.2011.6165184","DOIUrl":null,"url":null,"abstract":"The forced termination probability is an important measure in the performance evaluation of wireless communication networks. This paper proposes a new handoff queueing scheme that handles the channels reserved for handoff calls depending on the current status of the queue. This mechanism of queuing handoff priority scheme effectively reduces forced termination, at the expense of increased new call blocking probability. An analytical Markov model for the proposed scheme is developed and analyzed. We find that giving priority to handoff calls over new calls would improve the forced termination probability of the system without degrading the number of failed new call attempts. Various performance measures of the proposed scheme such as new call blocking probability, forced termination probability, handoff failure probability, the average waiting times of the queued handoff calls, etc. are described and evaluated. Computational experiences in the form of graphs of the proposed scheme and comparisons with conventional channel reservation schemes are presented.","PeriodicalId":369712,"journal":{"name":"2011 Third International Conference on Advanced Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A MAHO based prioritized handoff queueing scheme in cellular networks\",\"authors\":\"V. Goswami, P. K. Swain\",\"doi\":\"10.1109/ICOAC.2011.6165184\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The forced termination probability is an important measure in the performance evaluation of wireless communication networks. This paper proposes a new handoff queueing scheme that handles the channels reserved for handoff calls depending on the current status of the queue. This mechanism of queuing handoff priority scheme effectively reduces forced termination, at the expense of increased new call blocking probability. An analytical Markov model for the proposed scheme is developed and analyzed. We find that giving priority to handoff calls over new calls would improve the forced termination probability of the system without degrading the number of failed new call attempts. Various performance measures of the proposed scheme such as new call blocking probability, forced termination probability, handoff failure probability, the average waiting times of the queued handoff calls, etc. are described and evaluated. Computational experiences in the form of graphs of the proposed scheme and comparisons with conventional channel reservation schemes are presented.\",\"PeriodicalId\":369712,\"journal\":{\"name\":\"2011 Third International Conference on Advanced Computing\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Third International Conference on Advanced Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOAC.2011.6165184\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Third International Conference on Advanced Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOAC.2011.6165184","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

强制终止概率是无线通信网络性能评估中的一个重要指标。本文提出了一种新的切换队列方案,该方案根据队列的当前状态来处理为切换呼叫保留的通道。这种排队切换优先方案的机制以增加新呼叫阻塞概率为代价,有效地减少了强制终止。建立并分析了该方案的解析马尔可夫模型。我们发现,在不降低新呼叫失败次数的情况下,将切换呼叫优先于新呼叫可以提高系统的强制终止概率。描述并评估了该方案的各种性能度量,如新呼叫阻塞概率、强制终止概率、切换失败概率、排队切换呼叫的平均等待时间等。本文以图的形式给出了该方案的计算经验,并与传统的信道保留方案进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A MAHO based prioritized handoff queueing scheme in cellular networks
The forced termination probability is an important measure in the performance evaluation of wireless communication networks. This paper proposes a new handoff queueing scheme that handles the channels reserved for handoff calls depending on the current status of the queue. This mechanism of queuing handoff priority scheme effectively reduces forced termination, at the expense of increased new call blocking probability. An analytical Markov model for the proposed scheme is developed and analyzed. We find that giving priority to handoff calls over new calls would improve the forced termination probability of the system without degrading the number of failed new call attempts. Various performance measures of the proposed scheme such as new call blocking probability, forced termination probability, handoff failure probability, the average waiting times of the queued handoff calls, etc. are described and evaluated. Computational experiences in the form of graphs of the proposed scheme and comparisons with conventional channel reservation schemes are presented.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信