Abstract: A method of establishing streams within a QUIC connection implemented by a first network device, comprising: transmitting a first open message through the QUIC connection to a second network device, the first open message identifying a protocol; receiving a second open message through the QUIC connection from the second network device in response to transmitting the first open message, the second open message identifying the protocol; and establishing a first stream between the first network device and the second network device within the QUIC connection for the protocol identified in the first open message and in the second open message.

Abstract: A method is performed by a network element (NE) in a network implementing an Interior Gateway Protocol (IGP). The method comprises generating a message comprising a header and data, wherein the header comprises a length of the data prior to compressing the data, a length of the data after compressing the data, and a compression identifier, compressing the data based on a compression scheme identified by the compression identifier to obtain compressed data, and forwarding a compressed message comprising the header and the compressed data to another NE in the network.

Abstract: A method of establishing streams within a QUIC connection implemented by a first network device, comprising: transmitting a first open message through the QUIC connection to a second network device, the first open message identifying a protocol; receiving a second open message through the QUIC connection from the second network device in response to transmitting the first open message, the second open message identifying the protocol; and establishing a first stream between the first network device and the second network device within the QUIC connection for the protocol identified in the first open message and in the second open message.

Abstract: A method implemented by a network element (NE) in a network, comprising receiving, by the NE, an advertisement comprising preferred path route (PPR) information and backup PPR information, the PPR information describing a PPR between a source and a destination in the network, the backup PPR information describing a backup PPR between the source and the destination, the PPR information comprising a PPR identifier (PPR-ID) and a plurality of PPR description elements (PPR-PDEs) each representing an element on the PPR, updating, by the NE, a local forwarding database to include the PPR information and the backup PPR information in association with a destination address of the destination, and transmitting, by the NE, a data packet based on the backup PPR information instead of the PPR information in response to an element on the PPR being unavailable due to a failure of an element along the PPR.

Abstract: A method implemented by a network element (NE) in a network receiving, by the NE, an advertisement comprising preferred path route (PPR) information describing a path from an ingress NE to an egress NE in the network, the PPR information comprising a PPR identifier (PPR-ID) and an attribute associated with a resource to be reserved on the PPR, transmitting, by the NE, the advertisement comprising the PPR-ID and the attribute associated with the resource to be reserved on the PPR to another NE in the network, and updating, by the NE, a local forwarding database to include the PPR information in association with the egress NE in response to the NE being identified in the PPR information.

Abstract: A method of routing a data packet through a network comprises updating at least one router local forwarding table to include path IDs of network segments defining paths between network nodes and network function bit encoding/decoding information. In response to a data packet arriving at an ingress network node, an encapsulation header including a path ID identifying at least one network segment of an explicit routing path and a bit encoding specifying network functions to be performed on the data packet are encapsulated in unused portions of the source address and/or the destination address in the encapsulation header. A network node in the explicit routing path performs a network function encoded in the source address and/or the destination address of the encapsulation header of the data packet and forwards the data packet based on network function bit encoding/decoding and path ID information in the network node's local updated local forwarding table.

Abstract: A method is performed by a network element (NE) in a network implementing an Interior Gateway Protocol (IGP).

Abstract: A method of routing a data packet through a network comprises updating at least one router local forwarding table to include path IDs of network segments defining paths between network nodes and network function bit encoding/decoding information. In response to a data packet arriving at an ingress network node, an encapsulation header including a path ID identifying at least one network segment of an explicit routing path and a bit encoding specifying network functions to be performed on the data packet are encapsulated in unused portions of the source address and/or the destination address in the encapsulation header. A network node in the explicit routing path performs a network function encoded in the source address and/or the destination address of the encapsulation header of the data packet and forwards the data packet based on network function bit encoding/decoding and path ID information in the network node's local updated local forwarding table.

Abstract: A method implemented by a network element (NE) in a network, comprising receiving, by the NE, an advertisement comprising preferred path route (PPR) information and backup PPR information, the PPR information describing a PPR between a source and a destination in the network, the backup PPR information describing a backup PPR between the source and the destination, the PPR information comprising a PPR identifier (PPR-ID) and a plurality of PPR description elements (PPR-PDEs) each representing an element on the PPR, updating, by the NE, a local forwarding database to include the PPR information and the backup PPR information in association with a destination address of the destination, and transmitting, by the NE, a data packet based on the backup PPR information instead of the PPR information in response to an element on the PPR being unavailable due to a failure of an element along the PPR.

Abstract: A method implemented by a network element (NE) in a network receiving, by the NE, an advertisement comprising preferred path route (PPR) information describing a path from an ingress NE to an egress NE in the network, the PPR information comprising a PPR identifier (PPR-ID) and an attribute associated with a resource to be reserved on the PPR, transmitting, by the NE, the advertisement comprising the PPR-ID and the attribute associated with the resource to be reserved on the PPR to another NE in the network, and updating, by the NE, a local forwarding database to include the PPR information in association with the egress NE in response to the NE being identified in the PPR information.

