Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843510
Sanku Kumar Roy, I. Nikolaidis
We consider the problem of lossy compression of time series data collected by wireless sensor nodes, such that it produces a limited volume of compressed data for a given amount of raw data. The lossy compression is performed in a manner that minimizes the resulting L∞ reconstruction error. Producing a bounded volume of compressed data is desirable in circumstances where we wish to know, or limit, the rate at which the compressed data are communicated, e.g., for periodic communication scheduling of fixed payload transmissions. The work is also geared to understanding the impact of, and accommodating for, storage limitations of Wireless Sensor Network (WSN) nodes. The proposed scheme belongs to the class of piecewise linear approximations (PLAs) and its performance is compared to other PLA schemes proposed for WSNs. The evaluation is carried out using existing public data sets.
{"title":"Limited Size Lossy Compression for WSNs","authors":"Sanku Kumar Roy, I. Nikolaidis","doi":"10.1109/LCN53696.2022.9843510","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843510","url":null,"abstract":"We consider the problem of lossy compression of time series data collected by wireless sensor nodes, such that it produces a limited volume of compressed data for a given amount of raw data. The lossy compression is performed in a manner that minimizes the resulting L∞ reconstruction error. Producing a bounded volume of compressed data is desirable in circumstances where we wish to know, or limit, the rate at which the compressed data are communicated, e.g., for periodic communication scheduling of fixed payload transmissions. The work is also geared to understanding the impact of, and accommodating for, storage limitations of Wireless Sensor Network (WSN) nodes. The proposed scheme belongs to the class of piecewise linear approximations (PLAs) and its performance is compared to other PLA schemes proposed for WSNs. The evaluation is carried out using existing public data sets.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125524657","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 : 2022-09-26DOI: 10.1109/LCN53696.2022.9843472
Roy Chowdhury, Sukumar Nandi, D. Goswami
Video traffic demands for vehicle infotainment services have rapidly increased in recent years. To reduce bandwidth costs and delays, content distributors (CD) use edge vehicles to distribute video contents over vehicular networks. CDs usually offer multiple subscription tiers of varying video qualities for their clients. A CD’s business goal is to make a minimal edge vehicle selection to maximize Internet traffic offloading while satisfying heterogeneous video quality requirements of clients belonging to different subscription tiers. This work proposes an optimum cost-effective solution for edge vehicle selection for delay-constrained live video streaming over vehicular networks with multi-tier bitrate agreements. The edge vehicle selection problem is formulated as the minimum set covering problem for optimum results, and a distributed approximation solution is proposed to increase scalability. Simulation results show that the proposed solution is cost-effective for CDs and saves significant control message overhead while satisfying delay constraints and multi-tier bitrate agreements.
{"title":"Cost-effective Distributed Edge vehicle selection for Multi-tier Video streaming over Vehicular network","authors":"Roy Chowdhury, Sukumar Nandi, D. Goswami","doi":"10.1109/LCN53696.2022.9843472","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843472","url":null,"abstract":"Video traffic demands for vehicle infotainment services have rapidly increased in recent years. To reduce bandwidth costs and delays, content distributors (CD) use edge vehicles to distribute video contents over vehicular networks. CDs usually offer multiple subscription tiers of varying video qualities for their clients. A CD’s business goal is to make a minimal edge vehicle selection to maximize Internet traffic offloading while satisfying heterogeneous video quality requirements of clients belonging to different subscription tiers. This work proposes an optimum cost-effective solution for edge vehicle selection for delay-constrained live video streaming over vehicular networks with multi-tier bitrate agreements. The edge vehicle selection problem is formulated as the minimum set covering problem for optimum results, and a distributed approximation solution is proposed to increase scalability. Simulation results show that the proposed solution is cost-effective for CDs and saves significant control message overhead while satisfying delay constraints and multi-tier bitrate agreements.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127686226","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}
The IPv6 Segment Routing (SRv6) is a promising solution to support services such as service function chain (SFC) and network function virtualization (NFV). But the SRv6 implementation in the Linux kernel is being criticized for lack of programmability and scalability. In this paper, we present an efficient implementation of the SRv6 data plane based on AF_XDP (SRA) in userspace. By leveraging the AF_XDP supported in the Linux kernel, we implement a high-performance and programmable framework that allows network operators to encode their own network functions. Moreover, these functions can automatically execute in userspace and Linux network namespaces while processing specific packets. In addition, SRA also implements SR-proxy to support the Virtual Network Functions (VNFs) chaining based on SRv6. Experimental results show that SRA achieves high performance and enhances integration with the kernel ecosystem. In all scenarios, SRA processes faster than other implementations, such as the SRv6 implementation in the Linux kernel and SREXT module, and in some scenarios, SRA is even 10 times faster than the SRv6 implementation in the Linux kernel. Meanwhile, the proposed architecture can be easily extended to support new SRv6 behaviors and network functions.
SRv6 (IPv6 Segment Routing)是一种很有前途的解决方案，可以支持SFC (service function chain)和NFV (network function virtualization)等业务。但是Linux内核中的SRv6实现因缺乏可编程性和可伸缩性而受到批评。在本文中，我们提出了一种在用户空间中基于AF_XDP (SRA)的SRv6数据平面的有效实现。通过利用Linux内核中支持的AF_XDP，我们实现了一个高性能的可编程框架，该框架允许网络运营商对自己的网络功能进行编码。此外，在处理特定的数据包时，这些函数可以在用户空间和Linux网络名称空间中自动执行。此外，SRA还实现了SR-proxy，支持基于SRv6的VNFs (Virtual Network Functions)链。实验结果表明，该算法取得了较高的性能，增强了与内核生态系统的集成。在所有场景中，SRA的处理速度都比其他实现快，例如Linux内核中的SRv6实现和SREXT模块，在某些场景中，SRA甚至比Linux内核中的SRv6实现快10倍。同时，所提出的架构可以很容易地扩展，以支持新的SRv6行为和网络功能。
{"title":"SRA: Leveraging AF_XDP for Programmable Network Functions with IPv6 Segment Routing","authors":"Baosen Zhao, Yifang Qin, Wanghong Yang, Pengfei Fan, Xu Zhou","doi":"10.1109/LCN53696.2022.9843244","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843244","url":null,"abstract":"The IPv6 Segment Routing (SRv6) is a promising solution to support services such as service function chain (SFC) and network function virtualization (NFV). But the SRv6 implementation in the Linux kernel is being criticized for lack of programmability and scalability. In this paper, we present an efficient implementation of the SRv6 data plane based on AF_XDP (SRA) in userspace. By leveraging the AF_XDP supported in the Linux kernel, we implement a high-performance and programmable framework that allows network operators to encode their own network functions. Moreover, these functions can automatically execute in userspace and Linux network namespaces while processing specific packets. In addition, SRA also implements SR-proxy to support the Virtual Network Functions (VNFs) chaining based on SRv6. Experimental results show that SRA achieves high performance and enhances integration with the kernel ecosystem. In all scenarios, SRA processes faster than other implementations, such as the SRv6 implementation in the Linux kernel and SREXT module, and in some scenarios, SRA is even 10 times faster than the SRv6 implementation in the Linux kernel. Meanwhile, the proposed architecture can be easily extended to support new SRv6 behaviors and network functions.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"27 12","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120860250","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 : 2022-09-26DOI: 10.1109/LCN53696.2022.9843801
Konrad Wolsing, Antoine Saillard, Jan Bauer, Eric Wagner, Christian van Sloun, I. Fink, Marissa Schmidt, Klaus Wehrle, Martin Henze
Shipboard marine radar systems are essential for safe navigation, helping seafarers perceive their surroundings as they provide bearing and range estimations, object detection, and tracking. Since onboard systems have become increasingly digitized, interconnecting distributed electronics, radars have been integrated into modern bridge systems. But digitization increases the risk of cyberattacks, especially as vessels cannot be considered air-gapped. Consequently, in-depth security is crucial. However, particularly radar systems are not sufficiently protected against harmful network-level adversaries. Therefore, we ask: Can seafarers believe their eyes? In this paper, we identify possible attacks on radar communication and discuss how these threaten safe vessel operation in an attack taxonomy. Furthermore, we develop a holistic simulation environment with radar, complementary nautical sensors, and prototypically implemented cyberattacks from our taxonomy. Finally, leveraging this environment, we create a comprehensive dataset (RadarPWN) with radar network attacks that provides a foundation for future security research to secure marine radar communication.
{"title":"Network Attacks Against Marine Radar Systems: A Taxonomy, Simulation Environment, and Dataset","authors":"Konrad Wolsing, Antoine Saillard, Jan Bauer, Eric Wagner, Christian van Sloun, I. Fink, Marissa Schmidt, Klaus Wehrle, Martin Henze","doi":"10.1109/LCN53696.2022.9843801","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843801","url":null,"abstract":"Shipboard marine radar systems are essential for safe navigation, helping seafarers perceive their surroundings as they provide bearing and range estimations, object detection, and tracking. Since onboard systems have become increasingly digitized, interconnecting distributed electronics, radars have been integrated into modern bridge systems. But digitization increases the risk of cyberattacks, especially as vessels cannot be considered air-gapped. Consequently, in-depth security is crucial. However, particularly radar systems are not sufficiently protected against harmful network-level adversaries. Therefore, we ask: Can seafarers believe their eyes? In this paper, we identify possible attacks on radar communication and discuss how these threaten safe vessel operation in an attack taxonomy. Furthermore, we develop a holistic simulation environment with radar, complementary nautical sensors, and prototypically implemented cyberattacks from our taxonomy. Finally, leveraging this environment, we create a comprehensive dataset (RadarPWN) with radar network attacks that provides a foundation for future security research to secure marine radar communication.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127770545","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 : 2022-09-26DOI: 10.1109/lcn53696.2022.9843309
{"title":"Best Paper Awards for Prior IEEE LCN Conferences","authors":"","doi":"10.1109/lcn53696.2022.9843309","DOIUrl":"https://doi.org/10.1109/lcn53696.2022.9843309","url":null,"abstract":"","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116693374","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 : 2022-09-26DOI: 10.1109/LCN53696.2022.9843385
Mohamed-Anis Mekki, Nassima Toumi, A. Ksentini
Cloud-native rethinks the application architecture by embracing a micro-service approach, where each microservice is packaged into containers to run in a centralized or an edge cloud. When deploying the container running the micro-service, the tenant has to specify the amount of CPU and memory limit to run their workload. However, it is not straightforward for a tenant to know in advance the computing amount that allows running the microservice optimally. This will impact the service performances and the infrastructure provider, particularly if the resource overprovisioning approach is used. To overcome this issue, we conduct in this paper an experimental study aiming to detect if a tenant’s configuration allows running its service optimally. We run several experiments on a cloud-native platform, using different types of applications under different resource configurations. The obtained results provide insights on how to detect and correct performance degradation due to misconfiguration of the service resource.
{"title":"Microservices Configurations and the Impact on the Performance in Cloud Native Environments","authors":"Mohamed-Anis Mekki, Nassima Toumi, A. Ksentini","doi":"10.1109/LCN53696.2022.9843385","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843385","url":null,"abstract":"Cloud-native rethinks the application architecture by embracing a micro-service approach, where each microservice is packaged into containers to run in a centralized or an edge cloud. When deploying the container running the micro-service, the tenant has to specify the amount of CPU and memory limit to run their workload. However, it is not straightforward for a tenant to know in advance the computing amount that allows running the microservice optimally. This will impact the service performances and the infrastructure provider, particularly if the resource overprovisioning approach is used. To overcome this issue, we conduct in this paper an experimental study aiming to detect if a tenant’s configuration allows running its service optimally. We run several experiments on a cloud-native platform, using different types of applications under different resource configurations. The obtained results provide insights on how to detect and correct performance degradation due to misconfiguration of the service resource.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134552777","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 : 2022-09-26DOI: 10.1109/LCN53696.2022.9843647
Zhejiayu Ma, Soufiane Rouibia, F. Giroire, G. Urvoy-Keller
A hybrid CDN/Viewer-to-Viewer (V2V) architecture is an attractive solution for HTTP (HLS) and MPEG-DASH-based live streaming providers. It combines a traditional CDN with a V2V overlay for exchanging video fragments, reducing the cost of the CDN while maintaining the quality of experience. This work explores machine learning models to address the key challenge of neighbor selection. Our goal is to predict the connection quality between two arbitrary viewers using features such as locality, access providers, operating systems, past CDN, and V2V throughput. The proposed solutions are validated using an A/B testing approach on our production system, demonstrating a significant improvement in key system metrics compared to the traditional locality-based methods. We observe 17% higher V2V throughput, 26% lower delay, 37% fewer lost chunks, 39% fewer re-buffering, and 20% fewer quality switches.
{"title":"Neighbor Selection Strategies in the Wild for CDN/V2V WebRTC Live Streaming: Can we learn what a good neighbor is?","authors":"Zhejiayu Ma, Soufiane Rouibia, F. Giroire, G. Urvoy-Keller","doi":"10.1109/LCN53696.2022.9843647","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843647","url":null,"abstract":"A hybrid CDN/Viewer-to-Viewer (V2V) architecture is an attractive solution for HTTP (HLS) and MPEG-DASH-based live streaming providers. It combines a traditional CDN with a V2V overlay for exchanging video fragments, reducing the cost of the CDN while maintaining the quality of experience. This work explores machine learning models to address the key challenge of neighbor selection. Our goal is to predict the connection quality between two arbitrary viewers using features such as locality, access providers, operating systems, past CDN, and V2V throughput. The proposed solutions are validated using an A/B testing approach on our production system, demonstrating a significant improvement in key system metrics compared to the traditional locality-based methods. We observe 17% higher V2V throughput, 26% lower delay, 37% fewer lost chunks, 39% fewer re-buffering, and 20% fewer quality switches.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121508448","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 : 2022-09-26DOI: 10.1109/LCN53696.2022.9843483
Houda Amari, L. Khoukhi, Lamia Hadrich Belguith
Vehicle Ad-hoc Network (VANET) is the main component of the intelligent transportation system. With the development of the next-generation intelligent vehicular networks, the latter aims to provide strategic and secure services and communications in roads and smart cities. Due to VANET’s unique characteristics, such as high mobility of its nodes, self-organization, distributed network, and frequently changing topology, security, data integrity, and users’ privacy information are major concerns. Also, attack prevention is still an open issue. Distributed Denial of Service (DDoS) is one of the most dangerous attacks in VANETs, which aims to flood the system’s bandwidth. In this article, we propose a hierarchical architecture for securing Software-Defined Vehicular Network (SDVN) and a security model for predicting and detecting DDoS attacks based on behavioral analysis of nodes achieved by a Markov stochastic process. Simulation results show that our model effectively mitigates DDoS attacks with a high-reliability rate.
{"title":"Prediction and detection model for hierarchical Software-Defined Vehicular Network","authors":"Houda Amari, L. Khoukhi, Lamia Hadrich Belguith","doi":"10.1109/LCN53696.2022.9843483","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843483","url":null,"abstract":"Vehicle Ad-hoc Network (VANET) is the main component of the intelligent transportation system. With the development of the next-generation intelligent vehicular networks, the latter aims to provide strategic and secure services and communications in roads and smart cities. Due to VANET’s unique characteristics, such as high mobility of its nodes, self-organization, distributed network, and frequently changing topology, security, data integrity, and users’ privacy information are major concerns. Also, attack prevention is still an open issue. Distributed Denial of Service (DDoS) is one of the most dangerous attacks in VANETs, which aims to flood the system’s bandwidth. In this article, we propose a hierarchical architecture for securing Software-Defined Vehicular Network (SDVN) and a security model for predicting and detecting DDoS attacks based on behavioral analysis of nodes achieved by a Markov stochastic process. Simulation results show that our model effectively mitigates DDoS attacks with a high-reliability rate.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130016839","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 : 2022-09-26DOI: 10.1109/LCN53696.2022.9843564
Martin Nischwitz, M. Esche, Florian Tschorsch
Classic BFT protocols are often deployed in the LAN setting, with low delays and reliable links. Recent publications of BFT protocols have decreased drastically in their communication complexity and the application to previously unsuited areas such as mobile or sensor networks is getting more traction. To facilitate that development and showcase suitability under harsher network conditions, we take one of the most recent BFT protocols, HotStuff, and analyze the impact of increased and varying network delays on its performance. We apply the delay prediction scheme AWARE and make some simple modifications to the prediction algorithm in order to increase its performance even further.
{"title":"Raising the AWAREness of BFT Protocols for Soaring Network Delays","authors":"Martin Nischwitz, M. Esche, Florian Tschorsch","doi":"10.1109/LCN53696.2022.9843564","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843564","url":null,"abstract":"Classic BFT protocols are often deployed in the LAN setting, with low delays and reliable links. Recent publications of BFT protocols have decreased drastically in their communication complexity and the application to previously unsuited areas such as mobile or sensor networks is getting more traction. To facilitate that development and showcase suitability under harsher network conditions, we take one of the most recent BFT protocols, HotStuff, and analyze the impact of increased and varying network delays on its performance. We apply the delay prediction scheme AWARE and make some simple modifications to the prediction algorithm in order to increase its performance even further.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114421440","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
扫码关注我们
求助内容：
应助结果提醒方式：