Routing methods, systems, and computer program products

• US 10,735,306 B1
• Filed: 02/20/2020
• Issued: 08/04/2020
• 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): Kamara, Mohamed A
• Application Number:
  US16/796,933
• Time in Patent Office: 166 Days
• CPC Class Codes: H04L 12/66 Arrangements for connecting between networks having differing types of switching systems, e.g. gateways
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/033 by updating distance vector protocols
• CPC Class Codes: H04L 45/04 Interdomain routing, e.g. hierarchical routing
• CPC Class Codes: H04L 45/24 Multipath
• CPC Class Codes: H04L 45/50 using label swapping, e.g. multi-protocol label switch [MPLS]
• CPC Class Codes: H04L 45/566 Routing instructions carried by the data packet, e.g. active networks
• CPC Class Codes: H04L 45/745 Address table lookup; Address filtering

Abstract

In various embodiments, a method and apparatus are configured to receive information associated with a path from a first node to a second node; and generate a set of one or more segment identifiers at least one of which is in an address space having a span in a current region in which the first node resides, and is configured for use in identifying a next region, wherein the set of one or more segment identifiers encodes the path.

Claims

1. A method, comprising:

at a first node;

receiving information associated with a path from the first node to a second node;

generating a set of one or more segment identifiers at least one of which is;

in an address space having a span in a current region in which the first node resides, and

configured for use in identifying a next region,

wherein the set of one or more segment identifiers encodes the path; and

determining whether to use a nodal segment or an adjacency segment to encode a path between two nodes of the path.

2. A method, comprising:

at a first node;

receiving information associated with a path from the first node to a second node; and

generating a first set of one or more segment identifiers at least one of which is;

in an address space having a span in a current region in which the first node resides, and

configured for use in identifying a next region,

wherein the first set of one or more segment identifiers encodes the path;

the information identifies a second path; and

the generating comprises;

generating a second set of one or more segment identifiers, and

combining the first set of one or more segment identifiers and the second set of one or more segment identifiers.

3. The method of claim 2, wherein at least one of the first set of one or more segment identifiers or the second set of one or more segment identifiers is represented by a symbolic identifier.

4. The method of claim 2, wherein the path is encoded using a first number of segment identifiers that is fewer than a second number of segment identifiers required to encode the path deterministically.

5. The method of claim 4, wherein the path is encoded, without control signaling after data of a packet is identified for being sent.

6. The method of claim 5, wherein the packet is capable of being sent by the first node along different ones of a plurality of path segments based on a particular state of a network at a time when the packet is identified for being sent.

7. The method of claim 6, wherein a current state of the network is not maintained by the first node.

8. The method of claim 7, wherein contents of a packet header of the packet includes everything necessary for routing the data.

9. The method of claim 8, wherein the at least one of the one or more segment identifiers is globally unique in the current region by a same identifier being configured in a table in each of a plurality of nodes in the current region.

10. The method of claim 8, wherein a value of a particular one of the one or more segment identifiers is mapped to an identical value, even when the particular one of the segment identifiers identifies two different path segments.

11. The method of claim 8, wherein:

the at least one of the one or more segment identifiers is an outside-scope identifier;

the outside scope identifier includes an Internet Protocol (IP) prefix address without a network interface identifier;

the IP prefix address identifies the second node without identifying any particular network interface of the second node; and

the IP prefix address is associated with an operation identifier which identifies an operation that the second node is capable of performing in response to receiving the packet that includes the IP prefix address and the operation identifier.

12. The method of claim 8, wherein the information is predetermined by at least one topology node other than the first node.

13. The method of claim 8, wherein the at least one of the one or more segment identifiers of the first set is globally unique within the current region.

14. The method of claim 2, wherein at least ten of:

the path includes a physical path;

the path does not include a physical path;

the path includes a virtual path;

the information is associated with the path by describing the path;

the information is associated with the path by defining the path;

the information is associated with the path by being capable of being used to identify the path;

the information is received from an internal source;

the information is received from an external source;

the path is directly from the first node to the second node;

the path is not directly from the first node to the second node;

the path is from the first node to the second node and includes at least one path node therebetween;

the path is from the first node to the second node and dos not include a path node therebetween;

the generating includes at least one of creating, producing, or making;

the generating does not include bringing into existence;

the generating does not include creating, producing, nor making;

the generating includes bringing into existence;

the generating includes generating a new, previously non-existent set of one or more segment identifiers;

the one or more segment identifiers do not exist before the generating;

the one or more segment identifiers exist before the generating;

the generating the first set of one or more segment identifiers includes generating the first set of one or more segment identifiers from a previously existing set of one or more segment identifiers;

the generating includes assembling;

the generating includes assembling a subset of previously existing segment identifiers;

the generating includes selecting a subset of previously existing segment identifiers;

the generating includes causing an identification of the first set of one or more segment identifiers;

the generating includes re-formatting;

the first set of one or more segment identifiers includes a single segment identifier;

the first set of one or more segment identifiers includes a plurality of segment identifiers;

the one or more segment identifiers each includes an identifier that identifies a path segment;

the one or more segment identifiers each includes an identifier that identifies a segment of the path;

the address space includes a node-specific address space;

the address space includes a scope-specific address space;

the address space includes an entity-specific address space;

the address space includes a memory address space;

the address space includes a virtual address space;

the address space does not include a node-specific address space;

the address space does not include a scope-specific address space;

the address space does not include an entity-specific address space;

the address space does not include a memory address space;

the address space does not include a virtual address space;

the address space includes an identifier space;

the address space identifies one or more protocol points that are not endpoints;

the address space identifies one or more protocol endpoints defined according to a segment routing (SR) network protocol;

the address space identifies one or more protocol endpoints defined according to a network protocol;

the address space identifies one or more protocol endpoints defined according to a network protocol that is not a transmission control protocol (TCP) nor a hypertext transfer protocol (HTTP);

the address space identifies one or more protocol endpoints defined according to a network protocol that is at least one of a transmission control protocol (TCP), or a hypertext transfer protocol (HTTP);

the address space identifies one or more nodes that are not endpoints;

the address space is associated with a network protocol;

the address space is not associated with a network protocol;

the first node completely resides in the current region;

the first node only partially resides in the current region;

the current region in which the first node resides is current by virtue of being a region in which the first node currently resides;

the current region in which the first node resides is current by virtue of being a region in which the first node presently resides;

the current region in which the first node resides is current by virtue of being a region in which the first node resides at a time of the generating;

the address space has the span within the current region;

the address space has the span in only a subset of the current region;

the address space has the span in only the current region;

the address space has the span in an entirety of the current region;

the address space has the span in the current region, and at least one other region;

all of the first set of one or more segment identifiers is in the address space;

only the at least one of the first set of one or more segment identifiers is in the address space;

the next region is identified directly by the at least one of the first set of one or more segment identifiers;

the next region is identified indirectly by the at least one of the first set of one or more segment identifiers;

the next region is identified utilizing the at least one of the first set of one or more segment identifiers, by utilizing the at least one of the first set of one or more segment identifiers to look up at least one identifier that identifies the next region;

the next region is identified utilizing the at least one of the first set of one or more segment identifiers, by utilizing the at least one of the first set of one or more segment identifiers to identify the next region;

the next region is next by virtue of being a region that is a next destination along the path;

the next region is next by virtue of being a region that is a next packet destination along the path;

the next region is next by virtue of being a region in which a next node along the path resides;

the next region and the current region have no region therebetween;

the next region and the current region have at least one region therebetween;

the phrases first node, and second node do not invoke U.S.C. 112, sixth paragraph;

the first set of one or more segment identifiers encodes the path by describing the path using a predetermined format;

the first set of one or more segment identifiers encodes the path by describing the path using a predetermined protocol;

the first set of one or more segment identifiers encodes the path by describing the path using predetermined rules;

the first set of one or more segment identifiers encodes the path by describing the path using predetermined symbols;

the first set of one or more segment identifiers encodes the path by symbolically conveying the path;

the encoding includes at least one of formatting, describing, converting, or conveying;

separate portions of the information identify the path and the second path;

partially overlapping portions of the information identify the path and the second path;

mutually exclusive portions of the information identify the path and the second path;

at least a portion of the information identifies at least a portion of the path and the second path;

the information identifies the second path, by being capable of being used to look up a description of the second path;

the information identifies the second path, by directly describing the second path;

the second path is mutually exclusive of the path;

the second path overlaps the path, at least in part;

the second path is directly connected to the path;

the second path is not directly connected to the path;

the second path is indirectly connected to the path via at least one other path;

the first set of one or more segment identifiers is mutually exclusive of the second set of one or more segment identifiers;

the first set of one or more segment identifiers is not mutually exclusive of the second set of one or more segment identifiers;

at least one of the first set of one or more segment identifiers and at least one of the second set of one or more segment identifiers, are the same;

the combining includes at least one of;

mixing up, uniting, joining, associating, or relating;

the combining results in a single set of segment identifiers;

the combining results in a reduced number of segment identifiers;

the combining includes combining at least one of the first set of one or more segment identifiers and at least one of the second set of one or more segment identifiers, in a same data structure;