Abstract: The presence of a host is detected at a first data center. A message is generated at the first data center to indicate the presence of the host. The message has a limited lifetime. The message is transmitted to a second data center.

Abstract: One embodiment receives at a first node in at least a portion of a network a routing table, the portion of the network comprising the first node and one or more second nodes, the routing table specifying the immediate neighbor that provides each of the best paths in the portion of the network based on a total cost; using the routing table, determines at the first node every second node that is necessary for the first node to reach all edges of the network, the second nodes that are necessary for the first node to reach all edges of the network comprising an active set for the first node; and sends a message from the first node to every second node to facilitate determining whether to shut down the second node.

Abstract: Techniques for sharing routing information over a network include determining whether the scale of a flooding domain exceeds a threshold. If so, then a router announcement message is sent over a particular link. The message indicates the local router is a flooding domain border router (FDBR). Summary routing information is determined with less than a certain level of detail used in the flooding domain for routers connected to the local router through links different from the particular link. The summary routing information is sent over the particular link in a link state message that includes type data that indicates summary routing information that crosses a FDBR. These techniques allow automatic favorable scaling of domains of shared routing information as the size of a mobile ad hoc network grows.

Abstract: In one embodiment, accessing a device name, which includes a hostname and a domain name, of a network device; applying a hash function to the domain name to obtain 40 bits as a Global ID of an Internet Protocol version 6 (IPv6) unique local address (ULA); and encoding the hostname to obtain 80 bits as a Subnet ID and an Interface ID of the IPv6 ULA.

Abstract: Group key management in a mobile ad-hoc network (MANET) may be provided. Each network node associated with the MANET may comprise a group distribution key and a list of authorized member nodes from which a group key manager may be elected. The group key manager may periodically issue a new group key to be used in protecting communications among the network nodes. A compromised node may be excluded from receiving updated group keys and thus isolated from the MANET.

Abstract: In one embodiment, accessing a device name, which includes a hostname and a domain name, of a network device; applying a hash function to the domain name to obtain 40 bits as a Global ID of an Internet Protocol version 6 (IPv6) unique local address (ULA); and encoding the hostname to obtain 80 bits as a Subnet ID and an Interface ID of the IPv6 ULA.

Abstract: One embodiment receives at a first node in at least a portion of a network a routing table, the portion of the network comprising the first node and one or more second nodes, the routing table specifying the immediate neighbor that provides each of the best paths in the portion of the network based on a total cost; using the routing table, determines at the first node every second node that is necessary for the first node to reach all edges of the network, the second nodes that are necessary for the first node to reach all edges of the network comprising an active set for the first node; and sends a message from the first node to every second node to facilitate determining whether to shut down the second node.

Abstract: One embodiment identifies all one-hop neighbor nodes and two-hop neighbor nodes of a node; determines an active set of one-hop neighbor nodes for the node, comprising: includes in the active set each one-hop neighbor node that is either an edge node or connected with at least one two-hop neighbor node with which no other one-hop neighbor nodes are connected; and if the active set is not yet complete, then: determine all combinations of one-hop neighbor nodes that are not already in the active set; and tests each combination in order of each combination's total-energy value to determine whether a specific combination is able to complete the active set; if no combination is able to complete the active set, then including all one-hop neighbor nodes in the active set; and communicates a message to each one-hop neighbor node in the active set indicating that it is in the active set.

Abstract: In one embodiment, a method includes receiving on a first communication link at a local router all routing information at a certain level of detail for each router of multiple routers communicating in a first flooding domain. A measure of distance is determined from a particular router in the first flooding domain to the local router. It is determined whether the measure of distance exceeds a threshold. If the measure of distance exceeds the threshold, then summary routing information with less than the certain level of detail is determined for the particular router. Also, certain routing information is sent over a different second communication link at the local router. The certain routing information includes the summary information for the particular router, and all routing information at the certain level of detail for a subset of routers communicating in the first flooding domain, which subset excludes the particular router.

Abstract: In one embodiment, a method for using a two-hop relay includes receiving an update message for a distance vector routing protocol from a first neighbor. The update message is sent to a different neighbor. Often, it is first determined whether the receiving node is a relay node for the first neighbor in the protocol. The relay node is a node preferred to update a particular node two hops from the first neighbor. In another embodiment, a method for serving as the two-hop relay includes receiving from each neighbor a first message that includes neighbor data that indicates nodes that are in direct communication with the neighbor. A relay set of fewer than all neighbors is determined. Every node two hops from the first node is updated using only the relay set of neighbors. The relay set is sent in a second message for the protocol.