{"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}
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.