What is FD.io VPP?

  1. FD.io VPP(Fast Data Input/Output Vector Packet Processing)is a new network multi-tool.
  2. Feature:Fast, Scalable and Determinisic,Extensible and Flexible modular design,Developer friendly.
  3. New Directions:Asymmectrical Pipelines. Containers. TCP Acceleration. Accelerators.
  4. Summary:FD.io VPP is a multi-vendor packet processing technologies that is leading the network transformation. FD.io VPP is a fast and easy-to-use tools.

What the FD.io VPP can do?

中兴:Build the network infrastructure for MEC(multi-access edge computing) and IOT(物联网), based on FD.io /VPP

  1. Problem:Higher requirement for high bandwidth, ultra-low latency. The load of core network is further aggravated.
  2. case1:MEC Traffic Offloading Locally
    case2:IoT Gateway
  3. Contributions for VPP:ARP module,IP fragment packet pseudo reassembly improvement
    NAT ip fragment & icmp fragment packet pseudo reassembly support
    LB static scheduling algorithm (rr,wrr,hash)supplement;LB service health check support

华为:DMM

  1. Background:TCP protocol found as the perfomance killer
  2. Requirement:
  • Kernel space or User space?
  • Apps have different flavours?
  • hardware is not all the same
    DMM Protocol Framework: Dual mode, Multiple protocols & Multiple instances, aim to provide a new solution of diverse protocol stacks for developers.-Support Kernel Space and User Space-Simplify new protocol adoptions and Integrations-Enable “protocol routing” in Cloud Networking-
  1. DMM Protocol Framework deal a lot of problem so we can concentrate on develop.
  2. User Case for DMM
  • Traditional TCP has limited bandwidth usage in the WAN, because:
  • TCP Congestion Control will limit delivery rate
  • Packet Loss and Resend will decrease throughput.
    Optimized TCP stack in DMM can achieve 90% bandwidth usage and low latency, easy to deploy
    Optimized TCP stack in DMM can support mass concurrent connections and achieve smooth user experience even 12% packet loss rate.
  1. Stack developers can concentrate on user space protocol innovations;
    Apps can dynamically choose different protocols.
    Support both kernel TCP/IP stack and user space stack;
    Container network will easily build E2E communication capacities.
  2. huawei 罗素:支撑管道纵深(使能运营商,不可替代),云和IT,消费者终端和行业数字化

Intel:Hyperscan

  1. Hyperscan is a regular expression matching library。Regular expression is used to do string operation, or to search and replace some pattern. Hyperscan is used to optimize performance.
  2. Dimensions of Performance Optimize:Sreaming and non-streaming performance.
    Small writes.
    High match rates.
    Scaling to multiple cores/threads.(linear).
    Pattern compile time (<1s or <10s)
    Optimize size。
  3. Three tools : Hsbench-hyperscan性能测试 Hscheck-版本兼容性 Hscollider-传统匹配库兼容性
  4. Summary:Solid and mature. Delivers substantial speedups to open source IPS/IDS systems.
    (An Optimization can have many dimensions,and can bring some tools to be better used.)

京东:use DPDK to do LB

新华三:DPDK在NFV中的应用

  1. 关注点一:三层解耦,编排,控制,网元,虚拟化层能异厂家对接
  2. 关注点二: NFV的转发性能,低时延,高性能,和硬件转发相比
  3. 优化手段:
  • 无锁队列
  • 大页表—减少TLBmiss
  • 内存零拷贝
  • CPU编译指令优化
  • PMD调度模型
  1. 限制:只支持用户态,不提供用户态协议栈,需要厂家自行开发
  2. 优化:转发性能显著提升,单核性能可以翻倍