the combining includes combining at least one of the first set of one or more segment identifiers and at least one of the second set of one or more segment identifiers, in a single data structure;

the combining includes combining at least one of the first set of one or more segment identifiers and at least one of the second set of one or more segment identifiers, in a single data unit;

the combining results in the address space being combined;

the combining results in the address space being combined with another address space in which at least one of the second set of one or more segment identifiers resides;

the combining does not result in the address space being combined;

or

the combining does not result in the address space being combined with another address space in which at least one of the second set of one or more segment identifiers resides.

15. A method, comprising:

at a first node;

receiving information associated with a path from the first node to a second node; and

generating a set of one or more segment identifiers at least one of which is;

in an address space having a span in a current region in which the first node resides, and

configured for use in identifying a next region,

wherein the set of one or more segment identifiers encodes the path, and the at least one of the one or more segment identifiers is globally unique in the current region by a same identifier being configured in a table in each of a plurality of nodes in the current region.

16. The method of claim 15, wherein a packet is capable of being sent by the first node along different ones of a plurality of path segments based on a particular state of a network at a time when the packet is identified for being sent.

17. The method of claim 16, wherein the path is encoded, without control signaling after data of the packet is identified for being sent.

18. The method of claim 17, wherein a current state of the network is not maintained by the first node.

19. The method of claim 18, wherein contents of a packet header of the packet includes everything necessary for routing the data.

20. The method of claim 19, wherein the path is encoded using a first number of segment identifiers that is fewer than a second number of segment identifiers required to encode the path deterministically.

21. The method of claim 20, wherein the at least one of the one or more segment identifiers is globally unique in the current region by a same identifier being configured in a table in all nodes in the current region that operate in accordance with a particular network protocol.

22. The method of claim 20, wherein a value of a particular one of the one or more segment identifiers is mapped to an identical value, even when the particular one of the segment identifiers identifies two different path segments.

23. The method of claim 20, wherein the first node includes an ingress node for the current region.

24. The method of claim 20, wherein the information is predetermined by at least one topology node other than the first node.

25. The method of claim 20, wherein the at least one of the one or more segment identifiers of the set is globally unique within the current region.

26. The method of claim 15, wherein at least nine of:

the path includes a physical path;

the path does not include a physical path;

the path includes a virtual path;

the information is associated with the path by describing the path;

the information is associated with the path by defining the path;

the information is associated with the path by being capable of being used to identify the path;

the information is received from an internal source;

the information is received from a component of at least one node that includes the one or more processors;

the information is received from at least one node that does not include the one or more processors;

the information is received from an external source;

the path is directly from the first node to the second node;

the path is not directly from the first node to the second node;

the path is from the first node to the second node and includes at least one path node therebetween;

the path is from the first node to the second node and dos not include a path node therebetween;

the generating includes at least one of creating, producing, or making;

the generating does not include bringing into existence;

the generating does not include creating, producing, nor making;

the generating includes bringing into existence;

the generating includes generating a new, previously non-existent set of one or more segment identifiers;

the one or more segment identifiers do not exist before the generating;

the one or more segment identifiers exist before the generating;

the generating the set of one or more segment identifiers includes generating the set of one or more segment identifiers from a previously existing set of one or more segment identifiers;

the generating includes assembling;

the generating includes assembling a subset of previously existing segment identifiers;

the generating includes selecting a subset of previously existing segment identifiers;

the generating includes causing an identification of the set of one or more segment identifiers;

the generating includes re-formatting;

the set of one or more segment identifiers includes a single segment identifier;

the set of one or more segment identifiers includes a plurality of segment identifiers;

the one or more segment identifiers each includes an identifier that identifies a path segment;

the one or more segment identifiers each includes an identifier that identifies a segment of the path;

the address space includes a node-specific address space;

the address space includes a scope-specific address space;

the address space includes an entity-specific address space;

the address space includes a memory address space;

the address space includes a virtual address space;

the address space does not include a node-specific address space;

the address space does not include a scope-specific address space;

the address space does not include an entity-specific address space;

the address space does not include a memory address space;

the address space does not include a virtual address space;

the address space includes an identifier space;

the address space identifies one or more protocol points that are not endpoints;

the address space identifies one or more protocol endpoints defined according to a segment routing (SR) network protocol;

the address space identifies one or more protocol endpoints defined according to a network protocol;

the address space identifies one or more protocol endpoints defined according to a network protocol that is not a transmission control protocol (TCP) nor a hypertext transfer protocol (HTTP);

the address space identifies one or more protocol endpoints defined according to a network protocol that is at least one of a transmission control protocol (TCP), or a hypertext transfer protocol (HTTP);

the address space identifies one or more nodes that are not endpoints;

the address space is associated with a network protocol;

the address space is not associated with a network protocol;

the first node completely resides in the current region;

the first node only partially resides in the current region;

the current region in which the first node resides is current by virtue of being a region in which the first node currently resides;

the current region in which the first node resides is current by virtue of being a region in which the first node presently resides;

the current region in which the first node resides is current by virtue of being a region in which the first node resides at a time of the generating;

the address space has the span within the current region;

the address space has the span in only a subset of the current region;

the address space has the span in only the current region;

the address space has the span in an entirety of the current region;

the address space has the span in the current region, and at least one other region;

all of the set of one or more segment identifiers is in the address space;

only the at least one of the set of one or more segment identifiers is in the address space;

the next region is identified directly by the at least one of the set of one or more segment identifiers;

the next region is identified indirectly by the at least one of the set of one or more segment identifiers;

the next region is identified utilizing the at least one of the set of one or more segment identifiers, by utilizing the at least one of the set of one or more segment identifiers to look up at least one identifier that identifies the next region;

the next region is identified utilizing the at least one of the set of one or more segment identifiers, by utilizing the at least one of the set of one or more segment identifiers to identify the next region;

the next region is next by virtue of being a region that is a next destination along the path;

the next region is next by virtue of being a region that is a next packet destination along the path;

the next region is next by virtue of being a region in which a next node along the path resides;

the next region and the current region have no region therebetween;

the next region and the current region have at least one region therebetween;

the phrases first node, and second node do not invoke U.S.C. 112, sixth paragraph;

the set of one or more segment identifiers encodes the path by describing the path using a predetermined format;

the set of one or more segment identifiers encodes the path by describing the path using a predetermined protocol;

the set of one or more segment identifiers encodes the path by describing the path using predetermined rules;

the set of one or more segment identifiers encodes the path by describing the path using predetermined symbols;

the set of one or more segment identifiers encodes the path by symbolically conveying the path;

the encoding includes at least one of formatting, describing, converting, or conveying;

the table includes a forwarding table;

the at least one of the one or more segment identifiers is globally unique only in the current region;

the plurality of nodes in the current region include all of the nodes in the current region;

the plurality of nodes in the current region include a subset of the nodes in the current region;

the same identifier includes a same value;

or

the same identifier includes a same identifier value.

27. A non-transitory computer-readable media storing instructions that, when executed by one or more processors, cause the one or more processors to:

receive information associated with a path from a first node to a second node; and

generate a set of one or more segment identifiers at least one of which is;

in an address space having a span in a current region in which the first node resides, and

configured for use in identifying a next region,

wherein the set of one or more segment identifiers encodes the path;

wherein the instructions, when executed by the one or more processors, cause the one or more processors to map a value of at least one of the one or more segment identifiers to an identical value, even when the at least one segment identifier identifies two different network path segments.

28. The non-transitory computer-readable media of claim 27, wherein the at least one of the one or more segment identifiers of the set is globally unique within the current region.

29. The non-transitory computer-readable media of claim 27, wherein the first node includes an ingress node for the current region.

30. The non-transitory computer-readable media of claim 27, wherein the second node includes an egress node.

31. The non-transitory computer-readable media of claim 27, wherein the path comprises a plurality of nodes between the first node and the second node.

32. The non-transitory computer-readable media of claim 27, wherein the information is predetermined by at least one topology node.

33. The non-transitory computer-readable media of claim 27, wherein the information is predetermined by another node other than the first node.

34. The non-transitory computer-readable media of claim 27, wherein the path is encoded using a first number of segment identifiers that is fewer than a second number of segment identifiers required to encode the path deterministically.

35. The non-transitory computer-readable media of claim 27, wherein the path is encoded, without control signaling after data of a packet is identified for being sent.

36. The non-transitory computer-readable media of claim 27, wherein a packet is capable of being sent by the first node along different ones of a plurality of path segments based on a state of a network at a time when the packet is identified for being sent.

37. The non-transitory computer-readable media of claim 27, wherein a current state of a network is not maintained by the first node.

38. The non-transitory computer-readable media of claim 27, wherein contents of a packet header of a packet includes everything necessary for routing data.

39. The non-transitory computer-readable media of claim 27, wherein the at least one of the one or more segment identifiers is globally unique in the current region by a same identifier being configured in a table in each of a plurality of nodes in the current region.

40. The non-transitory computer-readable media of claim 27, wherein the instructions, when executed by the one or more processors, cause the one or more processors to operate such that a value of a particular one of the one or more segment identifiers is mapped to an identical value, even when the particular one of the segment identifiers identifies two different path segments.

