EdutechPub Date : 2023-06-12DOI: 10.23919/IFIPNetworking57963.2023.10186424
Alex Staves, Sam Maesschalck, R. Derbyshire, B. Green, D. Hutchison
{"title":"Learning to Walk: Towards Assessing the Maturity of OT Security Control Standards and Guidelines","authors":"Alex Staves, Sam Maesschalck, R. Derbyshire, B. Green, D. Hutchison","doi":"10.23919/IFIPNetworking57963.2023.10186424","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186424","url":null,"abstract":"The convergence of IT and OT has presented OT environments with several challenges, such as increasing the attack surface of its real time systems to include more commonplace enterprise vulnerabilities. As OT is used across heavily regulated sectors, including water and nuclear, many standards and guidelines are available to these sectors, providing them with assistance towards continued improvements from a cyber security perspective. However, these standards and guidelines are not always as mature as their IT counterparts. This paper proposes a model to benchmark the maturity of OT focused standards and guidelines, which we then use to analyse seven commonly adopted resources. Based on this analysis, we find that these OT standards and guidelines do not always provide in-depth implementation guidance, and often refer instead to IT standards and guidelines for more information. Improvements are urgently needed in security and risk mitigation for interconnected OT and IT systems, as security controls in OT are typically re-appropriated IT controls. To help achieve this goal, OT standards must mature further.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"63 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2023-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80157603","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}
EdutechPub Date : 2023-06-12DOI: 10.23919/IFIPNetworking57963.2023.10186420
Fatemeh Marzani, F. Esfahani, Zeynab Sabahi-Kaviani, T. V. Ede, Michael Steen
{"title":"Mobile App Fingerprinting through Automata Learning and Machine Learning","authors":"Fatemeh Marzani, F. Esfahani, Zeynab Sabahi-Kaviani, T. V. Ede, Michael Steen","doi":"10.23919/IFIPNetworking57963.2023.10186420","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186420","url":null,"abstract":"Application fingerprinting is crucial in network management and security to provide the best Quality of Service (QoS). To generate fingerprints for applications, we use an automata learning algorithm to observe the temporal order among destination-related features of network traffic and create a language as a fingerprint. We label fingerprints through machine learning classifiers. We propose our approach in a framework called ML-NetLang for fingerprinting mobile applications from encrypted network traffic. Our evaluation achieves an average accuracy of 95% for Android and iOS applications. ML-NetLang outperforms comparable state-of-the-art techniques using behavioral-based, correlation-based, and machine-learning solutions.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"123 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2023-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78162180","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}
EdutechPub Date : 2023-06-12DOI: 10.23919/IFIPNetworking57963.2023.10186359
Cheick Tidiani Cisse, Oumaya Baala, V. Guillet, F. Spies, A. Caminada
{"title":"IRGAN: cGAN-based Indoor Radio Map Prediction","authors":"Cheick Tidiani Cisse, Oumaya Baala, V. Guillet, F. Spies, A. Caminada","doi":"10.23919/IFIPNetworking57963.2023.10186359","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186359","url":null,"abstract":"Radio map or radio coverage prediction in indoor and outdoor remains a challenge of great interest due to the large number of applications it allows. Many techniques such as data-driven interpolation methods, model-based data fitting methods, model-based prediction methods exist. However, each of them has their limitations (computation time, accuracy, level of input information required, generalization to different environments). Also indoors seems less studied than outdoors. In this paper, a multi-material model and its enhanced version boosted by attention mechanism for indoor radio map prediction are introduced. The proposed models are based on conditional Generative Adversarial Networks (cGANs) and take floor plan images as input. We also propose a new method for floor plan images preprocessing by segmentation to characterize the materials in the environment of interest, which alleviates user's effort. The validity and efficiency of our method in generating high quality radio maps in different environments and its ability to consider the electromagnetic properties of materials are verified on two simulated datasets. Numerical results show that our approach outperforms state of the art methods.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"58 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2023-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91370957","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}
EdutechPub Date : 2023-06-12DOI: 10.23919/IFIPNetworking57963.2023.10186439
Henning Stubbe, Sebastian Gallenmüller, Manuel Simon, Eric Hauser, D. Scholz, Georg Carle
{"title":"Keeping up to Date with P4Runtime: An Analysis of Data Plane Updates on P4 Switches","authors":"Henning Stubbe, Sebastian Gallenmüller, Manuel Simon, Eric Hauser, D. Scholz, Georg Carle","doi":"10.23919/IFIPNetworking57963.2023.10186439","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186439","url":null,"abstract":"The continuous increase of achievable data rates in computer networks is both blessing and curse. Increasing data rates enable novel applications through higher bandwidths. However, support for higher data rates requires devices to process packets reliably in an ever-decreasing amount of time per packet. In terms of software-defined networking: higher data rates call for a faster data plane. Nevertheless, the control plane must not be ignored; to faithfully react to data plane behavior, a high-performance control plane is essential. Otherwise, e.g., the data plane's state cannot be updated fast enough to cope with fast-paced traffic changes. In this case study, we investigate the control plane of a high-performance P4 switching ASIC. Moreover, we create a measurement methodology to track the delay between the reception of a rule update on the control plane and its actual application on the data plane of a P4 hardware switch. By applying the methodology to said ASIC, we can precisely describe its performance and non-atomicity in updates. Based on our findings, we apply multiple different approaches to optimize control plane latency. Our results highlight the need to consider latency on the control plane proportionate with the increase of achievable data rates.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"188 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2023-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85460884","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}
{"title":"TSN Gatekeeper: Enforcing stream reservations via P4-based in-network filtering","authors":"Nurefsan Sertbas Bülbül, Joshua Jannis Krüger, Mathias Fischer","doi":"10.23919/IFIPNetworking57963.2023.10186402","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186402","url":null,"abstract":"Real-time communication is crucial for mission critical scenarios, such as industrial automation and automotive applications. To meet these applications' strict quality of service (QoS) requirements, a new set of specifications, known as time-sensitive networking standards (TSN), has been proposed. TSN requires pre-registration of data streams before actual communication to help guarantee bandwidth and ensure constrained end-to-end latency. However, this mechanism is vulnerable to traffic overload and denial of service (DoS) attacks. This paper proposes a P4-based dynamic attack filtering as a link-layer network function to defend TSN against malicious network elements, such as faulty talkers or switches, directly on the data plane. Our experiments indicate that our P4-based implementation can filter malicious traffic with minimal overhead and minimize frame losses for legitimate traffic.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"74 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2023-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85951255","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}
EdutechPub Date : 2023-06-12DOI: 10.23919/IFIPNetworking57963.2023.10186387
Erik Daniel, Florian Tschorsch
{"title":"Privacy-Enhanced Content Discovery for Bitswap","authors":"Erik Daniel, Florian Tschorsch","doi":"10.23919/IFIPNetworking57963.2023.10186387","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186387","url":null,"abstract":"IPFS is a content-addressed peer-to-peer data network, which follows the paradigm of information centric networking. In IPFS, data is exchanged with the Bitswap protocol. For content discovery, Bitswap queries all neighbors for the content, leaking the interest to all neighbors. In our paper, we develop three privacy-enhanced protocols for content discovery, which reduce the interest leak from all neighbors to ideally one content provider. Our protocols use probabilistic data structures like Bloom filter and cryptographic approaches like Private Set Intersection. We implement our protocols as proof of concept and show how they can be integrated into go-bitswap. Furthermore, we provide a performance, security, and privacy evaluation of the three protocols, showing their feasibility trade-offs.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"23 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2023-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87424424","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}
EdutechPub Date : 2023-06-12DOI: 10.23919/IFIPNetworking57963.2023.10186441
Xiaolin Wang, Fen Zhou, Yaojun Chen, Ting Wang
{"title":"Maximal Distance Spectrum Assignment for Services Provisioning in Elastic Optical Networks","authors":"Xiaolin Wang, Fen Zhou, Yaojun Chen, Ting Wang","doi":"10.23919/IFIPNetworking57963.2023.10186441","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186441","url":null,"abstract":"In elastic optical networks (EONs), a suitable guard-band should be inserted between the spectrum assigned to two lightpaths to prevent crosstalk if they share common fiber links. In the meantime, these guard-bands may have diverse sizes for different lightpath pairs due to the strength of the crosstalk among them, which is determined by many factors, such as the required bandwidth, the number of common fiber links, and the modulation level of each lightpath. However, in the presence of a high traffic load, not all communication requests can be satisfied at all times since the spectrum resource on fiber links is limited. In light of this, service providers need to prioritize communication requests and even reject some of the low-priority requests in cases of traffic blocking, especially in peak hours. Therefore, we formulate the maximal distance spectrum assignment (max-DSA) problem to investigate how to maximize the sum of weights of requests we can serve and give them spectrum assignments under the constraint of limited spectrum resources. At first, since max-DSA is $mathcal{NP}$-hard, we propose an ILP model to get the optimal solution. Then, we give the upper and lower bounds of the optimal value of the max-DSA problem. To solve max-DSA efficiently in polynomial time, we propose a Vertex-Deletion Iteration (VDI) approximation algorithm. Our algorithm starts with building several initial feasible solutions and then improves the solutions iteratively until reaching the local optimality. Furthermore, we also prove that the max-DSA problem can be solved in polynomial time to optimality in some specific complete conflict graphs. The obtained numerical results have demonstrated that the VDI algorithm can find near-optimal solutions for max-DSA in various conflict graphs and under various limited spectral resources.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"1 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2023-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88668433","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}
EdutechPub Date : 2023-06-12DOI: 10.23919/IFIPNetworking57963.2023.10186429
Zhejiayu Ma, Soufiane Roubia, F. Giroire, G. Urvoy-Keller
{"title":"Q-learning for Waiting Time Control in CDN/V2V Live streaming","authors":"Zhejiayu Ma, Soufiane Roubia, F. Giroire, G. Urvoy-Keller","doi":"10.23919/IFIPNetworking57963.2023.10186429","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186429","url":null,"abstract":"HTTP-based streaming has become the dominant technology for streaming due to the widespread adoption of the HTTP protocol. Many streaming providers use a combination of Content Delivery Network (CDN) and Viewer-to-Viewer (V2V) technology, known as Hybrid CDN/V2V live streaming, for both efficiency and cost-effectiveness. V2V technology allows for of-floading streaming traffic from the CDN and reducing operational costs, and WebRTC technology facilitates direct V2V transfer, as it is natively supported by all browsers. In a WebRTC-based V2V network, some viewers cache the video chunks on their devices, while others wait and fetch chunks from their neighbors. A common strategy used to determine when a viewer should stop waiting for chunk delivery and revert to the CDN is called Random Waiting Time Control (RWC). However, due to the complex dynamics in the V2V system, RWC is far from optimal. In this work, we have formulated the Waiting Time Control determination problem as a reinforcement learning problem and proposed a Q-learning-based Waiting Time Control (QWC) solution. We conducted offline experiments in the Grid5000 [1] testbed and validated our results through a 14-day A/B testing in the wild. Our findings showed that QWC improves overall streaming Quality-of-Experience (QoE) in rebuffering (-29% fewer events), video quality (+17 % higher), and buffer length (+5 % longer), with a slightly improved V2V ratio (+5 % more).","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"9 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2023-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84781740","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}
EdutechPub Date : 2023-06-12DOI: 10.23919/IFIPNetworking57963.2023.10186398
George Papathanail, L. Mamatas, Panagiotis Papadimitriou
{"title":"Towards the Integration of TAPRIO-based Scheduling with Centralized TSN Control","authors":"George Papathanail, L. Mamatas, Panagiotis Papadimitriou","doi":"10.23919/IFIPNetworking57963.2023.10186398","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186398","url":null,"abstract":"Time-Sensitive Networking (TSN) aspires to provide a solid underpinning for meeting latency guarantees across traffic classes with diverse requirements. Despite the emergence of various specifications from the TSN family of standards, there is a shortage of prototype implementations with support for both TSN-based scheduling and its configuration by a Centralized Network Controller (CNC). To this end, we present the design and implementation of a TSN platform that couples Time-Aware Priority Shaper (TAPRIO) with CNC. The CNC is utilized to convey TSN schedules into TAPRIO using NETCONF and YANG. We employ this platform for assessing the impact of TAPRIO on the latency and jitter experienced by scheduled traffic. Furthermore, we quantify the TAPRIO configuration overhead by populating TSN schedule configurations by the CNC. Our experimental results corroborate the proper operation of TAPRIO and its efficient interaction with the CNC.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"96 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2023-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83502361","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}
EdutechPub Date : 2023-06-12DOI: 10.23919/IFIPNetworking57963.2023.10186362
Jayasree Sengupta, Mike Kosek, Justus Fries, Pratyush Dikshit, Vaibhav Bajpai
{"title":"Web Privacy By Design: Evaluating Cross-layer Interactions of QUIC, DNS and H/3","authors":"Jayasree Sengupta, Mike Kosek, Justus Fries, Pratyush Dikshit, Vaibhav Bajpai","doi":"10.23919/IFIPNetworking57963.2023.10186362","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186362","url":null,"abstract":"Every Web session involves a DNS resolution. While, in the last decade, we witnessed a promising trend towards an encrypted Web in general, DNS encryption has only recently gained traction with the standardisation of DNS over TLS (DoT) and DNS over HTTPS (DoH). Meanwhile, the rapid rise of QUIC deployment has now opened up an exciting opportunity to utilise the same protocol to not only encrypt Web communications, but also DNS. In this paper, we evaluate this benefit of using QUIC to coalesce name resolution via DNS over QUIC (DoQ), and Web content delivery via HTTP/3 (H3) with 0-RTT. We compare this scenario using several possible combinations where H3 is used in conjunction with DoH and DoQ, as well as the unencrypted DNS over UDP (DoUDP). We observe, that when using H3 1-RTT, page load times with DoH can get inflated by >30% over fixed-line and by >50% over mobile when compared to unencrypted DNS with DoUDP. However, this cost of encryption can be drastically reduced when encrypted connections are coalesced (DoQ + H3 0-RTT), thereby reducing the page load times by 1/3 over fixed-line and 1/2 over mobile, overall making connection coalescing with QUIC the best option for encrypted communication on the Internet.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"60 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2023-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89674438","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}