FD.io社区中国行暨未来网络技术沙龙·南京站 会议小结的更多相关文章

  1. FD.io 社区中国行暨未来网络技术沙龙 南京站 参会小结

    FD.io 社区中国行暨未来网络技术沙龙 南京站,2018 年 3 月 17 日. 开场致辞 Ray 介绍了一些有的没的 ⁃ (Future Event)DPDK summit, FD.io summ ...

  2. 2017年P4中国峰会北京站 会议小结

    2017 P4 中国峰会 北京 本次会议依然侧重介绍P4,并highlight P4的benifit,大致分为以下几类: 1.学术界 - 未来网络的发展,为何提出P4技术? 未来网络和实体经济.其他学 ...

  3. 2016中国大学生程序设计竞赛 - 网络选拔赛 C. Magic boy Bi Luo with his excited tree

    Magic boy Bi Luo with his excited tree Problem Description Bi Luo is a magic boy, he also has a migi ...

  4. NFV 利器 FD.io VPP

    在VPP中,报文以向量批处理的形式在节点之间以流水线的方式处理,可以更加高效的利用CPU的i-cache,节点可以动态生成并加入到转发图中,节点分为多种类型,如VLIB_NODE_TYPE_INPUT ...

  5. FD.io VPP 技术Neutron VNF vRouter 实现

    在OpenStack Neutron中主要有三种网络设备,路由器(Router),负载均衡器(LB)以及VPN,其中Router作为基础网络设备起到连接子网到子网.内网到外网的作用.不同子网之间的访问 ...

  6. 2018中国大学生程序设计竞赛 - 网络选拔赛 1001 - Buy and Resell 【优先队列维护最小堆+贪心】

    题目传送门:http://acm.hdu.edu.cn/showproblem.php?pid=6438 Buy and Resell Time Limit: 2000/1000 MS (Java/O ...

  7. 2018中国大学生程序设计竞赛 - 网络选拔赛 1010 YJJ's Salesman 【离散化+树状数组维护区间最大值】

    题目传送门:http://acm.hdu.edu.cn/showproblem.php?pid=6447 YJJ's Salesman Time Limit: 4000/2000 MS (Java/O ...

  8. 2018中国大学生程序设计竞赛 - 网络选拔赛 1009 - Tree and Permutation 【dfs+树上两点距离和】

    Tree and Permutation Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Oth ...

  9. HDU 6154 - CaoHaha's staff | 2017 中国大学生程序设计竞赛 - 网络选拔赛

    /* HDU 6154 - CaoHaha's staff [ 构造,贪心 ] | 2017 中国大学生程序设计竞赛 - 网络选拔赛 题意: 整点图,每条线只能连每个方格的边或者对角线 问面积大于n的 ...

随机推荐

  1. C#学习笔记-接口与抽象类

    namespace ClassLesson { class Program { static void Main(string[] args) { ); Console.WriteLine(perso ...

  2. SQL导出到Excel 存储过程

    if exists (select * from dbo.sysobjects where id = object_id(N'[dbo].[p_exporttb]') and OBJECTPROPER ...

  3. js生成qq客服在线代码

    说到QQ客服在线代码,随便那么百度谷歌一下就会出来,一般都是 <a target="blank" href="http://wpa.qq.com/msgrd?V=1 ...

  4. BZOJ2229: [Zjoi2011]最小割(最小割树)

    传送门 最小割树 算法 初始时把所有点放在一个集合 从中任选两个点出来跑原图中的最小割 然后按照 \(s\) 集合与 \(t\) 集合的归属把当前集合划分成两个集合,递归处理 这样一共跑了 \(n − ...

  5. 判断数组内是否有几个元素之和等于m

    #include<iostream> using namespace std; ]; int f(int n,int m) { ||m-a[n]==); &&m-a[n]! ...

  6. 浏览器组成、线程及event loop

    浏览器组成 User interface: a. Every part of the browser display, except the window. b. The address bar, b ...

  7. Function Object in C++

    Function object is very userful to use member function or non-member function as callback mechanism, ...

  8. Heap memory compared to stack memory

  9. Python爬虫教程-09-error 模块

    Python爬虫教程-09-error模块 今天的主角是error,爬取的时候,很容易出现错,所以我们要在代码里做一些,常见错误的处,关于urllib.error URLError URLError ...

  10. Redis的基本操作语句

    注:以下出现的key.value都需要具体 1.String类型的数据存储获取 set key value:设置key的值为value,若存在则覆盖,不存在则自动创建decrby get key:获取 ...