Pub Date : 2023-07-10DOI: 10.1109/LANMAN58293.2023.10189419
Kristjon Ciko, M. Welzl, P. Teymoori
To fight global warming, carbon emissions must urgently be reduced. In this paper, we look at opportunities to do so by diminishing the operational energy usage of an important always-on element of the Internet: server systems. Our measurements from a server host indicate that there is probably not much to be gained by making a significant software change - but, depending on the system, a simple, easily overlooked configuration update may make a difference at no performance cost. This difference is small per server (in the order of an LED light bulb). Given the multitude of permanently operational servers in the world, it may however be significant at scale.
{"title":"Going Dark: A Software “Light Switch” for Internet Servers","authors":"Kristjon Ciko, M. Welzl, P. Teymoori","doi":"10.1109/LANMAN58293.2023.10189419","DOIUrl":"https://doi.org/10.1109/LANMAN58293.2023.10189419","url":null,"abstract":"To fight global warming, carbon emissions must urgently be reduced. In this paper, we look at opportunities to do so by diminishing the operational energy usage of an important always-on element of the Internet: server systems. Our measurements from a server host indicate that there is probably not much to be gained by making a significant software change - but, depending on the system, a simple, easily overlooked configuration update may make a difference at no performance cost. This difference is small per server (in the order of an LED light bulb). Given the multitude of permanently operational servers in the world, it may however be significant at scale.","PeriodicalId":416011,"journal":{"name":"2023 IEEE 29th International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"603 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123229948","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 : 2023-07-10DOI: 10.1109/LANMAN58293.2023.10189416
Soumya Kanta Rana, Himanshu Verma, Joydeep Pal, Deepak Choudhary, T. V. Prabhakar, C. Singh
The IEEE 802.1CB standard for Frame Replication and Elimination for Reliability (FRER) emphasises improving reliability by introducing link redundancy. In this paper, two approaches towards the elimination of duplicates are implemented on a programmable pipelined switch. The first approach meets the intermittent stream traffic goal of the standard. A sliding window-based algorithm is used for storing and comparing identification numbers of packets. The second approach handles bulk stream traffic by using a hash table along with the sliding window for a faster lookup, making it more scalable. Hash-collision mitigation with the help of stream identification is also incorporated in the hash table approach. The algorithms are implemented in P4 and Micro-C. Latency versus window size obtained for both the approaches and the end-to-end packet loss reduction yielded by FRER in presence of lossy intermediate links are demonstrated.
{"title":"Enhancing Reliability of Scheduled Traffic in Time-Sensitive Networks using Frame Replication and Elimination","authors":"Soumya Kanta Rana, Himanshu Verma, Joydeep Pal, Deepak Choudhary, T. V. Prabhakar, C. Singh","doi":"10.1109/LANMAN58293.2023.10189416","DOIUrl":"https://doi.org/10.1109/LANMAN58293.2023.10189416","url":null,"abstract":"The IEEE 802.1CB standard for Frame Replication and Elimination for Reliability (FRER) emphasises improving reliability by introducing link redundancy. In this paper, two approaches towards the elimination of duplicates are implemented on a programmable pipelined switch. The first approach meets the intermittent stream traffic goal of the standard. A sliding window-based algorithm is used for storing and comparing identification numbers of packets. The second approach handles bulk stream traffic by using a hash table along with the sliding window for a faster lookup, making it more scalable. Hash-collision mitigation with the help of stream identification is also incorporated in the hash table approach. The algorithms are implemented in P4 and Micro-C. Latency versus window size obtained for both the approaches and the end-to-end packet loss reduction yielded by FRER in presence of lossy intermediate links are demonstrated.","PeriodicalId":416011,"journal":{"name":"2023 IEEE 29th International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122315446","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 : 2023-07-10DOI: 10.1109/LANMAN58293.2023.10189807
Mohamed A. M. Seliem, A. Zahran, D. Pesch
Many Industrial Internet of Things (IIoT) applications have zero fault tolerance. Redundant networks are hence an important prerequisite for a dependable infrastructure to serve the various data traffic classes required for such applications. In this paper, we perform a delay analysis of a Quality Checks After Production (QCAP) application, which is running on a Time-Sensitive Network (TSN). We evaluate the worst-case delay of all data flows traversing the redundant TSN network using a Network Calculus (NC) based framework. We also evaluate how network parameters and configurations affect the QCAP application's service requirements.
{"title":"Delay Analysis of Redundant TSN-based Industrial Networks using Network Calculus","authors":"Mohamed A. M. Seliem, A. Zahran, D. Pesch","doi":"10.1109/LANMAN58293.2023.10189807","DOIUrl":"https://doi.org/10.1109/LANMAN58293.2023.10189807","url":null,"abstract":"Many Industrial Internet of Things (IIoT) applications have zero fault tolerance. Redundant networks are hence an important prerequisite for a dependable infrastructure to serve the various data traffic classes required for such applications. In this paper, we perform a delay analysis of a Quality Checks After Production (QCAP) application, which is running on a Time-Sensitive Network (TSN). We evaluate the worst-case delay of all data flows traversing the redundant TSN network using a Network Calculus (NC) based framework. We also evaluate how network parameters and configurations affect the QCAP application's service requirements.","PeriodicalId":416011,"journal":{"name":"2023 IEEE 29th International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126918461","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 : 2023-07-10DOI: 10.1109/LANMAN58293.2023.10189417
Jörg Deutschmann, K. Hielscher, Reinhard German
Paths with high delay and packet loss are problematic for transport protocols, especially when loss-based congestion control algorithms are used. Our topology of interest is a geostationary satellite path (round trip time approx. 600 ms) with additional packet loss, which could be caused by a lossy wireless local area network. In geostationary satellite networks, Performance Enhancing Proxies split TCP connections to improve performance, but this is not possible in case of encrypted transport protocols (VPNs, QUIC). This motivates the use of local loss recovery, i.e., avoiding packet loss on specific path segments. We briefly discuss related concepts, architectures, and protocols. We then evaluate local loss recovery using a TCP tunnel on the lossy link. By means of a simple emulation setup, we demonstrate that local loss recovery has great performance benefits if CUBIC is used. It is also shown that BBR works well for high-delay and lossy paths even without local loss recovery.
{"title":"CUBIC Local Loss Recovery vs. BBR on (Satellite) Internet Paths","authors":"Jörg Deutschmann, K. Hielscher, Reinhard German","doi":"10.1109/LANMAN58293.2023.10189417","DOIUrl":"https://doi.org/10.1109/LANMAN58293.2023.10189417","url":null,"abstract":"Paths with high delay and packet loss are problematic for transport protocols, especially when loss-based congestion control algorithms are used. Our topology of interest is a geostationary satellite path (round trip time approx. 600 ms) with additional packet loss, which could be caused by a lossy wireless local area network. In geostationary satellite networks, Performance Enhancing Proxies split TCP connections to improve performance, but this is not possible in case of encrypted transport protocols (VPNs, QUIC). This motivates the use of local loss recovery, i.e., avoiding packet loss on specific path segments. We briefly discuss related concepts, architectures, and protocols. We then evaluate local loss recovery using a TCP tunnel on the lossy link. By means of a simple emulation setup, we demonstrate that local loss recovery has great performance benefits if CUBIC is used. It is also shown that BBR works well for high-delay and lossy paths even without local loss recovery.","PeriodicalId":416011,"journal":{"name":"2023 IEEE 29th International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129424836","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}
Network coding has been widely used as a technology to ensure efficient and reliable communication. The ability to recode packets at the intermediate nodes is a major benefit of network coding implementations. This allows the intermediate nodes to choose a different code rate and fine-tune the outgoing transmission to the channel conditions, decoupling the requirement for the source node to compensate for cumulative losses over a multi-hop network. Block network coding solutions already have practical recoders but an on-the-fly recoder for sliding window network coding has not been studied in detail. In this paper, we present the implementation details of a practical recoder for sliding window network coding for the first time along with a comprehensive performance analysis of a multi-hop network using the recoder. The sliding window recoder ensures that the network performs closest to its capacity and that each node can use its outgoing links efficiently.
{"title":"Practical Sliding Window Recoder: Design, Analysis, and Usecases","authors":"Vipindev Adat Vasudevan, Tarun Soni, Muriel M'edard","doi":"10.1109/LANMAN58293.2023.10189420","DOIUrl":"https://doi.org/10.1109/LANMAN58293.2023.10189420","url":null,"abstract":"Network coding has been widely used as a technology to ensure efficient and reliable communication. The ability to recode packets at the intermediate nodes is a major benefit of network coding implementations. This allows the intermediate nodes to choose a different code rate and fine-tune the outgoing transmission to the channel conditions, decoupling the requirement for the source node to compensate for cumulative losses over a multi-hop network. Block network coding solutions already have practical recoders but an on-the-fly recoder for sliding window network coding has not been studied in detail. In this paper, we present the implementation details of a practical recoder for sliding window network coding for the first time along with a comprehensive performance analysis of a multi-hop network using the recoder. The sliding window recoder ensures that the network performs closest to its capacity and that each node can use its outgoing links efficiently.","PeriodicalId":416011,"journal":{"name":"2023 IEEE 29th International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127370146","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 : 2023-06-14DOI: 10.1109/LANMAN58293.2023.10189424
Zhe Wang, Tingkai Yan
With the development of the Internet of Vehicles (IoV), vehicle wireless communication poses serious cybersecurity challenges. Faulty information, such as fake vehicle positions and speeds sent by surrounding vehicles, could cause vehicle collisions, traffic jams, and even casualties. Additionally, private vehicle data leakages, such as vehicle trajectory and user account information, may damage user property and security. Therefore, achieving a cyberattack-defense scheme in the IoV system with faulty data saturation is necessary. This paper proposes a Federated Learning-based Vehicle Trajectory Prediction Algorithm against Cyberattacks (FL-TP) to address the above problems. The FL-TP is intensively trained and tested using a publicly available Vehicular Reference Misbehavior (VeReMi) dataset with five types of cyberattacks: constant, constant offset, random, random offset, and eventual stop. The results show that the proposed FL-TP algorithm can improve cyberattack detection and trajectory prediction by up to 6.99 % and 54.86%, respectively, under the maximum cyberattack permeability scenarios compared with benchmark methods.
{"title":"Federated Learning-based Vehicle Trajectory Prediction against Cyberattacks","authors":"Zhe Wang, Tingkai Yan","doi":"10.1109/LANMAN58293.2023.10189424","DOIUrl":"https://doi.org/10.1109/LANMAN58293.2023.10189424","url":null,"abstract":"With the development of the Internet of Vehicles (IoV), vehicle wireless communication poses serious cybersecurity challenges. Faulty information, such as fake vehicle positions and speeds sent by surrounding vehicles, could cause vehicle collisions, traffic jams, and even casualties. Additionally, private vehicle data leakages, such as vehicle trajectory and user account information, may damage user property and security. Therefore, achieving a cyberattack-defense scheme in the IoV system with faulty data saturation is necessary. This paper proposes a Federated Learning-based Vehicle Trajectory Prediction Algorithm against Cyberattacks (FL-TP) to address the above problems. The FL-TP is intensively trained and tested using a publicly available Vehicular Reference Misbehavior (VeReMi) dataset with five types of cyberattacks: constant, constant offset, random, random offset, and eventual stop. The results show that the proposed FL-TP algorithm can improve cyberattack detection and trajectory prediction by up to 6.99 % and 54.86%, respectively, under the maximum cyberattack permeability scenarios compared with benchmark methods.","PeriodicalId":416011,"journal":{"name":"2023 IEEE 29th International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127380230","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 : 2023-06-01DOI: 10.1109/lanman58293.2023.10189425
{"title":"Message from the TPC Chairs","authors":"","doi":"10.1109/lanman58293.2023.10189425","DOIUrl":"https://doi.org/10.1109/lanman58293.2023.10189425","url":null,"abstract":"","PeriodicalId":416011,"journal":{"name":"2023 IEEE 29th International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130379069","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 : 2023-03-21DOI: 10.1109/LANMAN58293.2023.10189812
Erol Gelenbe, Mert Nakıp
This paper presents several novel algorithms for real-time cyberattack detection using the Auto-Associative Deep Random Neural Network. Some of these algorithms require offline learning, while others allow the algorithm to learn during its normal operation while it is also testing the flow of incoming traffic to detect possible attacks. Most of the methods we present are designed to be used at a single node, while one specific method collects data from multiple network ports to detect and monitor the spread of a Botnet. The evaluation of the accuracy of all these methods is carried out with real attack traces. The novel methods presented here are compared with other state-of-the-art approaches, showing that they offer better or equal performance, with lower learning times and shorter detection times, as compared to the existing state-of-the-art approaches.
{"title":"Real-Time Cyberattack Detection with Offline and Online Learning","authors":"Erol Gelenbe, Mert Nakıp","doi":"10.1109/LANMAN58293.2023.10189812","DOIUrl":"https://doi.org/10.1109/LANMAN58293.2023.10189812","url":null,"abstract":"This paper presents several novel algorithms for real-time cyberattack detection using the Auto-Associative Deep Random Neural Network. Some of these algorithms require offline learning, while others allow the algorithm to learn during its normal operation while it is also testing the flow of incoming traffic to detect possible attacks. Most of the methods we present are designed to be used at a single node, while one specific method collects data from multiple network ports to detect and monitor the spread of a Botnet. The evaluation of the accuracy of all these methods is carried out with real attack traces. The novel methods presented here are compared with other state-of-the-art approaches, showing that they offer better or equal performance, with lower learning times and shorter detection times, as compared to the existing state-of-the-art approaches.","PeriodicalId":416011,"journal":{"name":"2023 IEEE 29th International Symposium on Local and Metropolitan Area Networks (LANMAN)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115451563","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
扫码关注我们
求助内容：
应助结果提醒方式：