公开(公告)号：DE602006018533D1

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

申请号：DE602006018533

申请日：2006-03-31

Applicant: ERICSSON TELEFON AB L M

Inventor： CSASZAR ANDRAS ,  TAKACS ATTILA

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

公开(公告)号：AT491294T

公开(公告)日：2010-12-15

申请号：AT07802387

申请日：2007-07-20

Applicant: ERICSSON TELEFON AB L M

Inventor： CSASZAR ANDRAS ,  MIHALY ATTILA ,  PAPP OCTAVIAN

IPC: H04L12/56

Abstract: In a packet switched communications transport network a method for re-routing traffic flow is provided. The invention based on the recognition of actual utilization of transport resources. In accordance with the implementation, Fast Re-Route detour paths are recalculated each time after new bandwidth information is received. The detours are re-established on new computed paths if needed, i.e., if an optimized path has been found. A node and a system are also disclosed, referring to MPLS network. Also a node is described acting as a Point of Local Repair for link failures. The node comprises a Routing engine, a Link state database, a Detour path calculator and a Detour path establisher in order to capture bandwidth information of the network links and to calculate detour path information for the nodes.

公开(公告)号：AT489791T

公开(公告)日：2010-12-15

申请号：AT06727794

申请日：2006-03-31

Applicant: ERICSSON TELEFON AB L M

Inventor： 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.

公开(公告)号：DE602007008772D1

公开(公告)日：2010-10-07

申请号：DE602007008772

申请日：2007-05-29

Applicant: ERICSSON TELEFON AB L M

Inventor： BADER ATTILA ,  CSASZAR ANDRAS

IPC: H04L12/54

公开(公告)号：AT479256T

公开(公告)日：2010-09-15

申请号：AT07729600

申请日：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.

公开(公告)号：BRPI0520495A2

公开(公告)日：2009-09-29

申请号：BRPI0520495

申请日：2005-08-23

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.