Edutech最新文献_第10页

KIRA: Distributed Scalable ID-based Routing with Fast Forwarding KIRA:分布式可扩展的基于id的路由与快速转发

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

R. Bless, M. Zitterbart, Z. Despotovic, A. Hecker

引用次数: 5

Revisiting Application Offloads on Programmable Switches 重新审视可编程交换机上的应用卸载

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

Chai Song, Xin Zhe Khooi, D. Divakaran, M. Chan

引用次数: 2

Routing on the Shortest Pairs of Disjoint Paths 不相交路径最短对上的路由

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

P. Babarczi, G. Rétvári, L. Rónyai, János Tapolcai

{"title":"Routing on the Shortest Pairs of Disjoint Paths","authors":"P. Babarczi, G. Rétvári, L. Rónyai, János Tapolcai","doi":"10.23919/ifipnetworking55013.2022.9829760","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829760","url":null,"abstract":"Recent trends point towards communication networks will be multi-path in nature to increase failure resilience, support load-balancing and provide alternate paths for congestion avoidance. We argue that the transition from single-path to multi-path routing should be as seamless as possible in order to lower the deployability barrier for network operators. Therefore, in this paper we are focusing on the problem of routing along the shortest pairs of disjoint paths between each source-destination pair over the currently deployed link-state routing architecture. We show that the union of disjoint path-pairs towards a given destination has a special structure, and we propose an efficient tag encoding scheme which requires only one extra forwarding table entry per router per destination. Our numerical evaluations demonstrate that in real-world topologies usually only 4 bit tags are sufficient in the packet headers to route on the disjoint path-pairs. Finally, we show that our tags automatically encode additional paths beyond the shortest pair of disjoint paths, including the shortest paths themselves, which enables incremental deployment of the proposed method.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"52 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":"80540925","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

FACL: A Flexible and High-Performance ACL engine on FPGA-based SmartNIC FACL:基于fpga的SmartNIC灵活高性能的ACL引擎

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

Chengjun Jia, Chenglong Li, Yifan Li, Xiaohe Hu, Jun Li

{"title":"FACL: A Flexible and High-Performance ACL engine on FPGA-based SmartNIC","authors":"Chengjun Jia, Chenglong Li, Yifan Li, Xiaohe Hu, Jun Li","doi":"10.23919/ifipnetworking55013.2022.9829813","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829813","url":null,"abstract":"Access Control List (ACL) is an important network function in modern cloud and carrier networks. Nowadays, SmartNIC is becoming a promising location to perform network functions in the end-to-end transmission. However, previous ACL designs have difficulties to achieve high throughput and support various kinds of rulesets at the same time. FPGA-based SmartNIC brings a new opportunity due to its flexibility and parallelism. In this paper, we propose FACL, a flexible and high performance ACL engine with the decision tree approach on FPGA-based SmartNIC. With the tree decomposition and the Network-on-Chip (NOC) pipeline scheduling, it is feasible for FACL to support all kinds of rulesets, as long as there is sufficient memory space. A compiler for FACL is also proposed, which maps decision trees to SRAM memory to optimize the throughput of a ruleset. FACL is implemented on Xilinx U250, a typical FPGA SmartNIC. According to the evaluation, FACL achieves up to 250 Mpps throughput with about 150 ns latency, when dealing with various 100 K ACL rulesets. The utilization of LUT/Register is only 10%/3.8%. With further decision tree optimization and engine parallelism, FACL has the potential to achieve higher throughput and support larger rulesets.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"57 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":"79454432","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

On the Incremental Reconfiguration of Time-sensitive Networks at Runtime 时间敏感网络在运行时的增量重构

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

Christoph Gartner, Amr Rizk, B. Koldehofe, René Guillaume, Ralf Kundel, R. Steinmetz

引用次数: 2

Local and Public DNS Resolvers: do you trade off performance against security? 本地和公共DNS解析器:您会权衡性能和安全性吗?

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

Antonia Affinito, A. Botta, G. Ventre

{"title":"Local and Public DNS Resolvers: do you trade off performance against security?","authors":"Antonia Affinito, A. Botta, G. Ventre","doi":"10.23919/ifipnetworking55013.2022.9829756","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829756","url":null,"abstract":"The Domain Name System (DNS) is a vital component of the Internet, used for all the operations performed over the network and, recently, also for protecting users from malicious activities. In this work, we analyze the behavior of DNS resolvers provided by three main Italian ISPs and contrast them with open, public resolvers provided by Google and Cisco. We consider two aspects. The first one is the time spent to perform a query and obtain a response from the resolvers, which has a considerable impact on the performance of most applications on the Internet. The second one is the capability to recognize domains associated with malicious activities, blocking related requests to protect users. The DNS response time is generally shorter for local resolvers since they are closer to the users. On the other hand, public resolvers are typically considered more efficient in detecting malicious domains. We performed a large number of DNS queries towards the different resolvers, both local and public, using different sets of domain names and different Internet access networks from main Italian providers. Our results confirm that the response time of local resolvers is shorter than the public ones. However, they also show that, unexpectedly, the protection level of local resolvers is largely comparable with the one of public resolvers. Consequently, you do not have to trade off security against performance. In addition, we study the impact of DNS over HTTPs, we unveil the different mechanisms implemented to block users from accessing malicious domains and assess the impact of caching on the obtained results.","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":"86947226","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

Prototyping Prototyping Facilities: Developing and Bootstrapping Testbeds 原型化原型化设施:开发和启动测试平台

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

Sebastian Gallenmüller, Eric Hauser, G. Carle

{"title":"Prototyping Prototyping Facilities: Developing and Bootstrapping Testbeds","authors":"Sebastian Gallenmüller, Eric Hauser, G. Carle","doi":"10.23919/ifipnetworking55013.2022.9829817","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829817","url":null,"abstract":"The creation of prototypes is a convincing approach, demonstrating the feasibility of scientific ideas. Testbeds act as enablers for such prototypes, contributing the facilities to their construction. In this paper, we apply a prototype-driven approach to the development of the testbeds themselves. Thus, we select abstractions and APIs to modularize testbeds to allow a selective adaptation or substitution of specific components. To minimize costs, our approach aims to consolidate all components into a single system. Hence, we named it testbed on a single system (toast). The single-server approach demands the recreation of entire components in software such as networks or experiment nodes. Simultaneously, the softwarization of components enables flexible network topologies and scalability. At the same time, we try to keep the behavior and the performance as close to a hardware-based testbed as possible. Therefore, we rely heavily on hardware acceleration of IO using techniques such as single root IO virtualization (SR-IOV). A case study compares the accelerated IO of toast to a hardware-based testbed and a testbed without IO acceleration. We want to use toast as a training and teaching environment and a prototype facility for future research infrastructures.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"18 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":"87885673","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

NetStack: A Game Approach to Synthesizing Consistent Network Updates NetStack:一种综合一致网络更新的游戏方法

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

Stefan Schmid, Bernhard Clemens Schrenk, Á. Torralba

{"title":"NetStack: A Game Approach to Synthesizing Consistent Network Updates","authors":"Stefan Schmid, Bernhard Clemens Schrenk, Á. Torralba","doi":"10.23919/ifipnetworking55013.2022.9829770","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829770","url":null,"abstract":"Availability and policy-compliance of many communication networks must be guaranteed at any time, even during updates. Accordingly, over the last years, the problem of how to update networks in a manner which transiently preserves desirable properties, has received much attention, especially in the context of Software-Defined Networks (SDNs). While important insights have been obtained for many different problem variants, in general, the design of efficient network update algorithms remains challenging, and usually new algorithms have to be developed on a case-by -case basis. This paper is motivated by the vision of fully automated communication networks in which consistent update schedules are synthesized automatically. In particular, we propose a game approach to the network update synthesis problem, and present NetStack, a tool based on Stackelberg games which transiently ensures fundamental properties such as reachability, loop-freedom, and waypointing. Our approach features a high flexibility. For example, with a simple extension, NetStack can also support concurrent updates, where in each round multiple routers are updated simultaneously. Our empirical evaluation shows that NetStack scales to realistic network sizes, and can compute optimal concurrent schedules.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"59 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":"90912591","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}

引用次数: 4

Global-Aware Prototypical Network for Few-Shot Encrypted Traffic Classification 基于全局感知的少射加密流分类原型网络

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

Jingyu Guo, Mingxin Cui, Chengshang Hou, Gaopeng Gou, Zhuguo Li, G. Xiong, Chang Liu

{"title":"Global-Aware Prototypical Network for Few-Shot Encrypted Traffic Classification","authors":"Jingyu Guo, Mingxin Cui, Chengshang Hou, Gaopeng Gou, Zhuguo Li, G. Xiong, Chang Liu","doi":"10.23919/ifipnetworking55013.2022.9829771","DOIUrl":"https://doi.org/10.23919/ifipnetworking55013.2022.9829771","url":null,"abstract":"Performing encrypted traffic classification under a few-shot scenario is vital because of labor-intensive labeling and intrinsically rare samples. Most existing methods apply metric learning to solve the problem of few-shot encrypted traffic classification. However, those methods only involve local information of traffic inputs to distinguish different traffic types, which weakens classification performance. In this paper, we devise Global-aware Prototypical Network (GP-Net) for few-shot encrypted traffic classification by aggregating the global information of the traffic inputs. Specifically, GP-Net firstly captures the relations between any two bytes of payload sequence, regardless of the spatial distance, and then utilizes the byte-wise relationships to aggregate the global information of traffic inputs. Moreover, we model the position information of bytes in payload sequence by leveraging the relative position mechanism, which enhances the express ability of GP-Net. We conduct extensive experiments on the real-world traffic dataset to evaluate the effectiveness of GP-Net. The experimental results demonstrate that GP-Net achieves high performance when recognizing a new traffic type even when the number of traffic samples is less than 20, outperforming state-of-the-art (SOTA) few-shot encrypted traffic classification methods.","PeriodicalId":31737,"journal":{"name":"Edutech","volume":"101 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":"79351462","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

An Eight Years Perspective on the Internet Broadband Infrastructure in the USA 美国互联网宽带基础设施的八年展望

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

Justus Fries, T. Doan, Rohit Gupta, Vaibhav Bajpai

引用次数: 3