Pub Date : 2022-09-26DOI: 10.1109/LCN53696.2022.9843536
Patrick Lampe, Markus Sommer, Artur Sterz, Jonas Hochst, Christian Uhl, Bernd Freisleben
Networked systems and applications are often based on proprietary hardware/software components that manufacturers might not be willing to adapt or update if new requirements arise. We present mechanism interception, a novel approach to unobtrusively add or modify functionality to/of an existing networked system or application without touching any proprietary components. Behavioral changes are achieved by functionality-enhancing yet unobtrusive interceptors, i.e., components introduced between systems and their environments adding or updating mechanisms. We illustrate our approach by unobtrusively adding a vertical handover mechanism between Wi-Fi and LTE to a mobile end device without disconnecting TCP sessions. Our results indicate that mechanism interception is a compelling approach to achieve improved service quality and provide previously unavailable functionality.
{"title":"Unobtrusive Mechanism Interception","authors":"Patrick Lampe, Markus Sommer, Artur Sterz, Jonas Hochst, Christian Uhl, Bernd Freisleben","doi":"10.1109/LCN53696.2022.9843536","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843536","url":null,"abstract":"Networked systems and applications are often based on proprietary hardware/software components that manufacturers might not be willing to adapt or update if new requirements arise. We present mechanism interception, a novel approach to unobtrusively add or modify functionality to/of an existing networked system or application without touching any proprietary components. Behavioral changes are achieved by functionality-enhancing yet unobtrusive interceptors, i.e., components introduced between systems and their environments adding or updating mechanisms. We illustrate our approach by unobtrusively adding a vertical handover mechanism between Wi-Fi and LTE to a mobile end device without disconnecting TCP sessions. Our results indicate that mechanism interception is a compelling approach to achieve improved service quality and provide previously unavailable functionality.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"37 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":"132900249","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.9843406
R. Seeliger, Louay Bassbouss
Technology environments are fragmented, hybrid and broadcast merge along online and digital paths, orchestration and distribution of individual content streams are evolving rapidly; DAI, SSAI, CSAI, DAS, targeted advertising and addressable TV are terms with different techniques but at the same time often used for similar use cases. There are standards such as HbbTV and MPEG-DASH available, but they meet these requirements only partially and require enhancements before they can be adopted by the industry. While HbbTV 2.0.3 is the latest version of the specification, it still has limitations in providing a seamless and personalized ad experience across broadcast and broadband. This demo showcases a real world, deployed and almost product ready implementation of Dynamic Ad Substitution for HbbTV Versions 1.5 and 2.0.X showcasing the feasibility for individual content replacements via broadband in broadcast environments.
{"title":"Dynamic Ad Substitution in Hybrid Broadband Broadcast Environments","authors":"R. Seeliger, Louay Bassbouss","doi":"10.1109/LCN53696.2022.9843406","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843406","url":null,"abstract":"Technology environments are fragmented, hybrid and broadcast merge along online and digital paths, orchestration and distribution of individual content streams are evolving rapidly; DAI, SSAI, CSAI, DAS, targeted advertising and addressable TV are terms with different techniques but at the same time often used for similar use cases. There are standards such as HbbTV and MPEG-DASH available, but they meet these requirements only partially and require enhancements before they can be adopted by the industry. While HbbTV 2.0.3 is the latest version of the specification, it still has limitations in providing a seamless and personalized ad experience across broadcast and broadband. This demo showcases a real world, deployed and almost product ready implementation of Dynamic Ad Substitution for HbbTV Versions 1.5 and 2.0.X showcasing the feasibility for individual content replacements via broadband in broadcast environments.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"3 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":"127463710","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.9843606
P. Teymoori, A. Boukerche, Feng Liang
This paper considers the problem of mobile computation offloading under stochastic wireless channels while task completion times are subject to deadline constraints. Our objective is to conserve energy for the mobile device by making an optimal decision to execute the task either locally or remotely. In the case of computation offloading, we dynamically vary the data transmission rate, in response to channel conditions. The wireless transmission channel is modelled using a Finite-State Markov Chain (FSMC). We formulate the problem of computation offloading as a constrained optimization problem, and develop an online algorithm to derive the optimal offloading policy. Moreover, to reduce the complexity, we estimate a suboptimal solution of the proposed online algorithm by reducing the size of the FSMC with the help of Markovian aggregation. The numerical results indicate that by applying Markovian aggregation, the running time of the algorithm can be significantly reduced without suffering unreasonable performance degradation.
{"title":"Efficient Mobile Computation Offloading over a Finite-State Markovian Channel using Spectral State Aggregation","authors":"P. Teymoori, A. Boukerche, Feng Liang","doi":"10.1109/LCN53696.2022.9843606","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843606","url":null,"abstract":"This paper considers the problem of mobile computation offloading under stochastic wireless channels while task completion times are subject to deadline constraints. Our objective is to conserve energy for the mobile device by making an optimal decision to execute the task either locally or remotely. In the case of computation offloading, we dynamically vary the data transmission rate, in response to channel conditions. The wireless transmission channel is modelled using a Finite-State Markov Chain (FSMC). We formulate the problem of computation offloading as a constrained optimization problem, and develop an online algorithm to derive the optimal offloading policy. Moreover, to reduce the complexity, we estimate a suboptimal solution of the proposed online algorithm by reducing the size of the FSMC with the help of Markovian aggregation. The numerical results indicate that by applying Markovian aggregation, the running time of the algorithm can be significantly reduced without suffering unreasonable performance degradation.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"48 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":"129042287","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.9843690
Bjørn Ivar Teigen, N. Davies, K. Ellefsen, T. Skeie, J. Tørresen
WiFi is one of the most widely deployed networking technologies, and understanding WiFi performance is therefore of great importance. The WiFi MAC layer sometimes introduces significant and variable delays. No existing models of the WiFi protocol describe WiFi performance in terms of complete latency distributions. In this work, we present a novel model of WiFi performance. We explicitly define our model in terms of the latency introduced at each step in the protocol state machine, and the model produces complete latency distributions. We validate the model by comparing its outputs to previous modeling work and real-world measurements. Finally, we use our results to quantify the latency distribution of WiFi as a function of the duration of transmit opportunities and the number of stations competing for the channel. Quantifying this relation represents a significant improvement in our understanding of WiFi performance that would not be possible with existing models.
{"title":"Quantifying the Quality Attenuation of WiFi","authors":"Bjørn Ivar Teigen, N. Davies, K. Ellefsen, T. Skeie, J. Tørresen","doi":"10.1109/LCN53696.2022.9843690","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843690","url":null,"abstract":"WiFi is one of the most widely deployed networking technologies, and understanding WiFi performance is therefore of great importance. The WiFi MAC layer sometimes introduces significant and variable delays. No existing models of the WiFi protocol describe WiFi performance in terms of complete latency distributions. In this work, we present a novel model of WiFi performance. We explicitly define our model in terms of the latency introduced at each step in the protocol state machine, and the model produces complete latency distributions. We validate the model by comparing its outputs to previous modeling work and real-world measurements. Finally, we use our results to quantify the latency distribution of WiFi as a function of the duration of transmit opportunities and the number of stations competing for the channel. Quantifying this relation represents a significant improvement in our understanding of WiFi performance that would not be possible with existing models.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"99 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":"123162622","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.9843432
Hossein Doroud, Ahmad Alaswad, F. Dressler
Internet service providers (ISP) rely on network traffic classifiers to provide secure and reliable connectivity for their users. Encrypted traffic introduces a challenge as attacks are no longer viable using classic Deep Packet Inspection (DPI) techniques. Distinguishing encrypted from non-encrypted traffic is the first step in addressing this challenge. Several attempts have been conducted to identify encrypted traffic. In this work, we compare the detection performance of DPI, traffic pattern, and randomness tests to identify encrypted traffic in different levels of granularity. In an experimental study, we evaluate these candidates and show that a traffic pattern-based classifier outperforms others for encryption detection.
{"title":"Encrypted Traffic Detection: Beyond the Port Number Era","authors":"Hossein Doroud, Ahmad Alaswad, F. Dressler","doi":"10.1109/LCN53696.2022.9843432","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843432","url":null,"abstract":"Internet service providers (ISP) rely on network traffic classifiers to provide secure and reliable connectivity for their users. Encrypted traffic introduces a challenge as attacks are no longer viable using classic Deep Packet Inspection (DPI) techniques. Distinguishing encrypted from non-encrypted traffic is the first step in addressing this challenge. Several attempts have been conducted to identify encrypted traffic. In this work, we compare the detection performance of DPI, traffic pattern, and randomness tests to identify encrypted traffic in different levels of granularity. In an experimental study, we evaluate these candidates and show that a traffic pattern-based classifier outperforms others for encryption detection.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"11 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":"121866232","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.9843683
G. Dandachi, Anouar Rkhami, Y. H. Aoul, A. Outtagarts
Network slicing is one of the building blocks in Zero Touch Networks. It mainly consists in a dynamic deployment of services in a substrate network. However, the Virtual Network Embedding (VNE) algorithms used generally follow a static mechanism, which results in sub-optimal embedding strategies and less robust decisions. Some reinforcement learning algorithms have been conceived for a dynamic decision, while being time-costly. In this paper, we propose a combination of deep Q-Network and a Monte Carlo (MC) approach. The idea is to learn, using DQN, a distribution of the placement solution, on which a MC-based search technique is applied. This improves the solution space exploration, and achieves a faster convergence of the placement decision, and thus a safer learning. The obtained results show that DQN with only 8 MC iterations achieves up to 44% improvement compared with a baseline First-Fit strategy, and up to 15% compared to a MC strategy.
{"title":"A Robust Monte-Carlo-Based Deep Learning Strategy for Virtual Network Embedding","authors":"G. Dandachi, Anouar Rkhami, Y. H. Aoul, A. Outtagarts","doi":"10.1109/LCN53696.2022.9843683","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843683","url":null,"abstract":"Network slicing is one of the building blocks in Zero Touch Networks. It mainly consists in a dynamic deployment of services in a substrate network. However, the Virtual Network Embedding (VNE) algorithms used generally follow a static mechanism, which results in sub-optimal embedding strategies and less robust decisions. Some reinforcement learning algorithms have been conceived for a dynamic decision, while being time-costly. In this paper, we propose a combination of deep Q-Network and a Monte Carlo (MC) approach. The idea is to learn, using DQN, a distribution of the placement solution, on which a MC-based search technique is applied. This improves the solution space exploration, and achieves a faster convergence of the placement decision, and thus a safer learning. The obtained results show that DQN with only 8 MC iterations achieves up to 44% improvement compared with a baseline First-Fit strategy, and up to 15% compared to a MC strategy.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"35 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":"124313452","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.9843411
M. Frank
This demo paper presents an update on ILDA (International Laser Display Association) audio stream specification in the context of the ILDA Digital Network (IDN). A framework of software elements is introduced to interface with audio hardware on a computer and other software that is able to handle multi-channel audio data. The demo will showcase the new elements in action and also will point out the interoperability to existing IDN elements.
{"title":"A Framework for Flexible ILDA Digital Network (IDN) Audio Streaming","authors":"M. Frank","doi":"10.1109/LCN53696.2022.9843411","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843411","url":null,"abstract":"This demo paper presents an update on ILDA (International Laser Display Association) audio stream specification in the context of the ILDA Digital Network (IDN). A framework of software elements is introduced to interface with audio hardware on a computer and other software that is able to handle multi-channel audio data. The demo will showcase the new elements in action and also will point out the interoperability to existing IDN elements.","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":"125554370","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.9843271
João Pedro Meira, Rui Pedro C. Monteiro, J. M. Silva
With continuous technological advancement, multihomed devices are becoming common. They can connect simultaneously to multiple networks through different interfaces. However, since TCP sessions are bound to one interface per device, it hampers applications from taking advantage of all the available connected networks. This has been solved by MPTCP, introduced as a seamless extension to TCP, allowing more reliable sessions and enhanced throughput. However, MPTCP comes with an inherent risk, as it becomes easier to fragment attacks towards evading NIDS. This paper presents a study of how MPTCP can be used to evade NIDS through simple cross-path attacks. It also introduces tools to facilitate assessing MPTCP-based services in diverse network topologies using an emulation environment. Finally, a new solution is proposed to prevent cross-path attacks through uncoordinated networks. This solution consists of a host-level plugin that allows MPTCP sessions only through trusted networks, even in the presence of a NAT.
{"title":"Securing MPTCP Connections: A Solution for Distributed NIDS Environments","authors":"João Pedro Meira, Rui Pedro C. Monteiro, J. M. Silva","doi":"10.1109/LCN53696.2022.9843271","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843271","url":null,"abstract":"With continuous technological advancement, multihomed devices are becoming common. They can connect simultaneously to multiple networks through different interfaces. However, since TCP sessions are bound to one interface per device, it hampers applications from taking advantage of all the available connected networks. This has been solved by MPTCP, introduced as a seamless extension to TCP, allowing more reliable sessions and enhanced throughput. However, MPTCP comes with an inherent risk, as it becomes easier to fragment attacks towards evading NIDS. This paper presents a study of how MPTCP can be used to evade NIDS through simple cross-path attacks. It also introduces tools to facilitate assessing MPTCP-based services in diverse network topologies using an emulation environment. Finally, a new solution is proposed to prevent cross-path attacks through uncoordinated networks. This solution consists of a host-level plugin that allows MPTCP sessions only through trusted networks, even in the presence of a NAT.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"33 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":"115961764","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.9843759
P. Willis, N. Shenoy, Yin Pan, John F. Hamilton
Switched networks use meshed topologies for path redundancy; loop-free frame forwarding paths are established by protocols that use either the spanning or Dijkstra tree algorithms. When a network link or device fails, the tree must be repaired, leading to high convergence latencies impacting both broadcast and unicast traffic. Unicast frames are constrained to use the tree paths, which may not be the shortest path and links are not utilized uniformly. We propose a new meshed tree algorithm and meshed tree protocol (MTP) to provide non-looping paths (with backup) for broadcast frames. We also propose a new scheme for unicast frames to use shortest paths (provisioned with backup) between end devices. A novel virtual ID technique to construct the trees makes the protocol robust and provides fast failure recovery. In this article, we present implementation details of MTP on the GENI testbed and compare its performance with state-of-the-art loop-avoidance protocols.
{"title":"A Novel Frame Forwarding Algorithm for Switched Networks","authors":"P. Willis, N. Shenoy, Yin Pan, John F. Hamilton","doi":"10.1109/LCN53696.2022.9843759","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843759","url":null,"abstract":"Switched networks use meshed topologies for path redundancy; loop-free frame forwarding paths are established by protocols that use either the spanning or Dijkstra tree algorithms. When a network link or device fails, the tree must be repaired, leading to high convergence latencies impacting both broadcast and unicast traffic. Unicast frames are constrained to use the tree paths, which may not be the shortest path and links are not utilized uniformly. We propose a new meshed tree algorithm and meshed tree protocol (MTP) to provide non-looping paths (with backup) for broadcast frames. We also propose a new scheme for unicast frames to use shortest paths (provisioned with backup) between end devices. A novel virtual ID technique to construct the trees makes the protocol robust and provides fast failure recovery. In this article, we present implementation details of MTP on the GENI testbed and compare its performance with state-of-the-art loop-avoidance protocols.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"46 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":"121381808","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}
Optical wireless communication (OWC) is an emerging technology for direct communication through the water-air interface. However, due to the high directionality of optical beams and the harsh oceanic environment, it faces significant challenges to achieve the alignment and preserve the link availability, as the waves cause beam deflection and the mobility of the transceivers makes the link worse. To tackle these challenges and achieve reliable optical communication between autonomous underwater vehicles and unmanned aerial vehicles, we propose a deep reinforcement learning algorithm assisted by an extended Kalman filter to solve the alignment issue. To improve the reliability of communication, we present an algorithm to obtain the optimal beam divergence angle to maximize the link availability. The numerical simulations demonstrate that the proposed scheme achieves better performance in terms of energy consumption and alignment accuracy, and the link availability is increased by 25% compared to that without adjustment.
{"title":"Reliable Water-Air Direct Wireless Communication: Kalman Filter-Assisted Deep Reinforcement Learning Approach","authors":"Jinglong Wang, Hanjiang Luo, Rukhsana Ruby, Jiangang Liu, Kai Guo, Kaishun Wu","doi":"10.1109/LCN53696.2022.9843503","DOIUrl":"https://doi.org/10.1109/LCN53696.2022.9843503","url":null,"abstract":"Optical wireless communication (OWC) is an emerging technology for direct communication through the water-air interface. However, due to the high directionality of optical beams and the harsh oceanic environment, it faces significant challenges to achieve the alignment and preserve the link availability, as the waves cause beam deflection and the mobility of the transceivers makes the link worse. To tackle these challenges and achieve reliable optical communication between autonomous underwater vehicles and unmanned aerial vehicles, we propose a deep reinforcement learning algorithm assisted by an extended Kalman filter to solve the alignment issue. To improve the reliability of communication, we present an algorithm to obtain the optimal beam divergence angle to maximize the link availability. The numerical simulations demonstrate that the proposed scheme achieves better performance in terms of energy consumption and alignment accuracy, and the link availability is increased by 25% compared to that without adjustment.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"75 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":"115668330","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
扫码关注我们
求助内容：
应助结果提醒方式：