公开(公告)号：WO2014057375A3

公开(公告)日：2014-06-05

申请号：PCT/IB2013058649

申请日：2013-09-18

Applicant: ERICSSON TELEFON AB L M

Inventor： GARG VIPIN ,  GRAY ERIC WARD ,  ALLAN DAVID IAN

IPC: H04L12/715 ,  H04L12/721

CPC classification number: H04L47/12 ,  H04L45/38 ,  H04L45/54 ,  H04L45/64

Abstract: A network element acting as a forwarding plane within a software-defined network to reduce negative effects of slow-path packet processing is described. The network element, upon receiving a first packet, determines whether it matches any flow entry within a set of flow tables. When the first packet does not match any flow entry of the set of flow tables, the network element performs a miss procedure including inserting at least a portion of the first packet into a packet miss table of the network element, which is accessed by a controller. The controller may access the packet miss table using a pull mechanism. The miss procedure may also include accessing a configurable default rule table of the network element, which includes rules enabling limited forwarding for those packets that do not match any entry of the set of flow tables.

Abstract translation: 描述了充当软件定义网络内的转发平面以减少慢速路径分组处理的负面影响的网络元件。 网络元件在接收到第一分组时确定它是否与一组流表中的任何流条目匹配。 当第一分组与流表集合中的任何流表项不匹配时，网络单元执行未命中过程，包括将第一分组的至少一部分插入网络单元的分组未命中表格中，由控制器 。 控制器可以使用拉机制来访问分组未命中表。 未命中过程还可以包括访问网络元件的可配置默认规则表，其包括为那些不匹配该组流表的任何条目的那些分组启用有限转发的规则。

公开(公告)号：WO2014118718A3

公开(公告)日：2014-11-06

申请号：PCT/IB2014058644

申请日：2014-01-29

Applicant: ERICSSON TELEFON AB L M

Inventor： ALLAN DAVID IAN ,  SALTSIDIS PANAGIOTIS ,  FARKAS JÁNOS ,  CSÁSZÁR ANDRÁS ,  TANTSURA EVGENY

IPC: H04L12/721 ,  H04L12/703 ,  H04L12/705 ,  H04L12/753

CPC classification number: H04L45/12 ,  H04L45/02 ,  H04L45/16 ,  H04L45/18 ,  H04L45/28 ,  H04L45/48 ,  H04L45/66 ,  H04L45/745

Abstract: A method forward Ethernet frames at a node in a network supporting an implementation of shortest path bridging (SPB) protocol is disclosed. The method starts with a shortest path computation for the node (referred to as the computing node). The shortest path computation selects at least a shortest path to each destination node in the network, where a neighboring node on the shortest path to reach each node is recorded. Then it computes a downstream loop-free alternate (LFA) node for a destination node, where the LFA node is downstream of the computing node but not on the selected shortest path to the destination node from the computing node. Then when connectivity to the neighboring node on the computed shortest path is detected to be abnormal, the node forwards an Ethernet frame with a destination media access control (MAC) address corresponding to the destination node through the LFA node.

Abstract translation: 公开了支持最短路径桥接（SPB）协议的实现的网络中的节点处转发以太网帧的方法。 该方法从节点（称为计算节点）的最短路径计算开始。 最短路径计算至少选择到网络中每个目的地节点的最短路径，其中记录到达每个节点的最短路径上的相邻节点。 然后，它为目的地节点计算下游无环交替（LFA）节点，其中LFA节点在计算节点的下游，但不在从计算节点到目标节点的选定的最短路径上。 然后，当检测到计算出的最短路径上的相邻节点的连接异常时，节点通过LFA节点转发具有与目的地节点对应的目的地媒体访问控制（MAC）地址的以太网帧。

公开(公告)号：WO2014091327A2

公开(公告)日：2014-06-19

申请号：PCT/IB2013059922

申请日：2013-11-06

Applicant: ERICSSON TELEFON AB L M

Inventor： ALLAN DAVID IAN ,  CHAKRABARTI SAMITA

CPC classification number: H04L43/10 ,  H04L41/12 ,  H04L45/122 ,  H04L45/24 ,  H04L45/26 ,  H04L45/7453