41. The non-transitory computer-readable media of claim 27, wherein at least one of:

the one or more processors is part of the first node;

the one or more processors is not part of the first node;

the one or more processors is part of a controller;

the one or more processors is part of a controller that is separate from the first node and the second node;

the one or more processors is part of a controller that is part of at least one of the first node or the second node;

the one or more processors is not part of a controller;

the one or more processors is part of an ingress node;

the one or more processors is not part of an ingress node;

the path includes a physical path;

the path does not include a physical path;

the path includes a virtual path;

the information is associated with the path by describing the path;

the information is associated with the path by defining the path;

the information is associated with the path by being capable of being used to identify the path;

the information is received from an internal source;

the information is received from a component of at least one node that includes the one or more processors;

the information is received from at least one node that does not include the one or more processors;

the information is received from an external source;

the path is directly from the first node to the second node;

the path is not directly from the first node to the second node;

the path is from the first node to the second node and includes at least one path node therebetween;

the path is from the first node to the second node and dos not include a path node therebetween;

the generating includes at least one of creating, producing, or making;

the generating does not include bringing into existence;

the generating does not include creating, producing, nor making;

the generating includes bringing into existence;

the generating includes generating a new, previously non-existent set of one or more segment identifiers;

the one or more segment identifiers do not exist before the generating;

the one or more segment identifiers exist before the generating;

the generating the set of one or more segment identifiers includes generating the set of one or more segment identifiers from a previously existing set of one or more segment identifiers;

the generating includes assembling;

the generating includes assembling a subset of previously existing segment identifiers;

the generating includes selecting a subset of previously existing segment identifiers;

the generating includes causing an identification of the set of one or more segment identifiers;

the generating includes re-formatting;

the set of one or more segment identifiers includes a single segment identifier;

the set of one or more segment identifiers includes a plurality of segment identifiers;

the one or more segment identifiers each includes an identifier that identifies a path segment;

the one or more segment identifiers each includes an identifier that identifies a segment of the path;

the address space includes a node-specific address space;

the address space includes a scope-specific address space;

the address space includes an entity-specific address space;

the address space includes a memory address space;

the address space includes a virtual address space;

the address space does not include a node-specific address space;

the address space does not include a scope-specific address space;

the address space does not include an entity-specific address space;

the address space does not include a memory address space;

the address space does not include a virtual address space;

the address space includes an identifier space;

the address space identifies one or more protocol points that are not endpoints;

the address space identifies one or more protocol endpoints defined according to a segment routing (SR) network protocol;

the address space identifies one or more protocol endpoints defined according to a network protocol;

the address space identifies one or more protocol endpoints defined according to a network protocol that is not a transmission control protocol (TCP) nor a hypertext transfer protocol (HTTP);

the address space identifies one or more protocol endpoints defined according to a network protocol that is at least one of a transmission control protocol (TCP), or a hypertext transfer protocol (HTTP);

the address space identifies one or more nodes that are not endpoints;

the address space is associated with a network protocol;

the address space is not associated with a network protocol;

the first node completely resides in the current region;

the first node only partially resides in the current region;

the current region in which the first node resides is current by virtue of being a region in which the first node currently resides;

the current region in which the first node resides is current by virtue of being a region in which the first node presently resides;

the current region in which the first node resides is current by virtue of being a region in which the first node resides at a time of the generating;

the address space has the span within the current region;

the address space has the span in only a subset of the current region;

the address space has the span in only the current region;

the address space has the span in an entirety of the current region;

the address space has the span in the current region, and at least one other region;

all of the set of one or more segment identifiers is in the address space;

only the at least one of the set of one or more segment identifiers is in the address space;

the next region is identified directly by the at least one of the set of one or more segment identifiers;

the next region is identified indirectly by the at least one of the set of one or more segment identifiers;

the next region is identified utilizing the at least one of the set of one or more segment identifiers, by utilizing the at least one of the set of one or more segment identifiers to look up at least one identifier that identifies the next region;

the next region is identified utilizing the at least one of the set of one or more segment identifiers, by utilizing the at least one of the set of one or more segment identifiers to identify the next region;

the next region is next by virtue of being a region that is a next destination along the path;

the next region is next by virtue of being a region that is a next packet destination along the path;

the next region is next by virtue of being a region in which a next node along the path resides;

the next region and the current region have no region therebetween;

the next region and the current region have at least one region therebetween;

the phrases non-transitory computer-readable media, instructions, one or more processors, first node, and second node all do not invoke U.S.C. 112, sixth paragraph;

the set of one or more segment identifiers encodes the path by describing the path using a predetermined format;

the set of one or more segment identifiers encodes the path by describing the path using a predetermined protocol;

the set of one or more segment identifiers encodes the path by describing the path using predetermined rules;

the set of one or more segment identifiers encodes the path by describing the path using predetermined symbols;

the set of one or more segment identifiers encodes the path by symbolically conveying the path;

the encoding includes at least one of formatting, describing, converting, or conveying;

the mapped at least one of the one or more segment identifiers is in the address space and configured for identifying the next region;

the mapped at least one of the one or more segment identifiers is not in the address space and not configured for identifying the next region;

the plurality of nodes in the current region include the first node;

the plurality of nodes in the current region include all node in the current region;

the plurality of nodes in the current region include a subset of nodes in the current region;

the same identifier is configured by being set;

the same identifier is configured by being created;

the same identifier is configured by being selected;

the same identifier is configured by being selected from a pre-existing set;

the mapping includes at least one of;

setting, configuring, altering, correlating, or associating;

or

the identical value includes an identical identifier value.

42. A non-transitory computer-readable media storing instructions that, when executed by one or more processors, cause the one or more processors to:

receive information associated with a path from a first node to a second node; and

generate a set of one or more segment identifiers at least one of which is;

in an address space having a span in a current region in which the first node resides, and

configured for use in identifying a next region,

wherein the set of one or more segment identifiers encodes the path;

wherein the instructions, when executed by the one or more processors, cause the one or more processors to determine whether to use a nodal segment or an adjacency segment to encode a path between two nodes of the path.

43. The non-transitory computer-readable media of claim 42, wherein the at least one of the one or more segment identifiers of the set is globally unique within the current region.

44. The non-transitory computer-readable media of claim 42, wherein the at least one of the one or more segment identifiers is an outside-scope identifier.

45. The non-transitory computer-readable media of claim 44, wherein the outside scope identifier includes an Internet Protocol (IP) prefix address without a network interface identifier.

46. The non-transitory computer-readable media of claim 45, wherein the IP prefix address identifies a particular node in the path without identifying any particular network interface of the particular node.

47. The non-transitory computer-readable media of claim 46, wherein the IP prefix address is associated with an operation identifier which identifies an operation that the particular node is capable of performing in response to receiving a packet that includes the IP prefix address and the operation identifier.

48. The non-transitory computer-readable media of claim 42, wherein the information is predetermined by another node other than the first node.

49. The non-transitory computer-readable media of claim 42, wherein the path is encoded using a first number of segment identifiers that is fewer than a second number of segment identifiers required to encode the path deterministically.

50. The non-transitory computer-readable media of claim 42, wherein the path is encoded, without control signaling after data of a packet is identified for being sent.

51. The non-transitory computer-readable media of claim 42, wherein a packet is capable of being sent by the first node along different ones of a plurality of path segments based on a state of a network at a time when the packet is identified for being sent.

52. The non-transitory computer-readable media of claim 42, wherein a current state of a network is not maintained by the first node.

53. The non-transitory computer-readable media of claim 42, wherein contents of a packet header of a packet includes everything necessary for routing data.

54. The non-transitory computer-readable media of claim 42, wherein the at least one of the one or more segment identifiers is globally unique in the current region by a same identifier being configured in a table in each of a plurality of nodes in the current region.

55. The non-transitory computer-readable media of claim 42, wherein the instructions, when executed by the one or more processors, cause the one or more processors to operate such that a value of a particular one of the one or more segment identifiers is mapped to an identical value, even when the particular one of the segment identifiers identifies two different path segments.

56. The non-transitory computer-readable media of claim 42, wherein at least one of:

the one or more processors is part of the first node;

the one or more processors is not part of the first node;

the one or more processors is part of a controller;

the one or more processors is part of a controller that is separate from the first node and the second node;

the one or more processors is part of a controller that is part of at least one of the first node or the second node;

the one or more processors is not part of a controller;

the one or more processors is part of an ingress node;

the one or more processors is not part of an ingress node;

the path includes a physical path;

the path does not include a physical path;

the path includes a virtual path;

the information is associated with the path by describing the path;

the information is associated with the path by defining the path;

the information is associated with the path by being capable of being used to identify the path;

the information is received from an internal source;

the information is received from a component of at least one node that includes the one or more processors;

the information is received from at least one node that does not include the one or more processors;

the information is received from an external source;

the path is directly from the first node to the second node;

the path is not directly from the first node to the second node;

the path is from the first node to the second node and includes at least one path node therebetween;

the path is from the first node to the second node and dos not include a path node therebetween;

the generating includes at least one of creating, producing, or making;

