Routing methods, systems, and computer program products for using specific identifiers to transmit data

• US 10,389,625 B1
• Filed: 08/10/2018
• Issued: 08/20/2019
• Est. Priority Date: 12/27/2012
• Status: Active Grant

• Current Assignee: MORRIS ROUTING TECHNOLOGIES, LLC
• Original Assignee: Sitting Man LLC
• Inventors: Morris, Robert Paul
• Primary Examiner(s): Tran, Jimmy H
• Application Number:
  US16/101,387
• Time in Patent Office: 375 Days
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/126 minimising geographical or physical path length
• CPC Class Codes: H04L 45/22 Alternate routing
• CPC Class Codes: H04L 45/34 Source routing
• CPC Class Codes: H04L 45/50 using label swapping, e.g. multi-protocol label switch [MPLS]
• CPC Class Codes: H04L 61/106 across networks, e.g. mapping telephone numbers to data network addresses
• CPC Class Codes: H04L 61/4511 using domain name system [DNS]
• CPC Class Codes: H04W 40/38 adapting due to varying relative distances between nodes

Abstract

In one embodiment, an apparatus is provided comprising: a current node configured to: receive, from a next node, information that is configured for use in identifying an identifier in a node-specific identifier space specific to the next node that identifies a particular node for the next node; and map, based on the information, the identifier that identifies the particular node for the next node, to an identifier in a node-specific identifier space specific to the current node that identifies the particular node for the current node, the identifier that identifies the particular node for the current node having a meaning for the current node defined solely by the node-specific identifier space specific to the current node.

Claims

1. An apparatus, comprising:

a current node configured to be positioned in a label switching network, the current node including at least one non-transitory memory configured to store instructions, and one or more processors in communication with the at least one non-transitory memory, wherein the one or more processors is configured to execute the instructions to cause the current node to;

receive, from a next node, information that is configured for use in identifying an identifier in a node-specific identifier space specific to the next node that identifies a particular node for the next node;

map, based on the information, the identifier that identifies the particular node for the next node, to an identifier in a node-specific identifier space specific to the current node that identifies the particular node for the current node, the identifier that identifies the particular node for the current node having a meaning for the current node defined solely by the node-specific identifier space specific to the current node;

store an association between the identifier that identifies the particular node for the next node, and the identifier that identifies the particular node for the current node;

receive, from a previous node, data and a packet including a header;

identify, using the header of the packet, the identifier that identifies the particular node for the current node;

identify a network path for transmitting the data to the particular node, the network path including the next node;

locate, based on the identifier that identifies the particular node for the current node, the association;

map, based on the association, the identifier that identifies the particular node for the current node, to the identifier that identifies the particular node for the next node; and

transmit, via a network interface of the current node, the data to the particular node via the next node included in the network path.

2. The apparatus of claim 1, wherein the current node is included in a plurality of nodes each of which:

has a respective node scope-specific identifier space that is specific thereto, and includes a node identifier that identifies the current node therefor.

3. The apparatus of claim 2, wherein the apparatus is configured such that the node identifier has a same value for each respective node scope-specific identifier space specific to each node in the plurality of nodes.

4. The apparatus of claim 3, wherein the apparatus is configured such that a scoped identifier space exists for the plurality of nodes that includes a scoped node identifier that has the same value and that globally identifies, for the plurality of nodes, the current node.

5. The apparatus of claim 1, wherein the network interface is a loop-back interface of the current node.

17. The apparatus of claim 1, wherein the apparatus is configured such that the identifier that identifies the particular node for the current node is advertised to at least one other node so the at least one other node knows the meaning for the current node defined solely by the node-specific identifier space specific to the current node.

18. The apparatus of claim 17, wherein the apparatus is configured such that the identifier that identifies the particular node for the current node is configured for use in identifying a sequence of identifiers, and a last identifier of the sequence, that is preceded by any other one or more identifiers in the sequence, is a scope-specific identifier that is in an identifier space specific to another node and that identifies, for the another node, the particular node.

