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

1. 发明申请

WO2013095247A1 METHOD AND ARRANGEMENT FOR FAULT ANALYSIS IN A MULTI-LAYER NETWORK 审中-公开
标题翻译：多层网络中故障分析的方法和布置
公开(公告)号：WO2013095247A1
公开(公告)日：2013-06-27
申请号：PCT/SE2012/050028
申请日：2012-01-16
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (publ) , ZHANG, Ying , BEHESHTI-ZAVAREH, Neda , DEVLIC, Alisa , MEIROSU, Catalin
发明人： ZHANG, Ying , BEHESHTI-ZAVAREH, Neda , DEVLIC, Alisa , MEIROSU, Catalin
IPC分类号： H04L12/24 , G01M11/00 , H04B10/07
CPC分类号： B01D19/0404 , B01D19/04 , B01D19/0409 , H04L41/065
摘要： The invention relates to a method for fault analysis in a multi-layer network. The method includes receiving (210) a first set of performance measurements occurring in response to the fault and representing at least a first and a second layer in a multi-layer communications network. A probable set of network elements affected by the fault are localized (220). The type of fault is inferred (230) from one or more symptoms in the performance measurements. The root cause of the failure is determined (240) from a combination of the information on probable set of network elements and inferred type of fault. The invention also relates to an arrangement in a network management node for carrying out the inventive method. The arrangement includes a root cause analyzer (320) to detect affected network elements and fault type upon network failure, wherein affected network elements are determined in a spatial localization unit (320) and the fault type is determined in a fault type inference unit (350).
摘要翻译：本发明涉及一种多层网络故障分析方法。该方法包括：接收（210）响应故障而发生的第一组性能测量，并表示多层通信网络中的至少第一层和第二层。受故障影响的一组可能的网络元件本地化（220）。从性能测量中的一个或多个症状推断故障类型（230）。根据可能的网络组件信息和推断的故障类型的组合来确定故障的根本原因（240）。本发明还涉及网络管理节点中用于实现本发明方法的一种布置。该配置包括：根本原因分析器（320），用于在网络故障时检测受影响的网络元件和故障类型，其中在空间定位单元（320）中确定受影响的网络元件，并且在故障类型推理单元（350）中确定故障类型）。

2. 发明申请

WO2013030693A1 IMPLEMENTING A 3G PACKET CORE IN A CLOUD COMPUTER WITH OPENFLOW DATA AND CONTROL PLANES 审中-公开
标题翻译：在具有开流数据和控制平面的云计算机中实现3G分组核心
公开(公告)号：WO2013030693A1
公开(公告)日：2013-03-07
申请号：PCT/IB2012/053920
申请日：2012-07-31
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , KEMPF, James , BEHESHTI-ZAVAREH, Neda , ZHANG, Ying , NILSSON, Tord K. , JOHANSSON, Bengt E. , PETTERSSON, Sten Rune , LUNING, Harald
发明人： KEMPF, James , BEHESHTI-ZAVAREH, Neda , ZHANG, Ying , NILSSON, Tord K. , JOHANSSON, Bengt E. , PETTERSSON, Sten Rune , LUNING, Harald
IPC分类号： H04L12/911 , H04L12/46 , H04W76/02
CPC分类号： H04L47/781 , H04L12/4633 , H04L12/4666 , H04L47/825 , H04W76/12
摘要： A method for implementing a general packet radio service (GPRS) tunnel protocol (GTP) in a packet core (PC) of a third generation (3G) network having a split architecture where a control plane of the PC of the 3G network is in a cloud computing system, the cloud computing system including a controller, the controller to execute a plurality of control plane modules, the control plane to communicate with the data plane of the PC through a control plane protocol, the data plane implemented in a plurality of network elements of the 3G network by configuring switches implementing a data plane of the SGSN and GGSN and intermediate switches to establish a first and second GTP tunnel endpoint.
摘要翻译：一种用于在第三代（3G）网络的分组核心（PC）中实现通用分组无线电业务（GPRS）隧道协议（GTP）的方法，所述第三代（3G）网络具有分离架构，其中所述3G网络的PC的控制平面处于云计算系统，云计算系统包括控制器，控制器执行多个控制平面模块，控制平面通过控制平面协议与PC的数据平面通信，数据平面在多个网络中实现通过配置实现SGSN和GGSN的数据平面的交换机和中间交换机来建立第一和第二GTP隧道端点，来实现3G网络的元素。

