Routing methods, systems, and computer program products with multiple sequences of identifiers

Description

BACKGROUND

It is unlikely that the designers of the early network, which is referred to as the “Internet” expected it to become as large as it has become. The fact that the global Internet Protocol (IP) address space for 32-bit addresses has been fully allocated is evidence of this. As the Internet grows, new problems will arise and some current problems are getting worse. For example, while network speeds and bandwidth are increasing, so are causes of network latency.

The Internet Engineering Task Force (IETF) has taken steps at various times in the past and are presently taking steps to address a number of problems resulting from the Internet's growth. Problems addressed by the IETF are described in a number of “Request for Comments” (RFC) documents published by the IETF. Documents referenced herein and included by reference include: “Request for Comments” (RFC) document RFC 791 edited by J. Postel, titled “Internet Protocol, DARPA Internet Protocol Specification”, published by the IETF in September, 1981; “Request for Comments” (RFC) document RFC 1519 by V. Fuller, et al, titled “Classless Inter-Domain Routing (CIDR): An Address Assignment and Aggregation Strategy”, published by the Internet Engineering Task Force (IEFT), in June, 1999; “Request for Comments” (RFC) document RFC 2460 by S. Deering, et al, titled “Internet Protocol, Version 6, (IPv6) Specification”, published by the IETF in December, 1998; “Request for Comments” (RFC) document RFC 3513 by R. Hinden, et al, titled “Internet Protocol Version 6 (IPv6) Addressing Architecture”, published by the IETF in April, 2003; and “Request for Comments” (RFC) document RFC 2374 by R. Hinden, et al, titled “Aggregatable Global Unicast Address Format”, published by the IETF in July, 1998.

RFC 791 states, “The internet protocol implements two basic functions: addressing and fragmentation”. RFC 791 goes on to state, “A distinction is made between names, addresses, and routes. A name indicates what we seek. An address indicates where it is. A route indicates how to get there. The internet protocol deals primarily with addresses. It is the task of higher level (i.e., host-to-host or application) protocols to make the mapping from names to addresses. The internet module maps internet addresses to local net addresses. It is the task of lower level (i.e., local net or gateways) procedures to make the mapping from local net addresses to routes”.

As demonstrated in the RFCs listed above, addressing has been a source of a number of problems. In order to address a number of current and future problems facing the Internet, the subject matter described herein challenges the distinctions asserted in RFC 791 between and among names, addresses, and routes.

Accordingly, there exists a need for methods, systems, and computer program products for routing based on a path-based protocol address.

SUMMARY

The following presents a simplified summary of the disclosure in order to provide a basic understanding to the reader. This summary is not an extensive overview of the disclosure and it does not identify key/critical elements of the invention or delineate the scope of the invention. Its sole purpose is to present some concepts disclosed herein in a simplified form as a prelude to the more detailed description that is presented later.

Methods and systems are described for routing based on a path-based protocol address.

In one embodiment, a non-transitory computer-readable media is provided for storing instructions, that when executed by one or more processors of a topology node, cause the topology node to: identify a first sequence of identifiers for data routing in a label switching network from a first node in the label switching network; identify a second sequence of identifiers for data routing in the label switching network from a second node in the label switching network; identify a policy for use in constraining data routing from the first node to a third node; include the first sequence of identifiers and the second sequence of identifiers in a third sequence of identifiers that reflects the policy such that data routing is constrained from the first node to the third node via a plurality of network paths that each include at least one node in the label switching network; and provide path information that identifies the third sequence of identifiers, for constraining data routing, according to the policy, to the third node via the second node.

In another embodiment, a system is provided, comprising; network means for data routing; and topology node means for: identifying a first sequence of identifiers for data routing in the network means from a first node in the network means; identifying a second sequence of identifiers for data routing in the network means from a second node in the network means; identifying a policy for use in constraining data routing from the first node to a third node; including the first sequence of identifiers and the second sequence of identifiers in a third sequence of identifiers that reflects the policy such that data routing is constrained from the first node to the third node via a plurality of network paths that each include at least one node in the network means; and providing path information that identifies the third sequence of identifiers, for constraining data routing, according to the policy, to the third node via the second node.

In yet another embodiment, a method is provided, comprising: at a topology node: identifying a first sequence of identifiers for data routing in a label switching network from a first node in the label switching network; identifying a second sequence of identifiers for data routing in the label switching network from a second node in the label switching network; identifying a policy for use in constraining data routing from the first node to a third node; including the first sequence of identifiers and the second sequence of identifiers in a third sequence of identifiers that reflects the policy such that data routing is constrained from the first node to the third node via a plurality of network paths that each include at least one node in the label switching network; and providing path information that identifies the third sequence of identifiers, for constraining data routing, according to the policy, to the third node via the second node.

In still yet another embodiment, a method for configuring a topology node is provided, comprising: communicatively coupling at least one non-transitory memory and one or more processors; and causing storage of the instructions on the at least one non-transitory memory where the instructions are configured to cause the topology node to: identify a first sequence of identifiers for data routing in a label switching network from a first node in the label switching network; identify a second sequence of identifiers for data routing in the label switching network from a second node in the label switching network; identify a policy for use in constraining data routing from the first node to a third node; include the first sequence of identifiers and the second sequence of identifiers in a third sequence of identifiers that reflects the policy such that data routing is constrained from the first node to the third node via a plurality of network paths that each include at least one node in the label switching network; and provide path information that identifies the third sequence of identifiers, for constraining data routing, according to the policy, to the third node via the second node.

BRIEF DESCRIPTION OF THE DRAWINGS

Objects and advantages of the present invention will become apparent to those skilled in the art upon reading this description in conjunction with the accompanying drawings, in which like reference numerals have been used to designate like or analogous elements, and in which:

FIG. 1 is a block diagram illustrating an exemplary hardware device included in and/or otherwise providing an execution environment in which the subject matter may be implemented;

FIG. 2 is a flow diagram illustrating a method for routing based on a path-based protocol address according to an aspect of the subject matter described herein;

FIG. 3 is a block diagram illustrating an arrangement of components for routing based on a path-based protocol address according to another aspect of the subject matter described herein;

FIG. 4A is a block diagram illustrating an arrangement of components for routing based on a path-based protocol address according to another aspect of the subject matter described herein;

FIG. 4B is a block diagram illustrating an arrangement of components for routing based on a path-based protocol address according to another aspect of the subject matter described herein;

FIG. 4C is a block diagram illustrating an arrangement of components for routing based on a path-based protocol address according to another aspect of the subject matter described herein;

FIG. 5A is a network diagram illustrating an exemplary system for routing based on a path-based protocol address according to another aspect of the subject matter described herein;

FIG. 5B is a network diagram illustrating an exemplary system for routing based on a path-based protocol address according to another aspect of the subject matter described herein;

FIG. 5C is a network diagram illustrating an exemplary system for routing based on a path-based protocol address according to another aspect of the subject matter described herein;

FIG. 6A is a diagram illustrating an exemplary representation of a path-based protocol address according to another aspect of the subject matter described herein;

FIG. 6B is a diagram illustrating an exemplary representation of a path-based protocol address according to another aspect of the subject matter described herein;

FIG. 6C is a diagram illustrating an exemplary representation of a path-based protocol address according to another aspect of the subject matter described herein;

FIG. 6D is a diagram illustrating an exemplary representation of a path-based protocol address according to another aspect of the subject matter described herein;

FIG. 6E is a diagram illustrating an exemplary representation of a path-based protocol address according to another aspect of the subject matter described herein;

FIG. 7 is a flow diagram illustrating a method for determining a protocol address for a node according to an aspect of the subject matter described herein;

FIG. 8 is a block diagram illustrating an arrangement of components for determining a protocol address for a node according to another aspect of the subject matter described herein

FIG. 9 is a flow diagram illustrating a method for routing based on a nested protocol address according to an aspect of the subject matter described herein;

FIG. 10 is a flow diagram illustrating a method for routing based on a scope-specific address space according to an aspect of the subject matter described herein;

FIG. 11 is a flow diagram illustrating a method for identifying a protocol address in a scope-specific address space according to an aspect of the subject matter described herein;

FIG. 12 is a block diagram illustrating an arrangement of components for identifying a protocol address in a scope-specific address space according to another aspect of the subject matter described herein;

FIG. 13 is a flow diagram illustrating a method for identifying a protocol address based on path information according to an aspect of the subject matter described herein;

FIG. 14 is a block diagram illustrating an arrangement of components for identifying a protocol address based on path information according to another aspect of the subject matter described herein;

FIG. 15 is a flow diagram illustrating a method for assigning an interface identifier to a network interface according to an aspect of the subject matter described herein; and

FIG. 16 is a block diagram illustrating an arrangement of components for assigning an interface identifier to a network interface according to another aspect of the subject matter described herein.

DETAILED DESCRIPTION

One or more aspects of the disclosure are described with reference to the drawings, wherein like reference numerals are generally utilized to refer to like elements throughout, and wherein the various structures are not necessarily drawn to scale. In the following description, for purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of one or more aspects of the disclosure. It may be evident, however, to one skilled in the art, that one or more aspects of the disclosure may be practiced with a lesser degree of these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to facilitate describing one or more aspects of the disclosure. It is to be understood that other embodiments and/or aspects may be utilized and structural and functional modifications may be made without departing from the scope of the subject matter disclosed herein.

The use of “including”, “comprising”, “having”, and variations thereof are meant to encompass the items listed thereafter and equivalents thereof as well as additional items and equivalents thereof. Terms used to describe interoperation and/or coupling between components are intended to include both direct and indirect interoperation and/or coupling, unless otherwise indicated. Exemplary terms used in describing interoperation and/or coupling include “mounted,” “connected,” “attached,” “coupled,” “communicatively coupled,” “operatively coupled,” “invoked”, “called”, “provided to”, “received from”, “identified to”, “interoperated” and similar terms and their variants.

As used herein, any reference to an entity “in” an association is equivalent to describing the entity as “included in and/or identified by” the association, unless explicitly indicated otherwise.

Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure belongs. Although methods, components, and devices similar or equivalent to those described herein can be used in the practice or testing of the subject matter described herein, suitable methods, components, and devices are described below.

All publications, patent applications, patents, and other references mentioned herein are incorporated by reference in their entirety. In case of conflict, the present disclosure, including definitions, will control. In addition, the materials, methods, and examples are illustrative only and not intended to be limiting.

An exemplary device included in an execution environment that may be programmed, adapted, modified, and/or otherwise configured according to the subject matter is illustrated in FIG. 1. An “execution environment”, as used herein, is an arrangement of hardware and, in some aspects, software that may be further modified, transformed, and/or otherwise configured to include and/or otherwise host an arrangement of components to perform a method of the subject matter described herein. An execution environment includes and/or is otherwise provided by one or more devices. The execution environment is said to be the execution environment “of” the device and/or devices. An execution environment may be and/or may include a virtual execution environment including software components operating in a host execution environment. Exemplary devices included in and/or otherwise providing suitable execution environments that may be adapted, programmed, and/or otherwise modified according to the subject matter include a workstation, a desktop computer, a laptop or notebook computer, a server, a handheld computer, a mobile telephone or other portable telecommunication device, a media playing device, a gaming system, a tablet computer, a portable electronic device, a handheld electronic device, a multiprocessor device, a distributed system, a consumer electronic device, a router, a network server, or any other type and/or form of computing, telecommunications, network, and/or media device that is suitable to perform the subject matter described herein. Those skilled in the art will understand that the components illustrated in FIG. 1 are exemplary and may vary by particular execution environment.

FIG. 1 illustrates a hardware device 100 included in an execution environment 102. FIG. 1 illustrates that execution environment 102 includes a processor 104, such as one or more microprocessors; a physical processor memory 106 including storage locations identified by addresses in a physical memory address space of processor 104; a persistent secondary storage 108, such as one or more hard drives and/or flash storage media; an input device adapter 110, such as a key or keypad hardware, a keyboard adapter, and/or a mouse adapter; an output device adapter 112, such as a display and/or an audio adapter to present information to a user; a network interface component, illustrated by a network interface adapter 114, to communicate via a network such as a LAN and/or WAN; and a mechanism that operatively couples elements 104-114, illustrated as a bus 116. Elements 104-114 may be operatively coupled by various means. Bus 116 may comprise any type of bus architecture, including a memory bus, a peripheral bus, a local bus, and/or a switching fabric.

As used herein a “processor” is an instruction execution machine, apparatus, or device. A processor may include one or more electrical, optical, and/or mechanical components that operate in interpreting and executing program instructions. Exemplary processors include one or more microprocessors, digital signal processors (DSPs), graphics processing units, application-specific integrated circuits (ASICs), optical or photonic processors, and/or field programmable gate arrays (FPGAs). Processor 104 may access instructions and data via one or more memory address spaces in addition to the physical memory address space. A memory address space includes addresses identifying locations in a processor memory. The addresses in a memory address space are included in defining a processor memory. Processor 104 may have more than one processor memory. Thus, processor 104 may have more than one memory address space. Processor 104 may access a location in a processor memory by processing an address identifying the location. The processed address may be identified by an operand of an instruction and/or may be identified by a register and/or other portion of processor 104.

FIG. 1 illustrates a virtual processor memory 118 spanning at least part of physical processor memory 106 and may span at least part of persistent secondary storage 108. Virtual memory addresses in a memory address space may be mapped to physical memory addresses identifying locations in physical processor memory 106. An address space including addresses that identify locations in a virtual processor memory is referred to as a “virtual memory address space”; its addresses are referred to as “virtual memory addresses”; and its processor memory is referred to as a “virtual processor memory” or “virtual memory”. The term “processor memory” may refer to physical processor memory, such as processor memory 106, and/or may refer to virtual processor memory, such as virtual processor memory 118, depending on the context in which the term is used.

Physical processor memory 106 may include various types of memory technologies. Exemplary memory technologies include static random access memory (SRAM), Burst SRAM or SynchBurst SRAM (BSRAM), Dynamic random access memory (DRAM), Fast Page Mode DRAM (FPM DRAM), Enhanced DRAM (EDRAM), Extended Data Output RAM (EDO RAM), Extended Data Output DRAM (EDO DRAM), Burst Extended Data Output DRAM (BEDO DRAM), Enhanced DRAM (EDRAM), synchronous DRAM (SDRAM), JEDEC SRAM, PC 100 SDRAM, Double Data Rate SDRAM (DDR SDRAM), Enhanced SDRAM (ESDRAM), SyncLink DRAM (SLDRAM), Ferroelectric RAM (FRAM), RAMBUS DRAM (RDRAM) Direct DRAM (DRDRAM), and/or XDR™ DRAM. Physical processor memory 106 may include volatile memory as illustrated in the previous sentence and/or may include non-volatile memory such as non-volatile flash RAM (NVRAM) and/or ROM.

Persistent secondary storage 108 may include one or more flash memory storage devices, one or more hard disk drives, one or more magnetic disk drives, and/or one or more optical disk drives. Persistent secondary storage may include a removable data storage medium. The drives and their associated computer readable media provide volatile and/or nonvolatile storage for computer-executable instructions, data structures, program components, and other data.

Execution environment 102 may include software components stored in persistent secondary storage 108, in remote storage accessible via a network, and/or in a processor memory. FIG. 1 illustrates execution environment 102 including an operating system 120, one or more applications 122, and other program code and/or data components illustrated by other libraries and subsystems 124. In an aspect, some or all software components may be stored in locations accessible to processor 104 in a shared memory address space shared by the software components. The software components accessed via the shared memory address space may be stored in a shared processor memory defined by the shared memory address space. In another aspect, a first software component may be stored in one or more locations accessed by processor 104 in a first address space and a second software component may be stored in one or more locations accessed by processor 104 in a second address space. The first software component is stored in a first processor memory defined by the first address space and the second software component is stored in a second processor memory defined by the second address space.

Execution environment 102 may receive user-provided information via one or more input devices illustrated by an input device 128. Input device 128 provides input information to other components in execution environment 102 via input device adapter 110. Execution environment 102 may include an input device adapter for a keyboard, a touch screen, a microphone, a joystick, a television receiver, a video camera, a still camera, a document scanner, a fax, a phone, a modem, a network interface adapter, and/or a pointing device, to name a few exemplary input devices.

Input device 128 included in execution environment 102 may be included in device 100 as FIG. 1 illustrates or may be external (not shown) to device 100. Execution environment 102 may include one or more internal and/or external input devices. External input devices may be connected to device 100 via corresponding network interfaces such as a serial port, a parallel port, and/or a universal serial bus (USB) port. Input device adapter 110 may receive input and provide a representation to bus 116 to be received by processor 104, physical processor memory 106, and/or other components included in execution environment 102.

An output device 130 in FIG. 1 exemplifies one or more output devices that may be included in and/or that may be external to and operatively coupled to device 100. For example, output device 130 is illustrated connected to bus 116 via output device adapter 112. Output device 130 may be a display device. Exemplary display devices include liquid crystal displays (LCDs), light emitting diode (LED) displays, and projectors. Output device 130 presents output of execution environment 102 to one or more users. In some embodiments, an input device may also include an output device. Examples include a phone, a joystick, and/or a touch screen. In addition to various types of display devices, exemplary output devices include printers, speakers, tactile output devices such as motion-producing devices, and other output devices producing sensory information detectable by a user. Sensory information detected by a user is referred herein to as “sensory input” with respect to the user.

A device included in and/or otherwise providing an execution environment may operate in a networked environment communicating with one or more devices via one or more network interface components. FIG. 1 illustrates network interface adapter (NIA) 114 as a network interface component included in execution environment 102 to operatively couple device 100 to a network. A network interface component includes a network interface hardware (NIH) component and optionally a network interface software (NIS) component. Exemplary network interface components include network interface controllers, network interface cards, network interface adapters, and line cards. A node may include one or more network interface components to interoperate with a wired network and/or a wireless network. Exemplary wireless networks include a BLUETOOTH network, a wireless 802.11 network, and/or a wireless telephony network (e.g., AMPS, TDMA, CDMA, GSM, GPRS UMTS, and/or PCS network). Exemplary network interface components for wired networks include Ethernet adapters, Token-ring adapters, FDDI adapters, asynchronous transfer mode (ATM) adapters, and modems of various types. Exemplary wired and/or wireless networks include various types of LANs, WANs, and/or personal area networks (PANs). Exemplary networks also include intranets and internets such as the Internet.

The terms “network node” and “node” in this document both refer to a device having a network interface component to operatively couple the device to a network. Further, the terms “device” and “node” used herein refer to one or more devices and nodes, respectively, providing and/or otherwise included in an execution environment unless clearly indicated otherwise.

As used herein, the term “network protocol” refers to a set of rules, conventions, and/or schemas that govern how nodes exchange information over a network. The set may define, for example, a convention and/or a data structure. The term “network path” as used herein refers to a sequence of nodes in a network that are communicatively coupled to transmit data in one or more data units of a network protocol between a pair of nodes in the network.

A “data unit”, as the term is used herein, is an entity specified according to a network protocol to transmit data between a pair of nodes in a network path to send the data from a source node to a destination node that includes an identified protocol endpoint of the network protocol. A network protocol explicitly and/or implicitly specifies and/or otherwise identifies a schema that defines one or more of a rule for a format for a valid data unit and a vocabulary for content of a valid data unit. One example of a data unit is an Internet Protocol (IP) packet. The Internet Protocol defines rules for formatting an IP packet that defines a header to identify a destination address that identifies a destination node and a payload portion to include a representation of data to be delivered to the identified destination node. Various address types are specified defining a vocabulary for one or more address portions of an IP data unit. The terms “data unit”, “frame”, “data packet”, and “packet” are used interchangeably herein. One or more data units of a first network protocol may transmit a “message” of a second network protocol. For example, one or more data units of the IP protocol may include a TCP message. In another example, one or more TCP data units may transmit an HTTP message. A message may be empty.

How data is packaged in one more data units for a network protocol may vary as the data traverses a network path from a source node to a destination node. Data may be transmitted in a single data unit between two consecutive nodes in a network path. Additionally, data may be exchanged between a pair of consecutive nodes in several data units each including a portion of the data. Data received in a single data unit by a node in a network path may be split into portions included in several respective data units to transmit to a next node in the network path. Portions of data received in several data units may be combined into a single data unit to transmit by a node in a network path. For purposes of describing the subject matter, a data unit in which data is received by a node is referred to as a different data unit than a data unit in which the data is forwarded by the node.

A “protocol address”, as the term is used herein, for a network protocol is an identifier of a protocol endpoint that may be represented in a data unit of the network protocol. For example, 192.168.1.1 is an IP protocol address represented in a human readable format that may be represented in an address portion of an IP header to identify a source and/or a destination IP protocol endpoint. A protocol address differs from a symbolic identifier, defined below, in that a symbolic identifier, with respect to a network protocol, maps to a protocol address. Thus, “www.mynode.com” may be a symbolic identifier for a node in a network when mapped to the protocol address 192.168.1.1. An identifier may be both a symbolic identifier and a protocol address depending on its role with respect to its use for a particular network protocol.

Since a protocol endpoint is included in a node and is accessible via a network via a network interface, a protocol address identifies a node and identifies a network interface of the node. A network interface may include one or more NICs operatively coupled to a network.

A node in a pair of nodes in a network path at one end of the sequence of nodes in the network path and/or the other end is referred to herein as a “path end node”. Note that a node may have two NICs with one NIC at each end of a network path. A network path may be included as a portion of another network path that communicatively couples a same pair of nodes. Data may be transmitted via the sequence of nodes in a network path between path end nodes communicatively coupled via the network path. Data may be transmitted in one or both directions depending on an ordering of the nodes in the sequence.

The term “hop” as used herein refers to a pair of consecutive nodes in a network path to transmit, via a network protocol, data sent from a source node to a destination node. A “hop path” is thus a sequence of hops in a network that respectively include a sequence of pairs of consecutive nodes included in transmitting data from a first path end node of the network path to a second path end node of the network path.

The term “path-based protocol address” as used herein refers to a protocol address for a network protocol that includes one or more path segment identifiers that identify one or more respective portions of a network path identified by the path-based protocol address. A “node-based protocol address” is a path-based protocol address that includes a plurality of node identifiers that identify a sequence of nodes in a network path. A “network-interface-based protocol address” is a path-based protocol address that includes a plurality of interface identifiers that identify a sequence of network interfaces in a network path. A “NIC-based protocol address” is a type of network-interface-based protocol address that includes a plurality of identifiers that identify a sequence of network interface components. A “hop-based protocol address” is a type path-based protocol address since a hop is a type of network path.

Given the above definitions, note that the terms “network path” and “hop” may be defined in terms of network interfaces. A “network path” and a “hop path” include a sequence of network interfaces in a network that are included in transmitting data between a pair of path end nodes in the network. A “hop” refers to at least part of a network path that includes a pair of consecutive network interfaces in a sequence of network interfaces in a network path. A “network path” is thus a sequence of hops in a network that respectively includes a sequence of pairs of consecutive network interfaces included in transmitting data from a first path end node of the network path to a second path end node of the network path.

The term “network topology” or “topology”, for short, as used herein refers to a representation of protocol endpoints and/or nodes in a network, and representations of hops representing communicative couplings between and/or among the protocol endpoints and/or nodes in the network. A network may have different network topologies with respect to different network protocols. A network topology may represent physical communicative couplings between nodes in the network. A network topology may represent logical couplings between protocol endpoints and/or nodes of a particular network protocol or a particular type of network protocol.

The domain name system (DNS) of the Internet operates based on an application layer protocol defined by the DNS. The nodes in the DNS are communicatively coupled via the DNS protocol and may be represented by a logical network topology. A DNS system includes nodes connected via the DNS protocol. The DNS system has a network topology defined by nodes that include protocol endpoints of the DNS protocol. In still another example, a token-ring network has a circular topology at the link layer but may have a star topology at the physical layer.

As used herein, an “entity-specific address space” refers to an address space defined for a specific entity where the addresses in the address space operate as identifiers in the context of the entity. An address from an entity-specific address space is referred to herein as an “entity-specific address”. An address is “entity-specific” in that what it identifies is based on the entity to which it is specific. Another address having the same form and content may identify a different entity when in an address space specific to another entity. Addresses in an entity-specific address space operate as identifiers in the context of an entity to which they are “specific” as defined by the specific association of the address space and the entity. Without knowledge of the entity to which an entity-specific address space is specific, what an address in the entity-specific address space identifies is indeterminate. The terms “entity-specific address” and “entity-specific identifier” are used interchangeably herein. An entity-specific address may identify an entity included in the entity to which the address is specific or may identify an entity external to the entity to which the address is specific. The fact that an address is entity-specific does not define a scope for the address.

A portion of a network is a type of entity. A type of entity-specific address space described herein is a scope-specific address space. As used herein, a “scope-specific address space”, specific to a particular region of a network, is an address space defined for the particular network region, where an address in the scope-specific protocol address operates as identifier, according to a network protocol, of a protocol endpoint in a node outside of the particular region when processed in the context of a node in the particular region. The region is indicated by the span of an indicated scope. The terms “region” and “zone” are used interchangeably herein. An address from a scope-specific address space is referred to herein as a “scope-specific protocol address”. An address is “scope-specific” in that what protocol endpoint it identifies depends on the region to which it is specific. Another address having the exact same form and content may identify a different protocol endpoint when in an address space that is specific to another region. A protocol address in a scope-specific address space serves as an identifier in the context of a node in a region to which the scope-specific address space is “specific” as defined by an association of the address space and the region indicated by the scope. Without knowledge of the particular region to which a scope-specific address space is specific, what a scope-specific protocol address in the scope-specific address space identifies is indeterminate. The terms “scope-specific protocol address” and “scope-specific protocol identifier” are used interchangeably herein. Types of scope-specific address spaces indicating exemplary spans include site-specific, LAN-specific, subnet-specific, city-specific, business-specific, and node-specific.

For a network protocol, an address in a scope-specific address space serves as an identifier of a protocol endpoint in a node. Data may be received via the protocol endpoint from a network via one or more network interfaces that operatively couple the node to the network. Data may be sent via the protocol endpoint to transmit over the network via the one or more network interfaces in the node. Since a protocol endpoint of a network protocol is included in a node and is accessible via a network via a network interface, a protocol address identifying the protocol endpoint also identifies the node and identifies a network interface of the node.

As used herein, a “node-specific address space” is a scope-specific address space defined for a specific node in a network, where the addresses in the node-specific address space operate as identifiers of nodes and/or network interfaces in the network when processed in the context of the specific node. An address from a node-specific address space is referred to herein as a “node-specific address”. An address is “node-specific” in that what it identifies depends on the node to which is defined as specific. Another address having the exact same form and content may identify a different node when in an address space specific to another node. Addresses in a node-specific address space operate as identifiers in the context of a node to which they are “specific” as defined by the specific association of the address space and the node. Without knowledge of the node to which a node-specific address space is specific, addresses in the node-specific address space are indeterminate. The terms “node-specific address” and “node-specific identifier” are used interchangeably herein. A node-specific address space is a type of scope-specific address space.

The term “node” is defined above. Note that an identifier of a network interface in a network also identifies a node that includes the network interface. Thus, a network interface-specific address is also a node-specific address. Network interfaces in a node may have their own respective network interface-specific address spaces that are also node-specific. The network interface-specific address spaces may be combined to form a node-specific address space and/or may be managed as separate address spaces. The adjectives “node-specific” and “network interface-specific” may be used interchangeably.

A scope-specific identifier differs from a scoped address as described in “Request for Comments” (RFC) document RFC 4007 by S. Deering, et al, titled “IPv6 Scoped Address Architecture”, published by the IETF in December, 2006 and further described in application Ser. No. 11/962,285, by the present inventor, filed on 2007 Dec. 21, entitled “Methods and Systems for Sending Information to a zone Included in an Internet Network”. A scoped address space is shared by nodes in a given scope. While a link-local scoped address is specific to a particular node, a link-local scoped address simply identifies a network interface component local to the particular node. A loop-back internet address is specific to a node as well. Neither link-local scoped addresses nor loop-back addresses identify one node to another. As such, neither serves as a node-specific identifier as defined above.

A “scoped address” is described by RFC 3513 and RFC 4007 as an identifier that, in a particular region of a network, serves as a protocol address of a network interface and/or a node in the particular region. The extent of the particular region is referred to as the scope of the region and thus the scope within which the identifier serves as a protocol address. A particular region included within a scope is indicated by its span. A scoped address is a valid protocol address only within a particular region as indicated by the address's indicated scope. Examples of scope indicators include node-scope where identifiers are valid only to a single node in the indicated span, LAN-scope where identifiers are valid for nodes in the span of a particular LAN, and subnet-scope where identifiers are valid only for nodes in a particular subnet. RFC 3513 currently defines support for link-local scope, site-local scope, and global scope. A data unit transmitted with a scoped address should not be delivered to node that does not have a network interface in the span indicated by the scope.

