The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jul. 19, 2022

Filed:

Dec. 21, 2017
Applicant:

Telefonaktiebolaget Lm Ericsson (Publ), Stockholm, SE;

Inventors:

Gabor Sandor Enyedi, Budapest, HU;

János Farkas, Kecske{acute over (m)}et, HU;

Zoltán Turányi, Szentendre, HU;

Assignee:
Attorney:
Primary Examiner:
Int. Cl.
CPC ...
H04L 12/703 (2013.01); H04L 12/721 (2013.01); H04L 12/707 (2013.01); H04L 45/28 (2022.01); H04L 45/12 (2022.01); H04L 45/00 (2022.01); H04L 45/24 (2022.01);
U.S. Cl.
CPC ...
H04L 45/28 (2013.01); H04L 45/12 (2013.01); H04L 45/22 (2013.01); H04L 45/24 (2013.01);
Abstract

The present disclosure relates to forwarding of network traffic. In one of its aspects, the technology presented herein concerns a method for forwarding network traffic from multiple sources to multiple destinations on maximally disjoint paths by maximally redundant trees, MRTs. The method is implemented in a network element implementing multipoint-to-multipoint functionalities in a path computation element, PCE, of a network, wherein the network includes a plurality of network elements. According to the method, an almost directed acyclic graph, ADAG, is computed for the network. Next hops along MRTs are computed by using the ADAG. One or more valid path pair(s) of the computed MRTs that is/are disjoint is/are determined and then, the network traffic is forwarded by using the valid path pair(s) of the MRT(s).


Find Patent Forward Citations

Loading…