3. 发明申请

WO2013017980A1 RESILIENCY-AWARE HYBRID DESIGN OF CONTROLLER-SWITCH CONNECTIVITY IN A SPLIT-ARCHITECTURE SYSTEM 审中-公开
标题翻译：分体式结构系统中控制器 - 开关连接的可靠性混合设计
公开(公告)号：WO2013017980A1
公开(公告)日：2013-02-07
申请号：PCT/IB2012/053667
申请日：2012-07-18
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , BEHESHTI-ZAVAREH, Neda , ZHANG, Ying
发明人： BEHESHTI-ZAVAREH, Neda , ZHANG, Ying
IPC分类号： H04L12/56
CPC分类号： H04L45/48 , H04L45/12 , H04L45/22 , H04L45/24 , H04L45/28
摘要： A method and apparatus for optimizing the resilience of a network using a combination of in-band and out-of-band signaling is disclosed. The metric used in the embodiment?s algorithm to determine resilience is the maximum number of protected neighbors. Nodes closer to the controller are assigned a higher weight than those further from the controller because if their connection to the network is interrupted, all their downstream nodes will be affected and disconnected. Therefore, when determining a path to the controller, switches with alternate paths to the controller are preferred. Dedicated connections using out-of-band signaling are assigned to convert unprotected nodes to protected nodes thus improving the resilience of the network.
摘要翻译：公开了一种使用带内和带外信令的组合优化网络的弹性的方法和装置。用于确定弹性的实施例算法中使用的度量是被保护邻居的最大数量。更靠近控制器的节点的分配权重比控制器更多，因为如果它们与网络的连接中断，则所有下游节点都将受到影响和断开。因此，当确定到控制器的路径时，具有到控制器的备用路径的交换机是优选的。分配使用带外信令的专用连接将未受保护的节点转换为受保护节点，从而提高网络的弹性。

4. 发明申请

WO2013021304A1 IMPLEMENTING OSPF IN SPLIT ARCHITECTURE NETWORKS 审中-公开
标题翻译：在分布式架构网络中实现OSPF
公开(公告)号：WO2013021304A1
公开(公告)日：2013-02-14
申请号：PCT/IB2012/053833
申请日：2012-07-26
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , YEDAVALLI, Kiran , BEHESHTI-ZAVAREH, Neda , ZHANG, Ying
发明人： YEDAVALLI, Kiran , BEHESHTI-ZAVAREH, Neda , ZHANG, Ying
IPC分类号： H04L12/56
CPC分类号： H04L45/12 , H04L45/025 , H04L45/026 , H04L45/64
摘要： A method is implemented in a network element that functions as one of a plurality of controllers for one of a plurality of areas of a split architecture network. The controller provides a control plane for the area of the split architecture network where the controller is remote from a plurality of switches providing a data plane for the area of split architecture network. The controller facilitates optimized routing across the plurality of areas of the split architecture network by providing limited intra-area link cost data to other controllers of other areas of the split architecture network and to traditional routers of a network including the split architecture network. The limited intra-area link cost data provides costs of each possible shortest path traversal of the area of the controller without providing all internal link cost data.
摘要翻译：一种在分离架构网络的多个区域中的一个区域的多个控制器之一中起作用的网络元件中实现一种方法。控制器为分离式架构网络的区域提供控制平面，其中控制器远离多个交换机，为分割架构网络的区域提供数据平面。控制器通过向分裂架构网络的其他区域的其他控制器和包括分离架构网络的网络的传统路由器提供有限的区域内链路成本数据来促进跨分离架构网络的多个区域的优化路由。有限的区域内链路成本数据提供控制器区域中每个可能的最短路径遍历的成本，而不提供所有内部链路成本数据。

5. 发明申请