“Path information” is any information that identifies a network path and/or a hop path for data transmitted via one or more specified network protocols. Path information may be identified by identifying network interfaces, NICs, nodes, and/or hops included in a network path. “Address information” is any information that identifies a protocol address that, for a network protocol, identifies a protocol endpoint. Address information may identify a unicast protocol address for a network protocol. In identifying a protocol endpoint, a protocol address identifies a node and a network interface.

Those skilled in the art will understand upon reading the descriptions herein that the subject matter disclosed herein is not restricted to the network protocols described and/or their corresponding OSI layers. For ease of illustration, the subject matter is described in terms of protocols that correspond to OSI layer three, also referred to as network layer protocols, in general. Particular descriptions are based on versions of the Internet Protocol (IP). Address information may identify one or more protocol addresses. Exemplary protocol addresses include IP addresses, IPX addresses, DECNet addresses, VINES Internet Protocol addresses, and Datagram Delivery Protocol (DDP) addresses, HTTP URLS, TCP port and IP address pairs, and the like.

The term “path-based address” is defined above. A “node-based address” is a path-based address where some or all of the address includes node identifiers that identify a sequence of nodes in a network path. A “network-interface-based address” is a path-based address where some or all of the address includes identifiers of network interfaces in a sequence in a network path. A “NIC-based address” is a type of network-interface-based address that identifies a sequence of network interface components. A “hop-based address” is a path-based address where some or all of the address identifies one or more hops in a network path. The protocol address types defined are not mutually exclusive.

The term “metric space”, as used herein, refers to a set, as defined in mathematics, where a distance between elements of the set is defined according to a metric. Metric spaces defined in Euclidean geometry are well-known examples. Those skilled in the art of metric spaces, such as Euclidian spaces, will appreciate that a one-to-one mapping may be determined and/or otherwise identified for mapping addresses from a first coordinate space having a first origin for a metric space to addresses from a second coordinate space having a second origin in the metric space. Given a mapping rule between a first scope-specific address space and a second scope-specific address space and a mapping between the second scope-specific address space and a third scope-specific address space based on a third coordinate space identifying a third origin in the metric space, a mapping from the first coordinate space to the third coordinate space may be determined. A mapping between coordinate spaces for a metric space may be included a coordinate shift and/or a rotation, for example. The mapping may be pre-specified and accessible to the nodes in one or both address spaces. Mapping between locations in a number of different metric spaces is well known in mathematics. For example, a top half of the surface of sphere may be mapped to a plane. Some will further appreciate that some metric spaces may be mapped to other metric spaces. Some of these mappings are one-to-one and/or onto.

FIG. 3 illustrates an arrangement of components in a system that operates in an execution environment, such as execution environment 102 in FIG. 1. The arrangement of components in the system operates to perform the method illustrated in FIG. 2. The system illustrated includes an in-data handler component 302, a routing component 304, a forwarding component 306, and an out-data handler component 308. The execution environment includes a processor, such as the processor 104, to process an instruction, during operation of the system, in at least one of the in-data handler component 302, the routing component 304, the forwarding component 306, and the out-data handler component 308.

Some or all of the exemplary components illustrated in FIG. 3 may be adapted to perform the method illustrated in FIG. 2 in a number of execution environments. FIG. 4A, FIG. 4B, and FIG. 4C are each block diagrams illustrating the components of FIG. 3 and/or analogs of the components of FIG. 3 respectively adapted to operate in an execution environment 401a, in an execution environment 401b, and in an execution environment 401c that are included in and/or that otherwise are provided by one or more nodes.

Components, illustrated in FIG. 4A, FIG. 4B, and FIG. 4C, are respectively identified by a number followed with an alphanumeric suffix. A component may be referred to generically in the singular or the plural by dropping a suffix of a portion thereof of the component's identifier. For example, execution environments; such as the execution environment 401a, the execution environment 401b, the execution environment 401c, and their adaptations and analogs; are referred to herein generically as an execution environment 401 or, when describing more than one, execution environments 401. Other components identified with a suffix may similarly be referred to generically or as a group by dropping a suffix or a portion thereof.

FIG. 1 illustrates key components of an exemplary device that may at least partially provide and/or otherwise be included in an execution environment. Some or all of the components illustrated in FIG. 4A, FIG. 4B, and FIG. 4C may be included in and/or otherwise may be combined with the components of FIG. 1 to create a variety of arrangements of components according to the subject matter described herein. Those skilled in the art will understand other execution environments in addition to the various adaptations of the execution environments described herein are suitable for hosting an adaptation of the arrangement in FIG. 3.

FIGS. 5A-C respectively illustrate networks 500 including nodes that in various aspects may include adaptations of any of the execution environments 401, illustrated in FIG. 4A, FIG. 4B, and FIG. 4C. The various illustrated nodes are operatively coupled via respective network interface components to the respective networks 500 in FIGS. 5A-C. For ease of illustration and description, each of FIGS. 5A-C includes nodes identified by a role played in sending data from one node to another. FIGS. 5A-C illustrate source nodes 502 configured to initiate a transmission of data to respective recipients, path nodes 504 configured to relay the data transmitted by respective source nodes 502, and destination nodes 506 identified by the respective source nodes 502 as recipients of the data from source nodes 502. In some of FIGS. 5A-C, one or more edge nodes 508 are illustrated for describing adaptations of the arrangement in FIG. 3 performing various aspects of the method illustrated in FIG. 2 operating in one or more of the roles identified.

A network interface includes one or more NICs identified by a protocol address of a network protocol for sending data from a protocol endpoint identified by the network protocol and/or for receiving data for the protocol endpoint.

In various contexts nodes illustrated as destination nodes 506, edge nodes 508, and/or path nodes 504 may operate as source nodes; some nodes illustrated as source nodes 502, edge nodes 508, and destination nodes 506 may operate as path nodes, and nodes illustrated as source nodes 502, edge nodes, 508, and/or path nodes 504 may operate as destination nodes. Exemplary nodes configured to operate as path nodes 504 include a router, a switch, a wireless access point, a bridge, a gateway, and the like.

A path node 504 illustrated in any of FIGS. 5A-C and/or a node otherwise operating as a path node may include an adaptation of any execution environment 401 illustrated in FIG. 4A, FIG. 4B, and/or FIG. 4C. A path node 504 may include a first network interface component and a second network interface component. With respect to FIG. 5B, a first path node 504b1 may be operatively coupled to a first network 514b1 included in a network 500b via a first network interface component and may be operatively coupled to a second network 514b2 via a second network interface component. The first path node 504b1 may forward data sent from a source node 502b in the first network 514b1 for delivery via a second network 514b2 to a destination node 506b in a third network 514b3. The first network 514b1, the second network 514b2, and/or the third network 514b3 may respectively include and/or may be included in a local area network (LAN), an intranet, at least a portion of the Internet, and/or another wide area network (WAN).

The network components in some nodes may be configured according to a layered design or architecture known to those skilled in the art as a “network stack”. Adaptations and/or analogs execution environments 401 in FIG. 4A, FIG. 4B, and FIG. 4C may include network components in a layered architecture, physically and/or logically. Other architectural models for network components may be included in other execution environments to send and/or receive data via a network and are considered within the scope of the subject matter described herein. Combinations of layered architectures and non-layered architectures are also considered to be within the scope of the subject matter described herein.

Some components illustrated in FIG. 4A correspond to components of the layered architecture specified by the Open System Interconnection (OSI) model, known to those skilled in the art. For example, network components in FIG. 4A may comply with specifications for protocols included in the TCP/IP protocol suite. The OSI model specifies a seven-layer network stack. The TCP/IP protocol suite may be mapped to layer three and layer four of the seven layers. Those skilled in the art will understand that fewer or more layers may be included in various adaptations and analogs of the execution environments 401 illustrated in FIG. 4A, FIG. 4B, FIG. 4C, and their various aspects described herein; and for any other execution environment suitable for hosting an adaptation and/or analog of the arrangement of components illustrated in FIG. 3.

FIG. 4A illustrates a network layer component 403a that corresponds to layer 3 of the open systems interconnection reference (OSI) model. The Internet Protocol (IP) is an exemplary layer 3 protocol, also referred to as a network layer protocol. FIG. 4A illustrates a first NIC 405a1 configured to operatively couple a node including an adaptation and/or analog of the execution environment 401a to a network. One or more NICs 405a correspond to layer one, also known as the physical layer, of the OSI model for receiving and sending signals via a physical data transmission medium. Exemplary network layer protocols include an Internet Protocol (IP), DECNet routing Protocol (DRP), an Internetwork Packet Exchange (IPX) protocol, an Internet Datagram Protocol (IDP), a VINES Internet Protocol, and a Datagram Delivery Protocol (DDP).

FIG. 4A also illustrates a link layer component 407a that corresponds to layer 2, also known as the link layer, of the OSI model for communicating, via layer 1, between nodes sharing a physical data transmission medium such as nodes in a LAN. Exemplary link layer protocols include an Ethernet protocol, a Token-ring protocol, and asynchronous transfer mode (ATM) protocol, to name a few. Some or all of a link layer component 407a may be included in one or more NICs 405, as illustrated in FIG. 4A. A portion of a link layer component may be external to and operatively coupled to one or more NICs. The external portion may be realized, at least in part, as a device driver for the one or more NICs. Exemplary physical data transmission media include Ethernet cables of various types, co-axial cables, fiber optic cables, and media suitable for transporting various types of wireless signals. FIG. 4A illustrates that some nodes included in and/or otherwise providing an adaptation and/or analog of the execution environment 401a may include more than two NICs 405a, as illustrated by a third NIC 405a3 through an Nth NIC 405an.

The network layer component 403a, illustrated in FIG. 4A, may operate to communicate across various types of link layer protocols, in various adaptations. Layer 3 protocols enable data to be exchanged between and among nodes on different networks across different types of physical data transmission media and differing link layer protocols. The Internet Protocol (IP) in the TCP/IP protocol suite is the most widely utilized network layer protocol currently in use. For ease of illustration, the description that follows provides examples based on IP networks and protocols in the TCP/IP suite due to their wide use and because they are well known in the art. Those skilled in the art will understand that the scope of the subject matter described is not limited to IP networks.

In addition to the protocols described above, protocols corresponding to layers in the OSI model above the network layer may be included in communicating via a network. The term “application protocol” as used herein refers to any protocol or combination of protocols that correspond to one or more layers in the OSI reference model above the network layer. Programs and executables operating in execution environments 401 may communicate via one or more application protocols. Exemplary application protocols include the transmission control protocol (the TCP) in the TCP/IP suite, the user datagram protocol (UDP) in the TCP/IP suite, various versions of hypertext transfer protocol (HTTP), various remote procedure call (RPC) protocols, various instant messaging protocols, various email protocols, and various other protocols for real-time communications. Data exchanged between nodes in a network may be exchanged via data units of one or more network protocols. An execution environment may include layer specific protocol components respectively configured according to the one or more network protocols. Some protocols and/or protocol components may define and/or provide services from multiple layers of the OSI model layer such as the Systems Network Architecture (SNA) protocol.

In addition to specifying schemas defining valid data units, a network protocol may define and/or otherwise be associated with a defined identifier space for identifying protocol endpoints defined according to the network protocol. The terms “identifier space” and “address space” are used interchangeably herein. For example, various versions of hypertext transfer protocol (HTTP) specify a format for HTTP uniform resource locators (URL). HTTP specifies a location in an HTTP header that identifies a URL as an identifier or address from the HTTP address space that identifies both a resource and recipient of an HTTP data unit. The transmission control protocol (TCP) specifies a format and vocabulary for a TCP header including a destination protocol endpoint identifier field referred to as a destination port number that, when combined with a destination protocol address from an IP packet, identifies a transport layer protocol endpoint of a receiver of data sent in a TCP data unit via a network. A source protocol endpoint is similarly identified by a source port number, included in a TCP header as defined by the TCP, along with a source protocol address from an IP data unit as defined by the Internet Protocol.

Other exemplary address spaces that identify protocol endpoints in various network protocols include an email address space, a telephone number address space for various telephony protocols, instant message address spaces for various instant message protocols, and media access control (MAC) addresses for various link layer protocols, to name just a few examples. The address spaces identified are shared among the senders and receivers exchanging data via any particular protocol from among those identified herein as well as others that are known. Some address spaces are shared by senders and receivers in a LAN, an intranet, and/or in another identifiable portion of a network. Other address spaces are shared globally. For example, the HTTP identifier space is a global address space shared across the Internet. An HTTP identifier is defined to identify the same resource regardless of the application and/or node identifying the resource via the HTTP identifier. An HTTP URL is a global identifier in an HTTP network, such as the World Wide Web (Web). Addresses in a shared address space are referred to as scoped addresses that serve as identifiers of protocol endpoints in nodes that share the address space in a region of a network defined by a scope.

In delivering data via a network between protocol endpoints of a particular network protocol, addresses from address spaces of the various protocols at the various layers are typically translated and/or otherwise mapped between the various layers. For example, a unicast IP address in an IP packet is mapped to a link layer address for a link via which the IP packet is transported in a network path via a path node 504 in relaying data from a source node 502 to an identified destination node 506. Addresses at the various layers are assigned from a suitable address space for corresponding network protocols.

FIG. 5B illustrates data may be received via the protocol endpoint from a network via one or more network interfaces that operatively couple a node to the network. Data may be sent via the protocol endpoint in a transmission over the network via the one or more network interfaces in the node. In FIG. 5B, a network path communicatively coupling the source node 502b and a second edge node 508b2 in the network 500b includes a sequence of nodes including of the source node 502b, a first path node 504b1, and the second edge node 508b2. In FIG. 5C, a first network path communicatively coupling a fifth edge node 508c5 and an eighth path node 504c8 includes a first sequence of nodes including the fifth edge node 508c5, a ninth path node 504c9, and the eighth path node 504c8. The first network path is included in a second network path communicatively coupling the fifth edge node 508c5 and the second edge node 508c2 that includes a second sequence of nodes including of the nodes in the first sequence, a seventh path node 504c7, and the second edge node 508c2. A network path may be physical network path or logical network path based on a particular network protocol defining protocol endpoints in the path end nodes.

FIG. 5B, illustrates a number of network paths communicatively coupling the source node 502b and the destination node 506b in the network. One network path illustrated includes a sequence of hops including a first hop 512b1, a sixth hop 512b6, and a seventh hop 512b7. In FIG. 5C, the first network path described above communicatively coupling the fifth edge node 508c5 and the eighth path node 504c8 includes a first sequence of hops including a first hop 512c1 and a second hop 512c2. A hop may be a physical hop or a logical hop based on a network protocol defining a network topology in which the hop is identified and/or otherwise represented.

Given the above definitions, note that the terms “network path” and “hop” may be defined in terms of network interfaces. A “network path” is a sequence of network interfaces in a network for transmitting data in one or more data units of a specified network protocol between a pair of path end nodes in the network. A “hop” refers to a pair of consecutive network interfaces, in a pair of nodes, in a sequence of network interfaces in a network path. A hop in a sequence in a network path corresponds to a pair of network interfaces in the sequence of network interfaces in the network path. In FIG. 5B, the network path described above communicatively coupling the source node 502b and the destination node 506b includes a sequence of network interfaces including a network interface in the first path node 504b1 in the first hop 512b1, a network interface in a second path 504b2 in a sixth hop 512b6, and network interface in the destination node 506b in a seventh hop 512b7. The network paths in FIG. 5C described above may also be described as a sequence of network interfaces.

A network topology may represent logical hops in a network. In FIG. 5B, the first network 514b1 may represented a physical topology when the first 514b1 represents a physical data transmission medium included in physically coupling nodes. The data transmission medium may be a token-ring LAN, for example. The hops 512 in FIG. 5, may illustrate logical communicative couplings at a level of the network above the data transmission medium. The hops 512 may represent network layer hops or hops at some other layer of the network above the physical layer. The domain name system (DNS) of the Internet provides another example of nodes in a logical network topology based on DNS protocol endpoints of the DNS protocol that identifies nodes in the Internet included the network topology. Hops in a DNS based network topology correspond to communicative couplings enabled by the DNS protocol.

With reference to FIG. 2, a block 202 illustrates that the method includes detecting, by a current node in a current location in a network path, data in a data unit that is specified according to a network protocol and that includes a first path-based protocol address including a plurality of path segment identifiers that identify respective path segments of a network path for transmitting data from a source node to a destination node. Accordingly, a system for routing based on a path-based protocol address includes means for detecting, by a current node in a current location in a network path, data in a data unit that is specified according to a network protocol and that includes a first path-based protocol address including a plurality of path segment identifiers that identify respective path segments of a network path for transmitting data from a source node to a destination node. For example, the arrangement illustrated in FIG. 3, includes the in-data handler component 302 that is operable for and/or otherwise is included in detecting, by a current node in a current location in a network path, data in a data unit that is specified according to a network protocol and that includes a first path-based protocol address including a plurality of path segment identifiers that identify respective path segments of a network path for transmitting data from a source node to a destination node. FIGS. 4A-C illustrate in-data handler components 402 as adaptations and/or analogs of the in-data handler component 302 in FIG. 3. One or more in-data handler components 402 operate in an execution environment 401. In FIG. 4A, an in-data handler component 402a is included in network layer component 403a. In FIG. 4B and in FIG. 4C, in-data handler components 402 operate in respective line card components 409.

In transmitting data from a source protocol endpoint in a source node 502 to a destination protocol endpoint in a destination node 506, the data is processed by a sequence of nodes in a network path that communicatively couples the source node 502 and the destination node 506. A node in the network path, that is currently processing the data to send it to the destination 506, is referred to herein as a “current node” with respect to the data. A node in the network path that has previously transmitted the data being processed by the current node is referred to herein as a “previous node”. A node in the network path that has not received the data being processed by the current node is referred to herein as a “next node”. For ease of description, with respect to a data unit “data” refers to data sent in the data unit via a protocol endpoint in the source node, that is being processed by a current node. As such, a source node 502 may be a current node or a previous node with respect to particular data. A path node 504 may be a current node, a previous node, or a next node with respect to the particular data. A destination node 506 may be a next node or a current node with respect to particular data.

A source node 502 may be a current node with respect to data to be transmitted to a destination node 506. The source node 502 may include an adaptation, analog, and/or instance of the execution environment 401a in FIG. 4A. An in-data handler component 402a operating in a network layer component 403a in the source node 502 may detect the data. The network layer component 403a may be configured according to a network layer protocol, such as a version of the Internet Protocol. The in-data handler component 402a may detect data in a data unit that is to be sent to the destination node 506. The data may be received from an application or other type of component configured to send data via a network to a recipient. For example, the application component may be an email client, a file transfer application, a network management client, and the like to be transmitted via one or more data units of the network protocol of the network layer component 403a. The in-data handler 402a may receive the data, directly and/or indirectly, from the application in the source node 502. The in-data handler 402 may interoperate with an out-data component 408a and/or other component of the network layer component 403a to include and/or otherwise detect the data in a data unit of the network protocol.

A path node 504 may include an adaptation, analog, and/or instance of the execution environment 401a, illustrated in FIG. 4A. Data communicated between a source node 502 and a destination node 506 may be received by the path node 504 via of a first NIC 405a1 operatively coupling the path node 504 to a previous network path including the source node 502 and the path node 504 as path end nodes. One or more link layer protocol data units may be detected by a link layer component 407a according to a compatible link layer protocol. For example, Ethernet frames may be detected as link layer protocol data units when received via a CAT 6 Ethernet cable. Data in a received link layer protocol data unit may be provided to an in-data handler component 402a in a network layer component 403a according to the specification of a particular network layer protocol, such as the IP.

An in-data handler component 402a may detect one or more network layer protocol data units in data received from the link layer component 407a. For example, the in-data handler component 402a may detect one or more IP packets in data received in one or more Ethernet frames. The in-data handler component 402a may detect a network layer data unit that includes data from the source node 502 to relay the data to the destination node 506 identified by a protocol address in address information in the detected network layer data unit as defined by a particular network layer protocol supported by the network layer component 403a in the path node 504. A network interface component 405a in a path node 504 may receive data communicated from a source node 502 via a previous network path included in a network 500. One or more network paths may exist to receive the data. A path node 504 may receive data from a source node 502 and may transmit the received data to a destination node 506 via a specified protocol. For example, a path node 504 may receive and transmit data in one or more data packets at a link layer as performed by an Ethernet bridge and a multiple protocol-labeling switch (MPLS). Further, a path node 504 may receive and transmit data in one or more data packets at a network layer as performed by an Internet protocol (IP) router. Still further, a path node 504 may receive and transmit data in one or more data packets at an application layer, as defined above.

Accordingly, data from a source node 502 may be included in and/or may include data formatted according to a link layer protocol, a network layer protocol, and/or an application layer protocol. An in-data handler component 402a may be configured according to a network layer protocol, a link layer protocol, and/or an application layer protocol.

A network protocol defines one or more of a format defining a valid structure for a data unit and a vocabulary defining valid content of the data unit. For example, data to transmit from a source node to a destination node may be included in a payload portion of a data unit of a particular network protocol. The network protocol may define a format that identifies the payload based on one or more valid data structures for a data unit. For example, a payload portion may be identified by a location with respect to the start of a data unit or relative to another portion of the data unit. Alternatively or additionally, the network protocol may define a vocabulary defining a keyword, a bit pattern, and/or other detectable marker that when detected identifies a payload or part of a payload in a data unit. The network protocol may define one or more format rules and/or vocabulary rules that an in-data handler component may detect in identifying data and/or address information in a data unit. The term “schema” refers to a definition of a structure and/or a vocabulary for constructing and/or detecting a valid data unit with respect to a network protocol. For example, both an IPv4 data packet and an IPv6 data packet are specified according to a schema for including address information in a destination protocol address field and in a source protocol address field in an IP header based on location and size.

Data received from a source node 502 by a path node 504 may be received via one or more previous path nodes 504. Data may be received by a current node 504 from a previous node based on a previous-current path segment identifier included in a path-based protocol address that identifies a destination node 506. The previous-current path segment identifier identifies a network path from the previous node to the current node for transmitting the data.

Returning to FIG. 2, a block 204 illustrates that the method further includes detecting, based on the current location, a current-next path segment identifier that identifies a current-next path segment in the plurality for transmitting the data from the current node to a next node in the network path. Accordingly, a system for routing based on a path-based protocol address includes means for detecting, based on the current location, a current-next path segment identifier that identifies a current-next path segment in the plurality for transmitting the data from the current node to a next node in the network path. For example, the arrangement illustrated in FIG. 3, includes the routing component 304 that is operable for and/or otherwise is included in detecting, based on the current location, a current-next path segment identifier that identifies a current-next path segment in the plurality for transmitting the data from the current node to a next node in the network path. FIGS. 4A-C illustrate routing components 404 as adaptations and/or analogs of the routing component 304 in FIG. 3. One or more routing components 404 operate in an execution environment 401.

In FIG. 4A, a routing component 404a is illustrated as a component of a network layer component 403a. In FIG. 4B, a routing component 404b is illustrated operatively coupled to multiple line card components 409b to relay data between and/or among portions of a network coupled to the line cards 409b. Routing component 404b may operate at a network layer of a network stack and/or at another layer. In FIG. 4C, a routing component 404c is illustrated as distributed throughout line card components 409c of an execution environment 401c. The routing component in the execution environment 401c includes a first routing agent (RA) component 404c1 in a first line card component 409c1 and a second RA component 404c2 in a second line card component 409c2.

FIGS. 6A-E illustrate a number of types of address representations 602 illustrating aspects of various address formats and vocabularies for representing a path-based protocol address. Various portions of the respective address representations 602 are illustrated as contiguous but need not be so in various embodiments. The address representations 602 in FIGS. 6A-E may be identified based on an aspect of a format of a data unit and/or an aspect of a vocabulary of a data unit as defined by a schema of a network protocol. Routing component 404a may detect a protocol address of a next node based on a schema for including address information in a data unit of a network protocol. In another aspect, address information may be detected by an in-data handler component 402a configured to provide some or all of the address information to the routing component 404a to detect a protocol address of a next node in a path-based protocol address in the address information.

Address representations 602 in FIGS. 6A-E are described with respect to their inclusion in data units of a network protocol. Each of the address types shown in FIGS. 6A-E may be adapted to be included in a destination protocol address portion and/or a source protocol address portion of an IPv4 packet header and/or of an IPv6 packet header. Each may be identified as a path-based protocol address, by a routing component 404a, by a bit pattern and/or other type identifier defined to identify a protocol address type as a path-based protocol address type. The bit pattern or identifier may be located by the routing component 404a stored in a type bits portion of an IP packet and/or in some other specified location. Those skilled in the art will realize that neither the schemas, which define a format rule(s) and/or a vocabulary rule(s) for a protocol address, described nor the protocols in which their use is described are exhaustive.

FIG. 6A illustrates an address representation 602a that may be detected by an in-data handler component 402a and/or a routing component 404a in a data unit or packet of an Internet Protocol or other network layer protocol. An address representation 602a may identify a path-based protocol address identifying multiple path segments in a network path for transmitting data from a source node to a destination node via the network path. In an aspect, an address representation 602a may be processed by an in-data handler component 402a and/or a routing component 404a as including multiple portions. An address information field 606a may include a path-based protocol address that identifies the destination node and/or the source node. An address separator field 604a is illustrated, in FIG. 6A, including a binary number. The exemplary binary number equals seventeen in FIG. 6A. The value in the address separator field 604a may be defined to identify the size in the address information field 606a of a previous address field 608a to identify the previous address field 608a and a next address field 610a. A routing component 404a, in a current node 504, may process information in a previous address field 608a to identify a previous-current path segment identifier, in the path-based protocol address, that identifies the current node 504 with respect to a previous node in the network path. A routing component 404a may identify, based on information in a next address field 610a, a current-next path segment identifier, in the path-based protocol address, that identifies a next node in the network path. In FIG. 6A previous portion 608a2 may be a path-segment identifier of the current node that identifies a network path in the network path from the source node to the current node. A next portion 610a2 may be a path-segment identifier of a path segment to a next node from the current node. The next node follows the current node in a sequence of nodes in a network path including the current node and the destination node.

Alternatively or additionally, a routing component 404a may identify, based on information in a next address field 610a, a next-current path segment identifier, in the path-based protocol address, that identifies the current node with respect to a next node. A routing component 404a interoperating with an in-data handler component 402 may determine the current-next path segment identifier, that identifies the next node, based on the next-current path segment identifier. In another aspect, a routing component may determine the next-current path segment identifier based on the current-next path segment identifier.

With respect to FIG. 5A, an address representation 602a may be included in a data unit including data from a source node 502a to transmit to a destination node 506a. An address information field 606a may include a path-based protocol address that identifies the sequence 1.2.2.3.2 that, in the data unit, identifies the destination node 506a. Note that the source node 502a is illustrated in a first region 510a1 in the network 500a. A first scope-specific address space may be specific to the first region 510a1. The sequence 1.2.2.3.2 may be represented in an address information field 606a to identify a protocol address that, in the first scope-specific address space, identifies the destination node 506a. Further, the sequence may be included in a path-based protocol address that identifies the destination node 506a in a data unit including data sent from the source node 502a.

In an aspect of the method illustrated in FIG. 2, address information in a data unit may identify a source-destination path-based protocol address that identifies a destination node with respect to a source node. Alternatively, or additionally the address information may identify a destination-source path-based protocol address that, with respect to the destination node, identifies the source node. A current-next path segment identifier may be included in at least one of the source-destination protocol address and the destination-source protocol address. The current-next path segment identifier may include one or more of a nested protocol address; a scope-specific protocol address that, in a current scope-specific address space specific to a current region including a current node, identifies a next node with respect to the current node; and a path-based protocol address that identifies a network path from the current node to the next node.

At the source node 502a, the address separator field 604a may be set to include a size of zero for a previous address field 608a. The address information field 606a, thus, includes a next address field 610a at the source node 502a and identifies the destination node 506a with respect to nodes in the first region 510a1 by identifying a specific network path included in transmitting data from the source node 502a to the destination node 506a.

At a first path node 504a1, outside the first region 510a1, an address separator field 604a in a data unit including the data from the source node 502a, may include a value of 1 that identifies, in a previous address field 608a, a previous-current path segment identifier, in destination protocol address, identifies the first path node 504a1. A routing component 404a in a first path node 504a1 may detect the value. The routing component 404a may also identify, based on the value in the address separator field 604a, a next address field 610a that identifies 2.2.3.2 as a current-next path segment identifier that, in the destination protocol address, also identifies the destination node 506a. The routing component 404a may detect the current-next path segment identifier.

