检索结果-内蒙古大学图书馆

FlexState: Flexible State Management of network functions

IEEE ACCESS 2021年 9卷 46837-46850页

作者： Pozza, Matteo Rao, Ashwin Lugones, Diego F. Tarkoma, Sasu Univ Helsinki Dept Comp Sci Helsinki 00014 Finland Nokia Bell Labs Dublin D15 Y6NT 15 Ireland

network function (NF) developers have traditionally prioritized performance when creating new packet processing capabilities. This was usually driven by a market demand for highly available solutions with differentiating features running at line rate, even at the expense of flexibility and tightly-coupled monolithic designs. Today, however, the market advantage is achieved by providing more features in shorter development cycles and quickly deploying them in different operating environments. In fact, network operators are increasingly adopting continuous software delivery practices as well as new architectural styles (e.g., microservices) to decouple functionality and accelerate development. A key challenge in revisiting NF design is state management, which is usually highly optimized for a deployment by carefully selecting the underlying data store. Therefore, migrating to a data store that suits a different use case is time-consuming as it requires code refactoring and adaptation to new application programming interfaces, APIs. As a result, refactoring NF software for different environments can take up to months, reducing the pace at which new features and upgrades can be deployed in production networks. In this paper, we demonstrate experimentally that it is feasible to introduce an abstraction layer to decouple NF state management from the data store adopted while still approaching line-rate performance. We present FlexState, a state management system that exposes data store functionality as configuration options, which reduces code refactoring efforts. Experiments show that FlexState achieves significant flexibility in optimizing the state management, and accelerates deployment on new scenarios while preserving performance and scalability.

关键词： Noise measurement Scalability Production Reliability engineering Distributed databases Optimization Middleware Data storage systems middleboxes network functions network functions virtualization NFV parallel processing state management

来源：评论

学校读者我要写书评

暂无评论

Easy Path Programming: Elevate Abstraction Level for network functions

引用

IEEE-ACM TRANSACTIONS ON networkING 2018年第1期26卷 189-202页

作者： Chen, Fei Wu, Chunming Hong, Xiaoyan Wang, Bin Zhejiang Univ Coll Comp Sci & Technol Hangzhou 310027 Zhejiang Peoples R China Univ Alabama Dept Comp Sci Tuscaloosa AL 35487 USA Zhejiang Univ Hangzhou 310027 Zhejiang Peoples R China Hangzhou Hikvis Digital Technol Co Ltd Network & Informat Secur Lab Hangzhou 310051 Zhejiang Peoples R China

As datacenter networks become increasingly programmable with proliferating network functions, network programming languages have emerged to simplify the program development of the network functions. While network functions exhibit high level abstraction over operations on the traffic flow and the interconnections among the operations, the existing languages usually require programming with detailed knowledge about the packet processing patterns at the switches. Such a mismatch between the program abstraction and development details makes developing network functions a nontrivial task. To solve the problem, this paper introduces the easy path programming (EP2) framework. EP2 offers a high-level abstraction to simplify the program design process of the network functions. EP2 also provides a language that captures the common properties of network functions and uses predicates and primitives as basic language components. Specifically, predicates describe when to handle a flow with a global view of the flow dynamics;and primitives describe how to choose a path for a specific flow. Furthermore, EP2 has its own runtime system to support the language and the abstraction model, especially to hide the low level packet-processing behavior at the data plane from the programmers. Throughout this paper, cases are given to illustrate the EP2 abstraction model, language details and benefits. The expressiveness of EP2, the potential overhead of the runtime system and the efficiency of the network functions generated by EP2 are evaluated. The results show that EP2 can achieve comparable performance while reducing programming efforts.

关键词： Software-defined networking network programming model network function abstraction data-plane programming network functions network programming language

来源：评论

学校读者我要写书评

暂无评论

Automatic Performance-Optimal Offloading of network functions on Programmable Switches

引用

IEEE TRANSACTIONS ON CLOUD COMPUTING 2023年第2期11卷 1591-1607页

