Computing and using resource colors for composite links
View Patent ↗A router can consider two color vectors for a path including multiple links through a network. One color vector indicates colors that all of the multiple links include. Another color vector indicates the colors that none of the multiple links include. In setting up a constraint-based label switched path (LSP), a router can use a program that includes a logical process. With the process, the router can automatically compute the color vectors for the path whenever the path of an LSP changes and/or the characteristics (colors) of one or more of the multiple links constituting the LSP changes. Computing whether the path is eligible for inclusion in the LSP includes calculating whether the path includes all colors that must be included in an LSP and calculating whether the path includes any of the colors that must be excluded from the LSP.
1. A method for use on a network, comprising:
determining a first color vector for a path comprised of multiple links between nodes of the network, the first color vector being determined based on color vectors for the multiple links, each of the color vectors representing multiple colors that correspond to attributes of the network, the first color vector indicating colors that all of the multiple links include;
determining a second color vector for the path based on the color vectors for the multiple links, the second color vector indicating colors that none of the multiple links include; and
using the first color vector and the second color vector in determining a route through the network.
2. The method of claim 1 , wherein using comprises considering the path for inclusion in a label switched path (LSP) if the path includes all colors that must be included in the LSP and does not include any colors that must be excluded from the LSP.
3. The method of claim 1 , further comprising:
determining whether the path includes all colors that must be included in a label switched path (LSP) by performing an AND operation on the first color vector and a mask indicating colors that must be included in the LSP; and
determining if a result of the AND operation equals the mask.
4. The method of claim 1 , further comprising:
determining whether the path includes any colors that must be excluded from a label switched path (LSP) by performing an AND operation on the second color vector and a mask indicating colors that must be excluded from the LSP; and
determining if a result of the AND operation equals zero.
5. The method of claim 1 , further comprising:
automatically re-determining the first color vector and the second color vector if an attribute of any of the multiple links changes.
6. The method of claim 1 , further comprising:
automatically re-determining the first color vector and the second color vector if one or more of the multiple links included in the path changes.
7. The method of claim 1 , wherein the colors indicate service attributes of the multiple links.
8. The method of claim 1 , wherein the network comprises the Internet.
9. A method for use on a network, comprising:
determining whether a path through the network includes all colors that must be included in a label switched path (LSP), wherein the colors correspond to attributes of the network associated with the LSP, the path comprises multiple links having color vectors, a color vector for a link represents multiple colors that correspond to attributes of the network associated with the link, and determining is performed based on the color vectors for the multiple links;
determining, based on the color vectors for the multiple links, whether the path includes any colors that must be excluded from the LSP; and
deciding whether to include the path in the LSP based on colors associated with the path.
10. The method of claim 9 , wherein deciding comprises considering the path for inclusion in the LSP if the path includes all colors that must be included in the LSP and does not include any colors that must be excluded from the LSP.
11. The method of claim 9 , wherein determining and determining are performed automatically.
12. The method of claim 9 , wherein determining whether the path includes all colors that must be included in the LSP comprises:
performing an AND operation on a color vector of the path and a mask indicating colors that must be included in the LSP; and
determining if a result of the AND operation equals the mask.
13. The method of claim 9 , wherein determining whether the path includes any colors that must be excluded from the LSP comprises:
performing an AND operation on a color vector of the path and a mask indicating colors that must be excluded from the LSP; and
determining if a result of the AND operation equals zero.
14. The method of claim 9 , wherein deciding comprises automatically determining if the path is eligible for inclusion in the LSP based on whether the path includes all colors that must be included in the LSP and whether the path includes any colors that must be excluded from the LSP.
15. The method of claim 9 , further comprising concurrently determining whether the path includes all colors that must be included in the LSP and determining whether the path includes any colors that must be excluded from the LSP.
16. The method of claim 9 , wherein it is first determined whether the path includes all colors that must be included in the LSP and, if the path does not include all colors that must be included in the LSP, it is not determined if the path includes any colors that must be excluded from the LSP; or
wherein it is first determined whether the path includes any colors that must be excluded from the LSP and, if the path includes any colors that must be excluded from the LSP, it is not determined if the path includes all colors that must be included in the LSP.
17. The method of claim 9 , further comprising setting-up the LSP.
18. The method of claim 9 , wherein the path includes stacked LSPs.
19. The method of claim 9 , wherein the colors indicate service attributes of the multiple links.
20. The method of claim 9 , wherein determining and determining are performed when one or more of the multiple links changes.
21. An article comprising a machine-readable medium which stores machine-executable instructions, the instructions causing a machine to:
determine whether a path through a network includes all colors that must be included in a label switched path (LSP), wherein the colors correspond to attributes of the network associated with the LSP, the path comprises multiple links having color vectors, a color vector for a link represents multiple colors that correspond to attributes of the network associated with the link, and determining is performed based on the color vectors for the multiple links;
determine, based on the color vectors for the multiple links, whether the path includes any colors that must be excluded from the LSP; and
decide whether to include the path in the LSP based on colors associated with the path.
22. The article of claim 21 , wherein deciding comprises considering the path for inclusion in the LSP if the path includes all colors that must be included in the LSP and does not include any colors that must be excluded from the LSP.
23. The article of claim 21 , wherein determining and determining are performed automatically.
24. The article of claim 21 , wherein determining whether the path includes all colors that must be included in the LSP comprises:
performing an AND operation on a color vector of the path and a mask indicating colors that must be included in the LSP; and
determining if a result of the AND operation equals the mask.
25. The article of claim 21 , wherein determining whether the path includes any colors that must be excluded from the LSP comprises:
performing an AND operation on a color vector of the path and a mask indicating colors that must be excluded from the LSP; and
determining if a result of the AND operation equals zero.
26. The article of claim 21 , wherein deciding comprises automatically determining if the path is eligible for inclusion in the LSP based on whether the path includes all colors that must be included in the LSP and whether the path includes any colors that must be excluded from the LSP.
27. The article of claim 21 , wherein determining and determining are performed concurrently.
28. The article of claim 21 , wherein it is first determined whether the path includes all colors that must be included in the LSP and, if the path does not include all colors that must be included in the LSP, it is not determined if the path includes any colors that must be excluded from the LSP; or
wherein it is first determined whether the path includes any colors that must be excluded from the LSP and, if the path includes any colors that must be excluded from the LSP, it is not determined if the path includes all colors that must be included in the LSP.
29. The article of claim 21 , further comprising instructions that cause the machine to set up the LSP.
30. The article of claim 21 , wherein the path includes stacked LSPs.
31. The article of claim 21 , wherein the colors indicate service attributes of the multiple links.
32. The article of claim 21 , wherein determining and determining are performed when one or more of the multiple links changes.
33. An apparatus comprising:
a memory that stores executable instructions for use in routing data along a path of a network between devices connected to the network; and
a processor that executes the instructions to:
determine whether a path through the network includes all colors that must be included in a label switched path (LSP), wherein the colors correspond to attributes of a network associated with the LSP, the path comprises multiple links having color vectors, a color vector for a link represents multiple colors that correspond to attributes of the network associated with the link, and determining is performed based on the color vectors for the multiple links;
determine, based on the color vectors for the multiple links, whether the path includes any colors that must be excluded from the LSP; and
decide whether to include the path in the LSP based on colors associated with the path.
34. The apparatus of claim 33 , wherein determining and determining are performed if one or more of the multiple links changes.
35. The apparatus of claim 33 , wherein deciding comprises considering the path for inclusion in a label switched path (LSP) across the network if the path includes all colors that must be included in the LSP and does not include any colors that must be excluded from the LSP.
36. The apparatus of claim 33 , wherein determining whether the path includes all colors that must be included in a label switched path (LSP) comprises:
performing an AND operation on a color vector of the path and a mask indicating colors that must be included in the LSP; and
determining if a result of the AND operation equals the mask.
37. The apparatus of claim 33 , wherein determining whether the path includes any colors that must be excluded from a label switched path (LSP) comprises:
performing an AND operation on a color vector of the path and a mask indicating colors that must be excluded from the LSP; and
determining if a result of the AND operation equals zero.
38. The apparatus of claim 33 , wherein the processor executes instructions to notify other devices on the network of the first and second color vectors.
39. The apparatus of claim 33 , wherein the processor executes instructions to to set up a label switched path across the network.
40. The apparatus of claim 33 , wherein the instructions comprise software to automatically determine the color vectors.