WO2013017979A1 METHOD AND APPARATUS FOR RESILIENT ROUTING OF CONTROL TRAFFIC IN A SPLIT-ARCHITECTURE SYSTEM 审中-公开
标题翻译：分散体系结构中控制交通运行的方法与装置
公开(公告)号：WO2013017979A1
公开(公告)日：2013-02-07
申请号：PCT/IB2012/053665
申请日：2012-07-18
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL) , BEHESHTI-ZAVAREH, Neda , ZHANG, Ying
发明人： BEHESHTI-ZAVAREH, Neda , ZHANG, Ying
IPC分类号： H04L12/56
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.
摘要翻译：本发明是一种使权重最小化的路由算法特征，意味着在网络故障的情况下节点与控制器断开的概率最小化。本发明中使用的第一种算法是一种近似算法，用于寻找在网络中提供最大弹性的控制器路由树。该算法在本文中被称为最大弹性（MR）算法。启发式MR算法选择最短路径树作为起点，并修改树以提高弹性。 MR算法的输出不一定是最短路径树，而是与初始树相比提供更多的弹性。与其他可能的最短路径树相比，RASP算法提供了具有改进的网络弹性的最短路径树。

6. 发明申请

WO2015036943A1 SERVICE PLACEMENT FOR INLINE SERVICES CHAINING WITH MULTIPLE INSTANCES 审中-公开
标题翻译：用于在线服务与多个实体的维修服务
公开(公告)号：WO2015036943A1
公开(公告)日：2015-03-19
申请号：PCT/IB2014/064405
申请日：2014-09-10
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)
发明人： ZHANG, Ying , BEHESHTI-ZAVAREH, Neda
IPC分类号： H04L12/24 , H04L12/50 , H04Q3/00
CPC分类号： H04L41/5045 , H04Q3/0029
摘要： A system and method for placing inline services having multiple instances in a service provider network. In one implementation, a topology of the service provider network and services to be placed therein are defined. Using service chaining policy requirements, the number of service instances, etc. as input, services and their multiple instances are placed within the network such that an overall network metric is optimized for all subscriber data flows. The implementation uses softwared defined networks (SDN) and OpenFlow.
摘要翻译：一种用于将具有多个实例的内联服务放置在服务提供商网络中的系统和方法。在一个实现中，定义要放置在其中的服务提供商网络和服务的拓扑。使用服务链条策略要求，将作为输入的服务实例等的数量，服务及其多个实例放置在网络内，使得为所有用户数据流优化整体网络度量。该实现使用软件定义网络（SDN）和OpenFlow。

7. 发明申请

WO2013124783A1 CONTROLLER PLACEMENT FOR FAST FAILOVER IN THE SPLIT ARCHITECTURE 审中-公开
标题翻译：控制器放置在分裂式架构中快速失效
公开(公告)号：WO2013124783A1
公开(公告)日：2013-08-29
申请号：PCT/IB2013/051320
申请日：2013-02-18
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)
发明人： BEHESHTI-ZAVAREH, Neda , ZHANG, Ying , HALPERN, Joel
IPC分类号： H04L12/715 , H04L12/707 , H04L12/703 , H04L12/721
CPC分类号： H04L41/0663 , H04L41/0836 , H04L41/12 , H04L41/145 , H04L41/22 , H04L45/12 , H04L45/22 , H04L45/28 , H04L45/48 , H04L45/64 , H04W16/18
摘要： A method implemented by a network topology design system (301), the network topology design system including a processing device (303). The method to determine placement of a controller (315) within a network with a split architecture where control plane components of the split architecture network are executed by a controller and the control plane components are separate from data plane components of the split architecture network. The placement of the controller is selected to minimize disruption of the split architecture network caused by a link failure, a switch failure or a connectivity loss between the controller and the data plane components.
摘要翻译：一种由网络拓扑设计系统（301）实现的方法，所述网络拓扑设计系统包括处理设备（303）。确定控制器（315）在具有分割架构的网络内的布置的方法，其中分离架构网络的控制平面组件由控制器和控制平面组件执行，分离架构网络的数据平面组件分离。选择控制器的放置以最小化由于链路故障，交换机故障或控制器与数据平面组件之间的连接性损失引起的分裂架构网络的中断。

8. 发明公开

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），其中每个并行查找组包含具有相同依赖度计数的一个或多个流表。

9. 发明公开

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.
摘要翻译：本公开的实施例包括用于将服务放置在网络中的方法和装置。定义网络和一组要放置在网络中的服务。确定多个用户的一组要求。每个要求是每个用户遍历的一系列服务。这些服务被放置成使得所有用户的总延迟或总距离最小化。

10. 发明公开

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.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式