19. The apparatus of claim 1, wherein the apparatus is configured such that another identifier in a node-specific identifier space specific to another node identifies the particular node.

20. The apparatus of claim 19, wherein the apparatus is configured such that the another identifier has the same value as the identifier that identifies the particular node for the current node.

21. The apparatus of claim 19, wherein the apparatus is configured such that the another identifier has a different value as compared to the identifier that identifies the particular node for the current node.

22. The apparatus of claim 21, wherein the apparatus is configured such that the identifier that identifies the particular node for the current node is configured for use in identifying a sequence of identifiers, and a last identifier of the sequence, that is preceded by any other one or more identifiers in the sequence, is a scope-specific identifier that is in an identifier space specific to another node and that identifies, for the another node, the particular node.

23. The apparatus of claim 1, wherein the apparatus is configured such that the identifier that identifies the particular node for the current node, is included in the header of the packet when the packet is received from the previous node.

24. The apparatus of claim 1, wherein the apparatus is configured such that the mapping results in a position of the identifier that identifies the particular node for the current node being replaced by the identifier that identifies the particular node for the next node.

25. The apparatus of claim 1, wherein the apparatus is configured such that the identifier that identifies the particular node for the current node, is not included with the data when the data is transmitted to the particular node.

28. The apparatus of claim 1, wherein at least one of:

said particular node is separate from the current node;

said next node is separate from the current node;

said apparatus is part of the current node;

said apparatus constitutes at least a portion of the current node;

said apparatus includes the current node;

said apparatus is part of a system that includes the current node;

said current node includes a device of the apparatus having a network interface component;

said current node includes a portion of the apparatus including at least a network interface component;

said current node includes at least a network interface component of the apparatus;

said information is configured for use in identifying the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node, by including the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node;

said information is configured for use in identifying the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node, by being configured for use in locating the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node;

said information is configured for use in identifying the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node, by including a symbolic identifier that represents the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node;

said information is configured for use in identifying the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node, by including a symbolic identifier that represents the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node, where the symbolic identifier is the only identifier positioned in the header of the packet;

said information is configured for use in identifying the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node, by including a symbolic identifier that represents the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node, where the symbolic identifier is one of a plurality of symbolic identifiers positioned in the header of the packet;

said information is configured for use in identifying the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node, by including a symbolic identifier that represents the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node, where the symbolic identifier is one of multiple identifiers positioned in the header that include at least one non-symbolic identifier;

said information is received from at least one other node, in addition to being received from the next node;

said information is received directly from the next node;

said information is received indirectly from the next node;

said information is received indirectly from the next node via at least one intermediate node;

said identifier in the node-specific identifier space specific to the current node that identifies the next node for the current node is identified using the header, by the header including the identifier in the node-specific identifier space specific to the current node that identifies the next node for the current node;

said identifier in the node-specific identifier space specific to the current node that identifies the next node for the current node is identified using the header, by the header being used to locate the identifier in the node-specific identifier space specific to the current node that identifies the next node for the current node;

said identifier in the node-specific identifier space specific to the current node that identifies the next node for the current node is identified using the header, by using a symbolic identifier in the header that represents the identifier in the node-specific identifier space specific to the current node that identifies the next node for the current node;

said label switching network includes a Multiprotocol Label Switching (MPLS) network;

said apparatus is configured to not use a Multiprotocol Label Switching (MPLS) control plane protocol;

said apparatus is configured to use a Multiprotocol Label Switching (MPLS) data plane protocol;

said information is received via another packet that is separate from the packet;

said data is included in the packet including the header;

said data is transmitted from the current node in another packet that is a copy of the packet;

said data is transmitted from the current node in another packet that is at least partially similar to the packet;

said mapping, based on the information, the identifier that identifies the particular node for the current node, to the identifier that identifies the particular node for the next node, results in the identifier that identifies the particular node for the current node, being replaced by the identifier that identifies the particular node for the next node;

said mapping includes replacing;

said mapping, based on the information, the identifier that identifies the particular node for the current node, to the identifier that identifies the particular node for the next node, results in the identifier that identifies the particular node for the next node being sent instead of the identifier that identifies the particular node for the current node;

