公开(公告)号：EP2119291A4

公开(公告)日：2013-10-09

申请号：EP07861180

申请日：2007-12-28

Applicant: ERICSSON TELEFON AB L M

Inventor： ANTAL CSABA ,  TAKACS ATTILA ,  WESTBERG LARS

IPC: H04W8/12 ,  H04W24/02 ,  H04W40/24

CPC classification number: H04W8/12 ,  H04L45/00 ,  H04L45/02 ,  H04L45/60 ,  H04W24/02 ,  H04W40/24

公开(公告)号：WO2008087547A3

公开(公告)日：2008-09-12

申请号：PCT/IB2008000119

申请日：2008-01-18

Applicant: ERICSSON TELEFON AB L M ,  FARKAS JANOS ,  ANTAL CSABA ,  TAKACS ATTILA ,  SALTSIDIS PANAGIOTIS

Inventor： FARKAS JANOS ,  ANTAL CSABA ,  TAKACS ATTILA ,  SALTSIDIS PANAGIOTIS

IPC: H04L12/46 ,  H04L12/56

CPC classification number: H04L12/462 ,  H04L45/02 ,  H04L45/025 ,  H04L45/04 ,  H04L45/48

Abstract: There is disclosed a manner of managing the active topology, that is the scheme for forwarding data, in a computer network such as an Ethernet local area network. A root bridge is selected from a plurality of bridges in the network; the root bridge calculating at least one spanning tree from a topology database that has been populated by bridge neighbor information gleaned from link state advertising messages. The root bridge may also calculate an alternate topology for implementation in the event a failure condition that affects the primary spanning tree is detected. The root bridge then advertises the spanning tree and remotely configures the port states of the bridges in the spanning tree through tree advertising messages that the bridges are arranged to process and set their ports accordingly.

Abstract translation: 公开了在诸如以太网局域网的计算机网络中管理活动拓扑的方式，即用于转发数据的方案。 从网络中的多个网桥中选择根网桥; 该根桥根据拓扑数据库计算至少一个生成树，该拓扑数据库已经由从链路状态通告消息中收集的网桥邻居信息填充。 如果检测到影响主生成树的故障条件，则根桥还可以计算实施的替代拓扑。 然后，根网桥通告生成树并通过树布告消息远程配置生成树中网桥的端口状态，网桥布置为处理并相应地设置其端口。

公开(公告)号：WO2008129388A2

公开(公告)日：2008-10-30

申请号：PCT/IB2008000929

申请日：2008-04-16

Applicant: ERICSSON TELEFON AB L M ,  TAKACS ATTILA ,  SALTSIDIS PANAGIOTIS

Inventor： TAKACS ATTILA ,  SALTSIDIS PANAGIOTIS

IPC: H04L12/56

CPC classification number: H04L45/48 ,  H04L12/462 ,  H04L12/4641 ,  H04L45/02 ,  H04L45/52

Abstract: A system, method, and node for identifying non-Multiple Spanning Tree Protocol control planes. The method includes the steps of identifying a specific non-Multiple Spanning Tree Protocol control plane instance, associating a General Control Plane Identification, GCPID, with the specific control plane instance, wherein the GCPID binds a Virtual Local Area Identifier, VID, with the specific control plane, and advertising the GCPID to identify the specific control plane instance.

Abstract translation: 用于识别非多生成树协议控制平面的系统，方法和节点。 该方法包括以下步骤：识别特定的非多生成树协议控制平面实例，将通用控制平面识别GCPID与特定控制平面实例相关联，其中GCPID将虚拟局域标识符VID与具体的控制平面实例 控制平面，并广告GCPID来识别具体的控制平面实例。

公开(公告)号：PL3119042T3

公开(公告)日：2018-03-30

申请号：PL16001757

申请日：2009-02-26

Applicant: ERICSSON TELEFON AB L M

Inventor： TAKACS ATTILA ,  KERN ANDRÁS

IPC: H04L12/46 ,  H04L45/50

公开(公告)号：DK2428007T3

公开(公告)日：2013-10-28

申请号：DK10717847

申请日：2010-04-23

Applicant: ERICSSON TELEFON AB L M

Inventor： TAKACS ATTILA ,  KINI SRIGANESH

IPC: H04L45/741 ,  H04L12/46

公开(公告)号：AT519301T

公开(公告)日：2011-08-15

申请号：AT06831666

申请日：2006-12-08

Applicant: ERICSSON TELEFON AB L M

Inventor： TAKACS ATTILA

IPC: H04L12/56 ,  H04L12/28 ,  H04L12/46

