EdutechPub Date : 2023-04-20DOI: 10.23919/IFIPNetworking57963.2023.10186423
Panagiotis Promponas, Víctor Valls, L. Tassiulas
{"title":"Full Exploitation of Limited Memory in Quantum Entanglement Switching","authors":"Panagiotis Promponas, Víctor Valls, L. Tassiulas","doi":"10.23919/IFIPNetworking57963.2023.10186423","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186423","url":null,"abstract":"We study the problem of operating a quantum switch with memory constraints. In particular, the switch has to allocate quantum memories to clients to generate link-level entanglements (LLEs), and then use these to serve end-to-end entanglements requests. The paper's main contributions are (i) to characterize the switch's capacity region, and (ii) to propose a memory allocation policy (MEW) that is throughput optimal. The worst-case time complexity of MEW is exponential on the system parameters. However, when the requests are bipartite and the LLE attempts are always successful, we propose a variant of MEW (MEW2) that has polynomial time complexity. We evaluate the proposed policies numerically and illustrate their performance depending on the requests arrivals characteristics and the time available to obtain a memory allocation.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"224 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2023-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79359909","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-03-20DOI: 10.23919/IFIPNetworking57963.2023.10186421
Doğanalp Ergenç, Robin Schenderlein, Mathias Fischer
{"title":"TSNZeek: An Open-source Intrusion Detection System for IEEE 802.1 Time-sensitive Networking","authors":"Doğanalp Ergenç, Robin Schenderlein, Mathias Fischer","doi":"10.23919/IFIPNetworking57963.2023.10186421","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186421","url":null,"abstract":"IEEE 802.1 Time-sensitive Networking (TSN) standards are envisioned to replace legacy network protocols in critical domains to ensure reliable and deterministic communication over off-the-shelf Ethernet equipment. However, they lack security countermeasures and can even impose new attack vectors that may lead to hazardous consequences. This paper presents the first open-source security monitoring and intrusion detection mechanism, TSNZeek, for IEEE 802.1 TSN protocols. We extend an existing monitoring tool, Zeek, with a new packet parsing grammar to process TSN data traffic and a rule-based attack detection engine for TSN-specific threats. We also discuss various security-related configuration and design aspects for IEEE 802.1 TSN monitoring. Our experiments show that TSNZeek causes only ∼5% CPU overhead on top of Zeek and successfully detects various threats in a real TSN testbed.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"1 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2023-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75780615","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 : 2022-06-13DOI: 10.23919/ifipnetworking55013.2022.9829777
Alexej Grigorjew, Florian Metzger, T. Hossfeld, Johannes Specht, Franz-Josef Götz, Feng Chen, Jürgen Schmitt
{"title":"Constant Delay Switching: Asynchronous Traffic Shaping with Jitter Control","authors":"Alexej Grigorjew, Florian Metzger, T. Hossfeld, Johannes Specht, Franz-Josef Götz, Feng Chen, Jürgen Schmitt","doi":"10.23919/ifipnetworking55013.2022.9829777","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829777","url":null,"abstract":"Recent developments in the Time Sensitive Networking (TSN) group have put forth a number of mechanisms to improve deterministic latency in layer 2 switches. Their shaping approaches differ with respect to prerequisites, flexibility, maximum latency, and latency variation (jitter). Asynchronous solutions provide flexibility in dynamic scenarios, but Credit-Based Shaping (CBS) and Asynchronous Traffic Shaping (ATS) come with a high latency variance, as the minimum latency is not affected by them. Some applications in industrial and automotive use cases require low jitter while trying to avoid a dependency on time synchronization, and even TSN's redundancy mechanism benefits from a lower latency variance. This work is bridging the gap between low-jitter transmission requirements and asynchronous shaping mechanisms. In this paper, the application of a stateless Asynchronous Constant Delay Shaper (ACDS) is discussed. It collects the queuing duration from the previous bridge to delay each frame for the remaining time such that a constant per-hop delay for each frame is achieved. The discussion includes the prerequisites, the mechanism itself, and its technical complexity, as well as a formal analysis of its guaranteed latency by proving its relation to a token-bucket based ATS. Further, two extensions are discussed, and an evaluation shows the applicability of ACDS by comparing its jitter to ATS in a frame-level simulation.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"32 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2022-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73501729","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 : 2022-06-13DOI: 10.23919/ifipnetworking55013.2022.9829809
Christian Grasso, Raoul Raftopoulos, G. Schembra
{"title":"Tailoring FANET-Based 6G Network Slices in Remote Areas for Low-Latency Applications","authors":"Christian Grasso, Raoul Raftopoulos, G. Schembra","doi":"10.23919/ifipnetworking55013.2022.9829809","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829809","url":null,"abstract":"In the near future, 6G networks will be able to provide its users with heterogeneous tailored end-to-end network services for edge AI-powered applications. However, in many 6G use case scenarios there may not be structured network infrastructures. One solution to meet this problem is to bring computing, networking and storage facilities on site by means of UAVs. The target of this paper is to define a management framework for Flying Ad-Hoc Networks (FANET) aimed at bringing edge computing to remote areas, guaranteeing low latency to ground devices with heterogeneous requirements in terms of mean latency. The proposed framework allows zero-touch management of different network slices realized by partitioning the Computing Elements (CE) installed on each UAV of the FANET and wireless links connecting them to each other. An Inter-Slice Orchestrator is in charge of deciding this resource partition, while an Intra-Slice Orchestrator manages horizontal offload among UAVs for each slice via Reinforcement Learning, in order to minimize the end-to-end latency.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"35 1","pages":"1-6"},"PeriodicalIF":0.0,"publicationDate":"2022-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81110801","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 : 2022-06-13DOI: 10.23919/ifipnetworking55013.2022.9829783
{"title":"2022 IFIP Networking Conference (IFIP Networking) Welcome Message","authors":"","doi":"10.23919/ifipnetworking55013.2022.9829783","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829783","url":null,"abstract":"On behalf of the Organizing Committee, we are pleased to welcome you to the 2022 IFIP Networking Conference.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"23 1","pages":"1-2"},"PeriodicalIF":0.0,"publicationDate":"2022-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85716303","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 : 2022-06-13DOI: 10.23919/ifipnetworking55013.2022.9829779
Yutaro Yoshinaka, Junji Takemasa, Y. Koizumi, T. Hasegawa
{"title":"gPHI: Lightweight Anonymity Protocol for Anonymity at Host and AS Levels","authors":"Yutaro Yoshinaka, Junji Takemasa, Y. Koizumi, T. Hasegawa","doi":"10.23919/ifipnetworking55013.2022.9829779","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829779","url":null,"abstract":"Lightweight anonymity protocols are expected to provide anonymity service at the networking layer. Among them, PHI and its successor dPHI are promising due to the fact that anonymous path selection according to IP routing enables easy deployment at the Internet infrastructure. However, the path selection based on IP routing incurs vulnerabilities against attacks which leverage underlying Internet topology information. This paper discovers such new attacks against PHI/dPHI and designs gPHI to mitigate such attacks by extending dPHI.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"4 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2022-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81397889","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":"Network Traffic Prediction Based on the Feature of Newly-Generated Network Flows","authors":"Shaohe Li, Junping Song, Luyang Xu, Yahui Hu, Wanming Luo, Xu Zhou","doi":"10.23919/ifipnetworking55013.2022.9829764","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829764","url":null,"abstract":"Network traffic prediction is essential for intelligent network management, such as resource reservation and burst warning. Existing prediction approaches are vulnerable in accurately capturing the sudden surge or plunge, uniformly denoted as the traffic burst. To solve this problem, we extract the time series of the number of newly-generated network flows (NoNGF) from the network flow information, explaining the intrinsic mechanism of network traffic bursts. We use time-lagged cross-correlation analysis to identify directionality between the NoNGF series and traffic series. It proves that we can perceive the future fluctuation and burst of network traffic by NoNGF in advance. The comprehensive prediction experiments of the whole network traffic and three application-level network traffic demonstrate that our proposed approach exhibits a significant performance improvement over the original LSTM and TCN models. Our approach can accurately capture the moment of network burst and the predicted value much more precisely when the burst occurs. In summary, our proposed traffic prediction based on NoNGF can significantly improve the prediction accuracy, especially for network burst traffic.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"34 1","pages":"1-8"},"PeriodicalIF":0.0,"publicationDate":"2022-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81660142","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 : 2022-06-13DOI: 10.23919/ifipnetworking55013.2022.9829774
Hyunseok Chang, F. Hao, M. Kodialam, T. Lakshman, S. Mukherjee, Matteo Varvello
{"title":"SNAPS: Seamless Network-Assisted Publish-Subscribe","authors":"Hyunseok Chang, F. Hao, M. Kodialam, T. Lakshman, S. Mukherjee, Matteo Varvello","doi":"10.23919/ifipnetworking55013.2022.9829774","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829774","url":null,"abstract":"The Internet is poised to support new classes of industrial applications driven by large numbers of sensors and actuators generating and consuming sensor data streams. While the publish-subscribe (PubSub) architecture is well-suited for such large-scale data dissemination, existing over-the-top PubSub systems are not only vulnerable to network-induced performance degradation, but also unable to orchestrate the underlying network for better usage. This paper proposes a network-assisted PubSub architecture called SNAPS which enables seamless control of distributed PubSub brokers at the edge, as well as the network that interconnects them. SNAPS leverages SRv6-based network programmability to build and maintain network-efficient, shareable data distribution trees for brokers. The architecture is independent of broker implementation, making it suitable for “bringing your own brokers” at available edge locations. We describe how the network interconnecting the brokers can be programmed for efficient data distribution. Through simulation and prototype evaluation, we show the efficacy of SNAPS in providing better service for PubSub data delivery and better usage of the network resources.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"508 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2022-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86844815","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 : 2022-06-13DOI: 10.23919/ifipnetworking55013.2022.9829785
Jorik Oostenbrink, F. Kuipers
{"title":"A Global Study of the Risk of Earthquakes to IXPs","authors":"Jorik Oostenbrink, F. Kuipers","doi":"10.23919/ifipnetworking55013.2022.9829785","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829785","url":null,"abstract":"In this paper, we study the risk of earthquakes to global Internet infrastructure, namely Internet eXchange Point (IXP) facilities. Leveraging the CAIDA IXPs dataset and publicly available earthquake models and hazard computation tools, we find that more than 50% of the facilities have at least a 2% probability of experiencing potentially damaging levels of shaking, due to earthquakes, within a period of 50 years. Furthermore, we estimate that there is a 10% probability that at least 20 facilities will simultaneously experience potentially damaging levels of shaking within a period of 50 years. Fortunately, our analysis shows that IXPs that host many Autonomous Systems (ASes) tend to be located in less earthquake-prone areas, and that spreading out over multiple facilities significantly reduces the impact of earthquakes to IXPs. Following this observation, we propose a novel metric to help AS operators select peering facilities based on the probability of simultaneous facility failures. We show that applying our metric can significantly increase the resilience of individual ASes, as well as that of the Internet as a whole.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"21 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2022-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82715769","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}