said mapping, based on the information, the identifier that identifies the particular node for the current node, to the identifier that identifies the particular node for the next node, results in the identifier that identifies the particular node for the next node being sent without the identifier that identifies the particular node for the current node;

said mapping involves a mapping rule;

said mapping involves identifying based on an association;

said mapping involves identifying a particular identifier based on an association thereof with another identifier;

said mapping reduces a number of lookup tables that must be maintained;

said mapping reduces a number of records that must be maintained;

said mapping reduces a number of lookup tables that must be accessed;

said mapping reduces a number of records that must be accessed;

said identifier that identifies the particular node for the current node has the meaning for the current node defined solely by the node-specific identifier space specific to the current node, by the meaning for the current node not being defined by any other node-specific identifier spaces specific to any other nodes;

knowledge of only the identifier in the node-specific identifier space specific to the current node that identifies the particular node for the current node, is insufficient to know a scope of the identifier in the node-specific identifier space specific to the current node that identifies the particular node for the current node;

knowledge of only the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node, is insufficient to know a scope of the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node;

knowledge of the current node is required to know a scope of the identifier in the node-specific identifier space specific to the current node that identifies the particular node for the current node;

knowledge of the next node is required to know a scope of the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node;

said identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node does not identify any node inside the particular node;

said identifier in the node-specific identifier space specific to the current node that identifies the particular node for the current node does not identify any node inside the particular node;

said identifier in the node-specific identifier space specific to the current node that identifies the particular node for the current node, only identifies the particular node;

said identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node, only identifies the particular node;

said identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node identifies the particular node by identifying a certain node inside the particular node;

said identifier in the node-specific identifier space specific to the current node that identifies the particular node for the current node identifies the particular node by identifying a certain node inside the particular node;

said identifier is identified by being detected;

said identifier that identifies the particular node for the current node is capable of identifying an entity included in the particular node;

said identifier that identifies the particular node for the next node is capable of identifying an entity included in the particular node;

said network interface includes a virtual network interface;

said network path includes a physical network path;

or

said network path includes a virtual network path.

6. An apparatus, comprising:

a current node configured to be positioned in a region of a label switching network, the current node including at least one non-transitory memory configured to store instructions, and one or more processors in communication with the at least one non-transitory memory, wherein the one or more processors is configured to execute the instructions to cause the current node to;

receive information that is configured for use in identifying a region scoped node identifier that is in an identifier space having a scope that spans the region of the network and that identifies a particular node in the region of the network, where the region scoped node identifier is in a region scoped identifier space for the region that further includes a plurality of nodes, and each node in the plurality of nodes has a respective identifier space configured with a node-specific identifier that identifies, for the each node, the particular node and that is identical to the region scoped node identifier;

based on the information, store lookup data that associates the region scoped node identifier with a network interface of the particular node;

receive, from a previous node, data and a packet including a header;

identify, using the header of the packet, the region scoped node identifier;

identify, based on the lookup data, the network interface of the particular node;

determine, based on the network interface of the particular node, a network interface of the current node for transmitting the data to the particular node; and

transmit, via the network interface of the current node, the data to the particular node via a network path that includes the network interface of the current node.

7. The apparatus of claim 6, wherein the apparatus is configured such that the network interface of the particular node is identified by:

performing a comparison utilizing the region scoped node identifier and the lookup data, and identifying the network interface of the particular node based on the comparison.

8. The apparatus of claim 6, wherein the respective identifier space of each of the plurality of nodes includes a node identifier that identifies the current node therefor.

9. The apparatus of claim 8, wherein the apparatus is configured such that a scoped identifier space exists for the plurality of nodes that includes a scoped node identifier that has the same value and that globally identifies, for the plurality of nodes, the current node.

10. The apparatus of claim 6, wherein the network interface of the particular node is a loop-back interface of the particular node.

11. An apparatus, comprising:

a current node configured to be positioned in a label switching network, the current node including at least one non-transitory memory configured to store instructions, and one or more processors in communication with the at least one non-transitory memory, wherein the one or more processors is configured to execute the instructions to cause the current node to;

