Method and system for allocating and controlling labels in multi-protocol label switched networks
View Patent ↗A method and system for allocating and controlling a hierarchy of labels in an MPLS network is provided. The hierarchy of labels, inserted into MPLS packets, is introduced so as to correspond to the hierarchy of sub-flows within a data flow. The labels have the established dependency so that positions of labels in the hierarchy identify a sequence of processing the labels and functions associated with the labels. The system for allocating and controlling the hierarchy of MPLS labels includes a first control plane mapper for releasing available labels, a first controller for assigning the released labels according to the hierarchy, means for transmitting the labels in the network, a second controller for detecting the labels, and a second control plane mapper for maintaining current label dependency within the hierarchy. If required, re-addressing of the hierarchy of labels may be performed to maintain flow-sub-flow association throughout two adjacent networks. In the preferred embodiments on the invention the method of allocating and controlling hierarchy of labels is applied to sub-flows within FA-LSP flows, and to multi-cast services in the network associated with a function of flooding and filtering data within a network node.
1. A data network having a plurality of nodes, comprising:
means for allocating a hierarchy of attribute labels to data in a data flow, comprising a hierarchy of data sub-flows, so that the hierarchy of the allocated labels corresponds to the hierarchy of data sub-flows within the data flow;
means for transmitting data having the allocated labels between the nodes in the network; and
means for detecting the allocated labels and processing the labels according to the label hierarchy.
2. A network as described in claim 1 , wherein the network is a packet network.
3. A network as described in claim 2 , wherein the packet network is a Multi-Protocol Label Switched (MPLS) network having the data flow between two label edge routers.
4. A network as described in claim 1 , wherein the network is a frame network.
5. A network as described in claim 4 , wherein the frame network is a high density link controlling (HDLC) network.
6. A network as described in claim 3 , wherein the means for allocating the hierarchy of labels comprises means for establishing dependency of labels within the hierarchy so that positions of labels in the hierarchy identify a sequence of processing of the labels and functions associated with the labels.
7. A network as described in claim 6 , wherein the means for allocating the hierarchy of labels comprises:
a first control plane mapper for releasing available labels, and a first controller for assigning the released labels according to the label hierarchy.
8. A network as described in claim 7 , wherein the first control mapper comprises a state machine capable of allocating a unique hierarchy of labels for each of the flow and sub-flow combination between the edge routers.
9. A network as described in claim 6 , wherein the means for transmitting comprises a line driving device on a forwarding node and a receiving interface on a receiving node.
10. A network as described in claim 6 , wherein the means for detecting comprises a second controller for detecting the hierarchy of labels according to the label dependency, and a second control plane mapper for maintaining current label dependency within the hierarchy.
11. A network as described in claim 6 , wherein the hierarchy of labels includes N labels, each label in the hierarchy being dependent upon, and processed immediately after, and deriving its function from the label above it.
12. A network as described in claim 11 , wherein N=2, the hierarchy of labels comprising a first label and a second label, the second label being dependent on the first one.
13. A network as described in claim 11 , wherein N=3.
14. A network as described in claim 11 , wherein N is selected from a range from 4 to 10.
15. A network as described in claim 3 , wherein the means for allocating labels comprise s means for allocating a space for each label itself equal to 20 bits.
16. A network as described in claim 3 , wherein the means for allocating labels comprises means for allocating a space for each label in the hierarchy within a range from 4 bits to 128 bits.
17. A network as described in claim 6 , further comprising means for re-addressing the hierarchy of labels at the label edge router.
18. A network as described in claim 12 , wherein the first label in the hierarchy identifies a Forwarding Agency label switched path (FA-LSP) flow, and the second label identifies a sub-flow within the FA-LSP flow.
19. A network as described in claim 6 , wherein one of the labels in the hierarchy is a multi-cast service label.
20. A network as described in claim 19 , wherein all packets labeled with the same multi-cast label follow the same label switched path in the network.
21. A network as described in claim 19 , wherein the multi-cast service label is associated with a function for flooding data to all ports within a node, and simultaneously enabling only those ports at the node, for which egress is required.
22. A network as described in claim 20 , wherein the same path is the path established so as to provide one of the following:
required traffic load in the network, and
controlled delay in arrival times of the multi-cast packets.
23. A method for managing data in communications data network, comprising the steps of:
forming a data flow, having a hierarchy of data sub-flows;
allocating a hierarchy of attribute labels to data in the data flow, corresponding to the hierarchy of data sub-flows;
transmitting data having the allocated labels between nodes in the network;
detecting the allocated labels; and
processing the labels according to the label hierarchy.
24. A method as described in claim 23 , the method being applied for managing data in Multi-Protocol Label Switched (MPLS) packet network having the data flow between two label edge routers.
25. A method as described in claim 24 , wherein the step of allocating the hierarchy of labels comprises establishing dependency of labels within the hierarchy so that positions of labels in the hierarchy identify a sequence of processing of the labels and functions associated with the labels.
26. A method as described in claim 24 , wherein the step of allocating the hierarchy of labels comprises releasing available labels and assigning the released labels according to the label hierarchy.
27. A method as described in claim 26 , wherein the step of releasing the labels comprises releasing a unique hierarchy of labels for each of the flow and sub-flow combination between the edge routers.
28. A method as described in claim 24 , wherein the step of allocating comprises allocating the hierarchy of labels including N labels, each label in the hierarchy being dependent upon, and processed immediately after, and deriving its function from the label above it.
29. A method as described in claim 24 , wherein the step of allocating comprises allocating labels so that each of the labels itself occupies one of the following:
a space of 20 bits; and
a space within a range from 4 bits to 128 bits.
30. A method as described in claim 24 , wherein the step of allocating further comprises re-addressing the labels within the hierarchy.
31. A method as described in claim 28 , wherein the step of allocating comprising allocating the hierarchy including a first and second labels (N=2), the first label identifying a Forwarding Agency label switched path (FA-LSP) flow, and the second label identifying a sub-flow within the FA-LSP flow.
32. A method as described in claim 25 , wherein the step of allocating comprises allocating one of the labels in the hierarchy as a multi-cast service label and associating a function with this label that all packets having the same multi-cast label follow the same label switched path in the network.
33. A method as described in claim 32 , wherein the step of allocating further comprises associating another function with the multi-cast service label, which provides flooding of data to all ports within a node and simultaneously enables only those ports at the node, for which egress is required.
34. A method as described in claim 32 , wherein the step of allocating comprises allocating another label in the hierarchy, which identifies the egress LSP label to be dependent onto the multiast label to define the path to the next destination.
35. A system for allocating and controlling labels in an MPLS packet network, comprising:
means for allocating a hierarchy of attribute labels to packets in a data flow, comprising a hierarchy of data sub-flows, so that the hierarchy of the allocated labels corresponds to the hierarchy of data sub-flows within the data flow;
means for transmitting packets having the allocated labels between the nodes in the network; and
means for detecting the allocated labels and processing the labels according to the label hierarchy.