公开(公告)号：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.

公开(公告)号：AU2007353984B2

公开(公告)日：2011-06-02

申请号：AU2007353984

申请日：2007-05-29

Applicant: ERICSSON TELEFON AB L M

Inventor： BADER ATTILA ,  CSASZAR ANDRAS

IPC: H04L12/54

Abstract: A method of managing quality of service in an IP network is provided. The method comprises identifying, at an egress edge node of the network, that congestion is present in one or more routers within the network. Data flows for termination to remove the congestion are selected. At least one flow termination notification is sent from the egress edge node to an ingress edge node of the network, the at least one flow termination notification identifying the selected data flows. Low priority flows from the selected data flows are terminated at the ingress edge node immediately. High priority flows are terminated only if congestion is still present after a predetermined delay period. The delay may be applied in the ingress edge node or the egress edge node. The invention also provides a method for admitting low priority flows into the network only if the network has resources available for a number of high priority flows above a dynamically determined threshold.

公开(公告)号：AU2006350511B2

公开(公告)日：2011-05-12

申请号：AU2006350511

申请日：2006-11-10

Applicant: ERICSSON TELEFON AB L M

Inventor： TAKACS ATTILA ,  CSASZAR ANDRAS ,  BADER ATTILA

IPC: H04L12/56 ,  H04L47/31

Abstract: A system for managing congestion within a network domain includes an ingress node, an interior node, and an egress node. The ingress node receives and routes data units entering the network domain. The interior node detects whether a load exceeds one or more load thresholds and generates congestion marked data units. The egress node detects the presence of congestion marked data units and reacts to the detection of the presence of congestion marked data units by invoking a congestion control process.

公开(公告)号：AU2007353984A1

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

申请号：AU2007353984

申请日：2007-05-29

Applicant: ERICSSON TELEFON AB L M

Inventor： BADER ATTILA ,  CSASZAR ANDRAS

IPC: H04L12/54

Abstract: A method of managing quality of service in an IP network is provided. The method comprises identifying, at an egress edge node of the network, that congestion is present in one or more routers within the network. Data flows for termination to remove the congestion are selected. At least one flow termination notification is sent from the egress edge node to an ingress edge node of the network, the at least one flow termination notification identifying the selected data flows. Low priority flows from the selected data flows are terminated at the ingress edge node immediately. High priority flows are terminated only if congestion is still present after a predetermined delay period. The delay may be applied in the ingress edge node or the egress edge node. The invention also provides a method for admitting low priority flows into the network only if the network has resources available for a number of high priority flows above a dynamically determined threshold.

公开(公告)号：AU2006350511A1

公开(公告)日：2008-05-15

申请号：AU2006350511

申请日：2006-11-10

Applicant: ERICSSON TELEFON AB L M

Inventor： TAKACS ATTILA ,  CSASZAR ANDRAS ,  BADER ATTILA

IPC: H04L12/56 ,  H04L47/31

Abstract: A system for managing congestion within a network domain includes an ingress node, an interior node, and an egress node. The ingress node receives and routes data units entering the network domain. The interior node detects whether a load exceeds one or more load thresholds and generates congestion marked data units. The egress node detects the presence of congestion marked data units and reacts to the detection of the presence of congestion marked data units by invoking a congestion control process.

公开(公告)号：AT541402T

公开(公告)日：2012-01-15

申请号：AT07846822

申请日：2007-11-26

Applicant: ERICSSON TELEFON AB L M

Inventor： PAPP OKTAVIAN ,  CSASZAR ANDRAS ,  MIHALY ATTILA ,  WESTBERG LARS

IPC: H04L29/12

Abstract: A technique for address resolution in data transmission networks, for example ARP-based address resolution in IPv4 networks. An embodiment of the technique comprises the following steps performed in a host of the data transmission network: Maintaining an association of at least one physical address with at least one network address range comprising multiple network addresses; obtaining a target network address; comparing the target network address with the network address range to determine an associated target physical address; and providing the determined target physical address, e.g. for initiating a data transmission.

公开(公告)号：ES2351586T3

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

申请号：ES07729600

申请日：2007-05-29

Applicant: ERICSSON TELEFON AB L M

Inventor： BADER ATTILA ,  CSASZAR ANDRAS

IPC: H04L12/54

Abstract: Un método de gestionar la calidad de servicio en una red IP que transmite flujos de datos que tienen al menos dos niveles de prioridad, el método que comprende: identificar, en un nodo de borde de salida (303, 304) de la red, que la congestión está presente en uno o más encaminadores (306) dentro de la red; seleccionar los flujos de datos para la terminación para eliminar la congestión; enviar una notificación de terminación del flujo inicial desde el nodo de borde de salida a un nodo de borde de entrada (301, 302) de la red, la notificación de terminación del flujo inicial que identifica los flujos de datos seleccionados; y terminar los flujos de baja prioridad a partir de los flujos de datos seleccionados en el nodo de borde de entrada cuando la notificación de terminación del flujo inicial se recibe; y caracterizado por: en el nodo de borde de salida, después de los periodos de medición predeterminados, identificar si la congestión todavía está presente y, si lo está, seleccionar los flujos de datos adicionales para la terminación y enviar las notificaciones de terminación de flujo consecutivo al nodo de borde de entrada, las notificaciones de terminación de flujo adicionales que identifican los flujos de datos adicionales; y terminar los flujos de alta prioridad a partir de los flujos de datos seleccionados en el nodo de borde de entrada solamente si: al menos uno de los mensajes de notificación de terminación consecutivos se recibe por el nodo de borde de entrada después de que ha transcurrido un periodo de retardo predeterminado desde la recepción de la notificación de terminación del flujo inicial; y el al menos un mensaje de notificación de terminación consecutivo recibido después del periodo de retardo predeterminado incluye los mismos flujos de alta prioridad en los flujos de datos adicionales seleccionados para la terminación.

公开(公告)号：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.