the generating does not include bringing into existence;

the generating does not include creating, producing, nor making;

the generating includes bringing into existence;

the generating includes generating a new, previously non-existent set of one or more segment identifiers;

the one or more segment identifiers do not exist before the generating;

the one or more segment identifiers exist before the generating;

the generating the set of one or more segment identifiers includes generating the set of one or more segment identifiers from a previously existing set of one or more segment identifiers;

the generating includes assembling;

the generating includes assembling a subset of previously existing segment identifiers;

the generating includes selecting a subset of previously existing segment identifiers;

the generating includes causing an identification of the set of one or more segment identifiers;

the generating includes re-formatting;

the set of one or more segment identifiers includes a single segment identifier;

the set of one or more segment identifiers includes a plurality of segment identifiers;

the one or more segment identifiers each includes an identifier that identifies a path segment;

the one or more segment identifiers each includes an identifier that identifies a segment of the path;

the address space includes a node-specific address space;

the address space includes a scope-specific address space;

the address space includes an entity-specific address space;

the address space includes a memory address space;

the address space includes a virtual address space;

the address space does not include a node-specific address space;

the address space does not include a scope-specific address space;

the address space does not include an entity-specific address space;

the address space does not include a memory address space;

the address space does not include a virtual address space;

the address space includes an identifier space;

the address space identifies one or more protocol points that are not endpoints;

the address space identifies one or more protocol endpoints defined according to a segment routing (SR) network protocol;

the address space identifies one or more protocol endpoints defined according to a network protocol;

the address space identifies one or more protocol endpoints defined according to a network protocol that is not a transmission control protocol (TCP) nor a hypertext transfer protocol (HTTP);

the address space identifies one or more protocol endpoints defined according to a network protocol that is at least one of a transmission control protocol (TCP), or a hypertext transfer protocol (HTTP);

the address space identifies one or more nodes that are not endpoints;

the address space is associated with a network protocol;

the address space is not associated with a network protocol;

the first node completely resides in the current region;

the first node only partially resides in the current region;

the current region in which the first node resides is current by virtue of being a region in which the first node currently resides;

the current region in which the first node resides is current by virtue of being a region in which the first node presently resides;

the current region in which the first node resides is current by virtue of being a region in which the first node resides at a time of the generating;

the address space has the span within the current region;

the address space has the span in only a subset of the current region;

the address space has the span in only the current region;

the address space has the span in an entirety of the current region;

the address space has the span in the current region, and at least one other region;

all of the set of one or more segment identifiers is in the address space;

only the at least one of the set of one or more segment identifiers is in the address space;

the next region is identified directly by the at least one of the set of one or more segment identifiers;

the next region is identified indirectly by the at least one of the set of one or more segment identifiers;

the next region is identified utilizing the at least one of the set of one or more segment identifiers, by utilizing the at least one of the set of one or more segment identifiers to look up at least one identifier that identifies the next region;

the next region is identified utilizing the at least one of the set of one or more segment identifiers, by utilizing the at least one of the set of one or more segment identifiers to identify the next region;

the next region is next by virtue of being a region that is a next destination along the path;

the next region is next by virtue of being a region that is a next packet destination along the path;

the next region is next by virtue of being a region in which a next node along the path resides;

the next region and the current region have no region therebetween;

the next region and the current region have at least one region therebetween;

the phrases non-transitory computer-readable media, instructions, one or more processors, first node, and second node all do not invoke U.S.C. 112, sixth paragraph;

the set of one or more segment identifiers encodes the path by describing the path using a predetermined format;

the set of one or more segment identifiers encodes the path by describing the path using a predetermined protocol;

the set of one or more segment identifiers encodes the path by describing the path using predetermined rules;

the set of one or more segment identifiers encodes the path by describing the path using predetermined symbols;

the set of one or more segment identifiers encodes the path by symbolically conveying the path;

the encoding includes at least one of formatting, describing, converting, or conveying;

the nodal segment is determined to encode the path between two nodes of the path;

the adjacency segment is determined to encode the path between two nodes of the path;

only the nodal segment is determined to encode the path between two nodes of the path;

only the adjacency segment is determined to encode the path between two nodes of the path;

the nodal segment or the adjacency segment is determined to encode the path between two nodes of the path, by being used in the encoding;

the nodal segment or the adjacency segment is determined to encode the path between two nodes of the path, by an identifier thereof being used in the encoding;

the nodal segment or the adjacency segment is determined to encode the path between two nodes of the path, by at least one identifier thereof encoding the path;

the nodal segment includes a path segment that includes at least one node;

the nodal segment includes a path segment that includes only one node;

the adjacency segment includes a path segment that is adjacent to the first node;

the adjacency segment includes a path segment that is contiguous to the first node;

the path between the two nodes includes a portion of the path;

the path between the two nodes includes a subset of the path;

the path between the two nodes includes only a subset of the path;

the two nodes include at least one of the first node or the second node;

or

the two nodes do not include neither the first node nor the second node.

57. A non-transitory computer-readable media storing instructions that, when executed by one or more processors, cause the one or more processors to:

receive information associated with a path from a first node to a second node; and

generate a first set of one or more segment identifiers at least one of which is;

in an address space having a span in a current region in which the first node resides, and

configured for use in identifying a next region,

wherein the first set of one or more segment identifiers encodes the path;

wherein the instructions, when executed by the one or more processors, cause the one or more processors to operate such that the information identifies a second path, and generating the first set of one or more segment identifiers comprises generating a second set of one or more segment identifiers, and combining the first set of one or more segment identifiers and the second set of one or more segment identifiers.

58. The non-transitory computer-readable media of claim 57, wherein the at least one of the one or more segment identifiers of the first set is globally unique within the current region.

59. The non-transitory computer-readable media of claim 57, wherein the first node includes an ingress node for the current region.

60. The non-transitory computer-readable media of claim 57, wherein the second node includes an egress node for the current region.

61. The non-transitory computer-readable media of claim 57, wherein the path comprises a plurality of nodes between the first node and the second node.

62. The non-transitory computer-readable media of claim 57, wherein the information is predetermined by at least one topology node.

63. The non-transitory computer-readable media of claim 57, wherein the information is predetermined by another node other than the first node.

64. The non-transitory computer-readable media of claim 57, wherein the path is encoded using a first number of segment identifiers that is fewer than a second number of segment identifiers required to encode the path deterministically.

65. The non-transitory computer-readable media of claim 57, wherein the path is encoded, without control signaling after data of a packet is identified for being sent.

66. The non-transitory computer-readable media of claim 57, wherein a packet is capable of being sent by the first node along different ones of a plurality of path segments based on a state of a network at a time when the packet is identified for being sent.

67. The non-transitory computer-readable media of claim 57, wherein a current state of a network is not maintained by the first node.

68. The non-transitory computer-readable media of claim 57, wherein:

the at least one of the one or more segment identifiers is an outside-scope identifier;

the outside scope identifier includes an Internet Protocol (IP) prefix address without a network interface identifier;

the IP prefix address identifies a particular node in the path without identifying any particular network interface of the particular node; and

the IP prefix address is associated with an operation identifier which identifies an operation that the particular node is capable of performing in response to receiving a packet that includes the IP prefix address and the operation identifier.

69. The non-transitory computer-readable media of claim 57, wherein the at least one of the one or more segment identifiers is globally unique in the current region by a same identifier being configured in a table in each of a plurality of nodes in the current region.

70. The non-transitory computer-readable media of claim 57, wherein the instructions, when executed by the one or more processors, cause the one or more processors to operate such that a value of a particular one of the one or more segment identifiers is mapped to an identical value, even when the particular one of the segment identifiers identifies two different path segments.

71. The non-transitory computer-readable media of claim 57, wherein at least one of:

the one or more processors is part of the first node;

the one or more processors is not part of the first node;

the one or more processors is part of a controller;

the one or more processors is part of a controller that is separate from the first node and the second node;

the one or more processors is part of a controller that is part of at least one of the first node or the second node;

the one or more processors is not part of a controller;

the one or more processors is part of an ingress node;

the one or more processors is not part of an ingress node;

the path includes a physical path;

the path does not include a physical path;

the path includes a virtual path;

the information is associated with the path by describing the path;

the information is associated with the path by defining the path;

the information is associated with the path by being capable of being used to identify the path;

the information is received from an internal source;

the information is received from a component of at least one node that includes the one or more processors;

the information is received from at least one node that does not include the one or more processors;

the information is received from an external source;

the path is directly from the first node to the second node;

the path is not directly from the first node to the second node;

the path is from the first node to the second node and includes at least one path node therebetween;

the path is from the first node to the second node and dos not include a path node therebetween;

the generating includes at least one of creating, producing, or making;

the generating does not include bringing into existence;

the generating does not include creating, producing, nor making;

the generating includes bringing into existence;

the generating includes generating a new, previously non-existent set of one or more segment identifiers;

the one or more segment identifiers do not exist before the generating;

the one or more segment identifiers exist before the generating;

the generating the first set of one or more segment identifiers includes generating the first set of one or more segment identifiers from a previously existing set of one or more segment identifiers;

the generating includes assembling;

