Edutech最新文献_第9页

Shoehorn: Towards Portable P4 for Low Cost Hardware Shoehorn:面向低成本硬件的便携式P4

Edutech Pub Date : 2022-06-13 DOI: 10.23919/ifipnetworking55013.2022.9829819

Christopher Lorier, M. Luckie, M. Barcellos, R. Nelson

引用次数: 0

CloudPilot: Flow Acceleration in the Cloud CloudPilot:云中的流量加速

Edutech Pub Date : 2022-06-13 DOI: 10.23919/ifipnetworking55013.2022.9829802

Kfir Toledo, David Breitgand, D. Lorenz, I. Keslassy

引用次数: 2

CArDS: Dealing a New Hand in Reducing Service Request Completion Times 卡牌:减少服务请求完成时间的新方法

Edutech Pub Date : 2022-06-13 DOI: 10.23919/ifipnetworking55013.2022.9829778

K. Khandaker, D. Trossen, R. Khalili, Z. Despotovic, A. Hecker, G. Carle

{"title":"CArDS: Dealing a New Hand in Reducing Service Request Completion Times","authors":"K. Khandaker, D. Trossen, R. Khalili, Z. Despotovic, A. Hecker, G. Carle","doi":"10.23919/ifipnetworking55013.2022.9829778","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829778","url":null,"abstract":"The cloud-native paradigm advocates agile development and deployment of virtualized micro-services, introducing a flexibility and dynamicity for service endpoints that may exist in many locations of a provider's network, not just data centers. Such ability leaves open the problem of scheduling traffic from clients to those possible locations. In this paper, we position our solution to this problem at the data plane level, avoiding the shortfalls of existing solutions in terms of latency and path stretch. For this, we present a system model for forwarding service requests based on compute information, with a distributed scheduler realizing the traffic steering decision at line rate and with measurable performance gains against existing network-level solutions. We evaluate our solution against several design aspects to provide insights for real-world deployments, while quantifying performance improvements for use cases where such scheduling decisions could indeed be performed at the level of each service request. Here we show that our improvements in request completion time may lead to serving up to 162 % more clients within the bounded request time that would ensure acceptable quality of experience.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"98 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":"80542575","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}

引用次数: 3

Query-Efficient and Imperceptible Attacks on Multivariate Time Series DNN Models 多变量时间序列DNN模型的查询高效和不可察觉攻击

Edutech Pub Date : 2022-06-13 DOI: 10.23919/ifipnetworking55013.2022.9829803

Haiying Shen, Fan Yao, Tanmoy Sen, Gustavo Moreira, Ankur Sarker

