会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • METHOD AND SYSTEM FOR FLOW TABLE LOOKUP PARALLELIZATION IN A SOFTWARE DEFINED NETWORKING (SDN) SYSTEM
    • 用于软件定义网络(SDN)系统中流表查找并行化的方法和系统
    • EP2959647B1
    • 2017-07-26
    • EP14711607.3
    • 2014-02-12
    • Telefonaktiebolaget LM Ericsson (publ)
    • ZHANG, YingBEHESHTI-ZAVAREH, NedaBELIVEAU, Ludovic
    • H04L12/715H04L12/741H04L12/721
    • H04L45/745H04L45/38H04L45/54H04L45/64
    • A method implemented in a Software Defined Networking (SDN) network for flow table lookup parallelization is disclosed. The SDN network contains at least a SDN controller and at least a forwarding element and the SDN network utilizes a plurality of flow tables to perform lookup for forwarding traffic. The method starts with determining dependency of flow tables within the forwarding element using a set of dependency determination rules. A dependency graph is then constructed based on determined dependency of flow tables. A dependency degree count for each flow table within the forwarding element is determined based on the dependency graph. Based on the dependency degree count determination for each flow table, a plurality of parallel lookup groups (PLGs) for the forwarding element is formed, where each parallel lookup group contains one or more flow tables having a same dependency degree count.
    • 公开了一种在用于流表查找并行化的软件定义网络(SDN)网络中实现的方法。 SDN网络至少包含SDN控制器和至少一个转发单元,SDN网络利用多个流表对转发流量进行查找。 该方法开始于使用一组依赖性确定规则来确定转发元素内的流表的依赖性。 然后基于所确定的流表的依赖性来构造依赖图。 基于依赖关系图来确定转发元素内的每个流表的依赖度计数。 基于每个流表的依赖度计数确定,形成用于转发元素的多个并行查找组(PLG),其中每个并行查找组包含具有相同依赖度计数的一个或多个流表。
    • 5. 发明授权
    • CONGESTION CONTROL AND RESOURCE ALLOCATION IN SPLIT ARCHITECTURE NETWORKS
    • 分裂体系结构网络中的拥塞控制和资源分配
    • EP2834949B1
    • 2017-07-05
    • EP13720605.8
    • 2013-04-01
    • Telefonaktiebolaget LM Ericsson (publ)
    • ZHANG, YingBEHESHTI-ZAVAREH, Neda
    • H04L12/815H04L12/891
    • H04L47/22H04L41/5025H04L43/0835H04L43/0882H04L47/41H04L47/822Y02D50/30
    • A controller performs network-wide congestion control in a split architecture network. The controller receives flow statistics from switches for each entity that communicates via the network. The controller chooses a most congested link as a bottleneck link based on a packet loss rate that is derived from the flow statistics and estimated for each entity on each link of the network. The controller identifies a target path in the network that passes through the bottleneck link and carries the most traffic, and calculates a throttling probability for each sharing entity that shares the target path based on the capacity of the bottleneck link, capacity of the first link of the target path, bandwidth consumption and packet loss rate of each sharing entity. The controller then transmits the throttling probability of each sharing entity to the ingress switch of the target path to reduce the congestion on the bottleneck link.
    • 控制器在分体式架构网络中执行网络范围内的拥塞控制。 控制器从交换机接收经由网络通信的每个实体的流量统计。 控制器基于从流量统计得出的分组丢失率并且为网络的每个链路上的每个实体估计,选择最拥塞的链路作为瓶颈链路。 控制器识别通过瓶颈链路且携带最多流量的网络中的目标路径,并基于瓶颈链路的容量计算共享目标路径的每个共享实体的节流概率,第一链路的容量 每个共享实体的目标路径,带宽消耗和丢包率。 控制器然后将每个共享实体的节流概率传输到目标路径的入口交换机以减少瓶颈链路上的拥塞。