专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明公开

EP2949079A1 METHOD AND APPARATUS FOR PLACING SERVICES IN A NETWORK 审中-公开
标题翻译： VERFAHREN UND VORRICHTUNG ZUR PLATZIERUNG VON DIENSTEN IN EINEM NETZWERK
公开(公告)号：EP2949079A1
公开(公告)日：2015-12-02
申请号：EP14704906.8
申请日：2014-01-20
申请人： Telefonaktiebolaget L M Ericsson (Publ)
发明人： ZHANG, Ying , BEHESHTI-ZAVAREH, Neda
IPC分类号： H04L12/24
CPC分类号： H04L41/5045 , H04L41/12
摘要： Embodiments of the present disclosure include a method and apparatus for placing services in a network. The network and a set of services to be placed within the network are defined. A set of requirements for a plurality of subscribers is determined. Each requirement is a sequence of services to traverse for each subscriber. The services are placed such that a total delay or total distance is minimized for all subscribers.
摘要翻译：本公开的实施例包括用于将服务放置在网络中的方法和装置。定义网络和一组要放置在网络中的服务。确定多个用户的一组要求。每个要求是每个用户遍历的一系列服务。这些服务被放置成使得所有用户的总延迟或总距离最小化。

2. 发明公开

EP2737672A1 RESILIENCY-AWARE HYBRID DESIGN OF CONTROLLER-SWITCH CONNECTIVITY IN A SPLIT-ARCHITECTURE SYSTEM 有权
标题翻译：在具有分离架构的系统的控制交换机连接合格AWARE HYBRID设计
公开(公告)号：EP2737672A1
公开(公告)日：2014-06-04
申请号：EP12755912.8
申请日：2012-07-18
申请人： Telefonaktiebolaget L M Ericsson (PUBL)
发明人： BEHESHTI-ZAVAREH, Neda , ZHANG, Ying
IPC分类号： H04L12/70
CPC分类号： H04L45/48 , H04L45/12 , H04L45/22 , H04L45/24 , H04L45/28
摘要： The invention is a routing algorithm characteristic that minimizes the weight, meaning that the probability that a node is disconnected from the controller in case of a failure in the network is minimized. The first algorithm used in the invention is an approximation algorithm for finding the controller routing tree that provides maximum resilience in the network. The algorithm is referred to herein as the Maximum Resilience (MR) algorithm. The heuristic MR algorithm selects a shortest-path tree as a starting point and modifies the tree in order to improve resilience. The output of the MR algorithm is not necessarily a shortest-path tree, but provides more resilience compared to the initial tree. The RASP algorithm provides a shortest-path tree with improved network resilience compared to other possible shortest-path trees.

3. 发明公开

EP2959647A1 METHOD AND SYSTEM FOR FLOW TABLE LOOKUP PARALLELIZATION IN A SOFTWARE DEFINED NETWORKING (SDN) SYSTEM 有权
标题翻译：维也纳公司系统ZUR FLIESSTABELLENSUCHPARALLELISIERUNG在EINEM软件开发网络系统
公开(公告)号：EP2959647A1
公开(公告)日：2015-12-30
申请号：EP14711607.3
申请日：2014-02-12
申请人： Telefonaktiebolaget L M Ericsson (Publ)
发明人： ZHANG, Ying , BEHESHTI-ZAVAREH, Neda , BELIVEAU, Ludovic
IPC分类号： H04L12/721 , H04L12/741 , H04L12/717
CPC分类号： H04L45/745 , H04L45/38 , H04L45/54 , H04L45/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），其中每个并行查找组包含具有相同依赖度计数的一个或多个流表。

4. 发明公开