{"title":"Query-Efficient and Imperceptible Attacks on Multivariate Time Series DNN Models","authors":"Haiying Shen, Fan Yao, Tanmoy Sen, Gustavo Moreira, Ankur Sarker","doi":"10.23919/ifipnetworking55013.2022.9829803","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829803","url":null,"abstract":"Many black-box adversarial attacks for deep neural network (DNN) models for two-dimensional image datasets have been proposed. Though there are many pervasive and computing application scenarios that need multivariate time-series data as DNN inputs, little research has been devoted to black-box adversarial attacks on multivariate time-series DNN models, which have higher requirements on efficiency and imperceptibility. To meet the requirements, in this paper, we propose three different black-box adversarial attacks based on an existing attack: a self-adaptive step technique to improve the query-efficiency and success rate; an $L_{0}$ distance-based attack to improve imperceptibility; and an input coordinate importance oriented attack based on multiplicative weight update (MWU), which exploits the time-series structure and improves query-efficiency and imperceptibility. These proposed attacks are able to make trade-offs between successful rate, $L_{2}/L_{0}$ distance, and the number of queries tailored for a particular targeted attack task. We conducted extensive experiments using ten different combinations of DNN models and datasets to test the effectiveness of the proposed black-box adversarial attacks for multivariate time-series based DNNs. The proposed attacks achieve up to 51% higher success rates with 25% fewer queries, and 84% fewer perturbation amounts over the existing black-box adversarial attacks.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"13 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":"89075143","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

PRISMA: A Packet Routing Simulator for Multi-Agent Reinforcement Learning 多智能体强化学习的数据包路由模拟器

Edutech Pub Date : 2022-06-13 DOI: 10.23919/ifipnetworking55013.2022.9829797

Redha A. Alliche, Tiago Da Silva Barros, R. Aparicio-Pardo, L. Sassatelli

{"title":"PRISMA: A Packet Routing Simulator for Multi-Agent Reinforcement Learning","authors":"Redha A. Alliche, Tiago Da Silva Barros, R. Aparicio-Pardo, L. Sassatelli","doi":"10.23919/ifipnetworking55013.2022.9829797","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829797","url":null,"abstract":"In this paper, we present PRISMA: Packet Routing Simulator for Multi-Agent Reinforcement Learning. To the best of our knowledge, this is the first tool specifically conceived to develop and test Reinforcement Learning (RL) algorithms for the Distributed Packet Routing (DPR) problem. In this problem, where a communication node selects the outgoing port to forward a packet using local information, distance-vector routing protocol (e.g., RIP) are traditionally applied. However, when network status changes very dynamically, is uncertain, or is partially hidden (e.g., wireless ad hoc networks or wired multi-domain networks), RL is an alternate solution to discover routing policies better fitted to these cases. Unfortunately, no RL tools have been developed to tackle the DPR problem, forcing the researchers to implement their own simplified RL simulation environments, complicating reproducibility and reducing realism. To overcome these issues, we present PRISMA, which offers to the community a standardized framework where: (i) communication process is realistically modelled (thanks to ns3); (ii) distributed nature is explicitly considered (nodes are implemented as separated threads); (iii) and, RL proposals can be easily developed (thanks to a modular code design and real-time training visualization interfaces) and fairly compared them.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"6 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":"73977115","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}

引用次数: 2

Veritaa-IoT: A Distributed Public Key Infrastructure for the Internet of Things Veritaa-IoT:面向物联网的分布式公钥基础设施

Edutech Pub Date : 2022-06-13 DOI: 10.23919/ifipnetworking55013.2022.9829794

Jakob Schaerer, Severin Zumbrunn, T. Braun

引用次数: 4

Tiramisu: Fast and Scalable Traffic Splitting on Commodity Switches 提拉米苏:商品交换机上快速和可扩展的流量分割

Edutech Pub Date : 2022-06-13 DOI: 10.23919/ifipnetworking55013.2022.9829765

Kun Huang, Qianpeng Su

{"title":"Tiramisu: Fast and Scalable Traffic Splitting on Commodity Switches","authors":"Kun Huang, Qianpeng Su","doi":"10.23919/ifipnetworking55013.2022.9829765","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829765","url":null,"abstract":"Traffic splitting is a key task for load balancing over multiple servers or paths. Load balancers often rely on commodity switches to implement traffic splitting within the ternary content addressable memory (TCAM). It is critical to reduce the amount of TCAMs allocated for this task since TCAMs are power-hungry and have limited capacities. Previous traffic splitting schemes have concentrated on minimizing the number of TCAM entries for a single service. However, these schemes suffer a great issue of scalability since a commodity switch with small-sized TCAMs needs to handle hundreds or thousands of services simultaneously. In this paper, we propose Tiramisu, an overlay approach to fast and scalable traffic splitting for multiple services on commodity switches. Tiramisu exploits wide SRAM words available in TCAMs to overlay multiple groups of rules within one same TCAM table. With rule overlaying, Tiramisu reduces the total number of TCAM entries allocated for multiple services. Experimental results on software simulations and P4 switches show that Tiramisu achieves significant reductions in number of TCAM entries by up to one order of magnitude for the imbalance error of 1 % as well as achieves higher splitting throughput and faster rule updates compared to previous schemes.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"31 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":"84563289","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

EZPath: Expediting Container Network Traffic via Programmable Switches EZPath:通过可编程交换机加快集装箱网络流量

Edutech Pub Date : 2022-06-13 DOI: 10.23919/ifipnetworking55013.2022.9829818

Zili Zha, An Wang, Yang Guo, Qun A. Li, Kun Sun, Songqing Chen

{"title":"EZPath: Expediting Container Network Traffic via Programmable Switches","authors":"Zili Zha, An Wang, Yang Guo, Qun A. Li, Kun Sun, Songqing Chen","doi":"10.23919/ifipnetworking55013.2022.9829818","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829818","url":null,"abstract":"Containerization, while getting popular in data centers, faces practical challenges due to the sharing nature of cloud networks among tens of thousands containers simultaneously and dynamically. While the typical overlay approach enables network virtualization to facilitate multi-tenant isolation and container portability, this approach often suffers from degraded performance. Other proposed schemes addressing this performance bottleneck require either specialized hardware support, or customized software and extra maintenance. In this paper, we propose EZPath, a novel approach that can seamlessly expedite the container traffic by leveraging the programmable Top-of-Rack (ToR) switches in clouds. By utilizing the underlying programmable switch's data plane capabilities, EZPath can offload traffic directly from the container to the ToR switches, thus creating a fast and easy path to mitigate the network bottleneck. Such a ToR switch based solution is transparent to user applications, and does not require the change of as kernel or the support of additional hardware. Using typical container workloads, we evaluate EZPath, and the results show that EZPath can significantly improve the application performance over the default overlay networking, e.g., a 35% throughput increase and a 42% tail latency reduction for Memcached.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"58 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":"91269672","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

Multiscale Energy Network Tomography 多尺度能量网络层析成像

Edutech Pub Date : 2022-06-13 DOI: 10.23919/ifipnetworking55013.2022.9829766

Yixiao Feng, N. Duffield

{"title":"Multiscale Energy Network Tomography","authors":"Yixiao Feng, N. Duffield","doi":"10.23919/ifipnetworking55013.2022.9829766","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829766","url":null,"abstract":"Much effort and ingenuity has been applied to develop tomographic methods to derive link-level performance statistics (packet delay and loss rates) from end-to-end measurements. However, there has been recognition in recent years that network anomalies may manifest with more detailed spectral properties beyond these aggregate performance statistics. This motivates us to study whether network tomography can be used to attribute spectral properties observed in end-to-end measurements to local network regions, which would then be indicated as potential attack targets. Although spectral properties have been used to characterize network traffic and protocol and serve as features for anomaly detection, no current methods exist to localize these features to specific network links. In this paper we show how a tomographic analysis of end-to-end measurements can be used to estimate the wavelet energy of internal link delays. The proposed estimator, used for assessing link-level performance, is able to locate the link and scale with the highest energy that might be contributed by anomalies or congestion. We evaluate our method through world-wide realistic RTT measurements that shows a high estimation accuracy (100%) on identifying links/scales with the highest energy and small mean relative errors (< 0.1).","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"574 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":"87263900","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

IPswen: A Long Term Evolution Approach for the IPv4 Internet Architecture IPswen: IPv4互联网架构的长期演进途径

Edutech Pub Date : 2022-06-13 DOI: 10.23919/ifipnetworking55013.2022.9829762

Bing Sun

{"title":"IPswen: A Long Term Evolution Approach for the IPv4 Internet Architecture","authors":"Bing Sun","doi":"10.23919/ifipnetworking55013.2022.9829762","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829762","url":null,"abstract":"After decades of IPv6 development., it is clear that the “legacy”” IPv4 protocol stack and the TCP/IPv4 architecture will coexist with IPv6 in the foreseeable future, even if IPv6 deployment or availability rate is reaching 100%. This paper presents a practical approach for the long term coexistence and evolution of the TCP/IPv4 architecture. The core idea is to adopt a variable length addressing and routing scheme (IPswen) to preserve the entire IPv4 stack with bidirectional interworking. Under strict design constraints., IPswen is an incrementally deployable and binary backwards compatible (evolutionary) solution to upgrade existing IPv4 networks, with a sufficiently large address space for long term evolution, which is a multilevel L3 address space that consists of 8 subspaces of address lengths ranging from 4 to 11 bytes. Results of a single-stack Linux implementation demonstrate its usability and binary code compatibility with TCP/IPv4 and existing socket API applications. We argue that IPv4 still possesses a potential for substantial extension after adopting CIDR and NAT44., and IPswen might be in a much more promising direction for the continued evolution of the TCP/IPv4 architecture than the conventional wisdom that we need to transit everything of the Internet from IPv4 to IPv6.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"22 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":"83681008","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