the generating includes assembling a subset of previously existing segment identifiers;

the generating includes selecting a subset of previously existing segment identifiers;

the generating includes causing an identification of the first set of one or more segment identifiers;

the generating includes re-formatting;

the first set of one or more segment identifiers includes a single segment identifier;

the first set of one or more segment identifiers includes a plurality of segment identifiers;

the one or more segment identifiers each includes an identifier that identifies a path segment;

the one or more segment identifiers each includes an identifier that identifies a segment of the path;

the address space includes a node-specific address space;

the address space includes a scope-specific address space;

the address space includes an entity-specific address space;

the address space includes a memory address space;

the address space includes a virtual address space;

the address space does not include a node-specific address space;

the address space does not include a scope-specific address space;

the address space does not include an entity-specific address space;

the address space does not include a memory address space;

the address space does not include a virtual address space;

the address space includes an identifier space;

the address space identifies one or more protocol points that are not endpoints;

the address space identifies one or more protocol endpoints defined according to a segment routing (SR) network protocol;

the address space identifies one or more protocol endpoints defined according to a network protocol;

the address space identifies one or more protocol endpoints defined according to a network protocol that is not a transmission control protocol (TCP) nor a hypertext transfer protocol (HTTP);

the address space identifies one or more protocol endpoints defined according to a network protocol that is at least one of a transmission control protocol (TCP), or a hypertext transfer protocol (HTTP);

the address space identifies one or more nodes that are not endpoints;

the address space is associated with a network protocol;

the address space is not associated with a network protocol;

the first node completely resides in the current region;

the first node only partially resides in the current region;

the current region in which the first node resides is current by virtue of being a region in which the first node currently resides;

the current region in which the first node resides is current by virtue of being a region in which the first node presently resides;

the current region in which the first node resides is current by virtue of being a region in which the first node resides at a time of the generating;

the address space has the span within the current region;

the address space has the span in only a subset of the current region;

the address space has the span in only the current region;

the address space has the span in an entirety of the current region;

the address space has the span in the current region, and at least one other region;

all of the first set of one or more segment identifiers is in the address space;

only the at least one of the first set of one or more segment identifiers is in the address space;

the next region is identified directly by the at least one of the first set of one or more segment identifiers;

the next region is identified indirectly by the at least one of the first set of one or more segment identifiers;

the next region is identified utilizing the at least one of the first set of one or more segment identifiers, by utilizing the at least one of the first set of one or more segment identifiers to look up at least one identifier that identifies the next region;

the next region is identified utilizing the at least one of the first set of one or more segment identifiers, by utilizing the at least one of the first set of one or more segment identifiers to identify the next region;

the next region is next by virtue of being a region that is a next destination along the path;

the next region is next by virtue of being a region that is a next packet destination along the path;

the next region is next by virtue of being a region in which a next node along the path resides;

the next region and the current region have no region therebetween;

the next region and the current region have at least one region therebetween;

the phrases non-transitory computer-readable media, instructions, one or more processors, first node, and second node all do not invoke U.S.C. 112, sixth paragraph;

the first set of one or more segment identifiers encodes the path by describing the path using a predetermined format;

the first set of one or more segment identifiers encodes the path by describing the path using a predetermined protocol;

the first set of one or more segment identifiers encodes the path by describing the path using predetermined rules;

the first set of one or more segment identifiers encodes the path by describing the path using predetermined symbols;

the first set of one or more segment identifiers encodes the path by symbolically conveying the path;

the encoding includes at least one of formatting, describing, converting, or conveying;

separate portions of the information identify the path and the second path;

partially overlapping portions of the information identify the path and the second path;

mutually exclusive portions of the information identify the path and the second path;

at least a portion of the information identifies at least a portion of the path and the second path;

the information identifies the second path, by being capable of being used to look up a description of the second path;

the information identifies the second path, by directly describing the second path;

the second path is mutually exclusive of the path;

the second path overlaps the path, at least in part;

the second path is directly connected to the path;

the second path is not directly connected to the path;

the second path is indirectly connected to the path via at least one other path;

the first set of one or more segment identifiers is mutually exclusive of the second set of one or more segment identifiers;

the first set of one or more segment identifiers is not mutually exclusive of the second set of one or more segment identifiers;

at least one of the first set of one or more segment identifiers and at least one of the second set of one or more segment identifiers, are the same;

the combining includes at least one of;

mixing up, uniting, joining, associating, or relating;

the combining results in a single set of segment identifiers;

the combining results in a reduced number of segment identifiers;

the combining includes combining at least one of the first set of one or more segment identifiers and at least one of the second set of one or more segment identifiers, in a same data structure;

the combining includes combining at least one of the first set of one or more segment identifiers and at least one of the second set of one or more segment identifiers, in a single data structure;

the combining includes combining at least one of the first set of one or more segment identifiers and at least one of the second set of one or more segment identifiers, in a single data unit;

the combining results in the address space being combined;

the combining results in the address space being combined with another address space in which at least one of the second set of one or more segment identifiers resides;

the combining does not result in the address space being combined;

or

the combining does not result in the address space being combined with another address space in which at least one of the second set of one or more segment identifiers resides.

72. A non-transitory computer-readable media storing instructions that, when executed by one or more processors, cause the one or more processors to:

receive information associated with a path from a first node to a second node; and

generate a set of one or more segment identifiers at least one of which is;

in an address space having a span in a current region in which the first node resides, and

configured for use in identifying a next region,

wherein the set of one or more segment identifiers encodes the path;

wherein the instructions, when executed by the one or more processors, cause the one or more processors to operate such that the set of one or more segment identifiers encodes the path by the set of one or more segment identifiers being capable of being re-formatted for use in identifying the path.

73. The non-transitory computer-readable media of claim 72, wherein the instructions, when executed by the one or more processors, cause the one or more processors to operate such that the information identifies a second path, and generating the set of one or more segment identifiers comprises generating a second set of one or more segment identifiers, and combining the set of one or more segment identifiers and the second set of one or more segment identifiers.

74. The non-transitory computer-readable media of claim 72, wherein the at least one of the one or more segment identifiers of the set is globally unique within the current region.

75. The non-transitory computer-readable media of claim 72, wherein the at least one of the one or more segment identifiers is an outside-scope identifier.

76. The non-transitory computer-readable media of claim 75, wherein the outside scope identifier includes an Internet Protocol (IP) prefix address without a network interface identifier.

77. The non-transitory computer-readable media of claim 76, wherein the IP prefix address identifies a particular node in the path without identifying any particular network interface of the particular node.

78. The non-transitory computer-readable media of claim 77, wherein the IP prefix address is associated with an operation identifier which identifies an operation that the particular node is capable of performing in response to receiving a packet that includes the IP prefix address and the operation identifier.

79. The non-transitory computer-readable media of claim 72, wherein the information is predetermined by another node other than the first node.

80. The non-transitory computer-readable media of claim 72, wherein the path is encoded using a first number of segment identifiers that is fewer than a second number of segment identifiers required to encode the path deterministically.

81. The non-transitory computer-readable media of claim 72, wherein the path is encoded, without control signaling after data of a packet is identified for being sent.

82. The non-transitory computer-readable media of claim 72, wherein a packet is capable of being sent by the first node along different ones of a plurality of path segments based on a state of a network at a time when the packet is identified for being sent.

83. The non-transitory computer-readable media of claim 72, wherein a current state of a network is not maintained by the first node.

84. The non-transitory computer-readable media of claim 72, wherein contents of a packet header of a packet includes everything necessary for routing data.

85. The non-transitory computer-readable media of claim 72, wherein the at least one of the one or more segment identifiers is globally unique in the current region by a same identifier being configured in a table in each of a plurality of nodes in the current region.

86. The non-transitory computer-readable media of claim 72, wherein the instructions, when executed by the one or more processors, cause the one or more processors to operate such that a value of a particular one of the one or more segment identifiers is mapped to an identical value, even when the particular one of the segment identifiers identifies two different path segments.

87. The non-transitory computer-readable media of claim 72, wherein at least one of:

the one or more processors is part of the first node;

the one or more processors is not part of the first node;

the one or more processors is part of a controller;

the one or more processors is part of a controller that is separate from the first node and the second node;

the one or more processors is part of a controller that is part of at least one of the first node or the second node;

the one or more processors is not part of a controller;

the one or more processors is part of an ingress node;

the one or more processors is not part of an ingress node;

the path includes a physical path;

the path does not include a physical path;

the path includes a virtual path;

the information is associated with the path by describing the path;

the information is associated with the path by defining the path;

the information is associated with the path by being capable of being used to identify the path;

the information is received from an internal source;

the information is received from a component of at least one node that includes the one or more processors;

the information is received from at least one node that does not include the one or more processors;

the information is received from an external source;

the path is directly from the first node to the second node;

the path is not directly from the first node to the second node;

the path is from the first node to the second node and includes at least one path node therebetween;

the path is from the first node to the second node and dos not include a path node therebetween;

the generating includes at least one of creating, producing, or making;

the generating does not include bringing into existence;

the generating does not include creating, producing, nor making;

the generating includes bringing into existence;

