| US 7,499,404 B2 | ||
| Distributed quality of service routing | ||
| Ravi S. Ravindran, Ottawa (Canada); Guo-Qiang Wang, Nepean (Canada); and Krishnaiyan Thulasiraman, Norman, Okla. (US) | ||
| Assigned to Nortel Networks Limited, St. Laurent, Quebec (Canada) | ||
| Filed on Aug. 30, 2002, as Appl. No. 10/232,063. | ||
| Prior Publication US 2004/0042404 A1, Mar. 04, 2004 | ||
| Int. Cl. G08C 15/00 (2006.01); H04J 3/14 (2006.01); H04L 12/28 (2006.01) | ||
| U.S. Cl. 370—238 [370/230; 370/255] | 21 Claims |
| 1. A routing method comprising:
receiving at a current node a construct path message from a neighboring previous node, the construct path message including
first and second values for first and second additive parameters;
checking whether the first value satisfies an optimality condition and whether the second value indicates a feasible path
given a path constraint; and
if the first value satisfies an optimality condition and the second value indicates a feasible path given a path constraint,
then testing whether each outgoing link satisfies a link constraint;
if an outgoing link to a next neighboring node satisfies the link constraint, then (i) sending out a construct path message
to the next neighboring node, (ii) incrementing a number-of-acknowledgement-messages variable by the number of construct path
messages sent, and (iii) adding an entry to a predecessor array stored at the current node, the entry including an identifier
for the predecessor neighboring node, the first path value, and the second path value.
|