Abstract: According to another embodiment of the invention, TWAMP path discovery is performed to determine a sequence of IP addresses of a forward direction TWAMP E2E path to be traversed by two different TWAMP test sessions between a Sender and a Reflector. Then, additional TWAMP test request packets are transmitted for the different TWAMP test sessions; and TWAMP test reply messages are received responsive to respective ones of the TWAMP test request packets. Responsive to the TWAMP test reply messages, a PM is determined that is specific to the different sequences of IP addresses of the forward direction TWAMP E2E paths traversed by the two different TWAMP test sessions.

Abstract translation: 根据本发明的另一个实施例，执行TWAMP路径发现以确定要由发送者和反射器之间的两个不同的TWAMP测试会话遍历的正向TWAMP E2E路径的IP地址序列。 然后，为不同的TWAMP测试会话传输额外的TWAMP测试请求数据包; 并且响应于相应的TWAMP测试请求分组而接收到TWAMP测试应答消息。 响应于TWAMP测试应答消息，确定PM是由两个不同的TWAMP测试会话遍历的正向TWAMP E2E路径的不同IP地址序列特有的。

公开(公告)号：CA2875365A1

公开(公告)日：2013-12-12

申请号：CA2875365

申请日：2013-05-10

Applicant: ERICSSON TELEFON AB L M

Inventor： ALLAN DAVID IAN

IPC: H04L12/46 ,  H04L45/50 ,  H04L45/74

Abstract: A process is implemented in a network element of a packet data to route packets with embedded virtual local area network information and an IP header to far end addresses of virtual forwarding instances. The method receiving a frame including an embedded virtual network identifier (VNI). The VNI is looked up to identify a virtual forwarding instance (VFI), the VFI having a correlated an I-Component Service Identifier (I- SID) and an internet protocol (IP) to backbone media access control (B- MAC) table that is shared with a set of VFIs each having correlated I-SIDs. The VFI resolves an IP address of the frame to a B-MAC address using the shared IP to B-MAC resolution table and encapsulates the frame with the I-SID and B-MAC; and the frame is then sent to the remote B-MAC address.

公开(公告)号：AU2014210787A1

公开(公告)日：2015-09-03

申请号：AU2014210787

申请日：2014-01-29

Applicant: ERICSSON TELEFON AB L M

Inventor： ALLAN DAVID IAN ,  SALTSIDIS PANAGIOTIS ,  FARKAS JANOS ,  CSASZAR ANDRAS ,  TANTSURA EVGENY

IPC: H04L45/02 ,  H04L45/16 ,  H04L45/18 ,  H04L45/28 ,  H04L45/74

Abstract: A method forward Ethernet frames at a node in a network supporting an implementation of shortest path bridging (SPB) protocol is disclosed. The method starts with a shortest path computation for the node (referred to as the computing node). The shortest path computation selects at least a shortest path to each destination node in the network, where a neighboring node on the shortest path to reach each node is recorded. Then it computes a downstream loop-free alternate (LFA) node for a destination node, where the LFA node is downstream of the computing node but not on the selected shortest path to the destination node from the computing node. Then when connectivity to the neighboring node on the computed shortest path is detected to be abnormal, the node forwards an Ethernet frame with a destination media access control (MAC) address corresponding to the destination node through the LFA node.

公开(公告)号：IN9385DEN2014A

公开(公告)日：2015-07-17

申请号：IN9385DEN2014

申请日：2014-11-07

Applicant: ERICSSON TELEFON AB L M

Inventor： ALLAN DAVID IAN

IPC: H04L45/122 ,  H04L45/28 ,  H04L69/40 ,  H04L45/74

Abstract: A three stage folded Clos network is used for Ethernet routing with improved efficiency for computational complexity, network administration, multicast addressing and load redistribution upon failure. The network includes an array of root nodes coupled to an array of edge nodes. Forwarding states are computed and installed for spanning trees rooted on the root nodes. When an edge node is identified as having a failed connection to a root node a shortest path first (SPF) tree rooted on that edge node is constructed for each Backbone VLAN identifier (B VID) for the spanning trees rooted on that root node and use the failed connection. A filtering database in each node is populated for edge node pairs having a common service identifier and unicast and multicast data are forwarded between the edge node pairs according to the filtering database via the SPF trees using a hybrid multicast addressing.