At the destination node 506a a data unit including the data from the source node 502a may include a value in an address separator field 604a that indicates that the address information field includes only a previous address field 608a identifying the network path 1.2.2.3.2, which is included in the destination path-based protocol address.

In another aspect, the method illustrated in FIG. 2 may include detecting, in a data unit by a current node, address-separating information specified according to a network protocol to detect the next address information and/or the previous address information. The address separating information may be updated in a next data unit for identifying, by the next node, at least one of next-previous path segment identifier and next-next path segment identifier in the address information, wherein the next-previous address information includes a path segment identifier that identifies the current node as a previous node. In yet another aspect, address separating information may be updated in a data unit received by a current node to identify, by the current node, the previous address information and the next address information in the address information. As the data from the source node 502a is transmitted from node to node in the network path the value represented in an address separator field 604a in an address representation 602a in a data unit including the data or a portion thereof may be adjusted to identify a path segment identifier in a path-based protocol address to identify a next node for each node operating as a current node in the network path.

The above description describes an address representation 602a processed in the role of a destination path-based protocol address in a data unit of a network protocol, such as a version of the internet protocol. An address information field 606a may include source address information sent in one or more data units included in sending data from a source node to a destination node. Returning to FIG. 5A, a data unit including data sent from the source node 502a to the destination node 506a may include source address information including a representation of a source path-based protocol address in an address information field 606a. At the second path node 504a2, an address separator field may identify a previous address field 608a identifying the sequence 0.0 that identifies a path segment identifier that, in the source path-based protocol address, identifies the source node 502a to the second path node 504a2. Note that the address 0.0 identifies the source node 502a node to all nodes in the second region 510a2 that communicate with the source node 502a via data units of the network protocol and may be an address in a scope-specific address space specific to the second region 510a2. The address information field 606a including the source address information at the second path node 504a2 may include a next address field 610a, identified by the address separator field 604a, identifying the sequence 0.1.0 that identifies a path segment identifier, in the source path-based protocol address, that identifies the second path node 504a2 to the destination node 506a.

FIG. 6B illustrates a variant of the address type illustrated in FIG. 6A. Instead of or in addition to including an address separator field that distinguishes a previous address field from a next address field based on a size, a bit-mask may be specified as one or more address separator fields 604b to identify a previous address field 608b and a next address field 610b in an address information field 606b in an address representation 602b of a data unit formatted according to a particular network protocol, such as IP or IPX. Address information formatted as illustrated in FIG. 6B may be processed by a routing component 404a interoperating with an in-data handler component 402a in an analogous manner to that described for the address information in FIG. 6A based on the bit mask address separator field(s) 604b rather than and/or in addition to a size address separator field 604a illustrated in FIG. 6A.

As described above and further described below, a path-based protocol address may include and/or may otherwise be based on path information for a network path included in communicatively coupling a pair of nodes in a network. Detecting a path-based protocol address and/or a protocol address in a path-based protocol address may include determining path information identifying a network path included in communicatively coupling a pair of path end nodes included in transmitting data from a source node to a destination node.

FIG. 6C illustrates an address representation 602c identifying a path-based protocol address including path information that may be detected by a routing component 404a. An address information field 606c may include a path-based protocol address that may be interpreted as including a network path identifier based on address separator field(s) 604c in a data unit. Address separator fields are specified according to a network protocol to distinguish one path segment identifier from another path segment identifier in an address information field 606c. Each path segment identifier and/or group of consecutive path segment identifiers may be a representation of a protocol address of the network protocol of a data unit including an address representation 606c.

In an aspect, illustrated in FIG. 6C, a routing component 404a and/or an in-data handler component 402a may distinguish hop identifiers, since a single hop is a network path and/or a path segment. A routing component 404a may distinguish separate hop identifiers based on changes in values in bits of consecutive address separator fields 604c. In FIG. 6C, a first address separator field 604c1 includes one or more 1-valued bits that correspond to bit positions in the address information field 606c to identify a previous address field referred to in FIG. 6C as a first hop information field. Network paths that include more than one hop may be distinguished similarly as shown in FIG. 6B. Combinations of hop identifiers and path segment identifiers may be distinguished by a routing component 404a and/or an in-data handler component 402a based on information in address separator fields 604. The routing component 402a may detect protocol addresses that correspond to the various combinations of hop identifiers and/or path segment identifiers. A second hop information field 604c2, in FIG. 6C, includes two 0-valued bits to identify a second hop information field in address information field 606c. Additional alternating sequences of 1-valued bits and 0-valued bits illustrated by address separator fields 604c3-12c correspond to and identify other hop information fields identifying hops in a network path communicatively coupling a source node 502 and a destination node 506.

Path information may include hop information identifying a hop. Next address information may be defined by a network protocol to include next path information identifying a current-next path identifier of a next network path included in communicatively coupling a current node and destination node. Alternatively or additionally, previous address information may be defined by the network protocol to include previous path information identifying a previous-current path segment identifier of previous network path included in communicatively coupling the current node and the source node. Next path information may include next hop information identifying a hop in the next network path. Previous path information may include previous hop information identifying a hop in the previous network path. A network protocol may define a hop identifier to be a valid protocol address that identifies a protocol endpoint.

In FIG. 5C, a hop may be identified by an interface identifier that may identify directly and/or indirectly one or more network interfaces in a pair of communicatively coupled nodes included in the hop. For example, the number 1 may serve as a hop identifier specific to a second path node 504c2 to identify a third hop 512c3 including the second path node 504c2 and a fourth path node 504c4. The number 1 may also identify a network path for exchanging data between the two nodes. The number 1 may also be a protocol address that, in a path-based protocol address identifying a destination node in a data unit including data from a source node, identifies the fourth path node 504c4 in a network path from the source node to the destination node. The number 1 may also identify a hop for the fourth path node 504c4 to exchange data with the second path node 504c2 and may also be a protocol address that identifies the second path node 504c2 and identifies a particular network interface of the second path node 504c2 in a data unit sent from the fourth path node 504c4.

A source node 502c may identify a destination node 506c by a destination path-based protocol address. The protocol address may be based on a sequence of hop identifiers 0.1.3.2.3.0.51. Note that other network paths are illustrated for transmitting data from the source node 502c to the destination node 506c and may also identify path-based protocol addresses that identify the destination node 506c to the source node 502c.

A seventh path node 504c7 in the identified network path may identify the destination node 506c based on another sequence of hop identifiers 3.0.51 that identifies a path segment. The sequence of hop identifiers may identify a protocol address that, in the destination path-based protocol address, identifies the destination node 506c. Note that a routing component 404a operating in the seventh path node 504c7 may detect the path segment identifier sequence 3.0.51, in and/or otherwise based on the path-based protocol address of the destination node 506c. Further, the routing component 404a may detect a path segment identifier for the eighth path node 504c8 as well as a path segment identifier for the ninth path node 504c4, in and/or otherwise based on the protocol address based on the path segment identifier 3.0.51.

The destination node 506c is illustrated in a third region 510c3. Within the third region 510c3, the destination node 506c may be identified by a local scoped address 51, which identifies a path segment. Nodes in the third region 510c3 may identify nodes outside the third region 510c3 by path-based protocol addresses, and may use local scoped addresses to identify nodes in the third region 510c3.

The hop identifiers 0.1.3.2.3.0.51 may be represented in a path-based protocol address in an address representation 602c in a data unit included in sending data from the source node 502c to the destination node 506c. At the seventh path node 504c7, a routing component 404a may determine and/or otherwise detect a path segment identifier identifying a network path to a next node based on a next address field identifying the path segment identifier 3.0.51 in the path-based protocol address. The identifiers may be given a bit or binary representation and the hop identifiers may be distinguished or separated via address separator fields 604c as described above with respect to FIG. 6C. An address separator field analogous to that shown in FIG. 6A may also or alternatively be included and processed as described above. Assignment of hop identifiers is described in application Ser. No. 13/727,649 filed on 2012 Dec. 27, entitled “Methods, Systems, and Computer Program Products for Assigning an Interface identifier to a Network Interface”, application Ser. No. 13/727,655 filed on 2012 Dec. 27, entitled “Methods, Systems, and Computer Program Products for Determining a Shared identifier for a Hop in a Network”.

Note that the address information that identifies one or more path segment identifiers for the seventh path node 504c7 and for the destination node 506c in the preceding description may include information to identify a return path or a portion thereof. For example, the path-based protocol address 3.0.51 includes the path segment identifier 0.3, which may be included in a path-based protocol address that identifies the seventh path node nodes in the third region 510c3 and may be path-based protocol address that identifies the seventh path node 504c7 to the ninth path node 504c9. The path-based protocol address 0.1.3.2 includes another path-based protocol address 2.3.1 that identifies a network path from the seventh path node 504c7 to a node having a network interface in first region 510c1, illustrated by a second path node 504c2.

Separate source address information may be included in a data unit received by the seventh path node 504c7 that includes data sent from the source node 502c. Address information in the data unit may include a source path-based protocol address representation 602c that may identify 2.3.1.101 as a protocol address that identifies the source node 502c. Note that 101 may identify a hop in the first region 510c1 from the second path node 504c2 to the source node 502c, in some aspects. For example, subnet 514c1 may be a LAN. In another aspect, 101 may be a scoped address that identifies the source node 502c in the scope of the first region 510c1. Thus, a path-based protocol address may include a scoped address, which may identify a path segment.

FIG. 6D includes an address representation 602d illustrating a schema for representing a path-based protocol address including path information based on identifiers of network interfaces included in a hop and/or in path end nodes in a network path. A routing component 404a and/or an in-data handler component 402a may operate based on the schema or a portion of the schema. An address information field 606d includes a path-based protocol address to identify a network path to communicatively couple a pair of path end nodes. FIG. 6D illustrates that an address representation 602d may include one or more address separator fields 604d that correspond to and/or otherwise identify respective one or more portions of the address information field 606d that are based on one or more pairs of identifiers of network interfaces of path end nodes. An address separator field 604d includes series of 1-valued bits and 0-valued bits. A change from a 1-valued bit to a 0-valued bit and vice versa may indicate, to a routing component 404a and/or an in-data handler component 402a, a boundary separating interface identifiers. Since a protocol address may consist of a single hop, a pair of interface identifiers corresponding to an address separator portion 604d may identify network interfaces in a hop identified in a protocol address. An address separator field 604d1 includes one 0-valued bit followed by four 1-valued bits. The 0-valued bit may be defined to indicate that a first network interface in a first hop identifier is 1 bit long with a corresponding position in the address information field 606d. FIG. 6D identifies the first interface identifier as the number 1 in base ten. The four 1-valued bits in the first address separator field 604d1 may be similarly defined to identify the location of a second interface identifier in the first hop identifier. The second interface identifier, as illustrated in FIG. 6D, has the value 10 in base ten. The first hop identifier includes the numbers 1 and 10. A second hop identifier is located by the end of the series of four 1-valued bits in the first address separator field 604d1 to a series of three 0-valued bits that identify a boundary of a second address separator field 604d2 for second hop information identifying a second hop identifier, and the three 0-valued bits also identify the location of a first interface identifier in second hop information in the address information field 606d. Two subsequent 1-valued bits identify the location in the address field 606d of a second interface identifier in the second hop information. The second hop identifier includes the numbers 6 and 0 in base ten. The remaining address separator fields 604d may be processed similarly.

The path-based protocol address illustrated FIG. 6D may be represented textually as 1-10.6-0.0-5.1-14.5-0.6. Note that the last hop mask does not identify a pair of identifiers and is similar to address portions identified based on address separator fields 604c described with respect to FIG. 6C or may be a local scoped address. This is illustrated to demonstrate that path-based protocol addresses may be uniform or non-uniform in their format and content. FIG. 6D illustrates that hop identifiers may be protocol addresses with respect to one or both nodes in the respective hops identified by the hop identifiers. A hop identifier may serve as a protocol address to identify a next node in the context of a path node, in a network path, identified the hop. A hop identifier may serve as a protocol address to identify a previous node for a path node in the network path.

In FIG. 5B, a source node 502b may identify a destination node 506b by a destination path-based protocol address, where the path-based protocol address is based on pairs of interface identifiers that identify path segments as described in the previous paragraphs. For example, FIG. 5B illustrates a sequence of pairs of interface identifiers 151-254.151-254.253-105 may be a path-based protocol address that identifies the destination node 506b. The source node 502b may send a data unit including an address representation 602d illustrated in FIG. 6D. Note that reversing the interface identifiers yields the identifier 105-253.254-151.254-151 that may be a path-based protocol address that identifies the source node 502b in a data unit exchanged by the source node 502b and the destination node 506b

For the first path node 504b1, an address representation 602d in a data unit including data received from the source node 502b may include previous address information, identified by a routing component 404a based on one or more address separator fields 604, that identifies the path segment identifier 151-254 and/or that identifies the path segment identifier 254-151. The sequence ordered as 151-254 may be a path segment identifier, in a destination path-based protocol address, that identifies the first path node 504b1. The sequenced ordered as 254-151 may be a path segment identifier, in source path-based protocol address, that identifies the source node.

Further for the first path node 504b1, the address representation 602d may include next address information identified by the routing component 404a based on one or more address separator fields 604d that identify the sequence 151-254.253-105 in a first order and/or in a second order. The sequence 151-254.253-105 in the first order may identify a path-based protocol address that identifies the destination node 506b. The sequence 105-253.254-151 in the second order may identify a path-based protocol address that identifies the first path node 504b1.

Still further, for the first path node 504b1, the next address information identified by the routing component 404a identifies the sequence 151-254 in a first order and/or in a second order. The sequence 151-254 in the first order may be a path segment identifier, in the destination path-based protocol address, that identifies a second path node 504c2 in a network path to the destination node 506b. The sequence 254-151 in the second order may be a path segment identifier, in the source path-based protocol address, that identifies the first path node 504b1. A sequence of hop identifiers based on interface identifiers may serve as a first path-based protocol address when processed in one order of the sequence and may serve as a second path-based protocol address when processed according to another order of the sequence.

FIG. 6E illustrates an address representation 602e that further demonstrates that an address handler component 404a may detect a path segment identifier that identifies a network path to a next node, in a path-based protocol address. An address representation 602e may include portions that include path information and/or portions that include scoped protocol addresses. A routing component 404a may distinguish path segment identifiers in portions of a path-based protocol address based on address separator fields 604e. Address separator fields 604e may be defined to identify path segment identifiers in the portions in a manner similar to the method described for distinguishing hop identifiers in FIG. 6C. A previous address information field 606e1, in FIG. 6E, corresponding to a first address separator field 604e1 includes a single interface identifier for an outbound network interface for the source node 502c as described above with respect to FIG. 6A and FIG. 5C. A next address information field 606e2 corresponding to a second address separator field 604e2 may include a scoped protocol address having an inside scope, an outside scope, or both. A node processing the second address information field 606e2 may be included in a portion of a network spanned by the scope of the scoped protocol address. The node may process the scoped protocol address accordingly. See application Ser. No. 11/962,285, by the present inventor, filed on 2007 Dec. 21, entitled “Methods and Systems for Sending Information to a Zone Included in an Internet Network” for a description of addresses having outside scope and/or inside scope and processing of such addresses. A third address information field 606e3 corresponding to a third address separator field 604e3 may include a pair of identifiers as described with respect to FIG. 6D. A fourth address information field 606e4 corresponding to a fourth address separator field 604e4 may include a path segment identifier as described with respect to the next address information field 606e2 such as a local scoped address.

In FIG. 5B, a source node 502b may be included in a first region that includes network interfaces coupling nodes to a first network 514b1 included in a network 500b. A destination node 506b may be included in a third region that includes network interfaces coupling nodes to a third network 514b3. Each of the two nodes may identify the other by a path-based protocol address. For example, a sequence of local scoped addresses 254.254.105 may be a sequence of path segment identifiers in a protocol address that may identify the destination node 506b to the source node 502b as well as to other nodes in the first region defined by the first network 514b1. A data unit including an address representation 602e in FIG. 6E may identify path segment identifiers based on a sequence of scoped addresses.

For a second path node 504b2, an address representation 602e in a data unit including data received from the source node 502b may include previous address information identified by a routing component 404a in the second path node 504b2 based on one or more address separator fields 604e that identifies a previous path segment identifier 254.254 in previous address information in the address representation 602e. The previous path segment identifier may identify a protocol address that identifies the second path node 504b2. Further, for the second path node 504b2, the previous address information identified by a routing component 404a in the second path node 504b2 identifies a first path segment identifier 254 that identifies a network interface of the second path node 504b2 to nodes with network interfaces in the second network 514b2. Yet further for the second path node 504b2, the address representation 602e may include next address information identified by the routing component 404a in the second path node 504b2 based on one or more address separator fields 604e that identifies a scoped address 105. The scoped address 105 in the scope of the third network 514b3 identifies the destination node 506b to nodes with network interfaces in the third network 514b3, such as the second path node 504c2.

Returning to FIG. 2, a block 206 illustrates that the method yet further includes determining, based on the current-next path segment identifier, a current-next network interface that is included in the current-next path segment. Accordingly, a system for routing based on a path-based protocol address includes means for determining, based on the current-next path segment identifier, a current-next network interface that is included in the current-next path segment. For example, the arrangement illustrated in FIG. 3, includes the forwarding component 306 that is operable for and/or otherwise is included in determining, based on the current-next path segment identifier, a current-next network interface that is included in the current-next path segment; and. FIGS. 4A-C illustrate forwarding components 406 as adaptations and/or analogs of the forwarding component 306 in FIG. 3. One or more forwarding components 406 operate in an execution environment 401.

In FIG. 4A, a routing component 404a may provide a path segment identifier of a network path to a next node and/or forwarding information based on the path segment identifier to a forwarding component 406a to determine a network interface to send data from a source node 502 to a destination node 506 via a next node in a network path from a current node 504 including the forwarding component 406a. In FIG. 4A, a forwarding component 406a is illustrated operatively coupled to a network layer component 403a and operatively coupled to the routing component 404a.

In an aspect, determining a next network interface based on a path segment identifier of a next node may include detecting an interface identifier in the path segment identifier. In FIG. 5C, data in a data unit may be received by the seventh path node 504c7 from the source node 502c. Address information in the data unit may identify the destination node 506c via a protocol address 0.1.3.2.3.0.51 representing a sequence of hops in a network path including the source node 502c and the destination node 506c.

As described above, the routing component may determine that a path segment identifier based on the sequence 3.0.51 identifies a network path to the destination node 506c. Further, the hop identifier 3 may be a path segment identifier identifying a network path to the eighth path node 504c8 as a next node. The number 3, as described above is assigned to identify a hop including the seventh path node 504c7 and the eighth path node, and thus identifies a network interface, in the seventh path node 504c7, that is included in the hop.

Identifying a next network interface may include performing a mapping and/or lookup that maps a portion of a path segment identifier identifying a network path to a next node to an identifier that identifies a NIC 405a to a link layer component 407a. A next network interface may be identified by mapping a path segment identifier to a link layer address by means of a lookup table or record associating the path segment identifier with the link layer address.

A path-based protocol addresses illustrated in any of FIGS. 6A-E may include a path segment identifier identifying network path to next nodes. In some aspects, a path segment identifier of a network path to a next node includes an identifier of a network interface for transmitting data to a destination protocol address via a network path that includes the network path to the next node identified by the path segment identifier. Routing tables and/or routing policies are not required when protocol addresses include path segment identifiers.

Returning to FIG. 2, a block 208 illustrates that the method yet further includes sending, via the current-next network interface, the data to the next node. Accordingly, a system for routing based on a path-based protocol address includes means for sending, via the current-next network interface, the data to the next node. For example, the arrangement illustrated in FIG. 3, includes the out-data handler component 308 that is operable for and/or otherwise is included in sending, via the current-next network interface, the data to the next node. FIGS. 4A-C illustrate out-data handler components 407a as adaptations and/or analogs of the out-data handler component 308 in FIG. 3. One or more out-data handler components 407a operate in an execution environment 401.

In FIG. 4A, a forwarding component 406a may provide data to an out-data handler component 408a to send the data to a next node via an identified network interface identified by forwarding component 406a. The next node may be a destination node 506 or a path node 504 in a network path for transmitting data from a source node 502 to the destination node 506. In FIG. 4A, an out-data handler 406a is illustrated operating in a network layer component 403a. The out-data handler component 402a may include the data in one or more network layer protocol data units including a path-based protocol address, as described above, identifying the destination node 506 according to a network layer protocol of the network protocol component 403a.

The one or more network layer protocol data units may be provided to a link layer component 407a as data to include in one or more link layer protocol data units to transmit via a NIC 405a based on the network interface identified by the forwarding component 406a. In a node with one NIC operatively coupled to a physical data transmission medium or with multiple NICs operatively coupled to the shared data transmission medium, an out-data handler component 408a may send network layer data packets via the one NIC or any of the multiple NICs over the physical data transmission medium for delivery to the destination node 506 according to network interface identified by the forwarding component 406a. Link layer protocol data units may be sent by the link layer component 407a according to a compatible link layer protocol and link layer address information. For example, Ethernet frames may be sent as link layer protocol data units via an Ethernet cable operatively coupled to a NIC 405a1 included in a suitable network path for transmitting the data to the destination node 506.

FIG. 4B illustrates another exemplary execution environment 401b that may include and/or otherwise be provided by a path node 504 in FIGS. 5A-C. In FIG. 4B, the execution environment 401b includes a first line card 409b1 that includes a first NIC 405b1. The first NIC 405b1 may operatively couple the path node 504 to a previous network path with respect to data from a source node 502 to relay to a destination node 506. The execution environment 401b also includes a second line card 409b2 including a second NIC 405b2 to operatively couple the path node 504 to a next network path with respect to the data from the source node 502.

Data sent from a source node 502 to an identified destination node 506 may be received in a data unit of a network protocol by the first NIC 405b1 in the path node 504. The data may be detected by an in-data handler component 402b1 operatively coupled to the first NIC 405b1. A path-based protocol address may be detected in an address representation included in the data unit according to the network protocol. The in-data handler component 402b1 may send the some or all of the path-based protocol address to a routing component 404b via an internal communications medium 421b, such as a bus 116 in FIG. 1, to determine a path segment identifier, in a path-based protocol address, that identifies a next node. The routing component 404b may include, be processed by, and/or otherwise interoperate with a general processing unit 419b and/or other hardware in processing the address information. A routing component 404b may be included, in some aspects, to also process protocol addresses that do not include an identifier of the next network interface component or for routing IP addresses from global address spaces as currently specified by RFC 791 and RFC 3513.

The routing component 404b may determine the path segment identifier of the next node as describe above and/or in an analogous manner. The routing component 404b may provide some or all of the path segment identifier to a forwarding component 406b. The forwarding component 406 may identify a second line card 409b2 including a second NIC 405b2, based on some or all of the path segment identifier. The forwarding component 406b may interoperate with the GPU 419b to configure the internal data transmission medium 421b to deliver the data received in the data unit from the first line card 409b1 to the second line card 409b2 for final packaging in one or more data units of the network protocol by an out-data handler component 408b2. The out-data handler component 402b2 may interoperate with a second NIC 405b to transmit the data via a data transmission medium to which the second NIC 405b2 is operatively coupled.

FIG. 4C illustrates still another exemplary execution environment 401c that may include and/or otherwise be provided by a path node 504 illustrated in FIGS. 5A-C. In FIG. 4C, the execution environment 401c includes a first line card 409c1 that includes a first NIC 405c1. The first line card 405c1 may operatively couple the path node 504 to a previous network path with respect to data from a source node 502 to relay to a destination node 506. The execution environment 401c also includes a second line card 409c2 including a second NIC 405c2 to operatively couple the path node 504 to a next network path with respect to the data from the source node 502.

In FIG. 4C, a routing component may be a distributed component. FIG. 4C illustrates that a routing component may be realized as routing agent components 404c included in line cards 409c in a path node 504. A forwarding component may also be distributed as illustrated in FIG. 4C by forwarding agent components 406c included in the line cards 409c. An FA component 406c1 may configure a switch interconnect unit (SIU) 421c to provide a communication channel from a first line card 409c1 to a second line card 409c2 and vice versa, as needed. Each line card 409c may include a switch interface (SI) component 423c to write data to a channel configured in the SIU component 421c and/or to read data from a channel.

A routing agent (RA) component, such as a first RA component 404c1, may identify a path segment identifier based on address information detected by a first in-data handler (IDH) component 402c1. Based on some or all of the path segment identifier, the first FA component 406c1 may identify a next line card 409c, such as the second line card 409c2, to transmit data received from a source node 502 to a next node identified by the path segment identifier as described above with respect to FIG. 4A and FIG. 4B. The first FA 406c1 may setup a channel in the SIU component 421c for communicating the data via a first SI component 423c1 to a second SI component 423c2 of the second line card 409c2. The second SI component 423c2 may read the data communicated via the SIU component 421c and provide the data to a second out-data handler (ODH) component 408c2 in the second line card 409c2 to transmit to the next node. Data may be relayed from the destination node 506 to the source node 502 via a second IDH component 402c2 and a first ODH component 408c1 in an analogous manner.

The following aspects of the method illustrated in FIG. 2 have been described above and illustrated in the drawings identified above.

Detecting the data may include receiving the data in a data unit sent by a previous node based on a previous-current path segment identifier, in the plurality, that identifies the current node with respect to the previous node.

The first path-base protocol address may identify a destination node for receiving the data from a source node, via the current node and the next node, according to the network protocol. The first path-base protocol address may include the plurality in an identified first order that identifies the destination node, and the plurality in an identified second order may be included in a second path-based protocol address for transmitting data from the destination node to the source node in one or more data units of the network protocol. The first order and/or the second order may be identified by sequence information represented separately from the plurality. The current node may be the source node. The next node may be the destination node.

The first path-base protocol address may be a scope-specific protocol address that, in a source scope-specific address space specific to a first region of the network that includes the source node, identifies the destination node included in the network outside the first region. In still another aspect, the first path-base protocol address may be a nested protocol address that includes a protocol address that identifies a node in the network path other than the source node and the destination node.

The current-next path segment identifier may include a local scoped address that identifies the next node in a region of the network that includes both the next network interface of the current node a network interface of the next node for receiving the data. In another aspect, the current-next path segment identifier may be included in a nested protocol address that includes a protocol address that identifies a node in a network path for transmitting the data from the current node to the next node. In an additional aspect, the current-next path segment identifier may be included in a scope-specific protocol address that, in a current scope-specific address space specific to a current region of the network that includes the current node, identifies the next node that is outside the current region.

In yet another aspect, the current-next path segment identifier may include a next hop identifier that identifies a next pair of consecutive nodes in a network path from the current node to the next node for transmitting the data to the next node. One or more of the current node and the next node may be included in the next hop. The next hop identifier may identify the next hop to one or more of the current node and the next node. The next hop identifier may include one or more of a next interface identifier that identifies the network interface and next-current interface identifier that identifies a next-current network interface in the next node for receiving the data. The next hop identifier may be the smallest identifier available, according to a size criterion, in an identifier space for at least one of the current node and the next node.

To the accomplishment of the foregoing and related ends, the descriptions and annexed drawings set forth certain illustrative aspects and implementations of the disclosure. These are indicative of but a few of the various ways in which one or more aspects of the disclosure may be employed. The other aspects, advantages, and novel features of the disclosure will become apparent from the detailed description included herein when considered in conjunction with the annexed drawings.

It should be understood that the various components illustrated in the various block diagrams represent logical components that operate to perform the functionality described herein and may be implemented in software, hardware, or a combination of the two. Moreover, some or all of these logical components may be combined, some may be omitted altogether, and additional components may be added while still achieving the functionality described herein. Thus, the subject matter described herein may be embodied in many different variations, and all such variations are contemplated to be within the scope of what is claimed.

To facilitate an understanding of the subject matter described above, many aspects are described in terms of sequences of actions that may be performed by elements of a computer system. For example, it will be recognized that the various actions may be performed by specialized circuits or circuitry (e.g., discrete logic gates interconnected to perform a specialized function), by program instructions being executed by one or more processors, or by a combination of both. The description herein of any sequence of actions is not intended to imply that the specific order described for performing that sequence must be followed.

