Marinos Vlasakis, Ioannis Moscholios, Panagiotis Sarigiannidis, Michael Logothetis
{"title":"支持准随机流量的移动热点性能评估","authors":"Marinos Vlasakis, Ioannis Moscholios, Panagiotis Sarigiannidis, Michael Logothetis","doi":"10.1049/ntw2.12093","DOIUrl":null,"url":null,"abstract":"<p>The authors study and evaluate a mobility-aware call admission control algorithm in a mobile hotspot. More specifically, a vehicle which has an access point of a fixed capacity and may alternate between stop and moving phases is considered. In the stop phase, the vehicle services new and handover calls. To prioritise handover calls a probabilistic bandwidth reservation policy is considered where a fraction of the capacity is reserved for handover calls. Based on this policy, new calls may enter the reservation space with a predefined probability. In addition, handover calls have the option to wait in a queue of finite size if there are no available resources at the time of their arrival. In the moving phase, the vehicle services only new calls under the classical complete sharing policy. In both phases, calls arrive in the system according to a quasi-random process, require a single bandwidth unit for their acceptance in the system and have an exponentially distributed service time. To analytically determine the various performance measures, such as time congestion probabilities, call blocking probabilities and link utilisation, an accurate analytical method is presented based on three-dimensional Markov chains.</p>","PeriodicalId":46240,"journal":{"name":"IET Networks","volume":null,"pages":null},"PeriodicalIF":1.3000,"publicationDate":"2023-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/ntw2.12093","citationCount":"0","resultStr":"{\"title\":\"Performance evaluation of a mobile hotspot supporting quasi-random traffic\",\"authors\":\"Marinos Vlasakis, Ioannis Moscholios, Panagiotis Sarigiannidis, Michael Logothetis\",\"doi\":\"10.1049/ntw2.12093\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The authors study and evaluate a mobility-aware call admission control algorithm in a mobile hotspot. More specifically, a vehicle which has an access point of a fixed capacity and may alternate between stop and moving phases is considered. In the stop phase, the vehicle services new and handover calls. To prioritise handover calls a probabilistic bandwidth reservation policy is considered where a fraction of the capacity is reserved for handover calls. Based on this policy, new calls may enter the reservation space with a predefined probability. In addition, handover calls have the option to wait in a queue of finite size if there are no available resources at the time of their arrival. In the moving phase, the vehicle services only new calls under the classical complete sharing policy. In both phases, calls arrive in the system according to a quasi-random process, require a single bandwidth unit for their acceptance in the system and have an exponentially distributed service time. To analytically determine the various performance measures, such as time congestion probabilities, call blocking probabilities and link utilisation, an accurate analytical method is presented based on three-dimensional Markov chains.</p>\",\"PeriodicalId\":46240,\"journal\":{\"name\":\"IET Networks\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":1.3000,\"publicationDate\":\"2023-07-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/ntw2.12093\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IET Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1049/ntw2.12093\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Networks","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1049/ntw2.12093","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
Performance evaluation of a mobile hotspot supporting quasi-random traffic
The authors study and evaluate a mobility-aware call admission control algorithm in a mobile hotspot. More specifically, a vehicle which has an access point of a fixed capacity and may alternate between stop and moving phases is considered. In the stop phase, the vehicle services new and handover calls. To prioritise handover calls a probabilistic bandwidth reservation policy is considered where a fraction of the capacity is reserved for handover calls. Based on this policy, new calls may enter the reservation space with a predefined probability. In addition, handover calls have the option to wait in a queue of finite size if there are no available resources at the time of their arrival. In the moving phase, the vehicle services only new calls under the classical complete sharing policy. In both phases, calls arrive in the system according to a quasi-random process, require a single bandwidth unit for their acceptance in the system and have an exponentially distributed service time. To analytically determine the various performance measures, such as time congestion probabilities, call blocking probabilities and link utilisation, an accurate analytical method is presented based on three-dimensional Markov chains.
IET NetworksCOMPUTER SCIENCE, INFORMATION SYSTEMS-
CiteScore
5.00
自引率
0.00%
发文量
41
审稿时长
33 weeks
期刊介绍:
IET Networks covers the fundamental developments and advancing methodologies to achieve higher performance, optimized and dependable future networks. IET Networks is particularly interested in new ideas and superior solutions to the known and arising technological development bottlenecks at all levels of networking such as topologies, protocols, routing, relaying and resource-allocation for more efficient and more reliable provision of network services. Topics include, but are not limited to: Network Architecture, Design and Planning, Network Protocol, Software, Analysis, Simulation and Experiment, Network Technologies, Applications and Services, Network Security, Operation and Management.