Edutech最新文献

筛选
英文 中文
Scalable Reinforcement Learning for Dynamic Overlay Selection in SD-WANs sd - wan中动态叠加选择的可扩展强化学习
Edutech Pub Date : 2023-06-12 DOI: 10.23919/IFIPNetworking57963.2023.10186399
A. Botta, R. Canonico, Annalisa Navarro, Giovanni Stanco, G. Ventre
{"title":"Scalable Reinforcement Learning for Dynamic Overlay Selection in SD-WANs","authors":"A. Botta, R. Canonico, Annalisa Navarro, Giovanni Stanco, G. Ventre","doi":"10.23919/IFIPNetworking57963.2023.10186399","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186399","url":null,"abstract":"SD-WAN promises distributed enterprises to satisfy their dynamic communication requirements over the public Internet with a substantial cost reduction and enhanced performance compared to dedicated lines. It builds interconnections between users or applications in remote sites by exploiting all available transport connections (e.g. Internet, MPLS, …), but how to combine them to enhance communication performance is still an open challenge. Previous work investigated the use of Reinforcement Learning in the SD-WAN control logic to solve this problem, but they only considered simple scenarios consisting of two sites connected by two paths. In this paper we move a step forward and pose the question of whether such a promising approach can scale to WANs spanning multiple distributed sites connected through several paths. We first conduct an analytical study of the complexity of Reinforcement Learning that considers the increase of action and state spaces when the number of sites and paths grows. We then propose a solution based on Multi-Agent Reinforcement Learning (MARL) that helps reducing the overall complexity by leveraging an agent for each site. Finally, we show the effectiveness of our solution with real experiments in an emulated environment, showing that not only it is viable, but it also achieves a reduction in network policy violations, latency, and transit costs in a multi-site scenario.","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":"84804095","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}
引用次数: 0
Secure Middlebox-Assisted QUIC 安全的middlebox辅助QUIC
Edutech Pub Date : 2023-06-12 DOI: 10.23919/IFIPNetworking57963.2023.10186363
Mike Kosek, B. Spies, J. Ott
{"title":"Secure Middlebox-Assisted QUIC","authors":"Mike Kosek, B. Spies, J. Ott","doi":"10.23919/IFIPNetworking57963.2023.10186363","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186363","url":null,"abstract":"While the evolution of the Internet was driven by the end-to-end model, it has been challenged by many flavors of middleboxes over the decades. Yet, the basic idea is still fundamental: reliability and security are usually realized end-to-end, where the strong trend towards ubiquitous traffic protection supports this notion. However, reasons to break up, or redefine the ends of, end-to-end connections have always been put forward in order to improve transport layer performance. Yet, the consolidation of the transport layer with the end-to-end security model as introduced by QUIC protects most protocol information from the network, thereby eliminating the ability to modify protocol exchanges. In this paper, we enhance QUIC to selectively expose information to intermediaries, thereby enabling endpoints to consciously insert middleboxes into an end-to-end encrypted QUIC connection while preserving its privacy, integrity, and authenticity. We evaluate our design in a distributed Performance Enhancing Proxy environment over satellite networks, finding that the performance improvements are dependent on the path and application layer properties: the higher the round-trip time and loss, and the more data is transferred over a connection, the higher the benefits of Secure Middlebox-Assisted QUIC.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"69 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":"84230235","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}
引用次数: 0
Wrapping DNS into HTTP(S): An Empirical Study on Name Resolution in Mobile Applications 将DNS封装到HTTP(S)中:移动应用中域名解析的实证研究
Edutech Pub Date : 2023-06-12 DOI: 10.23919/IFIPNetworking57963.2023.10186431
Baiyang Li, Yujia Zhu, Qingyun Liu, Yong Sun, Yuedong Zhang, Li Guo
{"title":"Wrapping DNS into HTTP(S): An Empirical Study on Name Resolution in Mobile Applications","authors":"Baiyang Li, Yujia Zhu, Qingyun Liu, Yong Sun, Yuedong Zhang, Li Guo","doi":"10.23919/IFIPNetworking57963.2023.10186431","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186431","url":null,"abstract":"Wrapping DNS into HTTP(S) is a promising way to mitigate the privacy and security issues of the traditional DNS. It has been standardized by IETF, i.e., DNS-over-HTTPS (DoH). This approach allows the application to choose open resolvers that it trusts, protecting its activities from potential snooping. Moreover, an application can establish a connection with its resolvers, incorporating specific handles and identifiers for customized use. How is the name resolution process performed on the client side? What are the criteria for an application to choose a resolver? These questions are still unclear. In this paper, we examine the application-level name resolution practices of 25 popular apps on Android and iOS platforms, revealing their adoption and usage patterns. We present the following findings: (i) non-standard, self-defined HTTP(S)DNS is more prevalent than DoH in practice, (ii) popular apps tend to use dispersed resolvers, some of which are self-owned, (iii) HTTP(S)DNS usage patterns differ across apps. These findings raise new issues related to the transparency and security of DNS configuration inside apps. We also explore the implications of these changes on the DNS ecosystem and analyze the potential security risks.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"28 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":"82577397","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}
引用次数: 0
Optimizing DNS Resolvers for High Loads 针对高负载优化DNS解析器
Edutech Pub Date : 2023-06-12 DOI: 10.23919/IFIPNetworking57963.2023.10186425
Itay Alayoff, Gil Einziger
{"title":"Optimizing DNS Resolvers for High Loads","authors":"Itay Alayoff, Gil Einziger","doi":"10.23919/IFIPNetworking57963.2023.10186425","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186425","url":null,"abstract":"Handling volumetric attacks and high loads is fundamental for Domain Name System (DNS) resolvers. While one can often scale up resources to cope with high loads, this costly solution is not always viable. Thus, our work revisits the design of DNS resolvers and maps the design decisions that most impact the resolver's robustness to high loads and volumetric attacks. Our work suggests a novel resolver composed of deadline-aware queue management, optimized cache policy, and high-load handling mechanisms. An evaluation with real DNS traces shows a consistent improvement of 21% in a high load scenario and by 40% under an NXDomain attack when compared with the best alternative method.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"57 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":"85883914","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}
引用次数: 1
Flow Prioritization for TSN Asynchronous Traffic Shapers TSN异步流量整形器的流量优先级
Edutech Pub Date : 2023-06-12 DOI: 10.23919/IFIPNetworking57963.2023.10186427
Julia Caleya-Sanchez, Jonathan Prados-Garzon, Lorena Chinchilla-Romero, P. Muñoz, P. Ameigeiras
{"title":"Flow Prioritization for TSN Asynchronous Traffic Shapers","authors":"Julia Caleya-Sanchez, Jonathan Prados-Garzon, Lorena Chinchilla-Romero, P. Muñoz, P. Ameigeiras","doi":"10.23919/IFIPNetworking57963.2023.10186427","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186427","url":null,"abstract":"Time-Sensitive Networking (TSN) technology is key to the development of current networks due to its capacity to provide a deterministic Quality of Service (QoS) mainly in terms of delay for different industrial traffic. It also simplifies management and improves the scalability of industrial networks. This articles focuses on Asynchronous Traffic Shape (ATS) for TSN. The key aspect of ATS is that by prioritizing flows delay requirement can be satisfied for each priority level. To that end, we formally formulate the problem of flow priority assignment in an network and we demonstrate the optimality of our proposed algorithm. We have compared our algorithm with the brute force search obtaining that the execution time of brute force is much higher than ours with exactly the same prioritization results.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"13 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":"81559108","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}
引用次数: 0
Hercules: High-Speed Bulk-Transfer over SCION 大力神:通过SCION进行高速批量传输
Edutech Pub Date : 2023-06-12 DOI: 10.23919/IFIPNetworking57963.2023.10186366
Marten Gartner, Jean-Pierre Smith, Matthias Frei, F. Wirz, Cédric Neukom, D. Hausheer, A. Perrig
{"title":"Hercules: High-Speed Bulk-Transfer over SCION","authors":"Marten Gartner, Jean-Pierre Smith, Matthias Frei, F. Wirz, Cédric Neukom, D. Hausheer, A. Perrig","doi":"10.23919/IFIPNetworking57963.2023.10186366","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186366","url":null,"abstract":"With the steady increase in the resolution of cameras and screens, and the ever-expanding creation of information, data volumes have been rising exponentially. However, standard bulk-transfer still performs inefficiently and require complex configuration, especially for high-speed long-distance transfers. While next-generation Internet architectures promise significant improvements through path-aware networking (PAN), their adoption requires modern tools. To overcome these limitations, we propose Hercules, which combines efficient host networking and congestion control in the first high-speed bulk-transfer tool with native multipath support. We show that Hercules is outperforming bulk-transfer tools (GridFTP, bbcp) in intercontinental transfers, achieving up to 90% increase in goodput. Even in local testbeds, Hercules achieves competitive goodput in a 1500-byte MTU environment, and outperforms bbcp and GridFTP using a 3400-byte MTU. Finally, we demonstrate how Hercules natively aggregates multiple inter-domain paths while behaving fair to competing flows.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"19 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":"83325856","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}
引用次数: 0
Graph Neural Network-based Delay Prediction Model Enhanced by Network Calculus 基于网络微积分的图神经网络延迟预测模型
Edutech Pub Date : 2023-06-12 DOI: 10.23919/IFIPNetworking57963.2023.10186434
Lianming Zhang, Benle Yin, Qian Wang, Pingping Dong
{"title":"Graph Neural Network-based Delay Prediction Model Enhanced by Network Calculus","authors":"Lianming Zhang, Benle Yin, Qian Wang, Pingping Dong","doi":"10.23919/IFIPNetworking57963.2023.10186434","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186434","url":null,"abstract":"Network modeling is critical to network management. Existing network modeling approaches still have room for improvement in performance prediction of important performance metrics, such as latency. Graph Neural Network (GNN) has proven their effectiveness for network performance prediction. However, the shortcomings of GNN in data interpretability limit their performance. To address this problem, we introduced network calculus to enhance the interpretation and learning of GNN for data. We proposed a modified GNN model - NetCTRT, which understands the information between topology, routing and traffic and interacts with the Network Calculus (NC)-based delay bound so that the end-to-end delay can be accurately predicted. Experimental results show that NetCTRT can significantly improve the prediction accuracy.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"39 1","pages":"1-7"},"PeriodicalIF":0.0,"publicationDate":"2023-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80528521","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}
引用次数: 1
Data-VCG: A Data Preservation Game for Base Station-less Sensor Networks with Performance Guarantee 数据- vcg:一种具有性能保证的无基站传感器网络数据保存博弈
Edutech Pub Date : 2023-06-12 DOI: 10.23919/IFIPNetworking57963.2023.10186405
Jennifer Ly, Yutian Chen, Bin Tang
{"title":"Data-VCG: A Data Preservation Game for Base Station-less Sensor Networks with Performance Guarantee","authors":"Jennifer Ly, Yutian Chen, Bin Tang","doi":"10.23919/IFIPNetworking57963.2023.10186405","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186405","url":null,"abstract":"We design a data preservation game called Data-VCG for base station-less sensor networks ($BSNs$). In the BSN, sensor nodes do not have connected paths to a base station thus, sensory data must be preserved inside the network before uploading opportunities arise. Data-VCG incorporates data values into the classic Vickrey-Clark-Groves (VCG) mechanism, a generic truthful mechanism for achieving a socially-optimal solution. It motivates all the sensor nodes (i.e., source, storage, and transition) to voluntarily participate in the data preservation process while achieving minimum data preservation cost. We give a detailed analysis of the performance guarantee of the Data-VCG and show that under certain conditions, its worst-case budget imbalance is at most $n-3$ times the efficiency gain, where $n$ is the number of sensor nodes in the network. We conduct extensive simulations to validate our results in both grids and randomly generated BSNs under different network dynamics.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"3 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":"82659067","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}
引用次数: 1
Controlling Epidemic Spread Under Immunization Delay Constraints 免疫延迟约束下控制流行病传播
Edutech Pub Date : 2023-06-12 DOI: 10.23919/IFIPNetworking57963.2023.10186397
Shiju Li, Xin Huang, Chul-Ho Lee, Do Young Eun
{"title":"Controlling Epidemic Spread Under Immunization Delay Constraints","authors":"Shiju Li, Xin Huang, Chul-Ho Lee, Do Young Eun","doi":"10.23919/IFIPNetworking57963.2023.10186397","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186397","url":null,"abstract":"In this paper, we study the problem of minimizing the spread of a viral epidemic when immunization takes a non-negligible amount of time to take into effect. Specifically, our problem is to determine which set of nodes to be vaccinated when vaccines take a random amount of time in order to maximize the total reward, which is the expected number of saved nodes. We first provide a mathematical analysis for the reward function of vaccinating an arbitrary number of nodes when there is a single source of infection. While it is infeasible to obtain the optimal solution analytically due to the combinatorial nature of the problem, we establish that the problem is a monotone sub-modular maximization problem and develop a greedy algorithm that achieves a ($1-1/e$) -approximation. We further extend the scenario to the ones with multiple infection sources and discuss how the greedy algorithm can be applied systematically for the multiple-source scenarios. We finally present extensive simulation results to demonstrate the superiority of our greedy algorithm over other baseline vaccination strategies.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"76 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":"79620499","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}
引用次数: 0
Federated Learning-Based In-Network Traffic Analysis on IoT Edge 基于联邦学习的物联网边缘网络流量分析
Edutech Pub Date : 2023-06-12 DOI: 10.23919/IFIPNetworking57963.2023.10186438
Mingyuan Zang, Changgang Zheng, Tomasz Koziak, Noa Zilberman, L. Dittmann
{"title":"Federated Learning-Based In-Network Traffic Analysis on IoT Edge","authors":"Mingyuan Zang, Changgang Zheng, Tomasz Koziak, Noa Zilberman, L. Dittmann","doi":"10.23919/IFIPNetworking57963.2023.10186438","DOIUrl":"https://doi.org/10.23919/IFIPNetworking57963.2023.10186438","url":null,"abstract":"The rise of IoT-connected devices has led to an increase in collected data for service and traffic analysis, but also to emerging threats and attacks. In-network machine learning-based attack detection has proven effective in fast response, but scaling to distributed IoT edge devices risks increasing communication overheads and raising data privacy concerns. To address these concerns, we present FLIP4, a distributed in-network attack detection framework based on federated tree models. FLIP4 maintains data privacy by enabling distributed machine learning training while keeping data local on IoT edge, and provides in-network inference within the programmable data plane on edge gateway for timely attack labeling and mitigation. Evaluation results show that FLIP4 can accurately detect attacks while maintaining source data privacy and enabling lightweight deployment on IoT edge.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"65 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":"79599841","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书