Moreover, the methods described herein may be embodied in executable instructions stored in a non-transitory computer readable medium for use by or in connection with an instruction execution machine, system, apparatus, or device, such as a computer-based or processor-containing machine, system, apparatus, or device. As used here, a “non-transitory computer readable medium” may include one or more of any suitable media for storing the executable instructions of a computer program in one or more forms including an electronic, magnetic, optical, and electromagnetic form, such that the instruction execution machine, system, apparatus, or device may read (or fetch) the instructions from the non-transitory computer readable medium and execute the instructions for carrying out the described methods. A non-exhaustive list of conventional exemplary non-transitory computer readable media includes a portable computer diskette; a random access memory (RAM); a read only memory (ROM); an erasable programmable read only memory (EPROM or Flash memory); optical storage devices, including a portable compact disc (CD), a portable digital video disc (DVD), a high definition DVD (HD-DVD™), and a Blu-ray™ disc; and the like

Thus, the subject matter described herein may be embodied in many different forms, and all such forms are contemplated to be within the scope of what is claimed. It will be understood that various details may be changed without departing from the scope of the claimed subject matter. Furthermore, the foregoing description is for the purpose of illustration only, and not for the purpose of limitation, as the scope of protection sought is defined by the claims as set forth hereinafter together with any equivalents.

All methods described herein may be performed in any order unless otherwise indicated herein explicitly or by context. The use of the terms “a” and “an” and “the” and similar referents in the context of the foregoing description and in the context of the following claims are to be construed to include the singular and the plural, unless otherwise indicated herein explicitly or clearly contradicted by context. The foregoing description is not to be interpreted as indicating that any non-claimed element is essential to the practice of the subject matter as claimed.

FIG. 8 illustrates an arrangement of components in a system that operates in an execution environment, such as execution environment 102 in FIG. 1. The arrangement of components in the system operates to perform the method illustrated in FIG. 7. The system illustrated includes a hop manager component 802, an address space director component 804, and a topology component 806. The execution environment includes a processor, such as the processor 104, to process an instruction in at least one of the hop manager component 802, the address space director component 804, and the topology component 806.

With reference to FIG. 7, a block 702 illustrates that the method includes identifying a first hop identifier that is, for a first node in a network, an identifier of a first hop that includes a pair of consecutive nodes in a network path in the network. Accordingly, a system for determining a protocol address for a node includes means for identifying a first hop identifier that is, for a first node in a network, an identifier of a first hop that includes a pair of consecutive nodes in a network path in the network. For example, the arrangement illustrated in FIG. 8, includes a hop manager component 802 operable for and/or otherwise included in identifying a first hop identifier that is, for a first node in a network, an identifier of a first hop that includes a pair of consecutive nodes in a network path in the network.

In an aspect, hop information may be received in an exchange between a first node in a hop and one or more of a second node in the hop and a third node in the network. A hop may be detected in response to exchanging and/or otherwise receiving the hop information.

Further, hop information for a network protocol may be detected by detecting an active protocol end point, such as a TCP port, for the network protocol and/or any network protocol included in activating the protocol endpoint.

Hop information may be received in response to a user input detected by an input device. In an aspect, the hop information may be included in topology information that identifies a network topology or part of a network topology. In FIG. 5A, the third edge node 508a3 as described above may host a topology service that maintains network topology information. Such a node may be referred to as a topology node. Some or all of the network topology information may be received via an input device in response to a user input. A user may provide, via one or more input devices, hop information that identifies one or more of the first path node 504a1, the second path node 504a2, and a communicative relationship that identifies the hop.

Hop information for a hop may be exchanged and/or received in response to detecting a change in a state of an operable coupling between a network and a network interface included in the hop and included in a node in the hop. Detecting the change may include detecting that the state indicates that the operable coupling is inoperative and subsequently detecting that the state indicates the operable coupling is operative. Detecting the change may include detecting that the state indicates that the operable coupling is operative and subsequently detecting that the state indicates the operable coupling is inoperative.

Hop information may identify an interface identifier that identifies at least one of a first network interface by which a first node is included in a hop and a second network interface by which a second node is included in the hop.

Determining that a hop identifier meets an identified hop identifier criterion may include determining that the hop identifier is the smallest, available hop identifier in an identifier space of hop identifiers.

Determining that a hop identifier meets an identified hop identifier criterion may include identifying a threshold condition that is based on the hop identifier criterion. The determining may further include detecting that the threshold condition is met by the hop identifier. The hop identifier may be determined in response to detecting that the threshold condition is met. A threshold condition may be evaluated based on a count of network interfaces included in one or more nodes in a hop, a size of a location in a data storage medium to store a hop identifier, a size of a representation of a hop identifier in a signal propagated by a specified data transmission medium, a size of a hop identifier included in a protocol address in a data unit that is valid according to a network protocol, and/or a time period to process a hop identifier included in a protocol address, to name a few examples.

A hop identifier criterion may specify and/or otherwise identify some or all of a schema that defines a valid format and/or a valid vocabulary for a representation of a hop identifier when included in a protocol address identifying a protocol endpoint of a network protocol. In an aspect, the schema may specify and/or otherwise identify a format rule defining a valid size of the representation in the protocol address included in a data unit of the network protocol. A size specified by a schema may identify a maximum size for a representation of a hop identifier. A size specified by a schema may identify a minimum size for a representation of a hop identifier. A size may identify an optimum or preferred size, based on a specified criterion, for a representation of a hop identifier. A size specified by a schema may identify a maximum size for an interface identifier included in a hop identifier. A size specified by a schema may identify a minimum size for an interface identifier included in a hop identifier. A size may identify an optimum or preferred size, based on a specified criterion, for an interface identifier included in a hop identifier.

A hop identifier may be based on one of more network interfaces in nodes in the hop. More generally a hop identifier may be based on one or more network interfaces in one more nodes for which a hop identifier serves to identify a particular hop. Thus, with respect to the method in FIG. 7 the first hop identifier may be identified based on one or more of a first network interface in the first node and a second network interface in a node in the first hop, and/or a network interface in a node in a network path that from the first node to a node in the first hop. Further, with respect to the method in FIG. 7, the first hop identifier may include a path identifier that identifies a network path included in communicatively coupling the first node to a node in the first hop. The first hop identifier of FIG. 7 may include a protocol address for the network protocol that at least one of identifies the first node to a node in the hop and identifies a node in the hop to the first node.

Returning to FIG. 7, block 704 illustrates that the method further includes receiving a first protocol address that for a network protocol at least one of identifies the first node to a second node in the network and identifies the second node to the first node, wherein the second node is not in the first hop. Accordingly, a system for determining a protocol address for a node includes means for receiving a first protocol address that for a network protocol at least one of identifies the first node to a second node in the network and identifies the second node to the first node, wherein the second node is not in the first hop. For example, the arrangement illustrated in FIG. 8, includes an address space director component 804 operable for and/or otherwise included in receiving a first protocol address that for a network protocol at least one of identifies the first node to a second node in the network and identifies the second node to the first node, wherein the second node is not in the first hop.

Returning to FIG. 7, a block 706 illustrates that the method yet further includes determining, based on the first protocol address and the first hop identifier, a second protocol address that for the network protocol at least one of identifies, to the second node, a node in the first hop that is not the first node and identifies the second node, to a node in the first hop, that is not the first node. Accordingly, a system for determining a protocol address for a node includes means for determining, based on the first protocol address and the first hop identifier, a second protocol address that for the network protocol at least one of identifies, to the second node, a node in the first hop that is not the first node and identifies the second node, to a node in the first hop, that is not the first node. For example, the arrangement illustrated in FIG. 8, includes an topology component 806 operable for and/or otherwise included in determining, based on the first protocol address and the first hop identifier, a second protocol address that for the network protocol at least one of identifies, to the second node, a node in the first hop that is not the first node and identifies the second node, to a node in the first hop, that is not the first node.

In a further aspect, a hop identifier may identify a hop to a node where the node is not in the hop.

As described above, one or more nodes in a network 500, as illustrated in FIGS. 5A-C, may individually or cooperatively operate to perform the method of FIG. 7. An adaptation, analog, and/or instance of the arrangement of components in FIG. 8 may operate in a topology service that includes a topology node in a network. Hop information and protocol addresses may be detected and/or reported to the topology node. The topology node may create, update, and/or otherwise maintain a representation of a topology of some or all of a network. The topology node may be included in a group of topology nodes in a topology service or system. Each of the topology nodes may maintain a representation of a topology for a portion of the network and/or for the entire network. As used herein, the term topology node is used interchangeably with the term topology execution environment, which is an execution environment that hosts a topology service or a portion thereof. A topology execution environment may include and/or otherwise be hosted by one or more nodes.

In an aspect, a topology system may include topology nodes organized as a hierarchy of topology nodes that maintain a hierarchy of the representations of respective portions of a topology of a network. In another aspect, topology nodes may operate in a peer-to-peer system.

In yet another aspect of the method, in FIG. 7, the second protocol address may be associated with a symbolic identifier of one of the path end nodes of the network path. The symbolic identifier may be resolved to the second protocol address and vice versa.

With reference to FIG. 9, a block 902 illustrates that the method includes detecting, by a current node in a network, data in a data unit that is specified according to a network protocol and that includes a first protocol address including a plurality of other protocol addresses. Accordingly, a system for routing based on a nested protocol address includes means for detecting, by a current node in a network, data in a data unit that is specified according to a network protocol and that includes a first protocol address including a plurality of other protocol addresses. For example, the arrangement illustrated in FIG. 3, includes the in-data handler component 302 operable for and/or otherwise included in detecting, by a current node in a network, data in a data unit that is specified according to a network protocol and that includes a first protocol address including a plurality of other protocol addresses. FIGS. 4A-C illustrate in-data handler components 402 as adaptations and/or analogs of the in-data handler component 302 in FIG. 3. One or more in-data handler components 402 operate in an execution environment 401. In FIG. 4A, an in-data handler component 402a is included in network layer component 403a. In FIG. 4B and in FIG. 4C, in-data handler components 402 operates in respective line card components 409.

Returning to FIG. 9, a block 904 illustrates that the method further includes detecting a current-next protocol address in the plurality that identifies a next node with respect to the current node. Accordingly, a system for routing based on a nested protocol address includes means for detecting a current-next protocol address in the plurality that identifies a next node with respect to the current node. For example, the arrangement illustrated in FIG. 3, includes the routing component 304 operable for and/or otherwise included in detecting a current-next protocol address in the plurality that identifies a next node with respect to the current node. FIGS. 4A-C illustrate routing components 404 as adaptations and/or analogs of the routing component 304 in FIG. 3. One or more routing components 404 operate in an execution environment 401.

Returning to FIG. 9, a block 906 illustrates that the method yet further includes determining, based on the current-next protocol address, a next network interface. Accordingly, a system for routing based on a nested protocol address includes means for determining, based on the current-next protocol address, a next network interface. For example, the arrangement illustrated in FIG. 3, includes the forwarding component 306 operable for and/or otherwise included in determining, based on the current-next protocol address, a next network interface. FIGS. 4A-C illustrate forwarding components 406 as adaptations and/or analogs of the forwarding component 306 in FIG. 3. One or more forwarding components 406 operate in an execution environment 401.

Nested protocol addresses illustrated in FIGS. 6A-E may include protocol addresses that identify a next node. In some aspects, a protocol address of next node includes an identifier of a network interface to transmit data to a destination protocol address via a network path that includes a next node identified by the protocol address. Routing tables and/or routing policies are not required when protocol addresses include identifiers of next nodes. In some aspects, routing tables and routing policies may be supported for some addresses included in destination and/or source protocol address.

Returning to FIG. 9, a block 908 illustrates that the method yet further includes sending, via the next network interface, the data to the next node. Accordingly, a system for routing based on a nested protocol address includes means for sending, via the next network interface, the data to the next node. For example, the arrangement illustrated in FIG. 3, includes the out-data handler component 308 operable for and/or otherwise included in sending, via the next network interface, the data to the next node. FIGS. 4A-C illustrate out-data handler components 408a as adaptations and/or analogs of the out-data handler component 308 in FIG. 3. One or more out-data handler components 408a operate in an execution environment 401.

With reference to FIG. 10, a block 1002 illustrates that the method includes receiving data, via a network from a previous node by a current node via a previous network interface operatively coupling the current node to the network, in a data unit that is specified according to a network protocol and that includes address information. Accordingly, a system for routing based on a scope-specific address space includes means for receiving data, via a network from a previous node by a current node via a previous network interface operatively coupling the current node to the network, in a data unit that is specified according to a network protocol and that includes address information. For example, the arrangement illustrated in FIG. 3, includes the in-data handler component 302 operable for and/or otherwise included in receiving data, via a network from a previous node by a current node via a previous network interface operatively coupling the current node to the network, in a data unit that is specified according to a network protocol and that includes address information. FIGS. 4A-C illustrate in-data handler components 402 as adaptations and/or analogs of the in-data handler component 302 in FIG. 3. One or more in-data handler components 402 operate in an execution environment 401. In FIG. 4A, an in-data handler component 402a is included in network layer component 403a. In FIG. 4B and in FIG. 4C, in-data handler components 402 operates in respective line card components 409.

Returning to FIG. 10, a block 1004 illustrates that the method further includes detecting, based on the address information, a current-next protocol address that, in a current scope-specific address space specific to a current region including the current node, identifies a next node. Accordingly, a system for routing based on a scope-specific address space includes means for detecting, based on the address information, a current-next protocol address that, in a current scope-specific address space specific to a current region including the current node, identifies a next node. For example, the arrangement illustrated in FIG. 3, includes the routing component 304 operable for and/or otherwise included in detecting, based on the address information, a current-next protocol address that, in a current scope-specific address space specific to a current region including the current node, identifies a next node. FIGS. 4A-C illustrate routing components 404 as adaptations and/or analogs of the routing component 304 in FIG. 3. One or more routing components 404 operate in an execution environment 401.

Address representations 602 in FIGS. 6A-E are described with respect to their inclusion in data units of a network protocol. Each may be identified as scope-specific, by a routing component 404a, by a bit pattern or identifier defined to identify a protocol address type as a scope-specific address type. The bit pattern or identifier may be located by the routing component 404a stored in a type bits portion of an IP packet and/or in some other specified location.

Alternatively or additionally, a routing component 404a may identify, based on information in a next protocol address field 610a, a current protocol address, that, in a next scope-specific address space specific to a next region that includes the next node, identifies the current node. A routing component 404a interoperating with an in-data handler component 402 may determine a next protocol address, in the current scope-specific address space, that identifies the next node, based on the current protocol address. Further, the next scope-specific address space may be a node-specific address space specific to the next node. In another aspect, a routing component may determine the current protocol address based on the next protocol address.

In still another aspect, a scope-specific address may conform to a currently known schema defining a valid Internet Protocol address as specified by RFC 791 and/or RFC 3513 in a scope-specific address spaces specific to a region. The scope-specific address is processed as scope-specific as opposed to interpreting it as included in a global address space as is currently done. In one aspect, a mapping may be specified between two scope-specific address space. In another aspect, a mapping may be specified from a scope-specific address space to a global address space. A mapping may be ruled-based and/or may be specified by associations such as represented by a lookup table.

A routing component 404a in a current node 504 may detect first address information identifying a current-first protocol address that, in a current scope-specific address space specific to a current region that includes the current node 504, identifies a first node in the network. Second address information identifying a first-second protocol address that, in a first scope-specific address space specific to a first region that includes the first node, identifies a second node in a network path including the current node to transmit data from a source node 502 and an identified destination node 506. The routing component 404a operating in the current node 504 may detect a relationship between the current-first protocol address and the first-second protocol address. The routing component 404a may generate a first-to-current mapping rule based on the relationship. The routing component 404a may process the first-second protocol address based on the first-to-current mapping rule to determine a current-second protocol address that, in the current scope-specific address space, identifies the second node in the network path. The second node may be a next node with respect to the current node 504 and the data from the source node 502. The second node may be the destination node 506.

A current-first protocol address 10.22.106.3 from a current scope-specific address space, may serve as an identifier with respect to the current node of a first node in the network. A first-second protocol address 40.88.58.1 in a first scope-specific address space, may serve as an identifier with respect to the first node of a second node. The current-first protocol address and first-second protocol address, in the example, include four parts. A first-first protocol address may be represented as 0.0.0.0 that, in the first scope-specific address spaces identifies the first node. A routing component 404 in the current node 504 may determine that the current-second protocol address, in the current scope-specific address space, for the second node may be calculated based on the mapping rule represented here as 40+10mod256.88+22mod256.106+58/mod256.3+1mod/256, or 50.110.164.4.

The mapping rule may be specific to the current scope-specific address space and the second scope-specific address space, may be specific to an identified group of scope-specific address spaces specific to a respective group of regions, and/or may apply among all scope-specific address spaces in use by nodes in a network. Those skilled in the art will see given the examples than many mapping rules exist that allow protocol addresses to be determined from previous protocol address information and next protocol address information according to the method illustrated in FIG. 10.

A next protocol address and/or a previous protocol address may be determined and/or otherwise identified based on one or more of a schema of one or more of a destination protocol address and/or a source protocol address identified in an address information portion of a data unit, a schema of a scope-specific hop identifier, a mapping between two or more of the schemas or portions thereof of two or more respective scope-specific address spaces, relationships between the nodes to which the protocol addresses are specific, relationships between the scope-specific address spaces of the protocol addresses, and relationships between the nodes in a network that includes them. Some of the relationships listed may be represented in a network topology of the network. A routing component 404 may detect some or all of the network topology in determining a next protocol address and/or a previous protocol address.

Returning to FIG. 10, a block 1006 illustrates that the method yet further includes determining, based on the current-next protocol address, a next network interface operatively coupling the current node to the network. Accordingly, a system for routing based on a scope-specific address space includes means for determining, based on the current-next protocol address, a next network interface operatively coupling the current node to the network. For example, the arrangement illustrated in FIG. 3, includes the forwarding component 306 operable for and/or otherwise included in determining, based on the current-next protocol address, a next network interface operatively coupling the current node to the network. FIGS. 4A-C illustrate forwarding components 406 as adaptations and/or analogs of the forwarding component 306 in FIG. 3. One or more forwarding components 406 operate in an execution environment 401.

For scope-specific protocol addresses that do not include an identifier of a next node, a similar lookup operation may be performed. In an aspect, a scope-specific address may be mapped to another address space such as global protocol address space or subnet-specific protocol address space shared by nodes in a portion of a network such as a LAN and/or a sub-network. Performing a mapping operation may reduce the number of lookup tables and/or records that must be maintained and/or otherwise accessed.

Protocol addresses illustrated in FIGS. 6A-E may include identifiers from scope-specific address spaces that identify a next node. In some aspects, a protocol address of next node includes an identifier of a network interface to transmit data to a destination protocol address via a network path that includes a next node identified by the protocol address. Routing tables and/or routing policies are not required when protocol addresses include identifiers of next nodes. In some aspects, routing tables and routing policies may be supported to support addresses from a global protocol address space and may be supported when a hop identifier identifies a pair of nodes in a network path that are communicatively coupled via one or more other path nodes.

Returning to FIG. 10, a block 1008 illustrates that the method yet further includes sending, via the next network interface, the data to the next node. Accordingly, a system for routing based on a scope-specific address space includes means for sending, via the next network interface, the data to the next node. For example, the arrangement illustrated in FIG. 3, includes the out-data handler component 308 operable for and/or otherwise included in sending, via the next network interface, the data to the next node. FIGS. 4A-C illustrate out-data handler components 407a as adaptations and/or analogs of the out-data handler component 308 in FIG. 3. One or more out-data handler components 407a operate in an execution environment 401.

The following aspects of the method illustrated in FIG. 10 have been described above and illustrated in the drawings identified above. The address information referred to FIG. 10 may include next protocol address information for identifying one or more of the current-next protocol address and a next-current protocol address that, in a next scope-specific address space specific to a next region including the next node, identifies the current node. Further, the address information may include previous protocol address information for identifying at least one of a previous-current protocol address that, in a previous scope-specific address space specific to a previous region that includes the previous node, identifies the current node and a current-previous protocol address that, in the current scope-specific address space, identifies the previous node.

A first hop including a first hop node and a second hop node, both in the network path, may be identified with respect to the previous node by a previous hop identifier in a previous scope-specific address space specific to a previous region that includes the previous node, identified with respect to the current node by a current hop identifier in the current scope-specific address space, and identified with respect to the next node by a next hop identifier in a next scope-specific address space specific to a next region that includes the next node.

The first hop identifier may be assigned from a first scope-specific address space specific to a first region that includes a network interface in the first hop node to identify the first hop in response to a negotiation between the nodes in the first hop.

A current-first path hop identifier that, in the current scope-specific address space, identifies the first hop and the current-first path identifier includes the first hop identifier, wherein the current-first path identifier identifies a network path that includes the current node as a path end node, the first hop node, and the second hop node. The first hop may be included in communicatively coupling the current node and one of the source node and the destination node. The current node may be either the first hop node or the second hop node. The previous-current protocol address may include the first hop identifier or the current-next protocol address may include the first hop identifier.

FIG. 12 illustrates an arrangement of components in a system that operates in an execution environment, such as execution environment 102 in FIG. 1. The arrangement of components in the system operates to perform the method illustrated in FIG. 11. The system illustrated includes an address handler component 1202, an address space director component 1204, and a resolver component 1206. A suitable execution environment includes a processor, such as processor 104, to process an instruction in at least one of the address handler component 1202, the address space director component 1204, and the resolver component 1206.

With reference to FIG. 11, block 1102 illustrates that the method includes detecting first address information that identifies at least one of a first-second protocol address that, according to a network protocol, identifies a second node to a first node in the network and a second-first protocol address that, according to the network protocol, identifies the first node to the second node. Accordingly, a system for identifying a protocol address in a scope-specific address space includes means for detecting first address information that identifies at least one of a first-second protocol address that, according to a network protocol, identifies a second node to a first node in the network and a second-first protocol address that, according to the network protocol, identifies the first node to the second node. For example, the arrangement illustrated in FIG. 12, includes an address handler component 1202 that is operable for and/or otherwise is included in detecting first address information that identifies at least one of a first-second protocol address that, according to a network protocol, identifies a second node to a first node in the network and a second-first protocol address that, according to the network protocol, identifies the first node to the second node.

As described herein, a first node may detect address information that identifies a first-second protocol address that, in a first scope-specific address space specific to a first region that includes the first node, identifies the second node. Alternatively or additionally, the second node may detect address information that identifies a second-first protocol address that, in a second scope-specific address space specific to a second region that includes the second node, identifies the first node to the second node. Alternatively or additionally, the second node may receive address information identifying the first-second protocol address. The second node may determine the second-first protocol address based on the first-second protocol address. Alternatively or additionally, the first node may receive the second-first protocol address. The first node may determine the first-second protocol address based on the second-first protocol address.

Returning to FIG. 11, block 1104 illustrates that the method further includes detecting second address information that identifies at least one of a second-third protocol address that identifies, according to the network protocol, a third node in the network to the second node and a third-second protocol address that identifies, according to the network protocol, the second node to the third node. Accordingly, a system for identifying a protocol address in a scope-specific address space includes means for detecting second address information that identifies at least one of a second-third protocol address that identifies, according to the network protocol, a third node in the network to the second node and a third-second protocol address that identifies, according to the network protocol, the second node to the third node. For example, arrangement illustrated in FIG. 12, includes address space director component 1204 that is operable for and/or otherwise is included in detecting second address information that identifies at least one of a second-third protocol address that identifies, according to the network protocol, a third node in the network to the second node and a third-second protocol address that identifies, according to the network protocol, the second node to the third node.

Returning to FIG. 11, block 1106 illustrates that the method yet further includes determining, based on the first address information and the second address information, a first-third protocol address that, in a first scope-specific address space specific to a first region that includes the first node, identifies the third node according to the network protocol, wherein the third node is outside the first region. Accordingly, a system for identifying a protocol address in a scope-specific address space includes means for determining, based on the first address information and the second address information, a first-third protocol address that, in a first scope-specific address space specific to a first region that includes the first node, identifies the third node according to the network protocol, wherein the third node is outside the first region. For example, the arrangement in FIG. 12, includes resolver component 1206 that is operable for and/or otherwise is included in determining, based on the first address information and the second address information, a first-third protocol address that, in a first scope-specific address space specific to a first region that includes the first node, identifies the third node according to the network protocol, wherein the third node is outside the first region.

As described various types of protocol addresses may conform to various schemas defining rules for formatting valid protocol addresses and/or defining vocabularies specifying valid content of a protocol address. Given first address information identifying a first protocol address and second address information identifying a second protocol address as described above with respect to the method illustrated in FIG. 11, a resolver component may determine a scope-specific first-third protocol address based on one or more of a schema of one or more of the first protocol address, a schema of the second protocol address, a schema of the third protocol address, a mapping between two or more of the schemas or portions thereof, relationships between the nodes to which the protocol addresses are specific, relationships between the scope-specific address spaces of the protocol addresses, and/or relationships between the nodes in a network that includes them. Some of the relationships listed may be represented in a network topology of the network. A resolver component may detect some or all of the network topology in determining the first-third protocol address.

A mapping rule may indicate that addresses in a first scope-specific address space have a one-to-one mapping between the first scope-specific address space and a second scope-specific address space that is based on an addend for each of the four portions of the various addresses, additionally taking the modulus of the result based on a maximum value for each address information field, and determining the absolute value to determine the final result. A third protocol address from the second scope-specific address space may serve to identify a third node in a third region. The second protocol address may be represented as, 200.10.150.33. A resolver component in the first node may determine that a third protocol address that, in the first scope-specific address space, identifies the third node may be calculated based on the mapping rule as “(200+30) mod 256.(10+66) mod 256.(150+198) mod 256.(33+254) mod 256”, or 230.76.92.31.

Nodes may exchange mapping information. In an aspect, the address information may identify a mapping rule when exchanged between nodes. The mapping rule may be determined by second node and sent to a first node. The mapping rule may include mapping information for mapping addresses from the third scope-specific address space to the first scope-specific address space.

As described above and illustrated in the accompanying drawings, the method illustrated in FIG. 11 may include additional aspects supported by various adaptations and/or analogs of the arrangement of components in FIG. 12. With respect to FIG. 11, in one aspect one or more of the first-third protocol address and the third-first protocol address may identify a third network path for exchanging data between the first node and the third node.

In another aspect, detecting the first address information may include detecting first path information identifying a first network path. The first network path includes a first sequence of nodes included in transmitting data between the first node and the second node. Analogously, detecting the second address information may include detecting second path information identifying a second network path. The second network path includes a second sequence of nodes included in exchanging data between the second node and the third node. One or more of the first-third protocol address and the third-first protocol address may be determined based on the first path information and the second path information. The first-third protocol address and/or the third-first protocol address may identify a third network path including a third sequence of nodes included in communicatively coupling the first node and the third node.

In another aspect of the method illustrated in FIG. 11, the first-second protocol address may be in the first scope-specific address space, the second-first protocol address may be in a second-scope-specific address space specific to a second region that includes the second node, the second-third protocol address may be in the second scope-specific address space, and/or the third-second protocol address may be in the third scope-specific address space. One or more of the scope-specific address spaces may be node-specific address spaces specific to the respective one or more of the first node, the second node, and the third node.

Hop information may be exchanged between a first node in a hop and one or more of a second node in the hop and a third node in the network. A hop may be detected in response to exchanging the hop information. In another aspect, hop information may be exchanged in response to detecting a hop.

A hop including pair of nodes may include a first network interface in a first node in the pair and a second network interface in a second node in the pair.

In another, aspect, a first node may be included in a first hop that includes a second node via a first network interface and the first node may be included in a second hop that includes the second node via a second network interface. The two NICs may be associated with different internet protocol addresses. Data units including one of the IP addresses are processed by one of the NICs and data units including the other IP address are processed by the other NIC.

A first node may be included in a first hop along with a second node. The first node may be included in the first hop via a first network interface in the first node. The first node may be included in a second hop including a third node. The first node may be included in the second hop via a second network interface in the first node.

A first node and a second node may be included in a first hop in a first network path from a source node to a destination node. The first node may be included in the first hop via a first network interface in the first node included in communicatively coupling the first node and the second node. The first node and the second node may be included in a second hop in a second network path from the source node to the destination node. The first node may be included in the second hop via a second network interface in the first node included in communicatively coupling the first node and the second node.

Hop information for a hop may be exchanged in response to detecting a change in a state of an operable coupling between a network and a network interface included in the hop and included in a node in the hop. Detecting the change may include detecting that the state indicates that the operable coupling is inoperative and subsequently detecting that the state indicates the operable coupling is operative. Detecting the change may include detecting that the state indicates that the operable coupling is operative and subsequently detecting that the state indicates the operable coupling is inoperative.

