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

1. 发明申请

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。

2. 发明申请

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）在具有分割架构的网络内的布置的方法，其中分离架构网络的控制平面组件由控制器和控制平面组件执行，分离架构网络的数据平面组件分离。选择控制器的放置以最小化由于链路故障，交换机故障或控制器与数据平面组件之间的连接性损失引起的分裂架构网络的中断。

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. 发明公开

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

5. 发明公开

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.

6. 发明申请

WO2016012924A1 SYSTEM AND METHOD FOR ASSIGNING MULTI-INSTANCE SERVICES IN A PROVIDER NETWORK 审中-公开
标题翻译：用于在提供者网络中分配多个实例服务的系统和方法
公开(公告)号：WO2016012924A1
公开(公告)日：2016-01-28
申请号：PCT/IB2015/055445
申请日：2015-07-17
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)
发明人： ZHANG, Ying , BEHESHTI-ZAVAREH, Neda
IPC分类号： H04L12/24
CPC分类号： H04L41/5054 , H04L41/0826 , H04L41/083 , H04L41/0893 , H04L43/028 , H04L63/20
摘要： 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, wherein a network node may include a data forwarding functionality and a control plane functionality. 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.
摘要翻译：一种用于将具有多个实例的内联服务放置在服务提供商网络中的系统和方法。在一个实现中，定义要放置在其中的服务提供商网络和服务的拓扑，其中网络节点可以包括数据转发功能和控制平面功能。使用服务链条策略要求，将作为输入的服务实例等的数量，服务及其多个实例放置在网络内，使得为所有用户数据流优化整体网络度量。

7. 发明申请

WO2014191851A1 A METHOD AND SYSTEM OF BANDWIDTH-AWARE SERVICE PLACEMENT FOR SERVICE CHAINING 审中-公开
标题翻译：用于服务链的带宽服务放置的方法和系统
公开(公告)号：WO2014191851A1
公开(公告)日：2014-12-04
申请号：PCT/IB2014/061017
申请日：2014-04-25
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)
发明人： ZHANG, Ying , BEHESHTI-ZAVAREH, Neda
IPC分类号： H04L12/24
CPC分类号： H04L47/2408 , H04L41/0896 , H04L41/12 , H04L41/5041 , H04L43/0882 , H04L47/10
摘要： A method implemented in a network for placing services at network devices is disclosed. The network contains a plurality of network devices and offers a set of services to subscribers. Subsets of the set of services are included in ordered service chains for subscribers. The method starts with determining a list of bandwidth consumption entities of a service for each service within the set of services, where each bandwidth consumption entity is based on one or more chains of services. Then a weight of each service is calculated based on the list of bandwidth consumption entities of the service and a service with a highest weight within the group of one or more services that have not been placed is selected. The selected service is then placed at a network device based at least partially on calculating bandwidth impacts to the network by the service.
摘要翻译：公开了一种在网络中实现的用于在网络设备上放置业务的方法。网络包含多个网络设备，并向用户提供一组服务。服务集合的子集包含在用户的有序服务链中。该方法首先确定服务集合内的每个服务的服务的带宽消耗实体的列表，其中每个带宽消耗实体基于一个或多个服务链。然后，基于服务的带宽消耗实体的列表计算每个服务的权重，并且选择一个或多个尚未被放置的服务的组内具有最高权重的服务。所选择的服务然后至少部分地基于由服务计算对网络的带宽影响而被放置在网络设备上。

8. 发明申请

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.
摘要翻译：公开了一种使用带内和带外信令的组合优化网络的弹性的方法和装置。用于确定弹性的实施例算法中使用的度量是被保护邻居的最大数量。更靠近控制器的节点的分配权重比控制器更多，因为如果它们与网络的连接中断，则所有下游节点都将受到影响和断开。因此，当确定到控制器的路径时，具有到控制器的备用路径的交换机是优选的。分配使用带外信令的专用连接将未受保护的节点转换为受保护节点，从而提高网络的弹性。

