{"title":"Exploiting Scheduled Access Features of mmWave WLANs for Periodic Traffic Sources","authors":"Mattia Lecci, Matteo Drago, A. Zanella, M. Zorzi","doi":"10.1109/MedComNet52149.2021.9501236","DOIUrl":null,"url":null,"abstract":"Many current and future multimedia and industrial applications, like video streaming, eXtended Reality or remote robot control, are characterized by periodic data transmissions with strict latency and reliability constraints. In an effort to meet the stringent demand of such traffic sources, the WiGig standards support a contention-free channel access mechanism, named Service Period, that makes it possible to allocate dedicated time intervals to certain wireless stations. However, the standard only covers the fundamental aspects that ensure interoperability, while the actual schedule logic is left to vendors. In this paper, we propose two algorithms for joint admission control and scheduling of periodic traffic streams with contrasting performance objectives, specifically a simple scheduler and a max-min fair scheduler. The schemes are compared in two different scenarios, in order to characterize and highlight some fundamental trade-offs. As expected from their design principles, the simple scheduler tends to accept more homogeneous resource allocation requests, while the max-min scheduler can efficiently handle more diversified requests, at the cost of a small loss in terms of total resource utilization.","PeriodicalId":272937,"journal":{"name":"2021 19th Mediterranean Communication and Computer Networking Conference (MedComNet)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 19th Mediterranean Communication and Computer Networking Conference (MedComNet)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MedComNet52149.2021.9501236","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
Many current and future multimedia and industrial applications, like video streaming, eXtended Reality or remote robot control, are characterized by periodic data transmissions with strict latency and reliability constraints. In an effort to meet the stringent demand of such traffic sources, the WiGig standards support a contention-free channel access mechanism, named Service Period, that makes it possible to allocate dedicated time intervals to certain wireless stations. However, the standard only covers the fundamental aspects that ensure interoperability, while the actual schedule logic is left to vendors. In this paper, we propose two algorithms for joint admission control and scheduling of periodic traffic streams with contrasting performance objectives, specifically a simple scheduler and a max-min fair scheduler. The schemes are compared in two different scenarios, in order to characterize and highlight some fundamental trade-offs. As expected from their design principles, the simple scheduler tends to accept more homogeneous resource allocation requests, while the max-min scheduler can efficiently handle more diversified requests, at the cost of a small loss in terms of total resource utilization.