A network protocol may be specified to exchange data between and/or among nodes that include hop agent components to determine whether certain network interfaces in the nodes are operative or inoperative. The protocol may include and/or be an extension of one more existing protocols such as the address resolution protocol (ARP), the dynamic host configuration protocol (DHCP), and/or any of numerous network protocols for announcing and/or detecting the presence of a node, a network interface, and/or other resource on a network. The protocol may be a yet unspecified protocol to count network interfaces in a region of a network.

An interface identifier included in hop information for a hop including a pair of nodes may be specified according to the requirements of a network protocol. The network protocol may be a network layer protocol, such the IPv4 and/or IPv6 protocols. The interface identifier may identify at least one node in a hop to the other. The interface identifier may be suitable to include in a data unit of a network protocol to transmit data in the data unit between the nodes in the hop. Hop information for a hop may be exchanged in more than one communication sent and/or received by a node in the hop.

Determining a hop identifier for a hop may include determining the hop identifier based on an interface identifier that identifies at least one network interface in the hop. The interface identifier may identify at least one of a first network interface in a first node in the hop and a second network interface in a second node in the hop to at least one of the first node and the second node.

A hop identifier for a hop may be based on a first interface identifier that identifies a first network interface in a first node in the hop and/or may be based on a second interface identifier that identifies a second network interface in a second node in the hop. The first interface identifier may identify the first network interface to one or both of the nodes in the hop. The second interface identifier may identify the second network interface to at least one of the first node and the second node. The hop identifier may include the first interface identifier and/or the second interface identifier.

FIG. 14 illustrates an arrangement of components in a system, that operates in an execution environment, such as execution environment 102 in FIG. 1. The arrangement of components in the system operates to perform the method illustrated in FIG. 13. The system illustrated includes a path detector component 1402, an address space director component 1404, and a path composer component 1406. A suitable execution environment includes a processor, such as processor 104, to process an instruction in at least one of the path detector component 1402, the address space director component 1404, and the path composer component 1406.

Some or all of the exemplary components illustrated in FIG. 14, their adaptations, and/or their analogs may operate in a number of execution environments to perform the method illustrated in FIG. 13.

With reference to FIG. 13, block 1302 illustrates that the method includes detecting first path information that identifies a first sequence of nodes in a first network path for transmitting data between a first node and a second node in a network. Accordingly, a system for identifying a protocol address based on path information includes means for detecting first path information that identifies a first sequence of nodes in a first network path for transmitting data between a first node and a second node in a network. For example, in the arrangement in FIG. 14, detecting first path information that identifies a first sequence of nodes in a first network path for transmitting data between a first node and a second node in a network is performed via operation of the path detector component 1402.

Returning to FIG. 13, block 1304 illustrates that the method further includes detecting second path information that identifies a second sequence of nodes in a second network path for transmitting data between the second node and a third node in the network. Accordingly, a system for identifying a protocol address based on path information includes means for detecting second path information that identifies a second sequence of nodes in a second network path for transmitting data between the second node and a third node in the network. For example, as illustrated in FIG. 14, detecting second path information that identifies a second sequence of nodes in a second network path for transmitting data between the second node and a third node in the network is performed via operation of the address space director component 1404.

As described above and further below, path information for a network protocol may be detected in a data unit of the network protocol. The path information may be detected by a node transmitting the data unit and/or may be detected by a node receiving the data unit.

In another aspect, a message may be sent to a network directory service to register a name or symbolic identifier for a node and/or a network interface of a node. The network directory service may associate the symbolic identifier with address information, which as described herein may be path information. Path information may be detected in the registration message and/or in one or more data units of a network protocol for which an association is to be created and/or otherwise maintained by a network directory service. Further, a response to the registration message may be exchanged between the registering node and the network directory service node. The response message and/or one or more data units included in transmitting the response may include and/or otherwise identify path information that may be detected by either node. Nodes in a network path transmitting the response and/or the registration request may detect path information in one or more data units received and/or sent in relaying some or all of one or both messages. Still further, a node may send a symbolic identifier to a network directory service in a resolve message in order to resolve the symbolic identifier to a protocol address of a node and/or a network interface identified by the symbolic identifier. Path information may be detected in the resolve message and/or in one or more data units of a protocol that the symbolic identifier is associated with in an association maintained by a network directory service. Further, a response to the resolve message may be exchanged between the requesting node and the network directory service node. The response message and/or one or more data units included in transmitting the response may include and/or otherwise identify path information that may be detected by either node. Nodes in a network path transmitting the response and/or the registration request may detect path information in one or more data units that they receive and/or send in relaying some or all of one or both messages.

Returning to FIG. 13, block 1306 illustrates that the method yet further includes determining, based on the first path information and the second path information, a first-third protocol address that identifies, according to a network protocol, the third node to the first node for transmitting data from the first node to the third node. Accordingly, a system for identifying a protocol address based on path information includes means for determining, based on the first path information and the second path information, a first-third protocol address that identifies, according to a network protocol, the third node to the first node for transmitting data from the first node to the third node. For example, as illustrated in FIG. 14, determining, based on the first path information and the second path information, a first-third protocol address that identifies, according to a network protocol, the third node to the first node for transmitting data from the first node to the third node is performed via operation of path composer component 1406.

With respect to the method in FIG. 13 and as described above, a first-second protocol address that identifies the second node with respect to the first node may be determined and/or otherwise identified based on the first path information. Alternatively or additionally, a second-first protocol address that identifies the first node with respect to the second node may be determined and/or otherwise identified based on the first path information. Further, a second-third protocol address that identifies the third node with respect to the second node may be determined and/or otherwise identified based on the second path information. Alternatively or additionally, a third-second protocol address that identifies the second node with respect to the third node may be determined and/or otherwise identified based on the second path information. The first-third protocol address may be determined based on at least one of the first-second protocol address and the second-first protocol and based on at least one of the second-third protocol address and the third-second protocol address.

In an aspect of the method illustrated in FIG. 13, the first-third protocol address may be in a first scope-specific identifier space specific to a first network region that includes the first node. Refer to application Ser. No. 13/727,653 filed on 2012 Dec. 27, entitled “Methods, Systems, and Computer Program Products for Identifying a Protocol address in a Scope-specific Address Space”.

FIG. 16 illustrates an arrangement of components in a system that operates in an execution environment, such as execution environment 102 in FIG. 1. The arrangement of components in the system operates to perform the method illustrated in FIG. 15. The system illustrated includes a count component 1602, an address space condition component 1604, an address space director component 1606, and an allocate component 1608. A suitable execution environment includes a processor, such as the processor 104, to process an instruction in at least one of the count component 1602, the address space condition component 1604, the address space director (ASD) component 1606, and the allocate component 1608.

Some or all of the exemplary components illustrated in FIG. 16 may be adapted to perform the method illustrated in FIG. 15 in a number of execution environments.

As the term “network topology” is defined herein, a network may have different network topologies with respect to different layers and/or network protocols and their corresponding protocol endpoints. A network topology may represent physical communicative couplings between nodes in the network. A network topology may represent logical hops in a network. In FIG. 5B, the first network 514b1 may represent a physical topology when the first network 514b1 represents a physical data transmission medium included in physically coupling nodes. The data transmission medium may be an Ethernet LAN, for example. The hops 512 in FIG. 5 may illustrate logical communicative couplings at a level of the network above the data transmission medium. The hops 512 may represent link layer hops, network layer hops, or hops at some other layer of the network above the data transmission medium or physical layer.

With reference to FIG. 15, a block 1502 illustrates that the method includes detecting a count of network interfaces in a first region, of a network, that includes a first network interface operatively coupling a first node to the first region. Accordingly, a system for assigning an interface identifier to a network interface includes means for detecting a count of network interfaces in a first region, of a network, that includes a first network interface operatively coupling a first node to the first region. For example, the arrangement illustrated in FIG. 16, includes count component 1602 operable for and/or otherwise included in detecting a count of network interfaces in a first region, of a network, that includes a first network interface operatively coupling a first node to the first region.

A region may include a single node with one or more network interfaces in the region and with no other network interfaces of other nodes in the region. All of the one or more network interfaces in the node may be in the region. Such a region is illustrated by a first region 510a1 including a source node 502a in FIG. 5A. The first region 510a1 illustrates a region that includes a single node, the source node 502a.

A node may include a network interface included in a region and may include another network interface not in the region. In FIG. 5A, a second path node 504a2 is illustrated having a network interface included in a second region 510a2 and another network interface included in a third region 510a3. A node may have a single network interface in a region and/or multiple network interfaces in a region.

A count or a partial count of network interfaces in a node in a particular region may be detected by a node in the region or by a node in another region. Detecting a count may include receiving count information identifying the count or a portion of the count, in response to a user input detected by an input device via a node. In an aspect, a count of network interfaces and/or of NICs in one or more network interfaces in the source node 502a may be a configuration setting set in response to an input detected from a user via an input device, such as described with respect to FIG. 1.

Detecting a count may include detecting whether network interface components in a region are in the same node. Detecting the count may further include determining that the network interface components are coupled to a same data transmission medium. Whether network interface components in the same node are coupled to a same data transmission medium may affect how network interfaces are counted. The network interface components in the network interface may be assigned the same protocol address for a particular protocol, such a network layer protocol. The internet protocol in the TCP/IP suite is an exemplary network layer protocol. Network interface components assigned the same protocol address may be counted as a single network interface when a count is for a network protocol of the protocol addresses.

In another aspect, multiple network interface components in a node may be operatively coupled to a same data transmission medium and may be included in more than one network interface for counting. Thus a node that includes multiple network interface components coupled to a same data transmission medium, may have a network interface component in the multiple network interface components in one network interface and another network interface component in the multiple network interface components may be included in another network interface.

As described above, detecting a change in a state of an operable coupling may include detecting that the state indicates the coupling is inoperative, and subsequently detecting that the state indicates the coupling is operative. Further, detecting a change in a state of a coupling may include detecting that the state indicates the coupling is operative and subsequently detecting that the state indicates the coupling is inoperative.

A count component may monitor one or more operations included in sending data and/or receiving data via an operable coupling including a network and a network interface. Detecting a change in an operable coupling may include performing an operation to send a data unit and/or to receive a data unit via the coupling, then determining whether the operation was successful.

A count may be based on whether a network interface in a region is in a node that is configured to send and/or receive a data unit of a particular network protocol via the network interface. A count of network interfaces may be performed according to the method illustrated in FIG. 15 for the purpose of assigning an identifier to a network interface for a particular network protocol.

Returning to FIG. 15, a block 1504 illustrates that the method further includes determining, based on the count, a threshold condition. Accordingly, a system for assigning an interface identifier to a network interface includes means for determining, based on the count, a threshold condition. For example, the arrangement illustrated in FIG. 16, includes address space condition component 1604 operable for and/or otherwise included in determining, based on the count, a threshold condition.

Returning to FIG. 15, a block 1506 illustrates that the method yet further includes identifying a first interface identifier that meets, based on a size attribute of the first interface identifier, the threshold condition. Accordingly, a system for assigning an interface identifier to a network interface includes means for identifying a first interface identifier that meets, based on a size attribute of the first interface identifier, the threshold condition. For example, the arrangement illustrated in FIG. 16, includes address space director component 1606 operable for and/or otherwise included in identifying a first interface identifier that meets, based on a size attribute of the first interface identifier, the threshold condition.

Identifying a network interface may include identifying a schema or part of a schema defining a valid format and/or a valid vocabulary for a representation of an interface identifier. Interface identifiers are assigned to network interfaces for a purpose. Interface identifiers may be assigned to network interfaces for routing data, received via a network interface in a node, to another network interface component in the node to relay some or all of data received to another node. Interface identifiers may be included in a protocol address and/or may be included in generating a protocol address for a network protocol as described below. An interface identifier may be included in identifying a network path in a network and/or a hop including a pair of communicatively coupled nodes. As described above interface identifiers may be selected for saving power when processed in performing specific tasks, selected to save storage space, selected to save processing time, and/or selected to save on any number of other costs in performing one or more tasks. A schema may be defined based on one or more tasks and/or purposes associated with processing an interface identifier.

Schemas explicitly and/or implicitly define rules for a valid format of an interface identifier and/or rules defining a vocabulary for defining valid content of a representation of an interface identifier. A rule may define a constraint on the format or structure of an interface identifier and/or a constraint on the content of an interface identifier. Such constraints may specify or otherwise identify threshold conditions. A threshold condition may be specified by and/or otherwise based on a schema defining a valid protocol address to identify a protocol endpoint for a particular network protocol. The threshold condition may be determined based on size information defined by the schema for representing the protocol address in the data unit of the network protocol. The size information may identify at least one of a maximum size and a minimum size for a valid representation, according to the schema, of the protocol address in the data unit.

A count of network interfaces may place a constraint on the minimum size of a representation of an interface identifier that is valid according to a specified schema. A schema may define a format rule and/or a vocabulary rule that may identify a maximum count and/or a minimum count. For example, in a schema that defines and/or otherwise allows an interface identifier to be represented by a number, the number of digits or number of identifiers in a suitable address space must be large enough to accommodate the value of the count detected. In binary, a single network interface may be represented by a single digit or bit. A count of seven network interfaces requires an identifier space that includes at least seven identifiers and at least some identifiers in the space require three digits or bits when represented in a binary or base two numeric representation. A schema may define and/or otherwise may be included in determining a constraint on the number of bits that may be used in representing an interface identifier.

In FIG. 5A, the first region 510a1 is illustrated with one network interface. A schema including a rule constraining and/or otherwise allowing identifiers to be represented numerically may be determined by an address space condition component 404a operating in the source node 502a to determine an identifier space that includes at least one identifier.

A threshold condition may be based on size information defined by the schema for representing a protocol address in the valid data unit. The size information may identify at least one of a maximum size and minimum size for a valid representation of a protocol address in a data unit.

Determining an interface identifier space may include determining size information identifying at least one of a maximum size for an interface identifier. The maximum size may be based on the count, for an interface identifier; and determining the threshold condition based on the size information. The maximum size may be based on a schema rule.

Returning to FIG. 15, a block 1508 illustrates that the method yet further includes providing the first interface identifier as an identifier of the first network interface. Accordingly, a system for assigning an interface identifier to a network interface includes means for providing the first interface identifier as an identifier of the first network interface. For example, the arrangement illustrated in FIG. 16, includes allocate component 1608 operable for and/or otherwise included in providing the first interface identifier as an identifier of the first network interface.

An ordering of interface identifiers in an identifier space may be determined based on a metric. The metric may be for measuring of any of various attributes accessible within an execution environment. Examples of metrics for interface identifiers are provided above in describing threshold conditions.

Further, an ordering of interface identifiers may correspond to an ordering of network interfaces. Interface identifiers may be assigned based on the correspondence. In an aspect, interface identifiers may be order based on a size of their respective representations in data units of a network protocol. For example, an interface identifier with the value 1 may be represented by a single bit in a data unit. An identifier with a value of ‘255’ may require 4 bits according to a particular type of representation. Network interfaces in a node may be ordered based on one or more of data units sent and/or received; bytes sent and/or received; types of data transmission media coupled to respective network interface; a measure of congestion; a measure of energy or power utilization; measure of heat; an attribute of specified protocol configured to communicate via the network interfaces; and a role of a next node included in a hop that includes a network interface.

Assigning an interface identifier to a first network interface in a first node may include receiving, via the first network interface, a message, sent via a second network interface in a second node, that includes criterion information to identify and/or assign an interface identifier. A criterion may be based on and/or may identify any of the measures described above. Assigning the interface identifier may further include determining that the first interface identifier meets the criterion. A threshold condition determined by an address space component may be determined based on such a criterion. The first interface identifier may be assigned to the first network interface in response to determining that the criterion is met by the first interface identifier.

In an aspect, a first node may receive data from a second node in a data unit of a network protocol via a first network interface. The first network interface may have an assigned first interface identifier. The data may be received based on a protocol address of the network protocol that includes the first interface identifier. The protocol address may identify a third node. In an aspect, the protocol address may include a second interface identifier. The second interface identifier may be assigned to identify a second network interface in the first node. The first node may transmit the data to the third node via the second network interface identified by the second interface identifier in the protocol address. In another aspect, the protocol address may include a third interface identifier assigned to a third network interface in the third node. The third network interface may be included in communicatively coupling the first node and the third node via the second network interface in the first node. In an aspect, the first node may transmit the data to the third node via the second network interface based on an association between the third interface identifier and the second network interface.

In another aspect, a first node may receive a message via a second network interface in the first node. The message may be from a second node in a network path that includes the second network interface. The message may include and/or may be received in one or more data units that include and/or identify a protocol address of a network protocol of the message or of the data units that include the message. The network protocol includes a first interface identifier assigned to a first network interface in the first node. The first node identifies the first network interface based on the first interface identifier in the protocol address. In response, the first node may send the message to a third node in a network path from the first node, where the network path includes the first network interface. The protocol address may be a valid address according to the network protocol of the third node. Alternatively, the third node may be a node in a network path to a destination node identified by the protocol address.

As described in the previous paragraph, a hop may be assigned an identifier that is shared by the pair of nodes in the hop. In still another aspect, a first-second protocol address may indicate a first ordering of the first interface identifier and the second interface identifier. The first-second protocol address may identify the second node to the first node based on the first ordering. A second-first protocol address may include and/or otherwise indicate a second ordering of the first interface identifier. The second-first protocol address may identify the first node to the second node based on the second ordering.

In an additional aspect, the method illustrated in FIG. 15 may include detecting a portion of a data unit, that is valid according to a network layer protocol, for representing a protocol address. The protocol address may identify a sender and/or a receiver of data included in the data unit. A hop threshold size may be determined for including a representation of a hop identifier in the detected portion. The hop threshold size may be determined based on a size of the hop identifier. A representation of the hop identifier may be stored in a hop location where the hop location has a size that meets a threshold condition based on the hop size.

The method illustrated in FIG. 15 may include additional aspects supported by various adaptations and/or analogs of the arrangement of components in FIG. 16. In an aspect, the method may include determining that a protocol address, that is specified according to a network protocol, includes a first interface identifier assigned to a first network interface. Further, the method may include determining that the protocol address includes an identifier of a second node in a network path that includes the first network interface. Determining that the second node is included in the network path that includes the first network interface may be based on the first interface identifier. The first interface identifier may identify the first network interface to transmit a data unit, of the network protocol, that includes and/or otherwise identifies the protocol address.

In another aspect a count may be detected by a count component based on whether a network interface in the region is in a node configured to at least one of send and receive a data unit specified according to a network protocol.

An address space condition component may determine a threshold condition based on an interface identifier space to identify a protocol endpoint of a network protocol. Determining the threshold condition may include determining, based on the count, a maximum count of interface identifiers in the interface identifier space

Further, a threshold condition may be based on a metric to measure an address portion of a data unit, of a network protocol, in a data transmission when transmitted via a data transmission medium. The threshold condition may be based on a metric to measure a size of an interface identifier in a protocol address when stored in the address portion.

In a further aspect identifying an interface identifier may include identifying an interface identifier space based on a threshold condition. The interface identifier interface identifier may be selected from the interface identifier space for assigning to a network interface.

In another aspect a first node may receive data, from a second node via a first network interface, in a data unit including a protocol address, of a protocol endpoint of a network protocol, that includes a first interface identifier of the first network interface. The protocol address may be a valid identifier of a third node that is included in a network path that includes a second network interface in the first node. The first node may send the data to the third node via the second network interface. The protocol address includes a second interface identifier assigned to identify the second network interface.

An interface identifier may be assigned to a first network interface in a first region in a node including a second network interface in a second region of a network. Assigning the first network interface may include determining that the first interface identifier is the smallest available interface identifier.

Claims