receive information that is configured for use in identifying a scope-specific identifier in an identifier space that is specific to at least one node, wherein the at least one node does not include a particular node and the scope-specific identifier identifies the particular node for each node in the at least one node, and the scope-specific identifier has a meaning for the at least one node defined solely by the identifier space that is specific to the at least one node;

based on the information, store lookup data that associates the scope-specific identifier with a network interface of the particular node;

receive, from a previous node, data and a packet including a header;

identify, using the header of the packet, the scope-specific identifier;

identify, based on the lookup data, the network interface of the particular node;

determine, based on the network interface of the particular node, a network interface of the current node for transmitting the data to the particular node; and

transmit, via the network interface of the current node, the data to the particular node via a network path that includes the network interface of the current node.

12. The apparatus of claim 11, wherein the apparatus is configured such that the network interface of the particular node is identified by:

performing a comparison utilizing the scope-specific identifier and the look up data, and identifying the network interface of the particular node based on the comparison.

13. The apparatus of claim 11, wherein the current node is included in a plurality of nodes each of which:

has a respective node scope-specific identifier space that is specific thereto, and includes a node identifier that identifies the current node therefor.

14. The apparatus of claim 13, wherein the apparatus is configured such that a segment identifier has a same value as the node identifier in the respective node scope-specific identifier space specific to each node in the plurality of nodes.

15. The apparatus of claim 14, wherein the apparatus is configured such that a scoped identifier space exists for the plurality of nodes that includes a scoped node identifier that has the same value and that globally identifies, for the plurality of nodes, the current node.

16. The apparatus of claim 13, wherein the node identifier that identifies the current node identifies a loop-back interface of the current node.

26. The apparatus of claim 12, wherein the apparatus is configured such that the scope-specific identifier is configured for use in identifying a sequence of identifiers, and a last identifier of the sequence, that is preceded by any other one or more identifiers in the sequence, is a scope-specific identifier that is in an identifier space specific to another node in the network path and that identifies, for the another node, the particular node.

27. The apparatus of claim 26, wherein the apparatus is configured to perform the comparison based on a first identifier of the sequence that precedes the any other one or more identifiers in the sequence.

29. A method, comprising the acts of:

configuring at least a portion of a plurality of instructions that cause a current node, that is positioned in a label switching network, to;

receive, from a next node, information that is configured for use in identifying an identifier in a node-specific identifier space specific to the next node that identifies a particular node for the next node,

map, based on the information, the identifier that identifies the particular node for the next node, to an identifier in a node-specific identifier space specific to the current node that identifies the particular node for the current node, the identifier that identifies the particular node for the current node having a meaning for the current node defined solely by the node-specific identifier space specific to the current node,

store an association between the identifier that identifies the particular node for the next node, and the identifier that identifies the particular node for the current node,

receive, from a previous node, data and a packet including a header,

identify, using the header of the packet, the identifier that identifies the particular node for the current node,

identify a network path for transmitting the data to the particular node, the network path including the next node,

locate, based on the identifier that identifies the particular node for the current node, the association,

map, based on the association, the identifier that identifies the particular node for the current node, to the identifier that identifies the particular node for the next node, and

transmit, via a network interface of the current node, the data to the particular node via the next node included in the network path; and

causing storage of the at least portion of the instructions on at least one non-transitory memory.

30. The method of claim 29, wherein the current node is configured to be included in a plurality of nodes each of which:

has a respective node scope-specific identifier space that is specific thereto, and includes a node identifier that identifies the current node therefor.

31. The method of claim 30, and comprising:

further configuring the at least portion of the instructions, where the instructions cause the current node to operate such that;

the node identifier has a same value for each respective node scope-specific identifier space specific to each node in the plurality of nodes.

32. The method of claim 31, and comprising:

further configuring the at least portion of the instructions, where the instructions cause the current node to operate such that;

a scoped identifier space exists for the plurality of nodes that includes a scoped node identifier that has the same value and that globally identifies, for the plurality of nodes, the current node.