作者： Chen, Xiang Liu, Hongyan Zhang, Dong Meng, Zili Huang, Qun Zhou, Haifeng Wu, Chunming Liu, Xuan Yang, Qiang Zhejiang Univ Coll Comp Sci & Technol Hangzhou 310007 Zhejiang Peoples R China Fuzhou Univ Coll Comp Sci & Big Data Fuzhou 350116 Fujian Peoples R China Tsinghua Univ Inst Network Sci & Cyberspace Beijing 100084 Peoples R China Peking Univ Sch Elect Engn & Comp Sci Beijing 100871 Peoples R China Zhejiang Univ Coll Control Sci & Engn Hangzhou 310007 Zhejiang Peoples R China Yangzhou Univ Coll Informat Engn Coll Artificial Intelligence Yangzhou 225012 Jiangsu Peoples R China Southeast Univ Sch Comp Sci & Engn Nanjing 211189 Jiangsu Peoples R China Zhejiang Univ Coll Elect Engn Hangzhou 310007 Zhejiang Peoples R China

In network function virtualization (NFV), network functions (NFs) are chained as a service function chain (SFC) to enhance NF management with low cost and high flexibility. Recent NFV solutions indicate that the packet processing performance of SFCs can be significantly improved by offloading NFs to programmable switches. However, such offloading requires a deep understanding of heterogeneous NF properties (e.g., NF resource consumption and NF performance behaviors) to achieve the maximum SFC performance. Unfortunately, none of existing solutions provide automatic analysis of these NF properties. Thus, network administrators have to manually examine the source codes of NFs and profile various NF properties by hand, which is extremely time-consuming and laborious. In this article, we propose LightNF, a novel system that simplifies NF offloading in programmable networks. LightNF automatically dissects comprehensive NF properties by means of code analysis and performance profiling while eliminating manual efforts. It then leverages its analysis results of NF properties in its SFC placement so as to make the performance-optimal offloading decisions. We have implemented LightNF on Tofino-based hardware programmable switches. We perform extensive experiments to evaluate LightNF with a real-world testbed and large-scale simulation. Our experiments show that LightNF outperforms existing solutions with an orders-of-magnitude reduction in per-packet processing latency and 9.5x improvement in SFC throughput.

关键词： network functions service function chains packet processing performance programmable switches

来源：评论

学校读者我要写书评

暂无评论

Compact representation and efficient generation of s-expanded symbolic network functions for computer-aided analog circuit design

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 2001年第7期20卷 813-827页

作者： Shi, CJR Tan, XD Univ Washington Dept Elect Engn Seattle WA 98195 USA

A graph-based approach is presented for the generation of exact symbolic network functions in the form of rational polynomials of the complex frequency variable s for analog integrated circuits. The approach employs determinant decision diagrams (DDDs) to represent the determinant of a circuit matrix and its cofactors, A notion of multiroot DDDs is introduced, where each root represents a symbolic expression for an individual coefficient of the powers of s in the numerator and denominator of a network function, and multiple roots share their common subgraphs, A DDD-based algorithm is presented for generating s-expanded network functions, We prove theoretically and validate experimentally that the algorithm constructs in O(kl/DDD/) time an s-expanded DDD with no more than kl/DDD/ vertices, where k is the degree of the denominator s polynomial, l is the maximum number of devices that connect to a circuit node, and /DDD/ is the number of DDD vertices representing the circuit-matrix determinant. For a practical circuit, /DDD/ is often many orders-of-magnitude less than the number of product terms, In contrast, previous approaches require the time and space complexities proportional to the number of product terms, which grows exponentially with the size of a circuit, Experimental results have demonstrated that the new approach can produce exact s-expanded-symbolic network functions for mu A741 operational amplifiers in several CPU seconds on an UltraSparc-I workstation. The expressive power of multiroot s-expanded DDDs is so remarkable that in one instance, over 10(35) symbolic product terms have been represented by a multiroot DDD with less than 17 K vertices, The compactness of DDDs is further demonstrated in the context of symbolic noise evaluation, where potentially many transfer functions, each being used for a noise source in the circuit, can be represented by a single DDD with the size comparable to that for a few transfer functions. This provides a powerful tool

关键词： analog circuits circuit design determinant decision diagrams network functions noise evaluation poles/zeros small-signal analysis symbolic circuit analysis

来源：评论

学校读者我要写书评

暂无评论

P4-BNG: Central Office network functions on Programmable Packet Pipelines 15

P4-BNG: Central Office Network Functions on Programmable Pac...