9. 发明申请

WO2015083018A1 A METHOD AND SYSTEM OF SERVICE PLACEMENT FOR SERVICE CHAINING 审中-公开
标题翻译：服务维修服务的方法和系统
公开(公告)号：WO2015083018A1
公开(公告)日：2015-06-11
申请号：PCT/IB2014/065799
申请日：2014-11-04
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)
发明人： BEHESHTI-ZAVAREH, Neda , ZHANG, Ying
IPC分类号： H04L12/24 , H04L12/715 , H04L12/727
CPC分类号： H04L47/2408 , H04L45/02 , H04L45/121 , H04L45/20
摘要： A method for placing services at network devices is disclosed. A network contains a plurality of network devices and the network offers a set of services to subscribers. Each subscriber of the network utilizes a subset of the set of service, where an order of the services is not predefined. The method starts with ordering the services from the most utilized service to the least utilized, and selects services from the most utilized to the least utilized. For each service, a network device is selected so that placing the service adds a least sum of additional delay based on services already placed in the network, and a path for each subscriber utilizing the service is updated to include the service, where the path is an ordered chain of services, and where the service is inserted in the path to result in minimum addition to delay to the subscriber. Implementation uses software defined networks (SDN) and OpenFlow. Enables service function chaining and network function virtualization without predetermined order of services to be applied.
摘要翻译：公开了一种在网络设备上放置业务的方法。网络包含多个网络设备，并且网络向订户提供一组服务。网络的每个用户利用服务集合的子集，其中服务的顺序未被预定义。该方法首先将服务从最常用的服务排序到最少的服务，并选择从最受欢迎的服务到最不利用的服务。对于每个服务，选择网络设备，使得服务基于已经放置在网络中的服务来添加最小额外的延迟，并且利用该服务的每个订户的路径被更新为包括服务，其中路径是一个有序的服务链，并且服务被插入路径中，从而导致用户的最小延迟。实现使用软件定义网络（SDN）和OpenFlow。支持服务功能链接和网络功能虚拟化，无需预定的服务顺序。

10. 发明申请

WO2014009871A1 DELAY-BASED TRAFFIC RATE CONTROL IN NETWORKS WITH CENTRAL CONTROLLERS 审中-公开
标题翻译：与中央控制器网络延迟的交通费率控制
公开(公告)号：WO2014009871A1
公开(公告)日：2014-01-16
申请号：PCT/IB2013/055597
申请日：2013-07-09
申请人： TELEFONAKTIEBOLAGET L M ERICSSON (PUBL)
发明人： BEHESHTI-ZAVAREH, Neda , HALPERN, Joel
IPC分类号： H04L12/841
CPC分类号： H04L47/283 , H04L43/0852 , H04L47/11 , H04L47/22
摘要： A process is performed by a controller in a split-architecture network. The controller monitors congestion of traffic groups across the split-architecture network and executes the process to provide delay based data rate control to alleviate congestion of the traffic groups. The process includes configuring an ingress switch and egress switch for each traffic group to collect delay measurement data for data packets of each traffic group as they arrive at the ingress switch and egress switch. The delay measurement data is received from the ingress switch and egress switch of each traffic group. A check is made whether a minimum data packet delay for any traffic group exceeds a defined threshold value. A throttling rate is calculated for each traffic group in the split-architecture network, in response to the defined threshold value being exceeded.
摘要翻译：一个进程由分离架构网络中的控制器执行。控制器监视跨架构网络上的流量组的拥塞，并执行该过程以提供基于延迟的数据速率控制，以减轻流量组的拥塞。该过程包括为每个流量组配置入口交换机和出口交换机，以便在到达入口交换机和出口交换机时收集每个业务组的数据分组的延迟测量数据。延迟测量数据从每个流量组的入口开关和出口开关接收。检查任何流量组的最小数据包延迟是否超过定义的阈值。响应于超过定义的阈值，为分裂架构网络中的每个流量组计算节流率。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式