33. The method of claim 29, wherein the network interface is a loop-back interface of the current node.

34. The method of claim 29, and comprising:

further configuring the at least portion of the instructions, where the instructions cause the current node to operate such that;

the identifier that identifies the particular node for the current node is advertised to at least one other node so the at least one other node knows the meaning for the current node defined solely by the node-specific identifier space specific to the current node.

35. The method of claim 34, and comprising:

further configuring the at least portion of the instructions, where the instructions cause the current node to operate such that;

the identifier that identifies the particular node for the current node is configured for use in identifying a sequence of identifiers, and a last identifier of the sequence, that is preceded by any other one or more identifiers in the sequence, is a scope-specific identifier that is in an identifier space specific to another node and that identifies, for the another node, the particular node.

36. The method of claim 29, and comprising:

further configuring the at least portion of the instructions, where the instructions cause the current node to operate such that;

another identifier in a node-specific identifier space specific to another node identifies the particular node.

37. The method of claim 36, and comprising:

further configuring the at least portion of the instructions, where the instructions cause the current node to operate such that;

the another identifier has the same value as the identifier that identifies the particular node for the current node.

38. The method of claim 36, and comprising:

further configuring the at least portion of the instructions, where the instructions cause the current node to operate such that;

the another identifier has a different value as compared to the identifier that identifies the particular node for the current node.

39. The method of claim 38, and comprising:

further configuring the at least portion of the instructions, where the instructions cause the current node to operate such that;

the identifier that identifies the particular node for the current node is configured for use in identifying a sequence of identifiers, and a last identifier of the sequence, that is preceded by any other one or more identifiers in the sequence, is a scope-specific identifier that is in an identifier space specific to another node and that identifies, for the another node, the particular node.

40. The method of claim 29, and comprising:

further configuring the at least portion of the instructions, where the instructions cause the current node to operate such that;

the identifier that identifies the particular node for the current node, is included in the header of the packet when the packet is received from the previous node.

41. The method of claim 29, and comprising:

further configuring the at least portion of the instructions, where the instructions cause the current node to operate such that;

the mapping results in a position of the identifier that identifies the particular node for the current node being replaced by the identifier that identifies the particular node for the next node.

42. The method of claim 29, and comprising:

further configuring the at least portion of the instructions, where the instructions cause the current node to operate such that;

the identifier that identifies the particular node for the current node, is not included with the data when the data is transmitted to the particular node.

43. The method of claim 29, and comprising:

further configuring the at least portion of the instructions, where the instructions cause the current node to operate such that;

the scope-specific identifier is configured for use in identifying a sequence of identifiers, and a last identifier of the sequence, that is preceded by any other one or more identifiers in the sequence, is a scope-specific identifier that is in an identifier space specific to another node in the network path and that identifies, for the another node, the particular node.

44. The method of claim 43, and comprising:

further configuring the at least portion of the instructions, where the instructions cause the current node to perform the comparison based on a first identifier of the sequence that precedes the any other one or more identifiers in the sequence.

45. The method of claim 29, wherein at least one of:

the configuring occurs at the current node;

the configuring occurs at a certain node other than the current node;

the configuring and the further configuring occur at the current node;

the configuring and the further configuring occur at a certain node other than the current node;

the configuring occurs at the current node and the further configuring occurs at a certain node other than the current node;

the further configuring occurs at the current node and the configuring occurs at a certain node other than the current node;

only part of the instructions is subject to the configuring;

only the at least portion of the instructions is subject to the configuring;

an entirety of the instructions is subject to the configuring;

the at least portion of the instructions that is subject to the configuring, is also subject to the further configuring;

the at least portion of the instructions that is subject to the configuring, is the same as the at least portion of the instructions that is subject to the further configuring;

the at least portion of the instructions that is subject to the configuring, is different from the at least portion of the instructions that is subject to the further configuring;

a first part of the at least portion of the instructions is subject to the configuring, and a second part of the at least portion of the instructions that is subject to the further configuring;