EP2612469A1 LOCALIZED CONGESTION EXPOSURE 失效转让
标题翻译：本地过载指示
公开(公告)号：EP2612469A1
公开(公告)日：2013-07-10
申请号：EP11746645.8
申请日：2011-07-19
申请人： Telefonaktiebolaget L M Ericsson (PUBL)
发明人： ZHANG, Ying , JOHANSSON, Ingemar , GREEN, Howard
IPC分类号： H04L12/56 , H04W28/10
CPC分类号： H04L47/2483 , H04L12/4633 , H04L47/115 , H04L47/12 , H04L47/127 , H04L47/14 , H04L47/22 , H04L47/26 , H04L47/32 , H04L61/2592 , H04W28/0231 , H04W28/0242 , H04W28/0284 , H04W28/0289 , H04W28/08 , H04W28/12 , H04W52/343 , H04W84/042
摘要： A method for localized congestion exposure within a local loop in a cellular network that is performed by a localized congestion exposure receiver node of the local loop. The method includes receiving downlink packets destined for a downstream user device. The downlink packets have headers that indicate a level of congestion experienced by the downlink packets. The headers also indicate a level of expected downstream congestion declared by an upstream node. The method also includes forwarding the downlink packets to the downstream user device through a wireless connection. The method further includes sending packets upstream that have feedback indicative of the level of congestion experienced by the downlink packets and any congestion experienced within the localized congestion exposure receiver node.

5. 发明授权

EP2745468B1 NETWORK-WIDE FLOW MONITORING IN SPLIT ARCHITECTURE NETWORKS 有权转让
标题翻译：广泛的网络流量控制与分体式架构网络
公开(公告)号：EP2745468B1
公开(公告)日：2015-10-28
申请号：EP12769485.9
申请日：2012-08-07
申请人： Telefonaktiebolaget L M Ericsson (Publ)
发明人： ZHANG, Ying
IPC分类号： H04L12/26
CPC分类号： H04L43/026 , H04L43/04 , H04L43/0876 , H04L43/12

6. 发明公开

EP2845347A1 CONGESTION CONTROL IN PACKET DATA NETWORKING 有权
标题翻译：过载控制分组数据网络
公开(公告)号：EP2845347A1
公开(公告)日：2015-03-11
申请号：EP13731888.7
申请日：2013-05-02
申请人： Telefonaktiebolaget L M Ericsson (Publ)
发明人： BEHESHTI-ZAVAREH, Neda , ZHANG, Ying
IPC分类号： H04L12/24 , H04L12/815 , H04L12/891
摘要： A network element controls congestion in a link of a packet data network. A congested link is identified and a throttle rate is determined for one or more of the traffic groups traversing the congested link. The central controller determines the throttle rates using a weight of the group and the current traffic rate of the group through the link. The throttle rates are sent to switches to throttle traffic for each affected group.

7. 发明公开

EP2834949A1 CONGESTION CONTROL AND RESOURCE ALLOCATION IN SPLIT ARCHITECTURE NETWORKS 有权
标题翻译： NETZWERKEN MIT GETEILTER ARCHITEKTURÜBERLASTREGELUNGUND RESSOURCENZUWEISUNG
公开(公告)号：EP2834949A1
公开(公告)日：2015-02-11
申请号：EP13720605.8
申请日：2013-04-01
申请人： Telefonaktiebolaget L M Ericsson (Publ)
发明人： ZHANG, Ying , BEHESHTI-ZAVAREH, Neda
IPC分类号： H04L12/815 , H04L12/891
CPC分类号： H04L47/22 , H04L41/5025 , H04L43/0835 , H04L43/0882 , H04L47/41 , H04L47/822 , Y02D50/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.
摘要翻译：控制器在分离式架构网络中执行全网络拥塞控制。控制器从交换机接收通过网络进行通信的每个实体的流量统计信息。控制器基于从流量统计导出并针对网络的每个链路上的每个实体估计的分组丢失率，选择最拥挤的链路作为瓶颈链路。控制器识别网络中通过瓶颈链路并承载最多流量的目标路径，并且基于瓶颈链路的容量计算共享目标路径的每个共享实体的节流概率，第一链路的容量每个共享实体的目标路径，带宽消耗和丢包率。然后，控制器将每个共享实体的节流概率发送到目标路径的入口交换机，以减少瓶颈链路上的拥塞。

8. 发明公开

