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.
Patent No.:
Date of Patent:
Oct. 31, 2017
Filed:
Mar. 30, 2015
Applicant:
Alcatel-lucent Usa, Inc., Murray Hill, NJ (US);
Inventors:
Murali Kodialam, Marlboro, NJ (US);
Randeep Bhatia, Green Brook, NJ (US);
Fang Hao, Morganville, NJ (US);
T. V. Lakshman, Morganville, NJ (US);
Assignee:
Alcatel Lucent, Boulogne-Billancourt, FR;
Attorney:
Primary Examiner:
Int. Cl.
CPC ...
H04L 12/801 (2013.01); H04L 12/28 (2006.01); H04L 12/24 (2006.01); H04L 12/26 (2006.01); H04L 12/751 (2013.01); H04L 12/729 (2013.01); H04L 12/721 (2013.01); H04L 12/723 (2013.01); H04L 12/707 (2013.01); H04L 12/717 (2013.01); H04L 12/803 (2013.01); H04L 29/06 (2006.01);
U.S. Cl.
CPC ...
H04L 47/18 (2013.01); H04L 12/28 (2013.01); H04L 41/0695 (2013.01); H04L 43/16 (2013.01); H04L 45/08 (2013.01); H04L 45/125 (2013.01); H04L 45/14 (2013.01); H04L 45/38 (2013.01); H04L 45/50 (2013.01); H04L 41/0654 (2013.01); H04L 41/12 (2013.01); H04L 41/142 (2013.01); H04L 45/24 (2013.01); H04L 45/42 (2013.01); H04L 47/125 (2013.01); H04L 69/166 (2013.01);
Abstract
Various exemplary embodiments relate to a method of offline traffic matrix aware segment routing. The method may include receiving a traffic matrix based upon all the traffic between nodes i and j that is routed in the network; and determining the amount of traffic between nodes i and j will be routed through node k, based on minimizing a maximum link utilization for the traffic matrix by determining that the total amount of flow on a link e in the network is less than the link's capacity.