the at least portion of the instructions that is subject to the configuring is a part thereof that causes the current node to perform the first instance of the receipt, the first instance of the mapping, the storage, the second instance of the receipt, the identification, the location, the second instance of the mapping, and the transmission;

the at least portion of the instructions that is subject to the configuring is a part thereof that causes the current node to perform at least one of the first instance of the receipt, the first instance of the mapping, the storage, the second instance of the receipt, the identification, the location, the second instance of the mapping, or the transmission;

the at least portion of the instructions that is subject to the configuring is not a part thereof that causes the current node to perform the first instance of the receipt, the first instance of the mapping, the storage, the second instance of the receipt, the identification, the location, the second instance of the mapping, or the transmission;

the at least portion of the instructions that is subject to the configuring is a part thereof that causes the current node to perform at least one operation other than the first instance of the receipt, the first instance of the mapping, the storage, the second instance of the receipt, the identification, the location, the second instance of the mapping, and the transmission;

the configuring includes customization;

the plurality of the instructions includes a subset of instructions required for the current node to operate;

the plurality of the instructions includes an entirety of instructions required for the current node to operate;

the causing storage includes causing storage of the at least portion of the instructions on the at least one non-transitory memory for being accessible to a user so that the user is capable of installing the at least portion of the instructions on other memory of the current node, for execution;

the causing storage includes causing storage of the at least portion of the instructions on the at least one non-transitory memory, that is part of the current node;

the causing storage includes causing storage of the at least portion of the instructions on the at least one non-transitory memory, that is part of the current node, so that the current node is provided to a user for use;

the causing storage includes installation of the at least portion of the instructions;

the causing storage includes causing transfer of the at least portion of the instructions from persistent storage to volatile memory;

the at least one non-transitory memory includes a register;

the at least one non-transitory memory includes volatile memory;

the at least one non-transitory memory includes persistent storage;

the method further comprises configuring the current node;

the method further comprises coupling the at least one non-transitory memory to one or more processors;

the method further comprises providing the current node;

the method further comprises providing the at least one non-transitory memory;

the method further comprises providing one or more processors;

the at least one non-transitory memory is part of the current node;

the at least one non-transitory memory is separate from current node memory of the current node;

the instructions are hardware instructions;

the instructions are software instructions;

the instructions is software code;

an entirety of the instructions are stored;

the method further comprises executing the instructions;

the instructions cause the current node to perform the first instance of the receipt, the first instance of the mapping, the storage, the second instance of the receipt, the identification, the location, the second instance of the mapping, and the transmission, in response to being executed via at least one processor of the current node;

the particular node is separate from the current node;

the next node is separate from the current node;

the current node includes a device of an apparatus having a network interface component;

the current node includes a portion of an apparatus including at least a network interface component;

the current node includes at least a network interface component of an apparatus;

the information is configured for use in identifying the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node, by including the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node;

the information is configured for use in identifying the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node, by being configured for use in locating the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node;

the information is configured for use in identifying the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node, by including a symbolic identifier that represents the identifier in the node- specific identifier space specific to the next node that identifies the particular node for the next node;

the information is configured for use in identifying the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node, by including a symbolic identifier that represents the identifier in the node- specific identifier space specific to the next node that identifies the particular node for the next node, where the symbolic identifier is the only identifier positioned in the header of the packet;

the information is configured for use in identifying the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node, by including a symbolic identifier that represents the identifier in the node- specific identifier space specific to the next node that identifies the particular node for the next node, where the symbolic identifier is one of a plurality of symbolic identifiers positioned in the header of the packet;

the information is configured for use in identifying the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node, by including a symbolic identifier that represents the identifier in the node- specific identifier space specific to the next node that identifies the particular node for the next node, where the symbolic identifier is one of multiple identifiers positioned in the header that include at least one non-symbolic identifier;

the information is received from at least one other node, in addition to being received from the next node;

the information is received directly from the next node;

the information is received indirectly from the next node;

the information is received indirectly from the next node via at least one intermediate node;

the identifier in the node-specific identifier space specific to the current node that identifies the next node for the current node is identified using the header, by the header including the identifier in the node-specific identifier space specific to the current node that identifies the next node for the current node;