引用

15th Int Conf on network and Serv Management (CNSM) / 1st Int Workshop on Analyt for Serv and Application Management (AnServApp) / Int Workshop on High-Precision networks Operat and Control, Segment Routing and Serv Function Chaining (HiPNet+SR/SFC)

作者： Kundel, Ralf Nobach, Leonhard Blendin, Jeremias Kolbe, Hans-Joerg Schyguda, Georg Gurevich, Vladimir Koldehofe, Boris Steinmetz, Ralf Tech Univ Darmstadt Multimedia Commun Lab Darmstadt Germany Deutsch Telekom Tech GmbH Fixed Mobile Engn Deutschland Darmstadt Germany Barefoot Networks Santa Clara CA USA

ISBN: (纸本)9783903176249

Large-scale telecommunications providers have to continuously challenge and evolve their network infrastructure to efficiently serve growing markets demands. They must increase performance, lower time-to-market, provide new services, and lower the cost of the infrastructure and its operation. network functions Virtualization (NFV) on commodity hardware offers an attractive, low-cost platform to establish innovations much faster than with purpose-built hardware products. Unfortunately, implementing NFV on commodity processors does not match the performance requirements of the high-throughput data plane components in large carrier access networks. In this article, we propose a way to offer residential network access with programmable packet processing architectures. Based on the highly flexible P4 programming language, we present a design and open source implementation of a BNG data plane that meets the challenging demands of Broadband network Gateways in carrier-grade environments. The proposed evaluation results show the desired performance characteristics and our proposed design together with upcoming P4 hardware can offer a giant leap towards highest performance NFV network access.

关键词： NFV P4 Access networks network functions Hardware Acceleration Computer networks

来源：评论

学校读者我要写书评

暂无评论

Redundant Logic Elimination in network functions

Redundant Logic Elimination in Network Functions

引用

ACM SIGCOMM Conference

作者： Deng, Bangwen Wu, Wenfei Song, Linhai Tsinghua Univ Beijing Peoples R China

ISBN: (纸本)9781450359153

In current NFV ecosystem, most software NFs delivered by NF vendors tend to be monolithic with multiple features. In runtime, an NF is configured with a subset of its features turned on/off. By our code analysis and primary test, we find that some of the (runtime) unused features are executed silently, which wastes CPU cycles and memory. We propose to use program analysis techniques to eliminate runtime redundant logic in NF code so that the NF performance can be accelerated. We prototype our idea and test it on Snort to show the feasibility.

关键词： network functions redundant logic elimination

来源：评论

学校读者我要写书评

暂无评论

An Efficient Caching Mechanism for End-host network functions 27

An Efficient Caching Mechanism for End-host Network Function...

引用

27th International Conference on Computer Supported Cooperative Work in Design (CSCWD)

作者： Tian, Yu Xia, Haojun Li, Chen Tu, Bibo Chinese Acad Sci Inst Informat Engn Beijing 100093 Peoples R China Univ Chinese Acad Sci Sch Cyber Secur Beijing 100049 Peoples R China

ISBN: (纸本)9798350349184;9798350349191

The end host serves as a natural enforcement point for various network functions (NFs), such as network address translators (NATs), firewalls, and load balancers. However, due to the limitations of the Linux networking stack, NFs struggle to achieve high performance when utilizing high-speed network interfaces. The eXpress Data Path (XDP) is a high-performance framework for packet processing within the Linux kernel. It operates as an optimized execution point before the networking stack. In contrast to kernel-bypass solutions like DPDK, XDP offers an appealing alternative by providing comparable performance with lower CPU usage. In this paper, we propose PFC, a novel approach that leverages XDP for Pre-Function table Caching. PFC acts as a packet header processor for incoming packets, it consists of two distinct facets: one involves traffic management within the end host, and the other focuses on processing requests from distributed applications. Experimental results show that PFC can significantly increase throughput and achieve the equivalent performance compared to DPDK. Furthermore, PFC can integrate seamlessly with existing systems without requiring any modifications to the applications.

关键词： XDP network functions caching mechanism high-throughput packet processing end host

来源：评论

学校读者我要写书评

暂无评论

NFCache: Fine-grained and Flexible Offloading of network functions to Programmable Switches 23