Abstract: A system, method, and Ethernet bridge utilizing forced MAC learning to set up a path from an originating node, PON (23) to one or more terminating nodes, PTN (12) through intermediate bridge nodes (14, 21). In the point-to-point case, a Previous Hop Bridge (PHB) list defines the links in the path. Each link includes a destination address, source address, port number, and VID. A path learning frame (13, 19, 22) containing the list is sent in reverse order from the PTN through the intermediate bridge nodes to the PON. Each node in the path saves the received frame's header information as learned path information using standard MAC learning functionality, removes the node's own information from the list, and forwards the frame with the remainder of the list to the next node using the port specified by the port number for that link. When the frame arrives at the PON, all nodes have saved the learned path information.

公开(公告)号：ES2338030T3

公开(公告)日：2010-05-03

申请号：ES05783439

申请日：2005-08-23

Applicant: ERICSSON TELEFON AB L M

Inventor： CSASZAR ANDRAS ,  TAKACS ATTILA ,  BADER ATTILA

IPC: H04W28/16 ,  H04L12/54 ,  H04L47/724

Abstract: Método de reserva de recursos para flujos de datos en una red de comunicaciones, que comprende: detectar una solicitud (151) de reserva de recursos para un flujo de datos nuevo que incluye una pluralidad de descriptores que especifican recursos solicitados; calcular un recuento de comprobación de admisión basándose en la pluralidad de descriptores del flujo de datos nuevo y recuentos de reserva que especifican los recursos acumulados de todos los flujos de datos admitidos, en los que cada recuento de reservas representa una función suma o una función producto, estando constituida la función suma por una suma de funciones que tienen como variables los descriptores de los flujos de datos admitidos y estando constituida la función producto por un producto de funciones que tienen como variables los descriptores de los flujos de datos admitidos; admitir el flujo de datos nuevo, si el recuento de comprobación de admisión es menor que un recuento de admisión máximo para la pluralidad de descriptores; y actualizar los recuentos de reservas basándose en los descriptores del flujo de datos nuevo, si se admite el flujo de datos nuevo.

公开(公告)号：HK1126052A1

公开(公告)日：2009-08-21

申请号：HK09103700

申请日：2009-04-22

Applicant: ERICSSON TELEFON AB L M

Inventor： CSASZAR ANDRAS ,  TAKACS ATTILA ,  BADER ATTILA

IPC: H04L12/54 ,  H04L47/724

Abstract: A network node for reserving resources for data flows in a communication network. The node detects a request for resource reservation for a new data flow and computes an admission test count based on descriptors of the new data flow and reservation counts, which represent reservation functions of descriptors of previously admitted data flows and which specify resources of the admitted data flows. The new data flow is admitted if the admission test count is smaller than a maximum allowable count. The reservation counts are then updated based on the descriptors of the new data flow. A plurality of admission formulas may thus be used to maintain aggregated reservation counts for data flows, the number of counts being independent from the number of flows.

公开(公告)号：CA2645356A1

公开(公告)日：2007-10-11

申请号：CA2645356

申请日：2006-03-31

Applicant: ERICSSON TELEFON AB L M

Inventor： BADER ATTILA ,  CSASZAR ANDRAS ,  TAKACS ATTILA

IPC: H04L45/28 ,  H04L12/54 ,  H04L45/02 ,  H04L47/2466

Abstract: Methods, edge routers and an edge-router-refresh network signalling message used to update state information in edge routers. A data session is established on a path from a source towards a destination connected from the source via a plurality of Autonomous Systems (AS). The edge-router-refresh network signalling message is created by an edge router acting an an ingress edge router. The edge-router-refresh network signalling message comprises an identifier of the data session, an identifier of the edge router, which issued the edge-router-refresh message and an indication that the edge-router-refresh message is meant to be used by the edge routers present on the modified path. Optionally, the edge-router-refresh network signalling message further comprises a list of the plurality of AS traversed by the path before the modification.

公开(公告)号：AU2009226921B2

公开(公告)日：2013-03-07

申请号：AU2009226921

申请日：2009-03-16

Applicant: ERICSSON TELEFON AB L M

Inventor： ANTAL CSABA ,  TAKACS ATTILA ,  FARKAS JANOS

IPC: H04L45/28

Abstract: A method is provided for use at a first node of a network. The first node (B) has an input path for receiving Ethernet frames destined for a second node of the network. The first node (B) also has a first output (working) path for forwarding the received Ethernet frames towards the second node. A failure along the first output (working) path is detected at the first node. Following such failure detection, the received Ethernet frames are caused, at the first node, to be re-routed along a second output (backup) path, different to the first output (working) path, towards the second node. The re-routing is performed by using (e.g. referring to and/or changing) respective indications (VLAN1) applied to the Ethernet frames to distinguish those Ethernet frames to be forwarded along the first output (working) path from those Ethernet frames to be forwarded along the second output (backup) path.