the generating includes generating a new, previously non-existent set of one or more segment identifiers;

the one or more segment identifiers do not exist before the generating;

the one or more segment identifiers exist before the generating;

the generating the set of one or more segment identifiers includes generating the set of one or more segment identifiers from a previously existing set of one or more segment identifiers;

the generating includes assembling;

the generating includes assembling a subset of previously existing segment identifiers;

the generating includes selecting a subset of previously existing segment identifiers;

the generating includes causing an identification of the set of one or more segment identifiers;

the generating includes re-formatting;

the set of one or more segment identifiers includes a single segment identifier;

the set of one or more segment identifiers includes a plurality of segment identifiers;

the one or more segment identifiers each includes an identifier that identifies a path segment;

the one or more segment identifiers each includes an identifier that identifies a segment of the path;

the address space includes a node-specific address space;

the address space includes a scope-specific address space;

the address space includes an entity-specific address space;

the address space includes a memory address space;

the address space includes a virtual address space;

the address space does not include a node-specific address space;

the address space does not include a scope-specific address space;

the address space does not include an entity-specific address space;

the address space does not include a memory address space;

the address space does not include a virtual address space;

the address space includes an identifier space;

the address space identifies one or more protocol points that are not endpoints;

the address space identifies one or more protocol endpoints defined according to a segment routing (SR) network protocol;

the address space identifies one or more protocol endpoints defined according to a network protocol;

the address space identifies one or more protocol endpoints defined according to a network protocol that is not a transmission control protocol (TCP) nor a hypertext transfer protocol (HTTP);

the address space identifies one or more protocol endpoints defined according to a network protocol that is at least one of a transmission control protocol (TCP), or a hypertext transfer protocol (HTTP);

the address space identifies one or more nodes that are not endpoints;

the address space is associated with a network protocol;

the address space is not associated with a network protocol;

the first node completely resides in the current region;

the first node only partially resides in the current region;

the current region in which the first node resides is current by virtue of being a region in which the first node currently resides;

the current region in which the first node resides is current by virtue of being a region in which the first node presently resides;

the current region in which the first node resides is current by virtue of being a region in which the first node resides at a time of the generating;

the address space has the span within the current region;

the address space has the span in only a subset of the current region;

the address space has the span in only the current region;

the address space has the span in an entirety of the current region;

the address space has the span in the current region, and at least one other region;

all of the set of one or more segment identifiers is in the address space;

only the at least one of the set of one or more segment identifiers is in the address space;

the next region is identified directly by the at least one of the set of one or more segment identifiers;

the next region is identified indirectly by the at least one of the set of one or more segment identifiers;

the next region is identified utilizing the at least one of the set of one or more segment identifiers, by utilizing the at least one of the set of one or more segment identifiers to look up at least one identifier that identifies the next region;

the next region is identified utilizing the at least one of the set of one or more segment identifiers, by utilizing the at least one of the set of one or more segment identifiers to identify the next region;

the next region is next by virtue of being a region that is a next destination along the path;

the next region is next by virtue of being a region that is a next packet destination along the path;

the next region is next by virtue of being a region in which a next node along the path resides;

the next region and the current region have no region therebetween;

the next region and the current region have at least one region therebetween;

the phrases non-transitory computer-readable media, instructions, one or more processors, first node, and second node all do not invoke U.S.C. 112, sixth paragraph;

the set of one or more segment identifiers encodes the path by describing the path using a predetermined format;

the set of one or more segment identifiers encodes the path by describing the path using a predetermined protocol;

the set of one or more segment identifiers encodes the path by describing the path using predetermined rules;

the set of one or more segment identifiers encodes the path by describing the path using predetermined symbols;

the set of one or more segment identifiers encodes the path by symbolically conveying the path;

the set of one or more segment identifiers are capable of being re-formatted by converting a first format of the set of one or more segment identifiers to a second format;

the set of one or more segment identifiers are capable of being re-formatted by altering a format of the set of one or more segment identifiers;

the set of one or more segment identifiers are capable of being re-formatted so that the set of one or more segment identifiers are capable of being used by the one or more processors to identify the path;

the set of one or more segment identifiers are capable of being re-formatted so that the set of one or more segment identifiers are capable of being used by at least one of the instructions to identify the path;

the set of one or more segment identifiers are capable of being re-formatted so that the set of one or more segment identifiers are capable of being used by another node to identify the path;

or

the set of one or more segment identifiers are capable of being re-formatted for use in identifying the path, such that the path is identified by decoding the set of one or more segment identifiers.

88. A non-transitory computer-readable media storing instructions that, when executed by one or more processors, cause the one or more processors to:

receive information associated with a path from a first node to a second node; and

generate a set of one or more segment identifiers at least one of which is;

in an address space having a span in a current region in which the first node resides, and

configured for use in identifying a next region,

wherein the set of one or more segment identifiers encodes the path;

wherein the instructions, when executed by the one or more processors, cause the one or more processors to operate such that the set of one or more segment identifiers encodes the path by the set of one or more segment identifiers being capable of being decoded for use in identifying the path.

89. The non-transitory computer-readable media of claim 88, wherein the instructions, when executed by the one or more processors, cause the one or more processors to operate such that the information identifies a second path, and generating the set of one or more segment identifiers comprises generating a second set of one or more segment identifiers, and combining the set of one or more segment identifiers and the second set of one or more segment identifiers.

90. The non-transitory computer-readable media of claim 88, wherein the at least one of the one or more segment identifiers of the set is globally unique within the current region.

91. The non-transitory computer-readable media of claim 88, wherein the first node includes an ingress node for the current region.

92. The non-transitory computer-readable media of claim 88, wherein the second node includes an egress node.

93. The non-transitory computer-readable media of claim 88, wherein the path comprises a plurality of nodes between the first node and the second node.

94. The non-transitory computer-readable media of claim 88, wherein the information is predetermined by at least one topology node.

95. The non-transitory computer-readable media of claim 88, wherein the information is predetermined by another node other than the first node.

96. The non-transitory computer-readable media of claim 88, wherein the path is encoded using a first number of segment identifiers that is fewer than a second number of segment identifiers required to encode the path deterministically.

97. The non-transitory computer-readable media of claim 88, wherein the path is encoded, without control signaling after data of a packet is identified for being sent.

98. The non-transitory computer-readable media of claim 88, wherein a packet is capable of being sent by the first node along different ones of a plurality of path segments based on a state of a network at a time when the packet is identified for being sent.

99. The non-transitory computer-readable media of claim 88, wherein a current state of a network is not maintained by the first node.

100. The non-transitory computer-readable media of claim 88, wherein:

the at least one of the one or more segment identifiers is an outside-scope identifier;

the outside scope identifier includes an Internet Protocol (IP) prefix address without a network interface identifier;

the IP prefix address identifies a particular node in the path without identifying any particular network interface of the particular node; and

the IP prefix address is associated with an operation identifier which identifies an operation that the particular node is capable of performing in response to receiving a packet that includes the IP prefix address and the operation identifier.

101. The non-transitory computer-readable media of claim 88, wherein the at least one of the one or more segment identifiers is globally unique in the current region by a same identifier being configured in a table in each of a plurality of nodes in the current region.

102. The non-transitory computer-readable media of claim 88, wherein the instructions, when executed by the one or more processors, cause the one or more processors to operate such that a value of a particular one of the one or more segment identifiers is mapped to an identical value, even when the particular one of the segment identifiers identifies two different path segments.

103. The non-transitory computer-readable media of claim 88, wherein at least one of:

the one or more processors is part of the first node;

the one or more processors is not part of the first node;

the one or more processors is part of a controller;

the one or more processors is part of a controller that is separate from the first node and the second node;

the one or more processors is part of a controller that is part of at least one of the first node or the second node;

the one or more processors is not part of a controller;

the one or more processors is part of an ingress node;

the one or more processors is not part of an ingress node;

the path includes a physical path;

the path does not include a physical path;

the path includes a virtual path;

the information is associated with the path by describing the path;

the information is associated with the path by defining the path;

the information is associated with the path by being capable of being used to identify the path;

the information is received from an internal source;

the information is received from a component of at least one node that includes the one or more processors;

the information is received from at least one node that does not include the one or more processors;

the information is received from an external source;

the path is directly from the first node to the second node;

the path is not directly from the first node to the second node;

the path is from the first node to the second node and includes at least one path node therebetween;

the path is from the first node to the second node and dos not include a path node therebetween;

the generating includes at least one of creating, producing, or making;

the generating does not include bringing into existence;

the generating does not include creating, producing, nor making;

the generating includes bringing into existence;

the generating includes generating a new, previously non-existent set of one or more segment identifiers;

the one or more segment identifiers do not exist before the generating;

the one or more segment identifiers exist before the generating;

the generating the set of one or more segment identifiers includes generating the set of one or more segment identifiers from a previously existing set of one or more segment identifiers;

the generating includes assembling;

the generating includes assembling a subset of previously existing segment identifiers;

the generating includes selecting a subset of previously existing segment identifiers;

the generating includes causing an identification of the set of one or more segment identifiers;

the generating includes re-formatting;