1. A non-transitory computer-readable media storing instructions that, when executed by one or more processors of a current node positioned in a network along a network path including a transmitting node and a receiving node, cause the one or more processors to: receive an indication of a receipt of a first packet that is specified according to an Internet Protocol (IP) network protocol or a label forwarding paradigm;identify, from a header of the first packet, network path information that is based on at least one of a first metric, a first policy, or a table, the network path information configured for use in identifying a plurality of path segment identifiers including a node scope-specific outside-scope identifier that: is in an identifier space specific to the current node,does not identify any network interface of any node, andidentifies, for the current node, a first region of the network,where the network path, along which first data is transmitted, includes: a first path segment that communicatively couples the current node and the first region, anda second path segment in a second region; andcause transmission, based on the node scope-specific outside-scope identifier of the network path information, of first data, along with at least one of the plurality path segment identifiers, from the current node to a path node at least partially included in the first region, via the first path segment selected, based on a routing data structure of the current node, from a plurality of path segments, including at least one multi-hop path segment, that are capable of communicatively coupling the current node and the first region, where the path node has a first network interface that receives the first data transmitted via the first path segment, and the path node further has a second network interface in the second path segment.
2. The non-transitory computer-readable media of claim 1, further including instructions that, when executed by the one or more processors of the current node positioned in an other network path along which second data is capable of being transmitted from a transmitting node to a receiving node in the other network path, wherein the one or more processors is further configured to execute the instructions to: receive an indication of a receipt of a second packet that is specified according to the Internet Protocol (IP) network protocol;identify, from a header of the second packet, the node scope-specific outside-scope identifier; andtransmit, based on the node scope-specific outside-scope identifier identified from the header of the second packet, the second data from the current node.
3. The non-transitory computer-readable media of claim 2, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: based on the node scope-specific outside-scope identifier, the second data is transmitted from the current node to the path node.
4. The non-transitory computer-readable media of claim 3, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: based on the node scope-specific outside-scope identifier, the first data and the second data are transmitted from the current node to a same network interface of the path node, where the same network interface is not included in the first region.
5. The non-transitory computer-readable media of claim 2, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: based on the node scope-specific outside-scope identifier, the second data is transmitted from the current node to another path node that is not included in the first region and at least partially included in the second region.
6. The non-transitory computer-readable media of claim 3, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: based on the node scope-specific outside-scope identifier, the first data and the second data are transmitted from the current node to different network interfaces.
7. The non-transitory computer-readable media of claim 5, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the first data is transmitted from the current node to a first network interface of the path node, and the second data is transmitted from the current node to a second network interface of the another path node at least partially included in the second region, wherein the second network interface is not included in the first region.
8. The non-transitory computer-readable media of claim 2, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the second data is transmitted from the current node via the first path segment that is selected from the plurality of path segments, based on at least one of the first metric, the first policy, or the table.
9. The non-transitory computer-readable media of claim 2, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the second data is transmitted from the current node via the second path segment that is selected from the plurality of path segments, based on at least one of the first metric, the first policy, or the table.
10. The non-transitory computer-readable media of claim 9, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the at least one of the first metric, the first policy, or the table includes the first metric, and the second path segment is selected based on a change in the network that causes a change in measurement that is measured according to the first metric.
11. The non-transitory computer-readable media of claim 9, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the first data and the second data are transmitted from the current node via different network interfaces of the current node.
12. The non-transitory computer-readable media of claim 9, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the first data and the second data are transmitted from the current node via the same network interface of the current node.
13. The non-transitory computer-readable media of claim 9, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: at least one of the first path segment or the second path segment includes multiple hops.
14. The non-transitory computer-readable media of claim 9, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the first path segment and the second path segment each include multiple hops.
15. The non-transitory computer-readable media of claim 1, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the path node has a network interface that is not included in the first region and that receives the first data transmitted via the first path segment.
16. The non-transitory computer-readable media of claim 15, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the IP network protocol or the label forwarding paradigm, includes the IP network protocol, and the network interface receives the first data transmitted via the first path segment despite the node scope-specific outside-scope identifier not including a network interface identifier portion specified by the IP network protocol for identifying any network interface of any node.
17. The non-transitory computer-readable media of claim 15, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the IP network protocol or the label forwarding paradigm, includes the IP network protocol, and the network interface receives the first data transmitted via the first path segment despite the node scope-specific outside-scope identifier not including a network interface identifier portion specified by the IP network protocol for identifying any network interface of any node, such that the first data is capable of being received, based on the node scope-specific outside-scope identifier, at any network interface of the path node included in any path segment capable of coupling the current node and the path node.
18. The non-transitory computer-readable media of claim 15, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the network interface receives the first data transmitted via the first path segment despite the node scope-specific outside-scope identifier only identifying, for at least the current node, the second region of the network.
19. The non-transitory computer-readable media of claim 15, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the network interface receives the first data transmitted via the first path segment despite the node scope-specific outside-scope identifier only identifying, for at least the current node, the second region of the network, such that the first data is capable of being received, based on the node scope-specific outside-scope identifier, at any network interface of the path node included in any path segment capable of coupling the current node and the path node.
20. The non-transitory computer-readable media of claim 1, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the path node has a first network interface that is not included in the first region and that receives the first data transmitted via the first path segment, and the path node further has a second network interface that is in the network path and that is in the second region.
21. The non-transitory computer-readable media of claim 1, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the network path information is predetermined by multiple topology nodes.
22. The non-transitory computer-readable media of claim 1, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the network path information is predetermined by the transmitting node.
23. The non-transitory computer-readable media of claim 1, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the network path is specified using a first number of identifiers that is fewer than a second number of identifiers required to specify the network path deterministically.
24. The non-transitory computer-readable media of claim 1, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the first data is capable of being transmitted by the current node along different ones of the plurality of path segments based on: a policy, and a state of the network at a time when the first packet is received.
25. The non-transitory computer-readable media of claim 24, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the plurality of path segments are predetermined before the first packet is received by the current node, and selection of one or more of the plurality of path segments is performed by the current node based on: the policy, and the state of the network at the time when the first packet is received.
26. The non-transitory computer-readable media of claim 1, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the first data is capable of being transmitted by the current node along different ones of the plurality of path segments based on a policy and a current state of the network.
27. The non-transitory computer-readable media of claim 1, further including instructions that, when executed by the one or more processors, cause the current node to operate such that: the first data is capable of being transmitted by the current node along different ones of the plurality of path segments based a current state of the network.
28. The non-transitory computer-readable media of claim 1, further including instructions that, when executed by the one or more processors, cause the current node to operate such that and at least one of: said first path segment is one of the plurality of path segments;said first path segment includes the at least one multi-hop path segment;said first path segment does not include the at least one multi-hop path segment;said first path segment is selected, based on at least two of the first policy, the table, or the metric;said first path segment is selected, based on at least all of the first policy, the table, and the metric;said first path segment is selected, based on the first policy;said first path segment is selected, based on the table;said first path segment is selected, based on the metric;said first packet is received from the transmitting node;said first packet is received from a particular node between the transmitting node and the current node;said IP network protocol or the label forwarding paradigm, includes the IP network protocol;said IP network protocol or the label forwarding paradigm, includes the label forwarding paradigm;said IP network protocol or the label forwarding paradigm, includes the label forwarding paradigm, where the label switching forwarding paradigm includes a Multiprotocol Label Switching (MPLS) network protocol;said IP network protocol or the label forwarding paradigm, includes the label forwarding paradigm, where the label switching includes Multiprotocol Label Switching (MPLS);said IP network protocol or the label forwarding paradigm, includes the label forwarding paradigm, where a forwarding paradigm of the label forwarding paradigm includes a network protocol;said IP network protocol or the label forwarding paradigm, includes the label forwarding paradigm, where a forwarding paradigm of the label forwarding paradigm includes a routing protocol;said first region is based on a first domain;said first region includes a first domain;said first region includes a first area;said second region is based on a second domain;said second region includes a second particular domain;said second region includes a second particular area;said receiving node includes a destination node;said receiving node does not include a destination node;said transmitting node includes a source node;said transmitting node does not include a source node;said identification, from the header of the first packet, of the first outside-scope identifier is performed, by a detection thereof;said receipt of the indication of the receipt of a first packet, includes receiving, at the one or more processors, a signal from an incoming network interface component upon receipt of the first packet by the incoming network interface component;said one or more processors includes multiple processors that, when different subsets of the instructions are each executed by a corresponding one of the different multiple processors, each perform different ones of: the receiving, the identification, and the causation;said one or more processors includes a single processor that, when the instructions are executed, performs each of: the receiving, the identification, and the causation;said first data is transmitted from the current node in another packet that is a copy of the first packet;said first data is transmitted from the current node in another packet that is at least partially similar to the first packet;said transmitting node and the receiving node in the network path, and the transmitting node and the receiving node in the other network path, are the same;at least one of the transmitting node or the receiving node in the network path, and at least one of the transmitting node or the receiving node in the other network path, are different;said transmitting node and the receiving node in the network path, and the transmitting node and the receiving node in the other network path, are all different;said node scope-specific outside-scope identifier identifies, only in the first region of the network, the second region;said node scope-specific outside-scope identifier globally identifies, in the first region of the network, the second region;said non-transitory computer-readable media is included as part of a system that further comprises the current node;said non-transitory computer-readable media is included as part of a system that further comprises the transmitting node and the receiving node;said network path information is configured for use in identifying the plurality of path segment identifiers including the node scope-specific outside-scope identifier, by including the node scope-specific outside-scope identifier;said network path information is configured for use in identifying the plurality of path segment identifiers including the node scope-specific outside-scope identifier, by being used to look up the node scope-specific outside-scope identifier;said first data is caused to be transmitted, along with each of the plurality path segment identifiers, including the node scope-specific outside-scope identifier;said first data is caused to be transmitted, along with the at least one of the plurality path segment identifiers, including the node scope-specific outside-scope identifier;said first data is caused to be transmitted, along with the at least one of the plurality path segment identifiers that does not include the node scope-specific outside-scope identifier;said node scope-specific outside-scope identifier is designated as a current identifier when the first packet is received by the current node, and the at least one of the plurality path segment identifiers, that does not include the node scope-specific outside-scope identifier, is designated as the current identifier when the first data is caused to be transmitted;said node scope-specific outside-scope identifier is designated as a current identifier when the first packet is received by the current node, and the node scope-specific outside-scope identifier is designated as the current identifier when the first data is caused to be transmitted; orsaid non-transitory computer-readable media is included as part of the current node.
29. The non-transitory computer-readable media of claim 1, further including instructions that, when executed by the one or more processors, cause the current node to operate such that and at least a majority of: said first path segment is one of the plurality of path segments;said first path segment includes the at least one multi-hop path segment;said first path segment does not include the at least one multi-hop path segment;said first path segment is selected, based on at least two of the first policy, the table, or the metric;said first path segment is selected, based on at least all of the first policy, the table, and the metric;said first path segment is selected, based on the first policy;said first path segment is selected, based on the table;said first path segment is selected, based on the metric;said first packet is received from the transmitting node;said first packet is received from a particular node between the transmitting node and the current node;said IP network protocol or the label forwarding paradigm, includes the IP network protocol;said IP network protocol or the label forwarding paradigm, includes the label forwarding paradigm;said IP network protocol or the label forwarding paradigm, includes the label forwarding paradigm, where the label switching forwarding paradigm includes a Multiprotocol Label Switching (MPLS) network protocol;said IP network protocol or the label forwarding paradigm, includes the label forwarding paradigm, where the label switching includes Multiprotocol Label Switching (MPLS);said IP network protocol or the label forwarding paradigm, includes the label forwarding paradigm, where a forwarding paradigm of the label forwarding paradigm includes a network protocol;said IP network protocol or the label forwarding paradigm, includes the label forwarding paradigm, where a forwarding paradigm of the label forwarding paradigm includes a routing protocol;said first region is based on a first domain;said first region includes a first domain;said first region includes a first area;said second region is based on a second domain;said second region includes a second particular domain;said second region includes a second particular area;said receiving node includes a destination node;said receiving node does not include a destination node;said transmitting node includes a source node;said transmitting node does not include a source node;said identification, from the header of the first packet, of the first outside-scope identifier is performed, by a detection thereof;said receipt of the indication of the receipt of a first packet, includes receiving, at the one or more processors, a signal from an incoming network interface component upon receipt of the first packet by the incoming network interface component;said one or more processors includes multiple processors that, when different subsets of the instructions are each executed by a corresponding one of the different multiple processors, each perform different ones of: the receiving, the identification, and the causation;said one or more processors includes a single processor that, when the instructions are executed, performs each of: the receiving, the identification, and the causation;said first data is transmitted from the current node in another packet that is a copy of the first packet;said first data is transmitted from the current node in another packet that is at least partially similar to the first packet;said transmitting node and the receiving node in the network path, and the transmitting node and the receiving node in the other network path, are the same;at least one of the transmitting node or the receiving node in the network path, and at least one of the transmitting node or the receiving node in the other network path, are different;said transmitting node and the receiving node in the network path, and the transmitting node and the receiving node in the other network path, are all different;said node scope-specific outside-scope identifier identifies, only in the first region of the network, the second region;said node scope-specific outside-scope identifier globally identifies, in the first region of the network, the second region;said non-transitory computer-readable media is included as part of a system that further comprises the current node;said non-transitory computer-readable media is included as part of a system that further comprises the transmitting node and the receiving node;said network path information is configured for use in identifying the plurality of path segment identifiers including the node scope-specific outside-scope identifier, by including the node scope-specific outside-scope identifier;said network path information is configured for use in identifying the plurality of path segment identifiers including the node scope-specific outside-scope identifier, by being used to look up the node scope-specific outside-scope identifier;said first data is caused to be transmitted, along with each of the plurality path segment identifiers, including the node scope-specific outside-scope identifier;said first data is caused to be transmitted, along with the at least one of the plurality path segment identifiers, including the node scope-specific outside-scope identifier;said first data is caused to be transmitted, along with the at least one of the plurality path segment identifiers that does not include the node scope-specific outside-scope identifier;said node scope-specific outside-scope identifier is designated as a current identifier when the first packet is received by the current node, and the at least one of the plurality path segment identifiers, that does not include the node scope-specific outside-scope identifier, is designated as the current identifier when the first data is caused to be transmitted;said node scope-specific outside-scope identifier is designated as a current identifier when the first packet is received by the current node, and the node scope-specific outside-scope identifier is designated as the current identifier when the first data is caused to be transmitted; orsaid non-transitory computer-readable media is included as part of the current node.
30. An apparatus, comprising: a particular node configured to be positioned in a network on a first network path along which first data is capable of being transmitted from a transmitting node to a receiving node which are both in the first network path, the particular node including: at least one non-transitory memory configured to store instructions, and one or more processors in communication with the at least one non-transitory memory, wherein the one or more processors is configured to execute the instructions to cause the particular node to:receive a first packet that is specified according to an Internet Protocol (IP) network protocol or a label forwarding paradigm;identify, in a header of the first packet, network path information that is based on at least one of a first metric, a first policy, or a table, the network path information configured for use in identifying a plurality of path segment identifiers including a node scope-specific outside-scope identifier that: is in an identifier space specific to the particular node,does not identify any network interface of any node, andidentifies, for the particular node, a first region of the network,where the network path, along which the first data is transmitted, includes: a first path segment that communicatively couples the particular node and the first region, anda second path segment in a second region; andtransmit, based on the node scope-specific outside-scope identifier of the network path information, first data, along with at least one of the plurality path segment identifiers, from the particular node to a path node at least partially included in the first region, via the first path segment selected, based on a routing data structure of the particular node, from a plurality of path segments, including at least one multi-hop path segment, that are capable of communicatively coupling the particular node and the first region, where the path node has a first network interface that receives the first data transmitted via the first path segment, and the path node further has a second network interface in the second path segment.
31. A method, comprising: at a particular node in a network along a network path including a transmitting node and a receiving node:receiving a first packet that is specified according to an Internet Protocol (IP) network protocol or a label forwarding paradigm, the first packet including a header with network path information that is based on at least one of a first metric, a first policy, or a table, the network path information configured for use in identifying a plurality of path segment identifiers including a node scope-specific outside-scope identifier that: is in an identifier space specific to the particular node,does not identify any network interface of any node, andidentifies, for the particular node, a first region of the network,where the network path, along which first data is transmitted, includes: a first path segment that communicatively couples the particular node and the first region, anda second path segment in a second region; andtransmitting, based on the node scope-specific outside-scope identifier of the network path information, first data, along with at least one of the plurality path segment identifiers, from the particular node to a path node at least partially included in the first region, via the first path segment selected, based on a routing data structure of the particular node, from a plurality of path segments, including at least one multi-hop path segment, that are capable of communicatively coupling the particular node and the first region, where the path node has a first network interface that receives the first data transmitted via the first path segment, and the path node further has a second network interface in the second path segment.
32. A particular node configured to be positioned in a network along a network path including a transmitting node and a receiving node, the particular node comprising: means for receiving a first packet that is specified according to an Internet Protocol (IP) network protocol or a label forwarding paradigm, the first packet including a header with network path information that is based on at least one of a first metric, a first policy, or a table, the network path information configured for use in identifying a plurality of path segment identifiers including a node scope-specific outside-scope identifier that: is in an identifier space specific to the particular node,does not identify any network interface of any node, andidentifies, for the particular node, a first region of the network,where the network path, along which first data is transmitted, includes: a first path segment that communicatively couples the particular node and the first region, anda second path segment in a second region; andmeans for transmitting, based on the node scope-specific outside-scope identifier of the network path information, first data, along with at least one of the plurality path segment identifiers, from the particular node to a path node at least partially included in the first region, via the first path segment selected, based on a routing data structure of the particular node, from a plurality of path segments, including at least one multi-hop path segment, that are capable of communicatively coupling the particular node and the first region, where the path node has a first network interface that receives the first data transmitted via the first path segment, and the path node further has a second network interface in the second path segment.
33. A method, comprising: performing at least one act that is configured to cause a current node, which is configured to be positioned in a network along a network path including a transmitting node and a receiving node, to: receive an indication of a receipt of a first packet that is specified according to an Internet Protocol (IP) network protocol or a label forwarding paradigm,identify, from a header of the first packet, network path information that is based on at least one of a first metric, a first policy, or a table, the network path information configured for use in identifying a plurality of path segment identifiers including a node scope-specific outside-scope identifier that: is in an identifier space specific to the current node,does not identify any network interface of any node, andidentifies, for the current node, a first region of the network,where the network path, along which first data is transmitted, includes: a first path segment that communicatively couples the current node and the first region, anda second path segment in a second region, andcause transmission, based on the node scope-specific outside-scope identifier of the network path information, of first data, along with at least one of the plurality path segment identifiers, from the current node to a path node at least partially included in the first region, via the first path segment selected, based on a routing data structure of the current node, from a plurality of path segments, including at least one multi-hop path segment, that are capable of communicatively coupling the current node and the first region, where the path node has a first network interface that receives the first data transmitted via the first path segment, and the path node further has a second network interface in the second path segment; andcausing storage of a result of the at least one act on at least one non-transitory memory.
34. The method of claim 33, and comprising: performing at least one additional act that is configured to cause the current node, which is configured to be positioned in an other network path along which second data is capable of being transmitted from a transmitting node to a receiving node in the other network path, to: receive an indication of a receipt of a second packet that is specified according to the Internet Protocol (IP) network protocol;identify, from a header of the second packet, the node scope-specific outside-scope identifier; andtransmit, based on the node scope-specific outside-scope identifier identified from the header of the second packet, the second data from the current node.
35. The method of claim 34, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: based on the node scope-specific outside-scope identifier, the second data is transmitted from the current node to the path node.
36. The method of claim 35, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: based on the node scope-specific outside-scope identifier, the first data and the second data are transmitted from the current node to a same network interface of the path node, where the same network interface is not included in the first region.
37. The method of claim 34, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: based on the node scope-specific outside-scope identifier, the second data is transmitted from the current node to another path node that is not included in the first region and at least partially included in the second region.
38. The method of claim 35, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: based on the node scope-specific outside-scope identifier, the first data and the second data are transmitted from the current node to different network interfaces.
39. The method of claim 37, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: the first data is transmitted from the current node to a first network interface of the path node, and the second data is transmitted from the current node to a second network interface of the another path node at least partially included in the second region, wherein the second network interface is not included in the first region.
40. The method of claim 34, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: the second data is transmitted from the current node via the first path segment that is selected from the plurality of path segments, based on at least one of the first metric, the first policy, or the table.
41. The method of claim 34, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: the second data is transmitted from the current node via the second path segment that is selected from the plurality of path segments, based on at least one of the first metric, the first policy, or the table.
42. The method of claim 41, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: the at least one of the first metric, the first policy, or the table includes the first metric, and the second path segment is selected based on a change in the network that causes a change in measurement that is measured according to the first metric.
43. The method of claim 41, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: the first data and the second data are transmitted from the current node via different network interfaces of the current node.
44. The method of claim 41, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: the first data and the second data are transmitted from the current node via the same network interface of the current node.
45. The method of claim 41, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: at least one of the first path segment or the second path segment includes multiple hops.
46. The method of claim 41, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: the first path segment and the second path segment each include multiple hops.
47. The method of claim 33, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: the path node has a network interface that is not included in the first region and that receives the first data transmitted via the first path segment.
48. The method of claim 47, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: the IP network protocol or the label forwarding paradigm, includes the IP network protocol, and the network interface receives the first data transmitted via the first path segment despite the node scope-specific outside-scope identifier not including a network interface identifier portion specified by the IP network protocol for identifying any network interface of any node.
49. The method of claim 47, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: the IP network protocol or the label forwarding paradigm, includes the IP network protocol, and the network interface receives the first data transmitted via the first path segment despite the node scope-specific outside-scope identifier not including a network interface identifier portion specified by the IP network protocol for identifying any network interface of any node, such that the first data is capable of being received, based on the node scope-specific outside-scope identifier, at any network interface of the path node included in any path segment capable of coupling the current node and the path node.
50. The method of claim 47, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: the network interface receives the first data transmitted via the first path segment despite the node scope-specific outside-scope identifier only identifying, for at least the current node, the second region of the network.
51. The method of claim 47, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: the network interface receives the first data transmitted via the first path segment despite the node scope-specific outside-scope identifier only identifying, for at least the current node, the second region of the network, such that the first data is capable of being received, based on the node scope-specific outside-scope identifier, at any network interface of the path node included in any path segment capable of coupling the current node and the path node.
52. The method of claim 33, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: the path node has a first network interface that is not included in the first region and that receives the first data transmitted via the first path segment, and the path node further has a second network interface that is in the network path and that is in the second region.
53. The method of claim 33, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: the network path information is predetermined by multiple topology nodes.
54. The method of claim 33, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: the network path information is predetermined by the transmitting node.
55. The method of claim 33, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: the network path is specified using a first number of identifiers that is fewer than a second number of identifiers required to specify the network path deterministically.
56. The method of claim 33, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: the first data is capable of being transmitted by the current node along different ones of the plurality of path segments based on: a policy, and a state of the network at a time when the first packet is received.
57. The method of claim 56, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: the plurality of path segments are predetermined before the first packet is received by the current node, and selection of one or more of the plurality of path segments is performed by the current node based on: the policy, and the state of the network at the time when the first packet is received.
58. The method of claim 33, and comprising: performing at least one additional act that is configured to cause the current node to operate such that: the first data is capable of being transmitted by the current node along different ones of the plurality of path segments based on a policy and a current state of the network.
59. The method of claim 58, and comprising: performing at least one additional act that is configured to cause the current node to operate such that and at least one of: said first path segment is one of the plurality of path segments;said first path segment includes the at least one multi-hop path segment;said first path segment does not include the at least one multi-hop path segment;said first path segment is selected, based on at least two of the first policy, the table, or the metric;said first path segment is selected, based on at least all of the first policy, the table, and the metric;said first path segment is selected, based on the first policy;said first path segment is selected, based on the table;said first path segment is selected, based on the metric;said first packet is received from the transmitting node;said first packet is received from a particular node between the transmitting node and the current node;said IP network protocol or the label forwarding paradigm, includes the IP network protocol;said IP network protocol or the label forwarding paradigm, includes the label forwarding paradigm;said IP network protocol or the label forwarding paradigm, includes the label forwarding paradigm, where the label switching forwarding paradigm includes a Multiprotocol Label Switching (MPLS) network protocol;said IP network protocol or the label forwarding paradigm, includes the label forwarding paradigm, where the label switching includes Multiprotocol Label Switching (MPLS);said IP network protocol or the label forwarding paradigm, includes the label forwarding paradigm, where a forwarding paradigm of the label forwarding paradigm includes a network protocol;said IP network protocol or the label forwarding paradigm, includes the label forwarding paradigm, where a forwarding paradigm of the label forwarding paradigm includes a routing protocol;said first region is based on a first domain;said first region includes a first domain;said first region includes a first area;said second region is based on a second domain;said second region includes a second particular domain;said second region includes a second particular area;said receiving node includes a destination node;said receiving node does not include a destination node;said transmitting node includes a source node;said transmitting node does not include a source node;said identification is performed, by a detection thereof;said receipt of the indication of the receipt of a first packet, includes receiving, at one or more processors, a signal from an incoming network interface component upon receipt of the first packet by the incoming network interface component;said first data is transmitted from the current node in another packet that is a copy of the first packet;said first data is transmitted from the current node in another packet that is at least partially similar to the first packet;said transmitting node and the receiving node in the network path, and the transmitting node and the receiving node in the other network path, are the same;at least one of the transmitting node or the receiving node in the network path, and at least one of the transmitting node or the receiving node in the other network path, are different;said transmitting node and the receiving node in the network path, and the transmitting node and the receiving node in the other network path, are all different;said node scope-specific outside-scope identifier identifies, only in the first region of the network, the second region;said node scope-specific outside-scope identifier globally identifies, in the first region of the network, the second region;said network path information is configured for use in identifying the plurality of path segment identifiers including the node scope-specific outside-scope identifier, by including the node scope-specific outside-scope identifier;said network path information is configured for use in identifying the plurality of path segment identifiers including the node scope-specific outside-scope identifier, by being used to look up the node scope-specific outside-scope identifier;said first data is caused to be transmitted, along with each of the plurality path segment identifiers, including the node scope-specific outside-scope identifier;said first data is caused to be transmitted, along with the at least one of the plurality path segment identifiers, including the node scope-specific outside-scope identifier;said first data is caused to be transmitted, along with the at least one of the plurality path segment identifiers that does not include the node scope-specific outside-scope identifier;said node scope-specific outside-scope identifier is designated as a current identifier when the first packet is received by the current node, and the at least one of the plurality path segment identifiers, that does not include the node scope-specific outside-scope identifier, is designated as the current identifier when the first data is caused to be transmitted;said node scope-specific outside-scope identifier is designated as a current identifier when the first packet is received by the current node, and the node scope-specific outside-scope identifier is designated as the current identifier when the first data is caused to be transmitted;said at least one act is performed at the current node;said at least one act is performed at a certain node other than the current node;said at least one act and the at least one additional act are performed at the current node;said at least one act and the at least one additional act are performed at a certain node other than the current node;said at least one act and the at least one additional act are performed at a certain node other than the current node;said at least one act and the at least one additional act are performed at a certain node other than the current 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;said at least one act causes the current node to perform the receipt, the identification, the causation of the transmission;said at least one act causes the current node to perform at least one of the receipt, the identification, or the causation of the transmission;said at least one act causes at least one operation to be performed other than the receipt, the identification, and the causation of the transmission;said 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 current node, for execution;said causing storage includes causing storage of at least portion of instructions on the at least one non-transitory memory, that is part of the current node;said causing storage includes causing storage of at least portion of instructions on the at least one non-transitory memory, that is part of the current node, so that the current node is provided to a user for use;said causing storage includes installation;said causing storage includes causing transfer of at least portion of instructions from persistent storage to volatile memory;said at least one non-transitory memory includes a register;said at least one non-transitory memory includes volatile memory;said at least one non-transitory memory includes persistent storage;said phrases at least one act and current node do not invoke 35 U.S.C. 112, sixth paragraph;said method further comprises configuring the current node;said method further comprises coupling the at least one non-transitory memory to one or more processors;said method further comprises providing the current node;said method further comprises providing the at least one non-transitory memory;said method further comprises providing one or more processors;said at least one non-transitory memory is part of the current node; orsaid at least one non-transitory memory is separate from current node memory of the current node.

RELATED APPLICATIONS

The present application is a continuation of U.S. application Ser. No. 16/264,580 filed Jan. 31, 2019 and entitled “Routing Methods, Systems, and Computer Program Products” which, in turn, is a continuation of U.S. application Ser. No. 15/961,818 filed Apr. 24, 2018 and entitled “Routing Methods, Systems, and Computer Program Products” which, in turn, is a continuation-in-part of U.S. application Ser. No. 14/274,632 filed May 9, 2014 and entitled “Methods, Systems, and Computer Program Products for Associating a Name with a Network Path” (US 2014-0365682 A1) which, in turn, is a continuation-in-part of: U.S. application Ser. No. 13/727,662 filed Dec. 27, 2012 and entitled “Methods, Systems, and Computer Program Products for Routing Based on a Path-Based Protocol Address” (US 2014-0189156 A1); U.S. application Ser. No. 13/727,651 filed Dec. 27, 2012 and entitled “Methods, Systems, and Computer Program Products for Routing Based on a Nested Protocol Address” (US 2014-0189045 A1); U.S. application Ser. No. 13/727,652 filed Dec. 27, 2012 and entitled “Methods, Systems, and Computer Program Products for Routing Based on a Scope-Specific Address” (US 2014-0189153 A1); U.S. application Ser. No. 13/727,653 filed Dec. 27, 2012 and entitled “Methods, Systems, and Computer Program Products for Identifying a Protocol Address in a Scope-Specific Address Space” (US 2014-0189159 A1); U.S. application Ser. No. 13/727,655 filed Dec. 27, 2012 and entitled “Methods, Systems, and Computer Program Products for Determining a Shared Identifier for a Hop in a Network” (US 2014-0189154 A1); and U.S. application Ser. No. 13/727,657 filed Dec. 27, 2012 and entitled “Methods, Systems, and Computer Program Products for Determining a Protocol Address For a Node” (US 2014-0189155 A1). Further, the present application incorporates by reference the following applications by reference in their entirety for all purposes: U.S. application Ser. No. 13/727,662 filed Dec. 27, 2012 and entitled “Methods, Systems, and Computer Program Products for Routing Based on a Path-Based Protocol Address” (US 2014-0189156 A1); U.S. application Ser. No. 13/727,651 filed Dec. 27, 2012 and entitled “Methods, Systems, and Computer Program Products for Routing Based on a Nested Protocol Address” (US 2014-0189045 A1); U.S. application Ser. No. 13/727,652 filed Dec. 27, 2012 and entitled “Methods, Systems, and Computer Program Products for Routing Based on a Scope-Specific Address” (US 2014-0189153 A1); U.S. application Ser. No. 13/727,653 filed Dec. 27, 2012 and entitled “Methods, Systems, and Computer Program Products for Identifying a Protocol Address in a Scope-Specific Address Space” (US 2014-0189159 A1); U.S. application Ser. No. 13/727,655 filed Dec. 27, 2012 and entitled “Methods, Systems, and Computer Program Products for Determining a Shared Identifier for a Hop in a Network” (US 2014-0189154 A1); and U.S. application Ser. No. 13/727,657 filed Dec. 27, 2012 and entitled “Methods, Systems, and Computer Program Products for Determining a Protocol Address For a Node” (US 2014-0189155 A1).

US Referenced Citations (476)