公开(公告)号：IN9369DEN2014A

公开(公告)日：2015-07-17

申请号：IN9369DEN2014

申请日：2014-11-07

Applicant: ERICSSON TELEFON AB L M

Inventor： ALLAN DAVID IAN

IPC: H04L45/122 ,  H04L45/28 ,  H04L69/40 ,  H04L45/16 ,  H04L45/24

Abstract: A node in a communication network selects between equal cost shortest paths (ECSPs) using split tiebreakers. The node advertises multiple system identifiers (IDs) for that node, and each system ID is associated with a different set of traffic IDs that distinguish different virtual networks in the network. The node receives sets of system IDs for each of the other nodes in the network. After constructing a plurality of different ECSPs between two nodes the node selects one of the ECSPs for each traffic ID used between the two nodes. For a traffic ID, the node constructs path IDs for each of the ECSPs using one system ID of each node in the path that is associated with that traffic ID. Because of the configuration of the system IDs and the traffic IDs in the network traffic affected by a failure will be distributed across a plurality of surviving ECSPs.

公开(公告)号：AU2011300436B2

公开(公告)日：2014-08-14

申请号：AU2011300436

申请日：2011-07-19

Applicant: ERICSSON TELEFON AB L M

Inventor： ALLAN DAVID IAN ,  MANSFIELD SCOTT ANDREW

IPC: H04L12/46 ,  H04L45/125

Abstract: A method in an Ethernet Bridge for improved load distribution in an Ethernet network that includes the Ethernet Bridge including determining a first set of one or more shortest paths between each Ethernet Bridge pair in the Ethernet network, selecting at least a first shortest path, calculating a link utilization value for each link of the Ethernet network, determining a second set of one or more shortest paths between each Ethernet Bridge pair in the Ethernet network, generating a path utilization value for each shortest path, selecting a second shortest path on the basis of said path utilization value, whereby the selection of the second shortest in light of path utilization minimizes the standard deviation of load distribution across the entire Ethernet network.

公开(公告)号：AR084125A1

公开(公告)日：2013-04-24

申请号：ARP110103281

申请日：2011-09-08

Applicant: ERICSSON TELEFON AB L M

Inventor： MANSFIELD SCOTT ANDREW ,  ALLAN DAVID IAN

IPC: H04L12/46 ,  H04L45/125

Abstract: Un método en un puente Ethernet para la distribución de carga mejorada en una red Ethernet que incluye el puente Ethernet, comprende: determinar un primer conjunto de una o más rutas más cortas entre cada par de puentes Ethernet de la red Ethernet; seleccionar al menos una primera ruta más corta; calcular un valor de utilización de enlaces correspondiente a cada enlace de la red Ethernet; determinar un segundo conjunto de una o más rutas más cortas entre cada par de puentes Ethernet de la red Ethernet; generar un valor de utilización de rutas para cada ruta más corta; seleccionar una segunda ruta más corta sobre la base de dicho valor de utilización de rutas, por lo cual la selección de la segunda ruta más corta, a la luz de la utilización de rutas, minimiza la desviación estándar de distribución de carga a través de toda la red Ethernet.

公开(公告)号：AU2011300438A1

公开(公告)日：2013-04-11

申请号：AU2011300438

申请日：2011-08-04

Applicant: ERICSSON TELEFON AB L M

Inventor： ALLAN DAVID IAN ,  MANSFIELD SCOTT ANDREW

IPC: H04L45/122 ,  H04L45/125 ,  H04L45/24 ,  H04L45/50

Abstract: A method implemented in a node of a multi-protocol label switching (MPLS) network for improved load distribution, including determining a first set of one or more shortest paths between each MPLS node pair, selecting at least a first shortest path by applying the common algorithm tie-breaking process, calculating a link utilization value for each link of the MPLS network, determining a second set of one or more shortest paths between each MPLS node pair, generating a path utilization value for each shortest path in the second set of shortest paths based on link utilization values corresponding to each shortest path, and selecting a second shortest path from the second set of shortest paths on the basis of said path utilization value, whereby the selection of the second subsets in light of path utilization minimizes the standard deviation of load distribution across the entire MPLS network.