the identifier in the node-specific identifier space specific to the current node that identifies the next node for the current node is identified using the header, by the header being used to locate the identifier in the node-specific identifier space specific to the current node that identifies the next node for the current node;

the identifier in the node-specific identifier space specific to the current node that identifies the next node for the current node is identified using the header, by using a symbolic identifier in the header that represents the identifier in the node-specific identifier space specific to the current node that identifies the next node for the current node;

the label switching network includes a Multiprotocol Label Switching (MPLS) network;

the current node is configured to not use a Multiprotocol Label Switching (MPLS) control plane protocol;

the current node is configured to use a Multiprotocol Label Switching (MPLS) data plane protocol;

the information is received via another packet that is separate from the packet;

the data is included in the packet including the header;

the data is transmitted from the current node in another packet that is a copy of the packet;

the data is transmitted from the current node in another packet that is at least partially similar to the packet;

the mapping, based on the information, the identifier that identifies the particular node for the current node, to the identifier that identifies the particular node for the next node, results in the identifier that identifies the particular node for the current node, being replaced by the identifier that identifies the particular node for the next node;

the mapping includes replacing;

the mapping, based on the information, the identifier that identifies the particular node for the current node, to the identifier that identifies the particular node for the next node, results in the identifier that identifies the particular node for the next node being sent instead of the identifier that identifies the particular node for the current node;

the mapping, based on the information, the identifier that identifies the particular node for the current node, to the identifier that identifies the particular node for the next node, results in the identifier that identifies the particular node for the next node being sent without the identifier that identifies the particular node for the current node;

the mapping involves a mapping rule;

the mapping involves identifying based on an association;

the mapping involves identifying a particular identifier based on an association thereof with another identifier;

the mapping reduces a number of lookup tables that must be maintained;

the mapping reduces a number of records that must be maintained;

the mapping reduces a number of lookup tables that must be accessed;

the mapping reduces a number of records that must be accessed;

the identifier that identifies the particular node for the current node has the meaning for the current node defined solely by the node-specific identifier space specific to the current node, by the meaning for the current node not being defined by any other node- specific identifier spaces specific to any other nodes;

knowledge of only the identifier in the node-specific identifier space specific to the current node that identifies the particular node for the current node, is insufficient to know a scope of the identifier in the node-specific identifier space specific to the current node that identifies the particular node for the current node;

knowledge of only the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node, is insufficient to know a scope of the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node;

knowledge of the current node is required to know a scope of the identifier in the node- specific identifier space specific to the current node that identifies the particular node for the current node;

knowledge of the next node is required to know a scope of the identifier in the node- specific identifier space specific to the next node that identifies the particular node for the next node;

the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node does not identify any node inside the particular node;

the identifier in the node-specific identifier space specific to the current node that identifies the particular node for the current node does not identify any node inside the particular node;

the identifier in the node-specific identifier space specific to the current node that identifies the particular node for the current node, only identifies the particular node;

the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node, only identifies the particular node;

the identifier in the node-specific identifier space specific to the next node that identifies the particular node for the next node identifies the particular node by identifying a certain node inside the particular node;

the identifier in the node-specific identifier space specific to the current node that identifies the particular node for the current node identifies the particular node by identifying a certain node inside the particular node;

the identifier is identified by being detected;

the identifier that identifies the particular node for the current node is capable of identifying an entity included in the particular node;

the identifier that identifies the particular node for the next node is capable of identifying an entity included in the particular node;

the network interface includes a virtual network interface;

the network path includes a physical network path;

or

the network path includes a virtual network path.

46. A method, comprising the acts of:

configuring at least a portion of a plurality of instructions that cause a current node, that is configured to be positioned in a region of a label switching network, to;

receive information that is configured for use in identifying a region scoped node identifier that is in an identifier space having a scope that spans the region of the network and that identifies a particular node in the region of the network, where the region scoped node identifier is in a region scoped identifier space for the region that further includes a plurality of nodes, and each node in the plurality of nodes has a respective identifier space configured with a node-specific identifier that identifies, for the each node, the particular node and that is identical to the region scoped node identifier,

