支持准随机流量的移动热点性能评估

IF 1.3 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS IET Networks Pub Date : 2023-07-13 DOI:10.1049/ntw2.12093
Marinos Vlasakis, Ioannis Moscholios, Panagiotis Sarigiannidis, Michael Logothetis
{"title":"支持准随机流量的移动热点性能评估","authors":"Marinos Vlasakis,&nbsp;Ioannis Moscholios,&nbsp;Panagiotis Sarigiannidis,&nbsp;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,&nbsp;Ioannis Moscholios,&nbsp;Panagiotis Sarigiannidis,&nbsp;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}
引用次数: 0

摘要

研究并评估了一种移动热点下的移动感知呼叫接纳控制算法。更具体地说,考虑具有固定容量的接入点并且可以在停止和移动阶段之间交替的车辆。在停止阶段,车辆服务新的和移交呼叫。为了优先考虑切换呼叫,考虑了概率带宽保留策略,其中为切换呼叫保留了一部分容量。基于此策略,新的调用可能以预定义的概率进入预订空间。此外,如果在到达时没有可用资源,切换调用可以选择在有限大小的队列中等待。在移动阶段,车辆在经典的完全共享策略下只服务新呼叫。在这两个阶段中,呼叫都是按照准随机过程到达系统的,在系统中接受它们需要一个带宽单元,并且具有指数分布的服务时间。为了分析各种性能指标,如时间拥塞概率、呼叫阻塞概率和链路利用率,提出了一种基于三维马尔可夫链的精确分析方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

摘要图片

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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 Networks
IET Networks COMPUTER 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.
期刊最新文献
Common criteria for security evaluation and malicious intrusion detection mechanism of dam supervisory control and data acquisition system Energy and throughput efficient mobile wireless sensor networks: A deep reinforcement learning approach Disaster scenario optimised link state routing protocol and message prioritisation A PU-learning based approach for cross-site scripting attacking reality detection Enhanced multivariate singular spectrum analysis-based network traffic forecasting for real time industrial IoT applications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1