Number	Name	Date	Kind
5195181	Bryant et al.	Mar 1993	A
5353283	Tsuchiya	Oct 1994	A
5426639	Follett et al.	Jun 1995	A
5452293	Wilkinson et al.	Sep 1995	A
5504747	Sweazey	Apr 1996	A
5649108	Spiegel et al.	Jul 1997	A
5764624	Endo et al.	Jun 1998	A
5845086	Doebrich et al.	Dec 1998	A
5968124	Takahashi et al.	Oct 1999	A
6032197	Birdwell et al.	Feb 2000	A
6205429	Peng	Mar 2001	B1
6374303	Armitage et al.	Apr 2002	B1
6574195	Roberts	Jun 2003	B2
6577600	Bare	Jun 2003	B1
6631484	Born	Oct 2003	B1
6647428	Bannai et al.	Nov 2003	B1
6650640	Muller et al.	Nov 2003	B1
6675218	Mahler et al.	Jan 2004	B1
6728220	Behzadi	Apr 2004	B2
6765921	Stacey	Jul 2004	B1
6816460	Ahmed et al.	Nov 2004	B1
6963570	Agarwal	Nov 2005	B1
6990108	Karlsson et al.	Jan 2006	B2
6996126	Deml et al.	Feb 2006	B2
7012919	So et al.	Mar 2006	B1
7023846	Andersson et al.	Apr 2006	B1
7031253	Katukam et al.	Apr 2006	B1
7031607	Smith	Apr 2006	B1
7047114	Rogers	May 2006	B1
7061921	Sheth	Jun 2006	B1
7065040	Nagamine	Jun 2006	B2
7068654	Joseph et al.	Jun 2006	B1
7072346	Hama	Jul 2006	B2
7082140	Hass	Jul 2006	B1
7088721	Droz et al.	Aug 2006	B1
7154416	Savage	Dec 2006	B1
7174387	Shand et al.	Feb 2007	B1
7174390	Schulter et al.	Feb 2007	B2
7177311	Hussain et al.	Feb 2007	B1
7180887	Schwaderer et al.	Feb 2007	B1
7181742	Hooper	Feb 2007	B2
7254138	Sandstrom	Aug 2007	B2
7260097	Casey	Aug 2007	B2
7269132	Casey et al.	Sep 2007	B1
7286479	Bragg	Oct 2007	B2
7286566	Parruck et al.	Oct 2007	B1
7315541	Housel et al.	Jan 2008	B1
7330440	Bryant et al.	Feb 2008	B1
7340535	Alam	Mar 2008	B1
7359377	Kompella	Apr 2008	B1
7366865	Lakshmanamurthy et al.	Apr 2008	B2
7373401	Azad	May 2008	B1
7403542	Thompson	Jul 2008	B1
7420992	Fang et al.	Sep 2008	B1
7430210	Havala et al.	Sep 2008	B2
7460473	Kodama et al.	Dec 2008	B1
7462639	Georges et al.	Dec 2008	B2
7463639	Rekhter	Dec 2008	B1
7466661	Previdi et al.	Dec 2008	B1
7471669	Sabesan et al.	Dec 2008	B1
7529224	Basso et al.	May 2009	B2
7551632	Thubert et al.	Jun 2009	B2
7564803	Minei et al.	Jul 2009	B1
7577143	Kompella	Aug 2009	B1
7602778	Guichard et al.	Oct 2009	B2
7610330	Quinn et al.	Oct 2009	B1
7619982	Blair et al.	Nov 2009	B2
7636299	Asa et al.	Dec 2009	B2
7660892	Choong et al.	Feb 2010	B2
7673072	Boucher et al.	Mar 2010	B2
7675861	Metzger et al.	Mar 2010	B2
7706306	Bardalai et al.	Apr 2010	B2
7773630	Huang et al.	Aug 2010	B2
7782834	Chitrapu	Aug 2010	B2
7787361	Rahman et al.	Aug 2010	B2
7813356	Roberts	Oct 2010	B2
7817667	Frederiksen et al.	Oct 2010	B2
7835393	Ren et al.	Nov 2010	B2
7885259	Filsfils	Feb 2011	B2
7885294	Patel et al.	Feb 2011	B2
7894352	Kompella et al.	Feb 2011	B2
7894458	Jiang et al.	Feb 2011	B2
7933272	Morris	Apr 2011	B2
7940695	Bahadur et al.	May 2011	B1
7944853	Eglin et al.	May 2011	B2
7970931	Ventakaramaiah et al.	Jun 2011	B2
7983174	Monaghan et al.	Jul 2011	B1
8000267	Solis et al.	Aug 2011	B2
8004967	Wang	Aug 2011	B2
8028298	Moore	Sep 2011	B2
8064441	Wijnands et al.	Nov 2011	B2
8065439	Johnson et al.	Nov 2011	B1
8068417	Roberts	Nov 2011	B1
8073968	Shah et al.	Dec 2011	B1
8248920	Tallet	Aug 2012	B2
8248969	Yan	Aug 2012	B2
8254272	Vasseur	Aug 2012	B1
8259585	P et al.	Sep 2012	B1
8275313	Myers et al.	Sep 2012	B1
8301738	Alex	Oct 2012	B1
8310957	Rekhter	Nov 2012	B1
8339973	Pichumani et al.	Dec 2012	B1
8380846	Abu-Ghazaleh et al.	Feb 2013	B1
8422514	Kothari et al.	Apr 2013	B1
8456987	Valluri et al.	Jun 2013	B1
8509056	Arya et al.	Aug 2013	B1
8537840	Raszuk et al.	Sep 2013	B1
8542706	Wang et al.	Sep 2013	B2
8611335	Wu et al.	Dec 2013	B1
8619817	Everson et al.	Dec 2013	B1
8630167	Smith	Jan 2014	B2
8631483	Soni et al.	Jan 2014	B2
8675488	Sidebottom et al.	Mar 2014	B1
8693341	Rajamanickam et al.	Apr 2014	B2
8705533	Venkatraman et al.	Apr 2014	B1
8711883	Kang et al.	Apr 2014	B2
8724627	Filsfils et al.	May 2014	B2
8743679	Gerstel et al.	Jun 2014	B2
8751686	Filsfils et al.	Jun 2014	B2
8762532	Kohlenz et al.	Jun 2014	B2
8792384	Banerjee et al.	Jul 2014	B2
8798047	Wadekar et al.	Aug 2014	B1
8813220	Knapp et al.	Aug 2014	B2
8825900	Gross et al.	Sep 2014	B1
8831025	Finney et al.	Sep 2014	B2
8838705	Zwaal et al.	Sep 2014	B2
8867363	Mohapatra et al.	Oct 2014	B2
8873409	Filsfils et al.	Oct 2014	B2
8891532	Smith et al.	Nov 2014	B1
8892772	Filsfils et al.	Nov 2014	B1
8908517	Filsfils et al.	Dec 2014	B2
8913613	Srinivasan et al.	Dec 2014	B2
8948179	Zhao et al.	Feb 2015	B2
8953590	Aggarwal et al.	Feb 2015	B1
8982710	Meilik et al.	Mar 2015	B2
9014049	Filsfils et al.	Apr 2015	B2
9015299	Shah	Apr 2015	B1
9030934	Shah et al.	May 2015	B2
9036463	Bashandy et al.	May 2015	B2
9036474	Dibirdi et al.	May 2015	B2
9049233	Frost et al.	Jun 2015	B2
9065750	Vasseur et al.	Jun 2015	B2
9094335	Subramanian et al.	Jul 2015	B2
9112734	Edwards et al.	Aug 2015	B2
9118572	Sajassi et al.	Aug 2015	B2
9124652	Jain et al.	Sep 2015	B1
9143395	Bashandy et al.	Sep 2015	B2
9178796	Previdi et al.	Nov 2015	B2
9178805	Goel	Nov 2015	B2
9185022	Vasseur et al.	Nov 2015	B2
9197508	Vasseur et al.	Nov 2015	B2
9231726	Lee et al.	Jan 2016	B2
9253041	Previdi et al.	Feb 2016	B2
9258174	Gerstel et al.	Feb 2016	B1
9282031	Liu et al.	Mar 2016	B2
9300584	Filsfils et al.	Mar 2016	B1
9319312	Filsfils et al.	Apr 2016	B2
9369371	Filsfils et al.	Jun 2016	B2
9369387	Filsfils et al.	Jun 2016	B2
9391704	Gerstel et al.	Jul 2016	B2
9401858	Francois et al.	Jul 2016	B2
9444677	Kumar et al.	Sep 2016	B2
9462043	Frost et al.	Oct 2016	B2
9479403	Filsfils et al.	Oct 2016	B2
9491686	Bosch et al.	Nov 2016	B2
9503363	Sivabalan et al.	Nov 2016	B2
9525619	Filsfils et al.	Dec 2016	B2
9544232	Srinivasan et al.	Jan 2017	B2
9548959	Boutros et al.	Jan 2017	B2
9559954	Filsfils et al.	Jan 2017	B2
9565160	Previdi et al.	Feb 2017	B2
9571349	Previdi et al.	Feb 2017	B2
9590850	Filsfils et al.	Mar 2017	B2
9634867	Lee et al.	Apr 2017	B2
9634924	Filsfils et al.	Apr 2017	B2
9634929	Boutros et al.	Apr 2017	B2
9647944	Filsfils et al.	May 2017	B2
9660897	Gredler	May 2017	B1
9698910	Filsfils et al.	Jul 2017	B2
9705815	Mattson et al.	Jul 2017	B2
9749227	Frost et al.	Aug 2017	B2
9780909	Wood et al.	Oct 2017	B2
9813333	Zhao et al.	Nov 2017	B2
9825845	Wang et al.	Nov 2017	B2
9825856	Yong et al.	Nov 2017	B2
9832115	Cai et al.	Nov 2017	B2
9847939	Patel et al.	Dec 2017	B2
9858241	Srinivasan et al.	Jan 2018	B2
9912577	Filsfils et al.	Mar 2018	B2
9929946	Filsfils et al.	Mar 2018	B2
9942057	Bryant et al.	Apr 2018	B2
9979601	Filsfils et al.	May 2018	B2
9979629	Sivabalan et al.	May 2018	B2
10063475	Previdi et al.	Aug 2018	B2
10142160	Adams et al.	Nov 2018	B1
10212076	Morris	Feb 2019	B1
10382334	Previdi et al.	Aug 2019	B2
20010037401	Soumiya et al.	Nov 2001	A1
20010040895	Templin	Nov 2001	A1
20010052053	Nemirovsky et al.	Dec 2001	A1
20020057651	Roberts	May 2002	A1
20020057699	Roberts	May 2002	A1
20020080786	Roberts	Jun 2002	A1
20020099856	Shitama	Jul 2002	A1
20020101868	Clear et al.	Aug 2002	A1
20020103631	Feldmann et al.	Aug 2002	A1
20020103732	Bundy et al.	Aug 2002	A1
20020176371	Behzadi	Nov 2002	A1
20020191541	Buchanan	Dec 2002	A1
20030016678	Maeno	Jan 2003	A1
20030026271	Erb et al.	Feb 2003	A1
20030039212	Lloyd et al.	Feb 2003	A1
20030058790	Nagamine	Mar 2003	A1
20030099194	Lee	May 2003	A1
20030099203	Rajan et al.	May 2003	A1
20030118051	Ooms	Jun 2003	A1
20030126272	Corl et al.	Jul 2003	A1
20030133412	Iyer et al.	Jul 2003	A1
20030142674	Casey	Jul 2003	A1
20030142685	Bare	Jul 2003	A1
20030179742	Ogier	Sep 2003	A1
20030231634	Henderson et al.	Dec 2003	A1
20040032856	Sandstrom	Feb 2004	A1
20040160958	Oh	Aug 2004	A1
20040174879	Basso et al.	Sep 2004	A1
20040196840	Amrutur et al.	Oct 2004	A1
20040196854	Thubert et al.	Oct 2004	A1
20040202158	Takeno et al.	Oct 2004	A1
20040218535	Liong	Nov 2004	A1
20040219922	Gage et al.	Nov 2004	A1
20040240442	Grimminger et al.	Dec 2004	A1
20040249951	Grabelsky et al.	Dec 2004	A1
20050066017	Bogia	Mar 2005	A1
20050071130	Benjamin et al.	Mar 2005	A1
20050073958	Atlas et al.	Apr 2005	A1
20050105515	Reed et al.	May 2005	A1
20050174998	Vesterinen et al.	Aug 2005	A1
20050213513	Ngo et al.	Sep 2005	A1
20050232303	Deforche et al.	Oct 2005	A1
20050240943	Smith et al.	Oct 2005	A1
20050259586	Hatid et al.	Nov 2005	A1
20050259655	Cuervo et al.	Nov 2005	A1
20060002304	Ashwood-Smith	Jan 2006	A1
20060013209	Somasundaram	Jan 2006	A1
20060039364	Wright	Feb 2006	A1
20060039371	Castro et al.	Feb 2006	A1
20060045088	Nguyen	Mar 2006	A1
20060056397	Aizu et al.	Mar 2006	A1
20060075134	Aalto	Apr 2006	A1
20060080421	Hu	Apr 2006	A1
20060092940	Ansari et al.	May 2006	A1
20060126272	Horio et al.	Jun 2006	A1
20060146696	Li et al.	Jul 2006	A1
20060182034	Klinker et al.	Aug 2006	A1
20060187817	Charzinski et al.	Aug 2006	A1
20060215544	Asa et al.	Sep 2006	A1
20060239199	Blair	Oct 2006	A1
20060239201	Metzger et al.	Oct 2006	A1
20060262735	Guichard et al.	Nov 2006	A1
20060274716	Oswal et al.	Dec 2006	A1
20070019647	Roy et al.	Jan 2007	A1
20070053342	Sierecki et al.	Mar 2007	A1
20070058638	Guichard et al.	Mar 2007	A1
20070064715	Lloyd et al.	Mar 2007	A1
20070112975	Cassar	May 2007	A1
20070133406	Vasseur	Jun 2007	A1
20070147363	Oswal et al.	Jun 2007	A1
20070171825	Roberts et al.	Jul 2007	A1
20070171826	Roberts et al.	Jul 2007	A1
20070189291	Tian	Aug 2007	A1
20070230362	Bardalai et al.	Oct 2007	A1
20070237160	Natarajan et al.	Oct 2007	A1
20070245034	Retana et al.	Oct 2007	A1
20080002699	Rajsic	Jan 2008	A1
20080025203	Tallet	Jan 2008	A1
20080034116	Li et al.	Feb 2008	A1
20080037117	Seki et al.	Feb 2008	A1
20080075016	Ashwood-Smith	Mar 2008	A1
20080075117	Tanaka	Mar 2008	A1
20080084881	Dharwadkar et al.	Apr 2008	A1
20080101227	Fujita et al.	May 2008	A1
20080101239	Goode	May 2008	A1
20080101367	Weinman	May 2008	A1
20080172497	Mohan et al.	Jul 2008	A1
20080189393	Wagner	Aug 2008	A1
20080192762	Kompella et al.	Aug 2008	A1
20080212465	Yan	Sep 2008	A1
20080225864	Aissaoui et al.	Sep 2008	A1
20080253367	Ould-Brahim	Oct 2008	A1
20080259820	White et al.	Oct 2008	A1
20080279201	Lu et al.	Nov 2008	A1
20090041038	Martini et al.	Feb 2009	A1
20090049194	Csaszar et al.	Feb 2009	A1
20090067445	Diguet et al.	Mar 2009	A1
20090080431	Rekhter	Mar 2009	A1
20090135815	Pacella	May 2009	A1
20090141721	Filsfils	Jun 2009	A1
20090161576	Morris	Jun 2009	A1
20090175274	Aggarwal et al.	Jul 2009	A1
20090213858	Dolganow et al.	Aug 2009	A1
20090252161	Morris	Oct 2009	A1
20090285101	Lu	Nov 2009	A1
20090290486	Wang	Nov 2009	A1
20090296710	Agrawal	Dec 2009	A1
20090310481	Deng et al.	Dec 2009	A1
20090323694	Miki et al.	Dec 2009	A1
20090323696	Schwan et al.	Dec 2009	A1
20100010975	Morris	Jan 2010	A1
20100010992	Morris	Jan 2010	A1
20100011048	Morris	Jan 2010	A1
20100014424	Agrawal et al.	Jan 2010	A1
20100063983	Groarke et al.	Mar 2010	A1
20100088717	Candelore et al.	Apr 2010	A1
20100103937	O'Neil	Apr 2010	A1
20100124220	Morris	May 2010	A1
20100124231	Kompella	May 2010	A1
20100128628	Wu et al.	May 2010	A1
20100142401	Morris	Jun 2010	A1
20100142548	Sheth	Jun 2010	A1
20100145602	Morris	Jun 2010	A1
20100145963	Morris	Jun 2010	A1
20100146132	Morris	Jun 2010	A1
20100161732	Morris	Jun 2010	A1
20100195516	McReynolds et al.	Aug 2010	A1
20100202455	Sundaram et al.	Aug 2010	A1
20100220739	Ishiguro	Sep 2010	A1
20100232435	Jabr et al.	Sep 2010	A1
20100241742	Douceur et al.	Sep 2010	A1
20100250777	Morris	Sep 2010	A1
20100265943	Dong et al.	Oct 2010	A1
20100272110	Allan et al.	Oct 2010	A1
20100284309	Allan et al.	Nov 2010	A1
20100290480	Westphal et al.	Nov 2010	A1
20110007670	Yan	Jan 2011	A1
20110060844	Allan et al.	Mar 2011	A1
20110063986	Denecheau et al.	Mar 2011	A1
20110090913	Kim et al.	Apr 2011	A1
20110216779	Peterson et al.	Sep 2011	A1
20110228780	Ashwood-Smith et al.	Sep 2011	A1
20110261722	Awano	Oct 2011	A1
20110268114	Wijnands et al.	Nov 2011	A1
20110273980	Smith	Nov 2011	A1
20110280123	Wijnands et al.	Nov 2011	A1
20110286326	Awano	Nov 2011	A1
20110286452	Balus et al.	Nov 2011	A1
20120044944	Kotha et al.	Feb 2012	A1
20120063526	Xiao et al.	Mar 2012	A1
20120069740	Lu et al.	Mar 2012	A1
20120069845	Carney et al.	Mar 2012	A1
20120075988	Lu et al.	Mar 2012	A1
20120076014	Bragg	Mar 2012	A1
20120082034	Vasseur	Apr 2012	A1
20120092986	Chen	Apr 2012	A1
20120106560	Gumaste	May 2012	A1
20120120808	Nandagopal et al.	May 2012	A1
20120120959	Krause	May 2012	A1
20120147768	Johnsson et al.	Jun 2012	A1
20120163180	Goel	Jun 2012	A1
20120163384	Takase	Jun 2012	A1
20120170461	Long	Jul 2012	A1
20120179796	Nagaraj et al.	Jul 2012	A1
20120213225	Subramanian et al.	Aug 2012	A1
20120218884	Kini et al.	Aug 2012	A1
20120236860	Kompella et al.	Sep 2012	A1
20120239799	Wang et al.	Sep 2012	A1
20120287818	Corti et al.	Nov 2012	A1
20120307629	Vasseur	Dec 2012	A1
20130003728	Kwong et al.	Jan 2013	A1
20130051237	Ong	Feb 2013	A1
20130058345	Kano	Mar 2013	A1
20130077476	Enyedi et al.	Mar 2013	A1
20130077624	Keesara et al.	Mar 2013	A1
20130077625	Khera et al.	Mar 2013	A1
20130077626	Keesara et al.	Mar 2013	A1
20130114402	Ould-Brahim et al.	May 2013	A1
20130142052	Burbidge et al.	Jun 2013	A1
20130188634	Magee	Jul 2013	A1
20130219034	Wang et al.	Aug 2013	A1
20130227108	Dunbar et al.	Aug 2013	A1
20130232193	Ali et al.	Sep 2013	A1
20130250809	Hui et al.	Sep 2013	A1
20130258842	Mizutani	Oct 2013	A1
20130266012	Dutta et al.	Oct 2013	A1
20130266013	Dutta et al.	Oct 2013	A1
20130322248	Guo	Dec 2013	A1
20130343204	Geib et al.	Dec 2013	A1
20140003425	Zhao et al.	Jan 2014	A1
20140010083	Hamdi et al.	Jan 2014	A1
20140056300	Zhao et al.	Feb 2014	A1
20140067911	Block et al.	Mar 2014	A1
20140098675	Frost et al.	Apr 2014	A1
20140160925	Xu et al.	Jun 2014	A1
20140169370	Filsfils et al.	Jun 2014	A1
20140173078	McCord	Jun 2014	A1
20140185618	Perlman et al.	Jul 2014	A1
20140189045	Morris	Jul 2014	A1
20140189081	Morris	Jul 2014	A1
20140189152	Morris	Jul 2014	A1
20140189153	Morris	Jul 2014	A1
20140189154	Morris	Jul 2014	A1
20140189155	Morris	Jul 2014	A1
20140189156	Morris	Jul 2014	A1
20140189159	Morris	Jul 2014	A1
20140192677	Chew et al.	Jul 2014	A1
20140198634	Kumar et al.	Jul 2014	A1
20140204946	Li	Jul 2014	A1
20140211794	Frost et al.	Jul 2014	A1
20140215087	Zhao et al.	Jul 2014	A1
20140233385	Beliveau et al.	Aug 2014	A1
20140254596	Filsfils et al.	Sep 2014	A1
20140269266	Filsfils et al.	Sep 2014	A1
20140269421	Previdi et al.	Sep 2014	A1
20140269422	Filsfils et al.	Sep 2014	A1
20140269698	Filsfils et al.	Sep 2014	A1
20140269699	Filsfils et al.	Sep 2014	A1
20140269721	Bashandy et al.	Sep 2014	A1
20140269725	Filsfils et al.	Sep 2014	A1
20140269727	Filsfils et al.	Sep 2014	A1
20140286195	Fedyk	Sep 2014	A1
20140317259	Previdi et al.	Oct 2014	A1
20140328207	Agrawal et al.	Nov 2014	A1
20140341222	Filsfils et al.	Nov 2014	A1
20140369356	Bryant et al.	Dec 2014	A1
20150003455	Haddad et al.	Jan 2015	A1
20150003458	Li et al.	Jan 2015	A1
20150003463	Li et al.	Jan 2015	A1
20150023328	Thubert et al.	Jan 2015	A1
20150109902	Kumar	Apr 2015	A1
20150156035	Foo et al.	Jun 2015	A1
20150188804	Ashwood-Smith	Jul 2015	A1
20150195197	Yong et al.	Jul 2015	A1
20150200843	Frost et al.	Jul 2015	A1
20150207671	Farkas et al.	Jul 2015	A1
20150236959	Cai et al.	Aug 2015	A1
20150256456	Previdi et al.	Sep 2015	A1
20150263940	Kini et al.	Sep 2015	A1
20150271066	Frost et al.	Sep 2015	A1
20150271102	Antich	Sep 2015	A1
20150326473	Dunbar et al.	Nov 2015	A1
20150326675	Kini et al.	Nov 2015	A1
20150381406	Francois et al.	Dec 2015	A1
20160006614	Zhao	Jan 2016	A1
20160021000	Previdi et al.	Jan 2016	A1
20160028640	Zhang et al.	Jan 2016	A1
20160173366	Saad et al.	Jun 2016	A1
20160191372	Zhang et al.	Jun 2016	A1
20160254987	Eckert et al.	Sep 2016	A1
20160254988	Eckert et al.	Sep 2016	A1
20160254991	Eckert et al.	Sep 2016	A1
20160352629	Wang et al.	Dec 2016	A1
20160352654	Filsfils et al.	Dec 2016	A1
20160373317	Ali et al.	Dec 2016	A1
20170005877	Papadimitriou	Jan 2017	A1
20170019330	Filsfils et al.	Jan 2017	A1
20170041223	Akashi	Feb 2017	A1
20170048138	Sivabalan et al.	Feb 2017	A1
20170064717	Filsfils et al.	Mar 2017	A1
20170104673	Bashandy et al.	Apr 2017	A1
20170111261	Francois et al.	Apr 2017	A1
20170111277	Previdi et al.	Apr 2017	A1
20170230274	Filsfils et al.	Aug 2017	A1
20170302561	Filsfils et al.	Oct 2017	A1
20170302571	Frost et al.	Oct 2017	A1
20170324497	Ruffini et al.	Nov 2017	A1
20170324654	Previdi et al.	Nov 2017	A1
20170331672	Fedyk et al.	Nov 2017	A1
20170346718	Psenak et al.	Nov 2017	A1
20170346737	Previdi et al.	Nov 2017	A1
20170366453	Previdi et al.	Dec 2017	A1
20180034728	Filsfils et al.	Feb 2018	A1
20180041420	Saad et al.	Feb 2018	A1
20180083871	Filsfils et al.	Mar 2018	A1
20180109450	Filsfils et al.	Apr 2018	A1
20180131616	LaBerge et al.	May 2018	A1
20180302320	Aranha et al.	Oct 2018	A1
20190349303	Previdi et al.	Nov 2019	A1

Foreign Referenced Citations (18)

Number	Date	Country
1726679	Jan 2006	CN
101247253	Aug 2008	CN
101399688	Apr 2009	CN
101496357	Jul 2009	CN
101803293	Aug 2010	CN
101841442	Sep 2010	CN
101616466	Dec 2010	CN
102098222	Jun 2011	CN
102132533	Jul 2011	CN
102299852	Dec 2011	CN
102498694	Jun 2012	CN
101931548	Sep 2012	CN
102714625	Oct 2012	CN
2974164	Jan 2016	EP
2974176	Jan 2016	EP
2009018728	Feb 2009	WO
2015063618	May 2015	WO
2015094296	Jun 2015	WO

Non-Patent Literature Citations (218)

