{"title":"基于时间阈值的蜂窝网络多保护带宽分配方案的分析建模","authors":"I. Candan, M. Salamah","doi":"10.1109/AICT.2009.12","DOIUrl":null,"url":null,"abstract":"In this paper, the analytical modeling of a time-threshold based multi-guard bandwidth allocation scheme is presented using a two-dimensional markov chain. The main idea of the scheme is based on monitoring the elapsed real time of handoff calls and according to a time threshold (te), a handoff call is either slightly-prioritized or fully-prioritized. A slightly-prioritized handoff call has higher priority than a new call and lower priority than a fully-prioritized handoff call. Also in this paper, the numerical results obtained from two dimensional markov chain analysis are compared with the numerical results which are obtained using one-dimensional markov chain analysis and simulation ones. The simulation and analytical results agree well. The performances of different bandwidth allocation schemes are measured using a crucial general performance metric Z. Z, which is a performance/cost ratio, is a function of the new call blocking probability, handoff call dropping probability and system utilization all together. The results indicate that our scheme outperforms other traditional schemes.","PeriodicalId":409336,"journal":{"name":"2009 Fifth Advanced International Conference on Telecommunications","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Analytical Modeling of a Time-Threshold Based Multi-guard Bandwidth Allocation Scheme for Cellular Networks\",\"authors\":\"I. Candan, M. Salamah\",\"doi\":\"10.1109/AICT.2009.12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the analytical modeling of a time-threshold based multi-guard bandwidth allocation scheme is presented using a two-dimensional markov chain. The main idea of the scheme is based on monitoring the elapsed real time of handoff calls and according to a time threshold (te), a handoff call is either slightly-prioritized or fully-prioritized. A slightly-prioritized handoff call has higher priority than a new call and lower priority than a fully-prioritized handoff call. Also in this paper, the numerical results obtained from two dimensional markov chain analysis are compared with the numerical results which are obtained using one-dimensional markov chain analysis and simulation ones. The simulation and analytical results agree well. The performances of different bandwidth allocation schemes are measured using a crucial general performance metric Z. Z, which is a performance/cost ratio, is a function of the new call blocking probability, handoff call dropping probability and system utilization all together. The results indicate that our scheme outperforms other traditional schemes.\",\"PeriodicalId\":409336,\"journal\":{\"name\":\"2009 Fifth Advanced International Conference on Telecommunications\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fifth Advanced International Conference on Telecommunications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AICT.2009.12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fifth Advanced International Conference on Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AICT.2009.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Analytical Modeling of a Time-Threshold Based Multi-guard Bandwidth Allocation Scheme for Cellular Networks
In this paper, the analytical modeling of a time-threshold based multi-guard bandwidth allocation scheme is presented using a two-dimensional markov chain. The main idea of the scheme is based on monitoring the elapsed real time of handoff calls and according to a time threshold (te), a handoff call is either slightly-prioritized or fully-prioritized. A slightly-prioritized handoff call has higher priority than a new call and lower priority than a fully-prioritized handoff call. Also in this paper, the numerical results obtained from two dimensional markov chain analysis are compared with the numerical results which are obtained using one-dimensional markov chain analysis and simulation ones. The simulation and analytical results agree well. The performances of different bandwidth allocation schemes are measured using a crucial general performance metric Z. Z, which is a performance/cost ratio, is a function of the new call blocking probability, handoff call dropping probability and system utilization all together. The results indicate that our scheme outperforms other traditional schemes.