based on the information, store lookup data that associates the region scoped node identifier with a network interface of the particular node,

receive, from a previous node, data and a packet including a header,

identify, using the header of the packet, the region scoped node identifier,

identify, based on the lookup data, the network interface of the particular node,

determine, based on the network interface of the particular node, a network interface of the current node for transmitting the data to the particular node, and

transmit, via the network interface of the current node, the data to the particular node via a network path that includes the network interface of the current node; and

causing storage of the at least portion of the instructions on at least one non-transitory memory.

47. The method of claim 46, and comprising:

further configuring the at least portion of the instructions, where the instructions cause the current node to operate such that;

the network interface of the particular node is identified by;

performing a comparison utilizing the region scoped node identifier and the lookup data, and identifying the network interface of the particular node based on the comparison.

48. The method of claim 46, wherein the respective identifier space of each of the plurality of nodes includes a node identifier that identifies the current node therefor.

49. The method of claim 48, and comprising:

further configuring the at least portion of the instructions, where the instructions cause the current node to operate such that;

a scoped identifier space exists for the plurality of nodes that includes a scoped node identifier that has the same value and that globally identifies, for the plurality of nodes, the current node.

50. The method of claim 46, wherein the network interface of the particular node is a loop-back interface of the particular node.

51. A method, comprising:

performing at least one act that is configured to cause a current node, that is configured to be positioned in a label switching network, to;

receive information that is configured for use in identifying a scope-specific identifier in an identifier space that is specific to at least one node, wherein the at least one node does not include a particular node and the scope-specific identifier identifies the particular node for each node in the at least one node, and the scope-specific identifier has a meaning for the at least one node defined solely by the identifier space that is specific to the at least one node,

based on the information, store lookup data that associates the scope-specific identifier with a network interface of the particular node,

receive, from a previous node, data and a packet including a header,

identify, using the header of the packet, the scope-specific identifier,

identify, based on the lookup data, the network interface of the particular node,

determine, based on the network interface of the particular node, a network interface of the current node for transmitting the data to the particular node, and

transmit, via the network interface of the current node, the data to the particular node via a network path that includes the network interface of the current node; and

causing storage of a result of the at least one act on at least one non-transitory memory.

52. The method of claim 51, and comprising:

performing at least one additional act that is configured to cause the current node to operate such that;

the network interface of the particular node is identified by;

performing a comparison utilizing the scope-specific identifier and the look up data, and identifying the network interface of the particular node based on the comparison.

53. The method of claim 52, and comprising:

performing at least one additional act that is configured to cause the current node to operate such that;

the scope-specific identifier is configured for use in identifying a sequence of identifiers, and a last identifier of the sequence, that is preceded by any other one or more identifiers in the sequence, is a scope-specific identifier that is in an identifier space specific to another node in the network path and that identifies, for the another node, the particular node.

54. The method of claim 53, and comprising:

performing at least one additional act that is configured to cause the current node to perform the comparison based on a single identifier of the sequence.

55. The method of claim 53, and comprising:

performing at least one additional act that is configured to cause the current node to perform the comparison based on a first identifier of the sequence that precedes the any other one or more identifiers in the sequence.

56. The method of claim 51, wherein the current node is configured to be included in a plurality of nodes each of which:

has a respective node scope-specific identifier space that is specific thereto, and includes a node identifier that identifies the current node therefor.

57. The method of claim 56, and comprising:

performing at least one additional act that is configured to cause the current node to operate such that;

a segment identifier has a same value as the node identifier in the respective node scope-specific identifier space specific to each node in the plurality of nodes.

58. The method of claim 57, and comprising:

performing at least one additional act that is configured to cause the current node to operate such that;

a scoped identifier space exists for the plurality of nodes that includes a scoped node identifier that has the same value and that globally identifies, for the plurality of nodes, the current node.

59. The method of claim 56, wherein the node identifier that identifies the current node identifies a loop-back interface of the current node.