the set of one or more segment identifiers includes a single segment identifier;

the set of one or more segment identifiers includes a plurality of segment identifiers;

the one or more segment identifiers each includes an identifier that identifies a path segment;

the one or more segment identifiers each includes an identifier that identifies a segment of the path;

the address space includes a node-specific address space;

the address space includes a scope-specific address space;

the address space includes an entity-specific address space;

the address space includes a memory address space;

the address space includes a virtual address space;

the address space does not include a node-specific address space;

the address space does not include a scope-specific address space;

the address space does not include an entity-specific address space;

the address space does not include a memory address space;

the address space does not include a virtual address space;

the address space includes an identifier space;

the address space identifies one or more protocol points that are not endpoints;

the address space identifies one or more protocol endpoints defined according to a segment routing (SR) network protocol;

the address space identifies one or more protocol endpoints defined according to a network protocol;

the address space identifies one or more protocol endpoints defined according to a network protocol that is not a transmission control protocol (TCP) nor a hypertext transfer protocol (HTTP);

the address space identifies one or more protocol endpoints defined according to a network protocol that is at least one of a transmission control protocol (TCP), or a hypertext transfer protocol (HTTP);

the address space identifies one or more nodes that are not endpoints;

the address space is associated with a network protocol;

the address space is not associated with a network protocol;

the first node completely resides in the current region;

the first node only partially resides in the current region;

the current region in which the first node resides is current by virtue of being a region in which the first node currently resides;

the current region in which the first node resides is current by virtue of being a region in which the first node presently resides;

the current region in which the first node resides is current by virtue of being a region in which the first node resides at a time of the generating;

the address space has the span within the current region;

the address space has the span in only a subset of the current region;

the address space has the span in only the current region;

the address space has the span in an entirety of the current region;

the address space has the span in the current region, and at least one other region;

all of the set of one or more segment identifiers is in the address space;

only the at least one of the set of one or more segment identifiers is in the address space;

the next region is identified directly by the at least one of the set of one or more segment identifiers;

the next region is identified indirectly by the at least one of the set of one or more segment identifiers;

the next region is identified utilizing the at least one of the set of one or more segment identifiers, by utilizing the at least one of the set of one or more segment identifiers to look up at least one identifier that identifies the next region;

the next region is identified utilizing the at least one of the set of one or more segment identifiers, by utilizing the at least one of the set of one or more segment identifiers to identify the next region;

the next region is next by virtue of being a region that is a next destination along the path;

the next region is next by virtue of being a region that is a next packet destination along the path;

the next region is next by virtue of being a region in which a next node along the path resides;

the next region and the current region have no region therebetween;

the next region and the current region have at least one region therebetween;

the phrases non-transitory computer-readable media, instructions, one or more processors, first node, and second node all do not invoke U.S.C. 112, sixth paragraph;

the set of one or more segment identifiers encodes the path by describing the path using a predetermined format;

the set of one or more segment identifiers encodes the path by describing the path using a predetermined protocol;

the set of one or more segment identifiers encodes the path by describing the path using predetermined rules;

the set of one or more segment identifiers encodes the path by describing the path using predetermined symbols;

the set of one or more segment identifiers encodes the path by symbolically conveying the path;

the encoding includes at least one of formatting, describing, converting, or conveying;

the set of one or more segment identifiers are capable of being decoded by converting a first format of the set of one or more segment identifiers to a second format;

the set of one or more segment identifiers are capable of being decoded by altering a format of the set of one or more segment identifiers;

the set of one or more segment identifiers are capable of being decoded so that the set of one or more segment identifiers are capable of being used by the one or more processors to identify the path;

the set of one or more segment identifiers are capable of being decoded so that the set of one or more segment identifiers are capable of being used by at least one of the instructions to identify the path;

the set of one or more segment identifiers are capable of being decoded so that the set of one or more segment identifiers are capable of being used by another node to identify the path;

or

the set of one or more segment identifiers are capable of being decoded for use in identifying the path, such that the path is identified by decoding the set of one or more segment identifiers.

104. A method, comprising:

at a first node;

receiving information associated with a path from the first node to a second node; and

generating a set of one or more segment identifiers at least one of which is;

in a space having a span in a first region in which the first node resides, and

configured for use in identifying a second region,

wherein the set of one or more segment identifiers encodes the path;

wherein the set of one or more segment identifiers encodes the path such that the set of one or more segment identifiers is re-formatted.

105. The method of claim 104, wherein:

the information is predetermined by at least one topology node other than the first node;

the path is encoded using a first number of segment identifiers that is fewer than a second number of segment identifiers required to encode the path deterministically;

the path is encoded, without control signaling after data of a packet is identified for being sent;

the packet is capable of being sent by the first node along different ones of a plurality of path segments based on a state of a network at a time when the packet is identified for being sent; and

contents of a packet header of the packet includes everything necessary for routing the data.

106. The method of claim 104, wherein:

the at least one of the one or more segment identifiers is an outside-scope identifier;

the outside scope identifier includes an Internet Protocol (IP) prefix address without a network interface identifier;

the IP prefix address identifies a particular node in the path without identifying any particular network interface of the particular node; and

the IP prefix address is associated with an operation identifier which identifies an operation that the particular node is capable of performing in response to receiving a packet that includes the IP prefix address and the operation identifier.

107. The method of claim 104, wherein:

the information is predetermined by at least one node other than the first node;

the path is encoded using a first number of segment identifiers that is fewer than a second number of segment identifiers required to encode the path deterministically;

a packet is capable of being sent by the first node along different ones of a plurality of path segments based on a particular state of a network at a time when data of the packet is identified for being sent;

a current state of the network is not maintained by the first node; and

contents of a packet header of the packet includes everything necessary for routing the data.

108. The method of claim 104, wherein:

the information is predetermined by at least one node other than the first node;

the path is encoded using a first number of segment identifiers that is fewer than a second number of segment identifiers required to encode the path deterministically; and

a packet is capable of being sent by the first node along different ones of a plurality of path segments based on a state of a network at a time when the packet is identified for being sent.

109. The method of claim 104, wherein the path is encoded using a first number of segment identifiers that is fewer than a second number of segment identifiers required to encode the path deterministically.

110. The method of claim 104, wherein the path is encoded, without control signaling after data of a packet is identified for being sent.

111. The method of claim 104, wherein a packet is capable of being sent by the first node along different ones of a plurality of path segments based on a state of a network at a time when the packet is identified for being sent.

112. The method of claim 104, wherein a current state of a network is not maintained by the first node.

113. The method of claim 104, wherein contents of a packet header of a packet includes everything necessary for routing data.

114. A method, comprising:

at a first node;

receiving information associated with a path from the first node to a second node; and

generating a set of one or more segment identifiers at least one of which is;

in a space having a span in a first region in which the first node resides, and

configured for use in identifying a second region,

wherein the set of one or more segment identifiers encodes the path;

wherein the set of one or more segment identifiers encodes the path such that the set of one or more segment identifiers is configured for being decoded for identifying the path.

115. The method of claim 114, wherein:

the information is predetermined by at least one topology node other than the first node;

the path is encoded using a first number of segment identifiers that is fewer than a second number of segment identifiers required to encode the path deterministically;

the path is encoded, without control signaling after data of a packet is identified for being sent;

the packet is capable of being sent by the first node along different ones of a plurality of path segments based on a state of a network at a time when the data of the packet is identified for being sent; and

contents of a packet header of the packet includes everything necessary for routing the data.

116. The method of claim 114, wherein:

the information is predetermined by at least one node other than the first node;

the path is encoded using a first number of segment identifiers that is fewer than a second number of segment identifiers required to encode the path deterministically;

the path is encoded, without control signaling after data of a packet is identified for being sent;

the packet is capable of being sent by the first node along different ones of a plurality of path segments based on a particular state of a network at a time when the data of the packet is identified for being sent; and

a current state of the network is not maintained by the first node.

117. The method of claim 114, wherein:

the information is predetermined by at least one topology node other than the first node;

the path is encoded using a first number of segment identifiers that is fewer than a second number of segment identifiers required to encode the path deterministically;

a packet is capable of being sent by the first node along different ones of a plurality of path segments based on a particular state of a network at a time when the packet is identified for being sent;

a current state of the network is not maintained by the first node; and

contents of a packet header of the packet includes everything necessary for data routing.

118. The method of claim 114, wherein:

the at least one of the one or more segment identifiers is an outside-scope identifier;

the outside scope identifier includes an Internet Protocol (IP) prefix address without a network interface identifier;

the IP prefix address identifies a particular node in the path without identifying any particular network interface of the particular node; and

the IP prefix address is associated with an operation identifier which identifies an operation that the particular node is capable of performing in response to receiving a packet that includes the IP prefix address and the operation identifier.

119. The method of claim 114, wherein the path is encoded using a first number of segment identifiers that is fewer than a second number of segment identifiers required to encode the path deterministically.

120. The method of claim 114, wherein the path is encoded, without control signaling after data of a packet is identified for being sent.

121. The method of claim 114, wherein a packet is capable of being sent by the first node along different ones of a plurality of path segments based on a state of a network at a time when the packet is identified for being sent.