NFCache: Fine-grained and Flexible Offloading of Network Fun...

引用

52nd International Conference on Parallel Processing (ICPP)

作者： Chen, Ruixin Shan, Xinpeng Zhao, Jin Fudan Univ Sch Comp Sci Shanghai Peoples R China

ISBN: (纸本)9798400708428

A Service Function Chain (SFC) consists of a sequence of network functions (NFs) in order, and plays an important role in network performance and security. In recent years, due to the low throughput and high latency of network functions in the context of network Function Virtualization (NFV), some NF implementation solutions consider offloading network functions to programmable switches. However, existing offloading efforts either perform coarse-grained offloading or are not flexible enough to adapt to dynamic and unbalanced traffic. In this paper, we propose NFCache, which offloads network functions at the granularity of NF rules and implements a general network function module, allowing different stateful or stateless network functions to share switch resources. When the traffic changes, the control plane of NFCache can flexibly offload the required network function rules that can bring the most significant offloading gain. We also implement NFCache on a commodity programmable switch to evaluate its performance. Experimental results show that compared with the state-of-the-art solutions, NF-Cache increases the average throughput by 72% and decreases the packet latency by 52% under dynamic and unbalanced traffic.

关键词： Programmable Data Plane Service Function Chains network functions

来源：评论

学校读者我要写书评

暂无评论

Loss-freedom, Order-preservation and No-buffering: Pick Any Two During Flow Migration in network functions 29

Loss-freedom, Order-preservation and No-buffering: Pick Any ...

引用

29th IEEE International Conference on network Protocols (ICNP)

作者： Sukapuram, Radhika Patowary, Ranjan Barua, Gautam Indian Inst Informat Technol Guwahati Gauhati India Cent Inst Technol Kokrajhar Kokrajhar India

ISBN: (纸本)9781665441315

network functions (NFs) provide security and optimization services to networks by examining and modifying packets and by collecting information. When NFs need to be scaled out to manage higher load or scaled in to conserve energy, flows need to be migrated from one instance of an NF, called the source instance, to another, called the destination instance, or from one chain of instances to another chain of instances. Before flows are migrated, the state information associated with the source instance needs to be migrated to the destination instance. Packets that arrive at the destination instance meanwhile need to be either buffered or dropped until the state information is migrated, for correct functioning of some stateful NFs, while for some others, the destination NF may continue to function. We define the properties of Loss-freedom, where the flow migration system does not drop packets, No-buffering, where it does not buffer packets, and Order-preservation, where it processes packets in the same manner as the source NF, if there was no flow migration. We formalize these properties, for the first time, and prove that it is impossible for a flow migration algorithm in stateful NFs to guarantee satisfying all three of the properties of Loss-freedom (L), Order-preservation (0) and No-buffering (N) during flow migration, even if messages or packets are not lost. We demonstrate how existing algorithms operate with regard to these properties and prove that these properties are compositional.

关键词： network functions Flow Migration Loss-freedom Order-preservation No-Latency Service functions

来源：评论

学校读者我要写书评

暂无评论

Virtual network functions Exploitation through a Prototype Resource Management Framework

Virtual Network Functions Exploitation through a Prototype R...

引用

International Conference on Telecommunications and Multimedia (TEMU)

作者： Mastorakis, George Markakis, Evangelos Pallis, Evangelos Mavromoustakis, Constandinos X. Skourletopoulos, Georgios Technol Educ Inst Crete Dept Business Adm Agios Nikolaos Crete Greece Technol Educ Inst Crete Dept Informat Engn Iraklion Crete Greece Univ Nicosia Dept Comp Sci CY-1700 Nicosia Cyprus Scientia Consulting SA Dept E Banking Insights Athens Greece

ISBN: (纸本)9781479932009

This paper elaborates on the design of a prototype framework for the exploitation of virtual network functions (NFs) and virtual network Resources (NRs) in a cloud-based network architecture. The proposed framework is based on a Marketplace approach, utilizing a centralized network architecture, where the exploitation of the available NFs/NRs is managed by a Brokerage Module. This Brokerage Module applies trading policies based on a resource predictive entity that monitors the resources, towards matching the end-user demands and providing the acceptable bandwidth required.

关键词： network functions network Resources Brokerage Module Marketplace Trading Policies Monitoring

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：