Entry
Reconsideration After Non-Final Rejection dated Apr. 9, 2019 for U.S. Appl. No. 16/153,114.
Reconsideration After Non-Final Rejection dated May 17, 2019 for U.S. Appl. No. 16/264,580.
Reconsideration After Non-Final Rejection dated May 20, 2019 for U.S. Appl. No. 16/264,580.
Rekhter et al.,“Carrying Label Information in BGP-4,” Request for Comments 3107, the Internet Society, May 2001, 8 pages.
Rekhter, et. al, “Application of the Border Gateway Protocol in the Internet”, RFC 1268, pp. 1-13, Internet Engineering Task Force, http://tools.ietf.org/rfc/rfc1268.txt, Oct. 1991.
Rekhter, Y. et al (ed), “A Border Gateway Protocol 4 {BGP-4)”, RFC 4271, pp. 1-104, Internet Engineering Task Force, http://tools.ietf.org/rfc/rfc4271.txt, Jan. 2006.
Response to Final Office Action dated Apr. 30, 2019 for U.S. Appl. No. 16/153,050.
Roberts, Lawrence, “A Radical New Router”, IEEE Spectrum, Jul. 2009, pp. 1-6.
Rosen et al. “Multiprotocol Label Switching Architecture,” RFC 3031, Jan. 2001, 61 pages.
Rosen et al., “BGP/MPLS IP Virtual Private Networks (VPNs),” Network Working Group, RFC 4364, Standards Track, Feb. 2006, 47 pages; https://tools.ietf.org/pdf/rfc4364.pdf.
Rosen et al., “BGP/MPLS VPNs”, Cisco Systems, Inc., Network Working Group, Request for Comments: 2547; Mar. 1999, pp. 1-25.
Sivabalan et al., “PCE-Initiated Traffic Engineering Path Setup in Segment Routed Networks; draft-sivabalan-pcesegmentrouting-00,” Internet Engineering Task Force, IETF, Standard Working Draft, Internet Society (ISOC) 4, Rue Des Falaises CH-1205, Geneva, Switzerland, Jun. 2013, pp. 1-16.
Steenstrup, M., “Inter-Domain Policy Routing Protocol Specification: Version 1”, RFC 1479, pp. 1-108, Internet Engineering Task Force, http://tools.ietf.org/rfc/rfc1479.txt, Jul. 1993.
Tian et al., “Source Routed MPLS LSP Using Domain Wide Label,” draft-tian-mpls-lsp-source-route-01.txt, Redback Networks, Network Working Group, Internet Draft, Jul. 2004, pp. 1-12.
Vasseur et al., “A Link-Type Sub-TLV to Convey the Number of Traffic Engineering Label Switched Paths Signaled with Zero Reserved Bandwidth Across a Link,” Cisco Systems, Inc., Network Working Group, Request for Comments 5330, Oct. 2008, 16 pages.
Vasseur et al., “Path Computation Element (PCE) Communication Protocol (PCEP) Request for Comments: 5440,” Cisco Systems, Internet Engineering Task Force, IETF, Standard, Internet Society (ISOC) 4, Rue Des Falaises CH-1205, Geneva, Switzerland, chapters 4-8, Mar. 2009, pp. 1-87.
Waitzman, D., et al, “Distance Vector Multicast Routing Protocol”, RFC 1075, pp. 1-24, Internet Engineering Task Force, http://tools.ietf.org/rfc/rfc1075.txt, Nov. 1988.
Wang et al., “Research and Implementation of a Scalable Secure Active Network Node”, Proceedings of the First International Conference on Machine Learning and Cybernetics, IEEE, Nov. 2002, pp. 111-115.
Wetherall et al., “The Active IP Option,” Proceedings of the 7th Workshop of ACM SIGOPS Systems Support for Worldwide Applications, Sep. 1996, pp. 33-40.
Wijnands et al., “Multicast Extensions for LDP,” Cisco Systems, Inc., Yuji Kamite and Hitoshi Fukuda, NTT Communications, Network Working Group; Internet Draft; Mar. 2005, pp. 1-12.
Abandonment Jun. 24, 2019 for U.S. Appl. No. 15/961,832.
Abley. J .. et al. ““Deprecation of Type 0 Routing Headers in IPv6””. RFCC 5095. pp. 1-7. Internet Engineering Task Force. http://tools.ietf.org/rfc/rfc5095.txt. Dec. 2007.
Advisory_Action_dated_Sep. 17, 2019_for_U.S. Appl. No. 16/195,830.
Aggarwal et al., “MPLS Upstream Label Assignment and Context Specific Label Space,” Network Working Group, FRC 5331, Aug. 2008, 13 pages.
Akiya et al., “Seamless Bidirectional Forwarding Detection (BFD) for Segment Routing (SR),” draft-akiyabfd-seamless-sr-01, Internet Engineering Task Force, Internet-Draft, Dec. 5, 2013, 7 pages.
Akiya et al., “Seamless Bidirectional Forwarding Detection (BFD) for Segment Routing (SR),” draft-akiyabfd-seamless-sr-02, Internet Engineering Task Force, Internet-Draft, Jun. 7, 2014, 7 pages.
Akiya et al., “Seamless Bidirectional Forwarding Detection (BFD) for Segment Routing (SR),” draft-akiyabfd-seamless-sr-03, Internet Engineering Task Force, Internet-Draft, Aug. 23, 2014, 7 pages.
Akiya et al., “Seamless Bidirectional Forwarding Detection (BFD) for Segment Routing (SR),” draft-akiyabfd-seamless-sr-04, Internet Engineering Task Force, Internet-Draft, Feb. 23, 2015, 7 pages.
Akiya et al., “Seamless Bidirectional Forwarding Detection (BFD) for Segment Routing (SR),” draft-akiyabfdseamless-sr-00, Internet Engineering Task Force, Internet-Draft, Jun. 7, 2013, 7 pages.
Akiya, N., “Segment Routing Implications on BFD,” Sep. 9, 2013, 2 pages.
Alcatel-Lucent, “Segment Routing and Path Computation Element—Using Traffic Engineering to Optimize Path Placement and Efficiency in IP/MPLS Networks,” Technology White Paper, 2015, 28 pages.
Aldrin et al., “Seamless Bidirectional Forwarding Detection (S-BFD) Use Cases,” draft-ietf-bfd-seamlessuse-case-08, Network Working Group, Internet-Draft, May 6, 2016, 15 pages.
Almquist, P., “Type of Service in the Internet Protocol Suite”, RFC 1349, pp. 1-28, Internet Engineering Task Force, http://lools.ielf.org/rfc/rfc1349. lxl, Jul. 1992.
Awduche et al., “Overview and Principles of Internet Traffic Engineering,” Network Working Group, Request for Comments, 3272, May 2002, pp. 1-71.
Awduche et al., “Requirements for Traffic Engineering Over MPLS,” Network Working Group, Request for Comments, 2702, Sep. 1999, pp. 1-29.
Awduche et al., “RSVP-TE: Extensions to RSVP for LSP Tunnels,” Network Working Group, Internet-Draft, Feb. 2001, pp. 1-12.
Awduche et al., “RSVP-TE: Extensions to RSVP for LSP Tunnels,” Network Working Group, RFC 3209, Dec. 2001, pp. 1-61.
Backes et al., “Deutsche Telekom AG's Statement About IPR Related to Draft-Geig-Spring-OAM-Usecase-01,” Aug. 23, 2012, pp. 1-2.
Backes et al., “Deutsche Telekom AG's Statement About IPR Related to Draft-Geig-Spring-OAM-Usecase-01,” Feb. 5, 2014, pp. 1-2.
Baker, F. (ed), “Requirements for IP Version 4 Routers”, RFC 1812, pp. 1-175, Internet Engineering Task Force, http://tools.ietf.org/rfc/rfc1812.txt, Jun. 1995.
Bates et al., “Multiprotocol Extensions for BGP-4,” Network Working Group, RFC 4760, Standards Track, Jan. 2007, 47 pages; https://tools.ietf.org/pdf/rfc4760.pdf.
Begtasevic, F. et al. “Measurements of the Hopcount in Internet,” Delft University of Technology, Information Technology and Systems, 7 pages.
Bergkvist, J., et al, “Boomerang—a Simple Resource Reservation Framework for IP”, drafl-ietf-manet-cbrp-spec-01.txt, pp. 1-15, Internet Engineering Task Force.http ://tools.ietf.org/html/drafl-ietf-manet-cbrp-spec-01.txt, Nov. 2000.
Bryant et al., “IP Fast Reroute Using Tunnels-draft-bryant-ipfrr-tunnels-03,” Cisco Systems, Network Working Group, Internet-Draft, Nov. 16, 2007, pp. 1-30.
Bryant et al., “Remote LFA FRR,” Cisco Systems, draft-ieff-rtgwg-remote-lfa-04, Network Working Group, Internet-Draft, Nov. 22, 2013, pp. 1-24.
Chandranmenon, Girish and Varghese, George. “Trading Packet Headers for Packet Processing,” Sigcomm, 1995.
Chroboczek, J., “The Babel Routing Protocol”, RFC 6126, pp. 1-45, Internet Engineering Task Force, http://tools.ietf_ org/rfc/rfc6126. txt, Apr. 2011.
Cisco Systems, Inc., “Introduction to Intermediate System-to-Intermediate System Protocol,” published 1992-2002; pp. 1-25.
Clausen,T. et al {ed), “Optimized Link State Routing Protocol {OSLR)”, RFC 3626, pp. 1-75, Internet Engineering Task Force, http://tools.ietf.org/rfc/rfc3626.txt, Oct. 2003.
Colton, R., et al, “OSPF for IPv6”, RFC 2740, pp. 1-80, Internet Engineering Task Force, http:fftools.ietf.org/rfc/rfc2740.txt, Dec. 1999.
Crabbe et al., “PCEP Extensions for MPLS-TE LSP Protection With Stateful PCE Draft-Crabbe-PCE-Stateful-PCE-Protection-00,” Network Working Group, Internet-Draft, Oct. 2012, pp. 1-12.
Crabbe et al., “PCEP Extensions for MPLS-TE LSP Protection With Stateful PCE Draft-Crabbe-PCE-Stateful-PCTProtection-04,” Network Working Group, Internet-Draft, May 8, 2013, pp. 1-54.
Crabbe et al., Stateful PCE Extensions for MPLS-TE LSPs, draft-crabbe-pce-stateful-pce-mpls-te-00, Network Working Group, Internet-Draft, Oct. 15, 2012, pp. 1-15.
Crabbe et al., “Stateful PCE Extensions for MPLS-TE LSPs,” draft-crabbe-pce-statement-pce-mpls-te-01, Network Working Group, Internet-Draft, May 8, 2013, pp. 1-11.
Deering et al., “Internet Protocol, Version 6 (1Pv6) Specification,” Cisco, Network Working Group, Request for Comments 2460, Dec. 1998, pp. 1-39.
Deering, S, et al, “Internet Protocol, Version 6, (IPv6) Specification”, RFC 2460, pp. 1-39, Internet Engineering Task Force (IEFT), http://tools.iefl.org/rfc/rfc2460. txt, Dec. 1998.
Deering, S. (ed)., “ICMP Router Discovery Messages”, RFC 1256, pp. 1-19, Internet Engineering Task Force, http://tools. ielf. org/rfc/rfc1256. !xi, Sep. 1991.
Deering, S. et al, “IPv6 Scoped Address Architecture” RFC 4007, Network Working Group, Mar. 2005, 24 pages.
Dragos Niculescu, “Survey of Active Network Research”, Retrieved on Jul. 22, 2004, Jul. 1999, pp. 1-13.
Eckert et al., “Traffic Engineering for Bit Index Explicit Replication BIER-TE, draft-eckert-bier-te-arch-01,” Network Working Group, Internet-Draft, Jul. 5, 2015, pp. 1-23.
Eckert T., “Traffic Engineering for Bit Index Explicit Replication BIER-TE, draft-eckert-bier-te-arch-00,” Network Working Group, Internet-Draft, Mar. 5, 2015, pp. 1-21.
Estrin, D. et al, “A Unified Approach to Inter-Domain Routing”, RFC 1322, pp. 1-38, Internet Engineering Task Force, http://lools.ielf.org/rfc/rfc1322.lxl, May 1992.
Estrin, D. et al, “Source Demand Routing: Packet Format and Forwarding Specification (Version 1 ).”, RFC 1940, pp. 1-27, Internet Engineering Task Force, http://lools.ielf.org/rfc/rfc1940.lxl, May 1996.
Farinacci et al., “Generic Routing Encapsulation (GRE),” Network Working Group, RFC 2784, Standards Track, Mar. 2000, 9 pages; https://tools.ietf.org/pdf/rfc2784.pdf.
Carrel et al., “A Path Computation Element (PCE)-Based Architecture,” Old Dog Consulting, Network Working Group, Request for Comments 4655, Aug. 2006, pp. 1-80.
Farrel et al., “Inter-Domain MPLS and GMPLS Traffic Enginerring—Resource Reservation Protocol—Traffic Enginerring (RSVP-TE) Extensions,” Old Dog Consulting, Newtork Working Group, Request for Comments 5151, Feb. 2008, pp. 1-25.
Farrel, “Path Computation Element,” Presentation, 11th Annual International Conference on Next Generation Internet and Related Technologies MPLS 2008, Oct. 19-22, 2008, 57 pages.
Fedyk et al., “Generalized Multiprotocol Label Switching (GMPLS) Control Ethernet Provider Backbone Traffic Engineering (PBB-TE),” Alcatel-Lucent, Internet Engineering Task Force (IETF), Request for Comments 6060, Mar. 2011, pp. 1-20.
U.S. Appl. No. 61/710,121.
U.S. Appl. No. 61/822,386.
U.S. Appl. No. 61/822,978.
U.S. Appl. No. 61/830,064.
U.S. Appl. No. 61/831,932.
U.S. Appl. No. 61/833,565.
U.S. Appl. No. 61/897,234.
U.S. Appl. No. 61/621,811.
U.S. Appl. No. 61/729,119.
Filsfils et al., “Segment Routing Architecture,” Cisco Systems, Inc., draft-filsfils-rtgwg-segment-routing-00, Jun. 28, 2013, pp. 1-28.
Filsfils et al., “Segment Routing Architecture,” Cisco Systems, Inc., draft-filsfils-rtgwgsegment-routing-01, Network Working Group, Internet-Draft, Oct. 21, 2013, pp. 1-28.
Filsfils et al., “Segment Routing Architecture,” Cisco Sytems, Inc., draft-filsfilsrtgwg-segment-routing-01, Network Working Group, Internet-Draft, Oct. 21, 2013, pp. 1-28.
Filsfils et al., “Segment Routing Architecture,” draft-ietf-spring-segment-routing-07, Network Working Group, Internet-Draft, Dec. 15, 2015, pp. 1-24.
Filsfils et al., “Segment Routing Interoperability with LDP,” Cisco Systems, Inc., draft-filsfils-springsegment-routing-dp-interop-01; Apr. 18, 2014, pp. 1-16.
Filsfils et al., “Segment Routing Interoperability with LDP,” Cisco Systems, Inc., draft-filsfils-spring-segment-routingldp-interop-01.txt, Apr. 18, 2014, pp. 1-16.
Filsfils et al., “Segment Routing Use Cases,” draft-filsfils-rtgwg-segment-routing-use-cases-01, Network Working Group, Internet-Draft, Jul. 14, 2013, pp. 1-46.
Filsfils et al., “Segment Routing Use Cases,” draft-filsfils-rtgwg-segment-routing-use-cases-02, Network Working Group, Internet-Draft, Oct. 21, 2013, pp. 1-36.
Filsfils et al., “Segment Routing with MPLS Data Plane,” draft-ietf-spring-segment-routing-mpls-05, Network Working Group, Internet-Draft, Jul. 6, 2016, 15 pages.
Final Rejection dated Mar. 28, 2019 for U.S. Appl. No. 16/101,386.
Final Rejection dated Jun. 13, 2019 for U.S. Appl. No. 16/153,114.
Final Rejection dated Jun. 14, 2019 for U.S. Appl. No. 16/195,823.
Final Rejection dated Jun. 17, 2019 for U.S. Appl. No. 16/195,827.
Final Rejection dated Jul. 12, 2019 for U.S. Appl. No. 16/264,580.
Final Rejection dated Jul. 22, 22019 for U.S. Appl. No. 16/195,830.
Frost et aL, “MPLS Generic Associated Channel (G-Ach) Advertisement Protocol,” Cisco Systems, Inc., draft-ietfmpls-gach-adv-00, Internet-Draft, Jan. 27, 2012, pp. 1-17.
Frost et al., “MPLS Generic Associated Channel (G-Ach) Advertisement Protocol,” Cisco Systems, Inc., draft-ietfmpls-gach-adv-08, Internet-Draft, Jun. 7, 2013, pp. 1-22.
Frost et al., “MPLS Generic Associated Channel (G-Ach) Advertisement Protocol,” Cisco Systems, Inc., Request for Comments 7212, Jun. 2014, pp. 1-23.
Fuller, V, et al, “Classless Inter-Domain Routing (CIDR): An Address Assignment and Aggregation Strategy”, RFC 1519, pp. 1-24, Internet Engineering Task Force (IEFT), http:l/tools.ieft.org/rfc/rfc1519.txt, Jun. 1999.
Fuller, V. et al, “Classless Inter-Domain Routing (CIDR): an Address Assignment and Aggregation Strategy” RFC 1519, Network Working Group, CIDR Address Strategy, Sep. 1993, 24 pages.
Geib, R., “Segment Routing Based OAM Use Case,” IETF 87, Berlin, Jul./Aug. 2013, pp. 1-3.
Geib, R., “Use Case for a Scalable and Topology Aware MPLS data plan moniotoring System,” Deutsch Telekom, draft-geib-spring-oam-usecase-01, Internet-Draft, Feb. 5, 2014, pp. 1-10.
Geib, R., “Use Case for a Scalable and Topology Aware MPLS data plan monitoring System,” Deutsch Telekom, draft-geib-spring-oam-usecase-00, Internet-Draft, Oct. 17, 2013, pp. 1-7.
Gerla, M., et al, “Fisheye State Routing Protocol (FSR) for Ad Hoc Netvvorks”, draft-ietf-manet-fsr-03.txt, pp. 1-17, Internet Engineering Task Force,http:f/tools.ietf.org/html/draft-ietf-manet-fsr-03.txt, Jun. 2002.
Glenn, R. et al, “The NULL Encryption Algorithm and Its Use With Ipsec” RFC 2410, Network Working Group, Nov. 1998, 6 pages.
Gredler et al., “Advertising MPLS Labels in IS-IS draftgredler-isis-label-advertisement-00,” Juniper Networks, Inc., Internet-Draft, Apr. 5, 2013, pp. 1-13.
Gredler et al., “Advertising MPLS LSPs in the IGP,” hannes@juniper.net, IETF87, Berlin, draft-gredler-ospf-label-advertisement-03, May 21, 2013, pp. 1-17.
Guilbaud, “Google-Localizing Packet Loss in a Large Complex Network,” Nicolas Guilbaud and Ross Cartlidge, Google Presentation, Feb. 5, 2013, pp. 1-43.
Gupta, P. et al, “Routing Lookups in Hardware at Memory Access Speeds,” Computer Systems Laboratory, Stanford University, Stanford, CA 94305-9030, 8 pages.
Halpern et al., “Service Function Chaining (SFC) Architecture—draft-ietf-sfc-architecture-09,” Network Workinq Group, Internet-Draft, Jun. 7, 2015, pp. 1-29.
Hass, Z., et al, “The Interzone Routing Protocol (IERP) for Ad Hoc Networks”, draft-ietf-manet-zone-ierp-02.txt, pp. 1-14, Internet Engineering Task Force,http://tools.ietf.org/html/draft-ietf-manet-zone-ierp-02.txt, Jul. 2002.
Hedrick, C, “Routing Information Protoocl”, RFC 1058, pp. 1-33, Internet Engineering Task Force, http://tools.ietf.org/rfc/rfc1058.txt, Jun. 1988.
Hinden et al “IPv6 Global Unicast Address Format” RFC 3587, Aug. 2003, 5 pages.
Hinden, R. et al, “An IPv6 Aggregatable Global Unicast Address Format” RFC 2374, Network Working Group, Jul. 1998, 12 pages.
Hinden, R. et al, “Internet Protocol Version 6 (IPv6) Addressing Architecture” RFC 3513, Network Working Group, Apr. 2003, 26 pages.
Hinden, R. et al, “Internet Protocol Version 6 (IPv6) Addressing Architecture”, RFC 3513, pp. 1-26, Internet Engineering Task Force, http://tools.ietf.org/rfc/rfc3513.txt, Apr. 2003.
Hinden, R., et al,, “Aggregatable Global Unicast Address Format”, RFC 2374, pp. 1-12, Internet Engineering Task Force, http:/tools.ietf.org/rfc/rfc2374, Jul. 1998.
Housley, R., “Using Advanced Encryption Standard (AES) CCM Mode with IPsec Encapsulating Security Payload (ESP),” Network Working Group, RFC 4309, Standards Track, Dec. 2005, 13 pages; https://tools.ietf.org/pdf/rfc4309.pdf.
Hu, Y., et al, “Flow State in Dynamic Source Routing Protocol for Mobile Ad Hoc Networks”, drafl-ietf-manet-dsrflow-00.txt, pp. 1-30, Internet Engineering Task Force,http://tools.ietf.org/html/drafl-ietf-manet-dsrflow-OO.txt, Feb. 2001.
Hui. J .. et al. ““An IPv6 Routing Header for Source Routes with the Routing Protocol for Low-Power and Lossy Networks (RPL)””. RFC 6554. pp. 1-13. Internet Engineering Task Force. http://tools.ietf.org/rfc/rfc6554.txt. Mar. 2012.
Imaizumi et al., “FMEHR: An Alternative Approach to Multi-Path Forwarding on Packed Switched Networks,” Networks, 2005, pp. 196-201.
Jiang, M., et al, “Cluster Based Routing Protocol (CBR)”, ddrafl-ietf-manet-cbrp-spec-01.txt, pp. 1-27, Internet Engineering Task Force,http://tools.ietf.org/html/ddrafl-ietf-manet-cbrp-spec-01.txt, Aug. 1999.
Johnson, D., et al, “The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4”, RFC 4728, pp. 1-107, Internet Engineering Task Force, http://lools.ielf.org/rfc/rfc4728.lxl, Feb. 2007.
Kent et al., “Security Architecture for the Internet Protocol,” Network Working Group, RFC 4301, Standards Track, Dec. 2005, 101 pages; https://tools.ietf.org/pdf/rfc4301.pdf.
Kettaf, N., et al, “Admission Control enabled on demand Routing (ACOR)”, drafl-kettaf-manet-acor-03.txt pp. 1-24, Internet Engineering Task Force,http://tools.ietf.org/html/draft-kettaf-manet-acor-03.txt, Oct. 2007.
Kompella et al, “Label Switched Paths (LSP) Hierarchy with Generalized Multi-Protocol Label Switching (GMPLS) Traffic Enginerring (TE),” Juniper Networks, Network Working Group, Request for Comments 4206, Oct. 2005, pp. 1-14.
Kompella et al., “Detecting Multi-Protocol Label Switched (MPLS) Data Plane Failures,” Juniper Networks, Inc., Network Working Group, Request for Comments 4379, Feb. 2006, pp. 1-50.
Kompella et al., “Virtual Private LAN Service (VPLS) Using BGP for Auto-Discovery and Signaling,” Network Working Group, Request for Comments 4761, Juniper Networks, Jan. 2007, pp. 1-28.
Kumar et al., “Label Switched Path (LSP) Ping/Trace for Segment Routing Networks Using MPLS Dataplane,” Cisco Systems, Inc., draft-kumar-mpls-spring-lsp-ping-00, Oct. 21, 2013, pp. 1-12.
Kumar et al., “Label Switched Path (LSP) Ping/Trace for Segment Routing Networks Using MPLS Dataplane,” draft-ietf-mpls-spring-lsp-ping-00, Network Work Group, Internet Draft, May 10, 2016, 17 pages.
Kumar et al., “Label Switched Path (LSP) Ping/Trace for Segment Routing Networks Using MPLS Dataplane,” draftkumarkini-mpls-spring-lsp-ping-00, Network Work Group, Internet-Draft, Jan. 2, 2014, pp. 1-15.
Kumar et al., “OAM Requirements for Segment Routing Network,” draft-kumar-spring-sr-oam-requirement-00, Spring, Internet-Draft, Feb. 14, 2014, 6 pages.
Kumar et al., “OAM Requirements for Segment Routing Network,” draft-kumar-spring-sr-oam-requirement-01, Spring; Internet-Draft, Jul. 1, 2014, 6 pages.
Kumar et al., “OAM Requirements for Segment Routing Network,” draft-kumar-spring-sr-oam-requirement-02, Spring, Internet-Draft, Dec. 31, 2014, 6 pages.
Kmar et al., “OAM Requirements for Segment Routing Network,” draft-kumar-spring-sr-oam-requirement-03, Spring, Internet-Draft, Mar. 9, 2015, 6 pages.
Lauder, P. et al, “Hierarchical Network Routing,” Software Systems Research Group, Department of Computer Scient, University of Sydney, 13 pages, available at www.janeelix.com/piers/papers/Routing/routing.html.
Li et al., “IS-IS Extensions for Traffic Engineering,” Redback Networks, Inc., Network Working Group, Request for Comments 5305, Oct. 2008, 17 pages.
Li, T. T (ed), “Recommendataion for a Routing Architecture”, RFC 6115, pp. 1-73, Internet Engineering Task Force, httP:/ftools.ietf.org/rfc/rfc6115.txt, Feb. 2011.
Lougheed, K., et al, (ed.),“A Border Gateway Protocol 3 (BGP-3)”, RFC 1267, pp. 1-35, Internet Engineering Task Force, http://tools.ietf.org/rfc/rfc1267.txt, Oct. 1991.
Mahalingam et al., “Virtual eXtensible Local Area Network (VXLAN): A Framework for Overlaying Virtualized Layer 2 Networks over Layer 3 Networks,” Network Working Group, RFC 7348, Aug. 2014, 22 pages; https://tools.ietf.org/pdf/rfc7348.pdf.
Metaswitch Networks, “PCE—an Evolutionary Approach to SDN,” Metaswitch Networks White Paper, 2010, 21 pages; http://www.metaswitch.com/sites/default/files/metaswitch-white-paper-pce-an-evolutionary-approach-to-sdn.pdf.
Moy, J, “OSPF Version 2”, RFC 2328, pp. 1-13, Internet Engineering Task Force, http://tools.ietf.org/rfc/rfc2328.txt, Oct. 1991.
Neumann, A., et al, “Better Approach to Mobile Ad-hoc Netvvorking (BAT.MAN.)”, draft-wunderlich-openmesh- manet-routing-00.txt pp. 1-24, Internet Engineering Task Force,http://tools.ietf.org/html/drafl-wunderlich-openmesh-manet-routing-003.txt, Apr. 2008.
NOA_dated_Aug. 22, 2019_for_U.S. Appl. No. 16/153,262.
NOA_dated_Aug. 26, 2019_for_U.S. Appl. No. 16/153,114.
Non-Final Rejection filed Apr. 17, 2019 for U.S. Appl. No. 16/195,832.
Non-Final Rejection dated Apr. 4, 2019 for U.S. Appl. No. 16/153,114.
Non-Final Rejection dated May 6, 2019 for U.S. Appl. No. 16/264,580.
Non-Final Rejection dated May 15, 2019 for U.S. Appl. No. 16/181,286.
Non-Final Rejection dated Jun. 10, 2019 for U.S. Appl. No. 16/296,195.
Non-Final Rejection dated Jun. 14, 2019 for U.S. Appl. No. 16/269,524.
Non-Final Rejection dated Jul. 31, 2019 for U.S. Appl. No. 16/454,040.
Non-Final Rejection dated Aug. 1, 2019 for U.S. Appl. No. 16/454,030.
Non-Final Rejection dated Aug. 1, 2019 for U.S. Appl. No. 16/454,043.
Non-Final_Rejection_dated_Sep. 12, 2019_for_U.S. Appl. No. 16/195,823.
Notice of Allowance filed Mar. 29, 2019 for U.S. Appl. No. 16/101,382.
Notice of Allowance filed Mar. 29, 2019 for U.S. Appl. No. 16/101,387.
Notice of Allowance filed Apr. 17, 2019 for U.S. Appl. No. 16/153,146.
Notice of Allowance filed Apr. 19, 2019 for U.S. Appl. No. 16/195,816.
Notice of Allowance filed Apr. 12, 2019 for U.S. Appl. No. 16/101,386.
Notice of Allowance dated Mar. 1, 2019 for U.S. Appl. No. 15/961,826.
Notice of Allowance dated Mar. 7, 2019 for U.S. Appl. No. 15/961,832.
Notice of Allowance dated Mar. 27, 2019 for U.S. Appl. No. 15/961,828.
Notice of Allowance dated Apr. 17, 2019 for U.S. Appl. No. 16/153,146.
Notice of Allowance dated Apr. 19, 2019 for U.S. Appl. No. 16/195,816.
Notice of Allowance dated Apr. 25, 2019 for U.S. Appl. No. 16/153,223.
Notice of Allowance dated Apr. 29, 2019 for U.S. Appl. No. 16/153,196.
Notice of Allowance dated Apr. 30, 2019 for U.S. Appl. No. 15/961,826.
Notice of Allowance dated May 16, 2019 for U.S. Appl. No. 16/153,262.
Notice of Allowance dated May 17, 2019 for U.S. Appl. No. 16/153,050.
Notice of Allowance dated May 22, 2019 for U.S. Appl. No. 16/101,382.
Notice of Allowance dated May 24, 2019 for U.S. Appl. No. 16/101,387.
Notice of Allowance dated May 28, 2019 for U.S. Appl. No. 16/101,386.
Notice of Allowance dated May 28, 2019 for U.S. Appl. No. 16/195,816.
Notice of Allowance dated May 31, 2019 for U.S. Appl. No. 16/101,382.
Notice of Allowance dated Jun. 1, 2019 for U.S. Appl. No. 15/961,826.
Notice of Allowance dated Jun. 4, 2019 for U.S. Appl. No. 15/961,828.
Notice of Allowance dated Jun. 4, 2019 for U.S. Appl. No. 15/961,832.
Notice of Allowance dated Jun. 7, 2019 for U.S. Appl. No. 16/101,380.
Notice of Allowance dated Jun. 14, 2019 for U.S. Appl. No. 16/195,832.
Notice of Allowance dated Jun. 24, 2019 for U.S. Appl. No. 16/101,386.
Notice of Allowance dated Jun. 11, 2019 for U.S. Appl. No. 16/153,146.
Notice of Allowance dated Jun. 11, 2019 for U.S. Appl. No. 16/153,196.
Notice of Allowance dated Jun. 11, 2019 for U.S. Appl. No. 16/153,223.
Notice of Allowance dated Jul. 3, 2019 for U.S. Appl. No. 16/153,196.
Notice of Allowance dated Jul. 12, 2019 for U.S. Appl. No. 16/195,827.
Notice of Allowance dated Jul. 22, 2019 for U.S. Appl. No. 16/101,387.
Notice of Allowance dated Jul. 22, 2019 for U.S. Appl. No. 16/153,050.
Notice of Allowance dated Jul. 22, 2019 for U.S. Appl. No. 16/153,168.
Notice of Allowance dated Jul. 31, 2019 for U.S. Appl. No. 16/101,380.
Notice of Allowance dated Aug. 5, 2019 for U.S. Appl. No. 16/153,146.
Notice of Allowance dated Aug. 9, 2019 for U.S. Appl. No. 16/153,223.
Notice of Allowance dated Aug. 12, 2019 for U.S. Appl. No. 16/153,262.
Notice of Allowance dated Aug. 13, 2019 for U.S. Appl. No. 16/195,827.
Notice of Allowance dated Sep. 5, 2019 for U.S. Appl. No. 16/264,580.
Office Action dated Jan. 22, 2019 for U.S. Appl. No. 16/153,223.
Office Action dated Jan. 24, 2019 for U.S. Appl. No. 16/153,262.
Office Action dated Feb. 7, 2019 for U.S. Appl. No. 16/153,168.
Office Action dated Feb. 26, 2019 for U.S. Appl. No. 16/153,146.
Office Action dated Mar. 12, 2019 for U.S. Appl. No. 16/153,196.
Office Action dated Mar. 14, 2019 for U.S. Appl. No. 16/195,827.
Office Action dated Mar. 21, 2019 for U.S. Appl. No. 16/195,816.
Office Action dated Mar. 21, 2019 for U.S. Appl. No. 16/195,830.
Office Action Summary in U.S. Appl. No. 13/727,662 dated Apr. 10, 2015.
Oran, D., (ed.), “OSI IS-IS Intrad-domain Routing Protocol”, RFC 1142, pp. 1-193, Internet Engineering Task Force, http://tools.ietf.org/rfc/rfc1142. txt, Feb. 1990.
Pao, D. et al, “Efficient Hardware Architecture for Fast IP Address Lookup” IEEE, Proceedings Twenty First Annual Joint Conference of the IEEE Computer and Communications Societies, Jun. 23-27 2002, vol. 2, pp. 555-561.
Perkins, C. et al, “Ad hoc On-Demand Distance Vector (AODV) Routing”, RFC 3561, pp. 1-37, Internet Engineering Task Force, http://lools.ielf.org/rfc/rfc3561.lxl, Jul. 2003.
Pignataro et al., “Seamless Bidirectional Forwarding Detection (S-BFD) for IPv4, IPv6 and MPLS,” draftietf-bfd-seamless-ip-06, Internet Engineering Task Force, Internet-Draft, May 6, 2016, 8 pages.
Pignataro et al.,“Seamless Bidirectional Forwarding Detection (S-BFD),” draft-ieft-bfd-seamless-base-11, Internet Engineering Task Force, Internet-Draft, May 6, 2016, 21 pages.
Postel, J et al “Comments on the IP Source Route Option” RFC unnumbered, IETF 1987, 18 pages.
Postel, J. et al. “Darpa Internet Program Protocol Specification RFC 791”, Sep. 1981, prepared for DARPA by Information Sciences Institute, University of Southern California, 50 pages, IETF.
Postel, J; “Internet Protocol, DARPA Internet Protocol Specification”, RFC 791 ,pp. 1-45, Internet Engineering Task Force (IEFT), http://tools.iefl.org/rfc/rfc791.txt, Sep. 1981.
Postel, John (ed.), Editor; “Transmission Control Protocol—DARPA Internet Protocol Specification”, RFC 793, pp. 1-85, USC/Information Sciences Institute, http://tools.ietf.org/rfc/rfc793.txt, Sep. 1981.
Previdi et al., “IS-IS Extensions for Segment Routing,” draft-ietf-isis-segment-routing-extensions-05, IS-IS for IP Internets, Internet-Draft, Jun. 30, 2015, pp. 1-37.
Previdi et al., “IS-IS Extensions for Segment Routing,” draft-ietf-isis-segment-routing-extensions-06, IS-IS for IP Internets, Internet-Draft, Dec. 14, 2015, pp. 1-39.
Previdi et al., “Segment Routing Egress Peer Engineering BGPLS Extensions”, Network Working Group Internet-Draft, < draft-previdi-idr-bgpls-segment-routing-epe-01 >, Internet Engineering Task Force Trust, Oct. 25, 2014, 16 pages.
Previdi et al., “Segment Routing with IS-IS Routing Protocol, draft-previdi-filsfils-isis-segment-routing-00,” Cisco Systems, Inc., IS-IS for IP Internets, Internet-Draft, Mar. 12, 2013, pp. 1-27.
Previdi et al., “Segment Routing with IS-IS Routing Protocol, draft-previdi-filsfils-isis-segment-routing-02,” Cisco Systems, Inc., Internet-Draft Mar. 20, 2013, pp. 1-27.
Psenak et al. “OSPF Extensions for Segment Routing,” draft-ietf-ospf-segment-routing-extensions-05, Open Shortest Path First IGP, Internet-Draft, Jun. 26, 2015, pp. 1-29.
Quinn et al., “Network Service Header—draft-quinn-sfc-nsh-07.txt,” Network Working Group, Internet-Draft, Feb. 24, 2015, pp. 1-43.
Raszuk, R., “MPLS Domain Wide Labels,” NTT 13, draft-raszuk-mpls-domain-widelabels-00, MPLS Working Group, Internet-Draft, Jul. 14, 2013, pp. 1-6.

Continuations (2)

	Number	Date	Country
Parent	16264580	Jan 2019	US
Child	16691593		US
Parent	15961818	Apr 2018	US
Child	16264580		US

Continuation in Parts (7)

	Number	Date	Country
Parent	14274632	May 2014	US
Child	15961818		US
Parent	13727651	Dec 2012	US
Child	14274632		US
Parent	13727652	Dec 2012	US
Child	13727651		US
Parent	13727653	Dec 2012	US
Child	13727652		US
Parent	13727655	Dec 2012	US
Child	13727653		US
Parent	13727657	Dec 2012	US
Child	13727655		US
Parent	13727662	Dec 2012	US
Child	13727657		US

Routing methods, systems, and computer program products with multiple sequences of identifiers

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

Field of Search

CPC

International Classifications

Disclaimer

Abstract