122. The method of claim 114, wherein a current state of a network is not maintained by the first node.

123. The method of claim 114, wherein contents of a packet header of a packet includes everything necessary for routing data.

124. A method, comprising:

performing at least one act that is configured to cause a first node to;

receive information associated with a path from the first node to a second node; and

generate a set of one or more segment identifiers at least one of which is;

in a space having a span in a first region in which the first node resides, and

configured for use in identifying a second region,

wherein the set of one or more segment identifiers encodes the path, and the set of one or more segment identifiers encodes the path such that the set of one or more segment identifiers is re-formatted; and

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

125. The method of claim 124, and comprising:

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

the information is predetermined by at least one topology node other than the first node;

the path is encoded using a first number of segment identifiers that is fewer than a second number of segment identifiers required to encode the path deterministically;

the path is encoded, without control signaling after data of a packet is identified for being sent;

the packet is capable of being sent by the first node along different ones of a plurality of path segments based on a state of a network at a time when the packet is identified for being sent; and

contents of a packet header of the packet includes everything necessary for routing the data.

126. The method of claim 124, and comprising:

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

the information is predetermined by at least one topology node other than the first node;

the path is encoded using a first number of segment identifiers that is fewer than a second number of segment identifiers required to encode the path deterministically;

the path is encoded, without control signaling after data of a packet is identified for being sent;

the packet is capable of being sent by the first node along different ones of a plurality of path segments based on a particular state of a network at a time when the packet is identified for being sent; and

a current state of the network is not maintained by the first node.

127. The method of claim 124, and comprising:

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

the information is predetermined by at least one topology node other than the first node;

the path is encoded using a first number of segment identifiers that is fewer than a second number of segment identifiers required to encode the path deterministically;

a packet is capable of being sent by the first node along different ones of a plurality of path segments based on a particular state of a network at a time when the packet is identified for being sent;

a current state of the network is not maintained by the first node; and

contents of a packet header of the packet includes everything necessary for data forwarding.

128. The method of claim 124, wherein the at least one of the one or more segment identifiers is an outside-scope identifier.

129. The method of claim 128, wherein the outside scope identifier includes an Internet Protocol (IP) prefix address without a network interface identifier.

130. The method of claim 129, wherein the IP prefix address identifies a particular node in the path without identifying any particular network interface of the particular node.

131. The method of claim 130, wherein the IP prefix address is associated with an operation identifier which identifies an operation that the particular node is capable of performing in response to receiving a packet that includes the IP prefix address and the operation identifier.

132. The method of claim 124, and comprising:

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

the information is predetermined by at least one topology node other than the first node;

the path is encoded using a first number of segment identifiers that is fewer than a second number of segment identifiers required to encode the path deterministically; and

a packet is capable of being sent by the first node along different ones of a plurality of path segments based on a state of a network at a time when the packet is identified for being sent.

133. The method of claim 124, and comprising:

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

the generating the set of one or more segment identifiers includes generating the set of one or more segment identifiers from a previously existing set of one or more segment identifiers that is identified utilizing the information.

134. The method of claim 133, wherein at least one of:

the at least one act is performed at the first node;

the at least one act is performed at a certain node other than the first node;

the at least one act and the at least one additional act are performed at the first node;

the at least one act and the at least one additional act are performed at a certain node other than the first node;

the at least one act and the at least one additional act are performed at a certain node other than the first node;

the at least one act and the at least one additional act are performed at a certain node other than the first node;

at least one of the at least one act or the at least one additional act includes a configuration;

at least one of the at least one act or the at least one additional act includes a configuration of instructions;

the at least one act causes the first node to perform the receipt and the generation;

the at least one act causes the first node to perform at least one of the receipt or the generation;

the at least one act causes at least one operation to be performed other than the receipt and the generation;

the causing storage includes causing storage of at least portion of 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 first node, for execution;

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

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

the causing storage includes installation;

the causing storage includes causing transfer of at least portion of 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 phrases at least one act and first node do not invoke 35 U.S.C. 112, sixth paragraph;

the method further comprises configuring the first node;

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

the method further comprises providing the first 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 first node;

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

the path includes a physical path;

the path does not include a physical path;

the path includes a virtual path;

the information is associated with the path by describing the path;

the information is associated with the path by defining the path;

the information is associated with the path by being capable of being used to identify the path;

the information is received from an internal source;

the information is received from a component of at least one node that includes the one or more processors;

the information is received from at least one node that does not include the one or more processors;

the information is received from an external source;

the path is directly from the first node to the second node;

the path is not directly from the first node to the second node;

the path is from the first node to the second node and includes at least one path node therebetween;

the path is from the first node to the second node and dos not include a path node therebetween;

the generating includes at least one of creating, producing, or making;

the generating does not include bringing into existence;

the generating does not include creating, producing, nor making;

the generating includes bringing into existence;

the generating includes generating a new, previously non-existent set of one or more segment identifiers;

the one or more segment identifiers do not exist before the generating;

the one or more segment identifiers exist before the generating;

the generating the set of one or more segment identifiers includes generating the set of one or more segment identifiers from a previously existing set of one or more segment identifiers;

the generating includes assembling;

the generating includes assembling a subset of previously existing segment identifiers;

the generating includes selecting a subset of previously existing segment identifiers;

the generating includes causing an identification of the set of one or more segment identifiers;

the generating includes re-formatting;

the set of one or more segment identifiers includes a single segment identifier;

the set of one or more segment identifiers includes a plurality of segment identifiers;

the one or more segment identifiers each includes an identifier that identifies a path segment;

the one or more segment identifiers each includes an identifier that identifies a segment of the path;

the space includes a node-specific space;

the space includes a scope-specific space;

the space includes an entity-specific space;

the space includes a memory space;

the space includes a virtual space;

the space does not include a node-specific space;

the space does not include a scope-specific space;

the space does not include an entity-specific space;

the space does not include a memory space;

the space does not include a virtual space;

the space includes an identifier space;

the space includes an address space;

the address space identifies one or more protocol points that are not endpoints;

the space identifies one or more protocol endpoints defined according to a segment routing (SR) network protocol;

the space identifies one or more protocol endpoints defined according to a network protocol;

the space identifies one or more protocol endpoints defined according to a network protocol that is not a transmission control protocol (TCP) nor a hypertext transfer protocol (HTTP);

the space identifies one or more protocol endpoints defined according to a network protocol that is at least one of a transmission control protocol (TCP), or a hypertext transfer protocol (HTTP);

the space identifies one or more nodes that are not endpoints;

the space is associated with a network protocol;

the space is not associated with a network protocol;

the first node completely resides in the first region;

the first node only partially resides in the first region;

the first region in which the first node resides is current by virtue of being a region in which the first node currently resides;

the first region in which the first node resides is current by virtue of being a region in which the first node presently resides;

the first region in which the first node resides is current by virtue of being a region in which the first node resides at a time of the generating;

the space has the span within the first region;

the space has the span in only a subset of the first region;

the space has the span in only the first region;

the space has the span in an entirety of the first region;

the space has the span in the first region, and at least one other region;

the first node includes a current node;

the first region includes a current region;

the second region includes a next region;

all of the set of one or more segment identifiers is in the space;

only the at least one of the set of one or more segment identifiers is in the space;

the next region is identified directly by the at least one of the set of one or more segment identifiers;

the next region is identified indirectly by the at least one of the set of one or more segment identifiers;

the next region is identified utilizing the at least one of the set of one or more segment identifiers, by utilizing the at least one of the set of one or more segment identifiers to look up at least one identifier that identifies the next region;

the next region is identified utilizing the at least one of the set of one or more segment identifiers, by utilizing the at least one of the set of one or more segment identifiers to identify the next region;

the next region is next by virtue of being a region that is a next destination along the path;

the next region is next by virtue of being a region that is a next packet destination along the path;

the next region is next by virtue of being a region in which a next node along the path resides;

the next region and the first region have no region therebetween;

the next region and the first region have at least one region therebetween;

the set of one or more segment identifiers encodes the path by describing the path using a predetermined format;

the set of one or more segment identifiers encodes the path by describing the path using a predetermined protocol;

the set of one or more segment identifiers encodes the path by describing the path using predetermined rules;

the set of one or more segment identifiers encodes the path by describing the path using predetermined symbols;

the set of one or more segment identifiers encodes the path by symbolically conveying the path;

the set of one or more segment identifiers is re-formatted by converting a first format of the set of one or more segment identifiers to a second format;

the set of one or more segment identifiers is re-formatted by altering a format of the set of one or more segment identifiers;

the set of one or more segment identifiers is re-formatted so that the set of one or more segment identifiers are capable of being used by the one or more processors to identify the path;

the set of one or more segment identifiers is re-formatted so that the set of one or more segment identifiers are capable of being used by at least one of the instructions to identify the path;

the set of one or more segment identifiers is re-formatted through an encoding process;

the set of one or more segment identifiers is re-formatted so that the set of one or more segment identifiers are capable of being used by another node to identify the path;

or

the set of one or more segment identifiers is re-formatted, such that the path is capable of being identified by decoding the set of one or more segment identifiers.