Pub Date : 2021-10-04DOI: 10.1109/lcn52139.2021.9524947
E. Volodina, E. Rathgeb
This work examines the behavior and impact of key protocol features like acknowledgment policy, different congestion control algorithms and the two levels of flow control on performance of the novel transport protocol QUIC. Each of the aforementioned protocol components adds significant complexity to the logic for sending and processing packets. Specific, suboptimal network conditions bring up new unsolved issues and can significantly lower the throughput of QUIC. One of the open issues is how to adapt the acknowledgment policy to a wide variety of network conditions. The ACK frequency frame scheme is a protocol extension proposed by Iyenguar et al. aiming at improving this mechanism by dynamically adapting the ACK ratio. To validate this proposal, we extended our existing QUIC implementation in OMNET++/INET, specifically by adding alternative congestion control algorithms as well as an implementation of the ACK frequency frame proposal. This paper presents a comparative evaluation of the ACK frequency frame proposal with a proposal, which we already introduced in previous work. Furthermore, it assesses the performance impact of this extension on the processing of the New Reno and Cubic congestion controls. It introduces simulation results how integration of Flow Control, ACK delay timer and PING frame influence an efficient ACK processing strategy, affecting the QUIC protocol performance.
{"title":"Impact of ACK Scaling Policies on QUIC Performance","authors":"E. Volodina, E. Rathgeb","doi":"10.1109/lcn52139.2021.9524947","DOIUrl":"https://doi.org/10.1109/lcn52139.2021.9524947","url":null,"abstract":"This work examines the behavior and impact of key protocol features like acknowledgment policy, different congestion control algorithms and the two levels of flow control on performance of the novel transport protocol QUIC. Each of the aforementioned protocol components adds significant complexity to the logic for sending and processing packets. Specific, suboptimal network conditions bring up new unsolved issues and can significantly lower the throughput of QUIC. One of the open issues is how to adapt the acknowledgment policy to a wide variety of network conditions. The ACK frequency frame scheme is a protocol extension proposed by Iyenguar et al. aiming at improving this mechanism by dynamically adapting the ACK ratio. To validate this proposal, we extended our existing QUIC implementation in OMNET++/INET, specifically by adding alternative congestion control algorithms as well as an implementation of the ACK frequency frame proposal. This paper presents a comparative evaluation of the ACK frequency frame proposal with a proposal, which we already introduced in previous work. Furthermore, it assesses the performance impact of this extension on the processing of the New Reno and Cubic congestion controls. It introduces simulation results how integration of Flow Control, ACK delay timer and PING frame influence an efficient ACK processing strategy, affecting the QUIC protocol performance.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124995530","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-04DOI: 10.1109/LCN52139.2021.9525005
Dominic Laniewski, N. Aschenbruck
In many robotic applications as well as in the area of immersive multimedia, large point clouds need to be transmitted over a network preferably in real-time. Typically, the point cloud is first compressed to a significantly smaller size, before it is transmitted as a simple file transfer. A drawback of this method is that it requires a point cloud to be fully available for the compression process to begin, inducing additional delay. In this paper, we explore the potential of streaming incoming points directly from an ongoing laser scan. Therefore, we propose a compression algorithm that operates on an ongoing point stream. Furthermore, we propose and compare different rate adaptation methods that dynamically adapt the compression rate to the currently available network data rate. Our evaluations show promising results in terms of rate fluctuations around the available network data rate and the achieved quality of our solution.
{"title":"On the Potential of Rate Adaptive Point Cloud Streaming on the Point Level","authors":"Dominic Laniewski, N. Aschenbruck","doi":"10.1109/LCN52139.2021.9525005","DOIUrl":"https://doi.org/10.1109/LCN52139.2021.9525005","url":null,"abstract":"In many robotic applications as well as in the area of immersive multimedia, large point clouds need to be transmitted over a network preferably in real-time. Typically, the point cloud is first compressed to a significantly smaller size, before it is transmitted as a simple file transfer. A drawback of this method is that it requires a point cloud to be fully available for the compression process to begin, inducing additional delay. In this paper, we explore the potential of streaming incoming points directly from an ongoing laser scan. Therefore, we propose a compression algorithm that operates on an ongoing point stream. Furthermore, we propose and compare different rate adaptation methods that dynamically adapt the compression rate to the currently available network data rate. Our evaluations show promising results in terms of rate fluctuations around the available network data rate and the achieved quality of our solution.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123452424","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-04DOI: 10.1109/lcn52139.2021.9524955
Wang Guo, Yanhong Huang, Jianqi Shi, Zhé Hóu, Yang Yang
There are quite tight timing requirements in deterministic low latency network. The IEEE 802.1 Time-Sensitive Networking (TSN) task group has proposed several traffic shapers to satisfy real-time communications requirements. Traditionally, the performance of TSN is analyzed by simulations, whereas these methods cannot cover all corner cases. This paper firstly presented formal models of the TSN’s time-aware and peristaltic shapers using UPPAAL, tactically solving the problem mentioned above. Afterward, we verified some properties of the shapers models, of which the results could evaluate whether these shapers are able to satisfy strict timing requirements or not. Based on the models, we can discuss about the performance of time-critical traffic combining the preemption mechanism. More-over, we can also analyze resource utilization and transmission latency. Under the time properties analysis and verification of TSN traffic shapers, we can provide engineers with an accessible reference that may assist them in developing the TSN.
{"title":"A Formal Method for Evaluating the Performance of TSN Traffic Shapers using UPPAAL","authors":"Wang Guo, Yanhong Huang, Jianqi Shi, Zhé Hóu, Yang Yang","doi":"10.1109/lcn52139.2021.9524955","DOIUrl":"https://doi.org/10.1109/lcn52139.2021.9524955","url":null,"abstract":"There are quite tight timing requirements in deterministic low latency network. The IEEE 802.1 Time-Sensitive Networking (TSN) task group has proposed several traffic shapers to satisfy real-time communications requirements. Traditionally, the performance of TSN is analyzed by simulations, whereas these methods cannot cover all corner cases. This paper firstly presented formal models of the TSN’s time-aware and peristaltic shapers using UPPAAL, tactically solving the problem mentioned above. Afterward, we verified some properties of the shapers models, of which the results could evaluate whether these shapers are able to satisfy strict timing requirements or not. Based on the models, we can discuss about the performance of time-critical traffic combining the preemption mechanism. More-over, we can also analyze resource utilization and transmission latency. Under the time properties analysis and verification of TSN traffic shapers, we can provide engineers with an accessible reference that may assist them in developing the TSN.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114303984","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-04DOI: 10.1109/LCN52139.2021.9525028
Jonathan Kua
The progressive adoption of Active Queue Management (AQM) and the popularity of Dynamic Adaptive Streaming over HTTP (DASH)-based streaming services have motivated the development of adaptive chunklets. Chunklets significantly improves the Quality of Experience (QoE) of video streaming applications in the presence of cross-traffic, which is known as the Achieved Rate (AR) multiplication effect. However, the detailed behaviour of chunklets and their implications on queuing dynamics have not been well-explored. In this paper, we instrumented a fine-grained, packet-driven FreeBSD queue measurement kernel module, and present an experimentally validated system model to help us better understand the AR multiplication effect in FlowQueue-based AQM bottlenecks. We experimentally demonstrated the accuracy of our system model across a wide range of network settings, along with providing fine-grained insights into queuing behaviours, including the detection of hash collisions. Our approach can provide network operators and researchers with greater network visibility where AQM schemes are deployed.
{"title":"Understanding the Achieved Rate Multiplication Effect in FlowQueue-based AQM Bottleneck","authors":"Jonathan Kua","doi":"10.1109/LCN52139.2021.9525028","DOIUrl":"https://doi.org/10.1109/LCN52139.2021.9525028","url":null,"abstract":"The progressive adoption of Active Queue Management (AQM) and the popularity of Dynamic Adaptive Streaming over HTTP (DASH)-based streaming services have motivated the development of adaptive chunklets. Chunklets significantly improves the Quality of Experience (QoE) of video streaming applications in the presence of cross-traffic, which is known as the Achieved Rate (AR) multiplication effect. However, the detailed behaviour of chunklets and their implications on queuing dynamics have not been well-explored. In this paper, we instrumented a fine-grained, packet-driven FreeBSD queue measurement kernel module, and present an experimentally validated system model to help us better understand the AR multiplication effect in FlowQueue-based AQM bottlenecks. We experimentally demonstrated the accuracy of our system model across a wide range of network settings, along with providing fine-grained insights into queuing behaviours, including the detection of hash collisions. Our approach can provide network operators and researchers with greater network visibility where AQM schemes are deployed.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121487241","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-04DOI: 10.1109/lcn52139.2021.9524950
Haya Elayan, M. Aloqaily, H. Salameh, M. Guizani
Recent technological advances have reshaped many aspects of our lives, especially modern transportation systems. For instance, AI and B5G Networks have raised the level of automation as autonomous vehicles (AV) become decision-independent and self-aware. However, in-vehicle health monitoring is still an open issue. Therefore, a cooperative healthcare emergency response framework has been proposed that employs in-vehicle intelligent health monitoring and local networks for AV to minimize the time to receive emergency treatment for passengers with abnormal health conditions. The extensive simulation results show that the framework minimizes the First Emergency Treatment Time by at least 75%, and eliminates hospital waiting time, the Total Time for Emergency Treatment is minimized by at least 93%. Finally, it reduces Travel Time by nearly 50%. All results compared to the autopilot approach.
{"title":"Intelligent Cooperative Health Emergency Response System in Autonomous Vehicles","authors":"Haya Elayan, M. Aloqaily, H. Salameh, M. Guizani","doi":"10.1109/lcn52139.2021.9524950","DOIUrl":"https://doi.org/10.1109/lcn52139.2021.9524950","url":null,"abstract":"Recent technological advances have reshaped many aspects of our lives, especially modern transportation systems. For instance, AI and B5G Networks have raised the level of automation as autonomous vehicles (AV) become decision-independent and self-aware. However, in-vehicle health monitoring is still an open issue. Therefore, a cooperative healthcare emergency response framework has been proposed that employs in-vehicle intelligent health monitoring and local networks for AV to minimize the time to receive emergency treatment for passengers with abnormal health conditions. The extensive simulation results show that the framework minimizes the First Emergency Treatment Time by at least 75%, and eliminates hospital waiting time, the Total Time for Emergency Treatment is minimized by at least 93%. Finally, it reduces Travel Time by nearly 50%. All results compared to the autopilot approach.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128189290","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-04DOI: 10.1109/LCN52139.2021.9524961
Tanvir ul Huque, F. den Hartog
Packet injection attacks are a primary threat to software-defined enterprise networks, for which continuous connectivity and real-time network functioning are two essential requirements. They are a form of denial-of-service attacks, and their main effect is network performance degradation up to total breakdown. In this paper, we show how such an attack can effectively be detected and mitigated at the entrance gateway switch of the software-defined enterprise network without sacrificing the basic functionality and performance of the networks control mechanisms. We describe an effective protection of the network’s core controller as well as a significant reduction of rule-space overhead compared to a state-of-the-art technique.
{"title":"Protecting Software-Defined Enterprise Networks from Packet Injection Attacks","authors":"Tanvir ul Huque, F. den Hartog","doi":"10.1109/LCN52139.2021.9524961","DOIUrl":"https://doi.org/10.1109/LCN52139.2021.9524961","url":null,"abstract":"Packet injection attacks are a primary threat to software-defined enterprise networks, for which continuous connectivity and real-time network functioning are two essential requirements. They are a form of denial-of-service attacks, and their main effect is network performance degradation up to total breakdown. In this paper, we show how such an attack can effectively be detected and mitigated at the entrance gateway switch of the software-defined enterprise network without sacrificing the basic functionality and performance of the networks control mechanisms. We describe an effective protection of the network’s core controller as well as a significant reduction of rule-space overhead compared to a state-of-the-art technique.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131089691","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-04DOI: 10.1109/LCN52139.2021.9524996
Mohamed Hamnache, Rahim Kacimi, A. Beylot
LoRaWAN is a promising enabling technology for connected things. Nowadays, it is largely used in many application areas thanks to its relevant features such as long-range, low-cost, and low power consumption. However, as with all wireless technologies, mobility remains a major concern bringing end-devices out of their home operator coverage. In this paper, we investigate the inter-operator roaming capability in mobile scenarios. We proposed a novel LoRaWAN roaming scheme to enable inter-operator roaming based on DNS resolution and end-device context migration between networks. Moreover, we extended the LoRaWAN architecture while maintaining the integrity of the existing mechanisms and with a minimum prior configuration requirements. In order to validate our solution, we designed and implemented a test-bed platform integrating our extensions to Chirpstack.
{"title":"Unifying LoRaWAN Networks by Enabling the Roaming Capability","authors":"Mohamed Hamnache, Rahim Kacimi, A. Beylot","doi":"10.1109/LCN52139.2021.9524996","DOIUrl":"https://doi.org/10.1109/LCN52139.2021.9524996","url":null,"abstract":"LoRaWAN is a promising enabling technology for connected things. Nowadays, it is largely used in many application areas thanks to its relevant features such as long-range, low-cost, and low power consumption. However, as with all wireless technologies, mobility remains a major concern bringing end-devices out of their home operator coverage. In this paper, we investigate the inter-operator roaming capability in mobile scenarios. We proposed a novel LoRaWAN roaming scheme to enable inter-operator roaming based on DNS resolution and end-device context migration between networks. Moreover, we extended the LoRaWAN architecture while maintaining the integrity of the existing mechanisms and with a minimum prior configuration requirements. In order to validate our solution, we designed and implemented a test-bed platform integrating our extensions to Chirpstack.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"204 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131873587","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-04DOI: 10.1109/ISMVL.2000.10000
G. Dueck
Ciad mile failte (a hundred thousand welcomes) to Antigonish, Nova Scotia, site of the 1997 International Symposium on Multiple-Valued Logic. This is the fourth time that the symposium is being held in Canada and the first time in Nova Scotia. The annual symposium (now in its 27th year) is the main event organized by the IEEE Computer Society Technical Committee on Multiple-Valued Logic. The financial sponsorship of this year’s symposium is shared by St. Francis Xavier University and the IEEE Computer Society. On behalf of all participants, I wish to thank St. Francis Xavier University for its support. The university hosted our reception, processed the registrations, and kept track of our finances. I am also grateful to the public relations department, which made our symposium known to the community at large. I am very grateful to the Program Co-Chairs for their efforts in developing our excellent technical program. Dr. Rolf Drechsler served as Program Co-Chair for Europe and Africa, Prof. Okihiko Ishizuka served as Program Co-Chair for Asia and the Pacific, and Prof. D. Michael Miller served as Program Co-Chair for the Americas. The success of a symposium depends on the quality of the program and the participation of the attendees. Thanks to the authors and our Program Committee we have achieved the first condition. I am confident that through your participation new ideas will emerge from this symposium, thus advancing research in multiple-valued logic. I hope that after the symposium you will have some time to enjoy our beautiful countryside and ocean vistas. Take a walk through the university campus (founded in 1853), hike along the beach, or take a whale watching cruise. You are not restricted to expanding your research horizon at the technical sessions as you can also enjoy the beauty and Scottish charm of Antigonish.
{"title":"Message from the Symposium Chair","authors":"G. Dueck","doi":"10.1109/ISMVL.2000.10000","DOIUrl":"https://doi.org/10.1109/ISMVL.2000.10000","url":null,"abstract":"Ciad mile failte (a hundred thousand welcomes) to Antigonish, Nova Scotia, site of the 1997 International Symposium on Multiple-Valued Logic. This is the fourth time that the symposium is being held in Canada and the first time in Nova Scotia. The annual symposium (now in its 27th year) is the main event organized by the IEEE Computer Society Technical Committee on Multiple-Valued Logic. The financial sponsorship of this year’s symposium is shared by St. Francis Xavier University and the IEEE Computer Society. On behalf of all participants, I wish to thank St. Francis Xavier University for its support. The university hosted our reception, processed the registrations, and kept track of our finances. I am also grateful to the public relations department, which made our symposium known to the community at large. I am very grateful to the Program Co-Chairs for their efforts in developing our excellent technical program. Dr. Rolf Drechsler served as Program Co-Chair for Europe and Africa, Prof. Okihiko Ishizuka served as Program Co-Chair for Asia and the Pacific, and Prof. D. Michael Miller served as Program Co-Chair for the Americas. The success of a symposium depends on the quality of the program and the participation of the attendees. Thanks to the authors and our Program Committee we have achieved the first condition. I am confident that through your participation new ideas will emerge from this symposium, thus advancing research in multiple-valued logic. I hope that after the symposium you will have some time to enjoy our beautiful countryside and ocean vistas. Take a walk through the university campus (founded in 1853), hike along the beach, or take a whale watching cruise. You are not restricted to expanding your research horizon at the technical sessions as you can also enjoy the beauty and Scottish charm of Antigonish.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134082756","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-04DOI: 10.1109/LCN52139.2021.9525001
O. Gul
We consider a cognitive radio network consisting of M primary users, M primary receivers, a secondary user with K channels and K secondary receivers. A channel is assigned to each primary user for transmitting data to a primary receiver. Secondary user is assumed as data backlogged. The secondary user has no direct information on states (good or bad) of M channels, or statistic of channel evolution process. Secondary user chooses K channels for transmission in each time slot. If secondary user senses good state for a chosen channel, it can transmit data to a secondary receiver in that time slot. Otherwise, secondary user does not use that channel and choose another channel for data transmission next time. This scheduling problem is tackled under average reward criterion. Uniforming Random Ordered Policy (UROP) is proposed, and shown to achieve nearly throughput-optimality. It performs much better than myopic policy.
我们考虑一个由M个主用户、M个主接收机、一个具有K个信道的辅助用户和K个辅助接收机组成的认知无线电网络。为每个主用户分配一个信道，用于向主接收器传输数据。假设从用户为数据积压用户。辅助用户没有M个通道状态(好或坏)的直接信息，也没有通道演变过程的统计信息。辅助用户在每个时隙中选择K个信道进行传输。如果辅助用户感知到所选信道的良好状态，则可以在该时隙中将数据传输到辅助接收器。否则，从用户下次不再使用该信道，而是选择其他信道进行数据传输。在平均报酬条件下，对该调度问题进行了研究。提出了统一随机有序策略(uniform Random Ordered Policy, UROP)，并证明该策略可以实现近乎吞吐量最优性。这比目光短浅的政策要好得多。
{"title":"Near-Optimal Opportunistic Spectrum Access in Cognitive Radio Networks in the 5G and IoT Era","authors":"O. Gul","doi":"10.1109/LCN52139.2021.9525001","DOIUrl":"https://doi.org/10.1109/LCN52139.2021.9525001","url":null,"abstract":"We consider a cognitive radio network consisting of M primary users, M primary receivers, a secondary user with K channels and K secondary receivers. A channel is assigned to each primary user for transmitting data to a primary receiver. Secondary user is assumed as data backlogged. The secondary user has no direct information on states (good or bad) of M channels, or statistic of channel evolution process. Secondary user chooses K channels for transmission in each time slot. If secondary user senses good state for a chosen channel, it can transmit data to a secondary receiver in that time slot. Otherwise, secondary user does not use that channel and choose another channel for data transmission next time. This scheduling problem is tackled under average reward criterion. Uniforming Random Ordered Policy (UROP) is proposed, and shown to achieve nearly throughput-optimality. It performs much better than myopic policy.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114724383","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2021-10-04DOI: 10.1109/lcn52139.2021.9525015
M. Arifuzzaman, Shafkat Islam, Engin Arslan
Finding the root causes of network performance anomalies is critical to satisfy the quality of service requirements. In this paper, we introduce machine learning (ML) models to process TCP socket statistics to pinpoint underlying reasons of performance issues such as packet loss and jitter. More importantly, we introduce a novel feature engineering method to transform network-dependent metrics (e.g., total packet count and round trip time) in training datasets into network-independent forms to be able to transfer the models to new network settings without requiring to retrain them. Experimental results in various network settings show that the proposed feature engineering approach improves the performance of the models in previously unseen network settings from around 60% to nearly 90%. We believe ability to transfer ML models across networks will pave the way for wide adoption of ML solutions in production networks where collecting labeled data is not possible.
{"title":"Towards Generalizable Network Anomaly Detection Models","authors":"M. Arifuzzaman, Shafkat Islam, Engin Arslan","doi":"10.1109/lcn52139.2021.9525015","DOIUrl":"https://doi.org/10.1109/lcn52139.2021.9525015","url":null,"abstract":"Finding the root causes of network performance anomalies is critical to satisfy the quality of service requirements. In this paper, we introduce machine learning (ML) models to process TCP socket statistics to pinpoint underlying reasons of performance issues such as packet loss and jitter. More importantly, we introduce a novel feature engineering method to transform network-dependent metrics (e.g., total packet count and round trip time) in training datasets into network-independent forms to be able to transfer the models to new network settings without requiring to retrain them. Experimental results in various network settings show that the proposed feature engineering approach improves the performance of the models in previously unseen network settings from around 60% to nearly 90%. We believe ability to transfer ML models across networks will pave the way for wide adoption of ML solutions in production networks where collecting labeled data is not possible.","PeriodicalId":222740,"journal":{"name":"2021 IEEE 46th Conference on Local Computer Networks (LCN)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126254396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：