Abstract:
In one embodiment, a node "N" within a computer network utilizing directed acyclic graph (DAG) routing selects a parent node "P" within the DAG, and, where P is not a DAG root, may determine a grandparent node "GP" as a parent node to the parent node P. The node N may then also select an alternate parent node "P'" that has connectivity to GP and N. N may then inform P and P' about prefixes reachable via N, and also about P' as an alternate parent node to P to reach the prefixes reachable via N. Also, in one embodiment, P may be configured to inform GP about the prefixes reachable via N and also about P' as an alternate parent node to P to reach the prefixes reachable via N, and P' may be configured to store the prefixes reachable via N without informing other nodes about those prefixes.
Abstract:
In one embodiment, a method includes, in each of a plurality of mesh access points, connecting to one of a plurality of mesh controllers in a mesh network and passing connection information to the one mesh controller. The mesh access points include a wired mesh access point having a wired connection to the one mesh controller, and wireless mesh access points having a wireless connection to the one mesh controller via the wired mesh access point. The method also includes generating, in each mesh controller, a corresponding link state table based on the passed connection information from each corresponding connected mesh access point. The method also includes generating in at least one of the mesh controllers a mesh table, identifying all of the connecting links for the mesh access points connected among the mesh controllers, based on the mesh controllers sharing the respective link state tables.
Abstract:
Each mobile ad hoc node has an assigned hierarchy position within an identified tree-based aggregation group. Each ad hoc node is configured for selectively attaching to one of a plurality of available ad hoc nodes based on identifying a best match, for the assigned hierarchy position within the identified aggregation group, from among identifiable hierarchy positions of identifiable aggregation groups. Each ad hoc node also is configured for selectively attaching to any available ad hoc node based on a determined absence of any available ad hoc node advertising the identified aggregation group of the ad hoc node, or an aggregation group containing the identified aggregation group. Hence, a root node of an aggregation group can filter group-specific routing information from packets destined toward a network clusterhead, resulting in a scalable routing protocol that is not adversely affected by added nodes.
Abstract:
An IPv4 node is able to send an IPv4 packet to an IPv4 destination via an IPv6 access network, based on translation of the IPv4 packet into an IPv6 packet for transmission via the IPv6 access network. The IPv4 packe is translated into the IPv6 packet by a local gateway. The IPv6 packet has an IPv6 source address that includes a prescribed address prefix assigned to the local gateway, and an IPv4 address of the IPv4 node. The IPv6 packet also includes an IPv6 destination address that includes a second a address prefix assigned to a remote gateway, and a second IPv4 adress of the IPv4 destination. The IPv6 packet is converted by the remote gateway into an IPv4 packet for reception by the IPv4 destination via an IPv4 network.
Abstract:
A mobile router and a correspondent router, each configured for routing services for nodes within their routing prefixes associated with their respective routing tables, establish a secure, bidirectional tunnel based on a messaging protocol between each other and a route server resource. A reactive (i.e., on-demand) protocol is used that enables the requesting device (e.g., the mobile router, correspondent router), to obtain routing information in a secure manner from the route server. The mobile router sends a query via its home agent to the route server resource to identify the correspondent router serving the correspondent node. The mobile router sends a binding update request, specifying a home address and care-of address for the mobile router, to the correspondent router for establishment of a bidirectional tunnel. The correspondent router establishes the bidirectional tunnel, and updates its routing tables based on information from the route server resource.
Abstract:
A router is configured for sharing routing rules with other routers, the routing rules defining aggregated routes according to a prescribed topology. Each routing rule used by the router for routing a packet having a corresponding matching destination address prefix (116), specifies a corresponding address prefix pattern rule for extracting an identified pattern from a portion of the destination address (120), and a gateway address pattern rule for generating a gateway address, for a gateway providing reachability to the destination address (122), based on applying the identified pattern to a specified pattern of the gateway address. The router generates a routing update message that describes the address prefix pattern rule and the gateway address pattern rule, and outputs the routing update message to a second router (126) according to a prescribed distance vector routing protocol.
Abstract:
A router (e.g., a home agent for an IPv6 mobile router) is configured for determining a destination router (e.g., the IPv6 mobile router) for a received packet based on accessing a routing table having multiple routing entries, each routing entry including a routing key and a routing field that specifies one of a prescribed address specifying the destination router and a computation tag. The computation tag specifies a prescribed function to be executed to calculate a determined address for the destination router (e.g., the home address for the lPv6 mobile router). The router identifies, for each received packet, the matching routing entry based on the corresponding routing key, and in response to detecting the computation tag in the routing field, selectively executes the corresponding function to calculate the determined address for the destination router.
Abstract:
This disclosure describes techniques for device to device authentication. For instance, a first device may detect a second device, such as when a user physically attaches the second device to the first device or when the second device wireless communicates with the first device. A component of the first device and/or an authentication entity may then determine to authenticate the second device. In some instances, the component determines to authenticate the second device using information associated with an environment of the second device. To authenticate the second device, the authentication entity may send a request to a user, receive a response from the user, and then verity the response. After the authentication, the first device may determine that the second device includes a trusted device and establish a connection with the second device.
Abstract:
Telemetry for cloud switches queuing excursion may be provided. A first hysteresis threshold and a second hysteresis threshold for a queue of the network switch may be specified. Next, a queue position relative to the first hysteresis threshold and the second hysteresis threshold may be determined for each incoming packets for the queue. A number of crossings including the queue position passing the first hysteresis threshold and subsequently passing the second hysteresis threshold in a first predetermined time period may be determined. A number of data packets being sent to the queue of the network switch may then be altered based on one or more of the number of crossings, the first hysteresis threshold, and the second hysteresis threshold.
Abstract:
The present disclosure provides Border Gateway Protocol route aggregation in a Clos fabric when one or more communication failures are detected. A method includes receiving a prefix component of a first aggregate route from a first next hop node, the prefix component being associated with a failed network element; announcing, to one or more neighboring nodes, the first aggregate route along with the prefix component and the first next hop node associated with the failed network element; identifying, by the one or more neighboring nodes, a second aggregate route, the second aggregate route being a shortest aggregate route that contains the first aggregate route; and generating, from the second aggregate route, one or more Chad routes to the prefix component of the first aggregate route, wherein the one or more Chad routes are associated with one or more next hop nodes that are different from the first next hop node.