EP2737671A1 METHOD AND APPARATUS FOR RESILIENT ROUTING OF CONTROL TRAFFIC IN A SPLIT-ARCHITECTURE SYSTEM 有权
标题翻译：方法和设备的控制流量在系统与分裂的体系结构弹性ROUTES
公开(公告)号：EP2737671A1
公开(公告)日：2014-06-04
申请号：EP12755911.0
申请日：2012-07-18
申请人： Telefonaktiebolaget L M Ericsson (PUBL)
发明人： BEHESHTI-ZAVAREH, Neda , ZHANG, Ying
IPC分类号： H04L12/70
CPC分类号： H04L45/48 , H04L45/12 , H04L45/22 , H04L45/24 , H04L45/28
摘要： The invention is a routing algorithm characteristic that minimizes the weight, meaning that the probability that a node is disconnected from the controller in case of a failure in the network is minimized. The first algorithm used in the invention is an approximation algorithm for finding the controller routing tree that provides maximum resilience in the network. The algorithm is referred to herein as the Maximum Resilience (MR) algorithm. The heuristic MR algorithm selects a shortest-path tree as a starting point and modifies the tree in order to improve resilience. The output of the MR algorithm is not necessarily a shortest-path tree, but provides more resilience compared to the initial tree. The RASP algorithm provides a shortest-path tree with improved network resilience compared to other possible shortest-path trees.

9. 发明公开

EP2965468A1 NETWORK BANDWIDTH ALLOCATION IN MULTI-TENANCY CLOUD COMPUTING NETWORKS 有权
标题翻译：网络带宽分配策略在云计算网络，多方参与
公开(公告)号：EP2965468A1
公开(公告)日：2016-01-13
申请号：EP14720695.7
申请日：2014-02-14
申请人： Telefonaktiebolaget L M Ericsson (Publ)
发明人： ZHANG, Ying
IPC分类号： H04L12/24 , G06F9/50 , H04L12/801 , H04L12/753 , H04L29/08
CPC分类号： H04L41/0806 , G06F9/5072 , G06F9/5077 , H04L41/0896 , H04L41/142 , H04L41/5096 , H04L45/48 , H04L47/10 , H04L67/10
摘要： A computing device determines an optimal allocation of network bandwidth on a plurality of communications links for a plurality of virtual machines (VMs) in a multi-tenant cloud network based upon a set of bandwidth requirements for the plurality of VMs. The computing device generates a plurality of spanning tree data structures (TDSs). Edges in the TDSs include computed bandwidth values indicating an amount of bandwidth to be reserved over a communications link represented by that edge for the plurality of VMs. The computing device generates a weighted distance value for each TDS of the plurality of TDSs, and selects a TDS of the plurality of TDSs having a smallest weighted distance value as the TDS having computed bandwidth values representing the optimal allocation of network bandwidth.

10. 发明授权

EP2612469B1 LOCALIZED CONGESTION EXPOSURE 失效转让
标题翻译：本地过载指示
公开(公告)号：EP2612469B1
公开(公告)日：2015-09-02
申请号：EP11746645.8
申请日：2011-07-19
申请人： Telefonaktiebolaget L M Ericsson (publ)
发明人： ZHANG, Ying , JOHANSSON, Ingemar , GREEN, Howard
IPC分类号： H04L12/70
CPC分类号： H04L47/2483 , H04L12/4633 , H04L47/115 , H04L47/12 , H04L47/127 , H04L47/14 , H04L47/22 , H04L47/26 , H04L47/32 , H04L61/2592 , H04W28/0231 , H04W28/0242 , H04W28/0284 , H04W28/0289 , H04W28/08 , H04W28/12 , H04W52/343 , H04W84/042
摘要： A method for localized congestion exposure within a local loop in a cellular network that is performed by a localized congestion exposure receiver node of the local loop. The method includes receiving downlink packets destined for a downstream user device. The downlink packets have headers that indicate a level of congestion experienced by the downlink packets. The headers also indicate a level of expected downstream congestion declared by an upstream node. The method also includes forwarding the downlink packets to the downstream user device through a wireless connection. The method further includes sending packets upstream that have feedback indicative of the level of congestion experienced by the downlink packets and any congestion experienced within the localized congestion exposure receiver node.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式