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.
Abstract:
In one embodiment, a network node provides a time slotted channel hopping (TSCH) schedule to one or more child nodes of the network node. The TSCH schedule includes one or more mandatory routing protocol report time slots. The network node receives routing protocol reports from the one or more child nodes according to the TSCH schedule. The network node aggregates the received routing protocol reports into an aggregated routing protocol report. The network node provides the aggregated routing protocol report to a parent of the network node during a time slot that is subsequent to the one or more mandatory time slots for the one or more child nodes.
Abstract:
In one embodiment, a particular node operates a distributed routing protocol in a shared-media communication network, and distributes timeslot allocations using the routing protocol, where the particular node as a parent node allocates a pool of timeslots available to child nodes of the parent node. The parent node specifically allocates particular timeslots from the pool to particular child nodes according to particular flows from a source to a target in the shared-media communication network in order to meet a defined time budget for a resultant time- synchronized path from the source to the target.
Abstract:
One embodiment includes: forwarding a particular packet through an Available Routing Construct (ARC) chain topology network. In one embodiment, this forwarding includes: sending the particular packet by each particular non-edge node on an arc of the plurality of arcs receiving the particular packet to each sibling on the arc that did not send the particular packet to said particular non-edge node, while not sending the particular packet if it was received from both siblings of said particular edge node; and sending the particular packet to a respective child node on a second arc of the plurality of arcs by each particular edge node of two edge nodes on the arc after receiving the particular packet. In one embodiment, the network is a wireless deterministic network with pre-assigned time slots for receiving and subsequently sending a same particular packet by each node of the network.
Abstract:
A device, e.g., switch (120) or registry (115) maintains a binding table for all internet protocol (IP) addresses in a particular subnet associated with the device, and in response to receiving a neighbor solicitation (NS) lookup message from a router (130) for a particular address, determines whether the particular address is within the binding table. When the particular address is not within the binding table, the device causes the router (130) to not store the particular address in a neighbor discovery (ND) cache at the router e.g., by responding to clear the cache, or ignoring to prevent state from being created. The ND-requesting router ensures that the particular address is not kept in an ND cache at the router in response to the device indicating that the particular address is not within its binding table (explicit response to clear, or absence of instruction to store state).
Abstract:
In one embodiment, a more capable device (MCD) in a computer network may determine one or more a critical destinations (CDs), and may transmit an unsolicited reactive routing route request (RREQ) message to each CD. The MCD may then receive a route reply (RREP) message from the CDs having a route from the MCD to the CD, and may store the route at the MCD. Subsequently, the MCD may transmit a RREP message of its own to one or more less capable devices (LCDs) to provide the route from each respective LCD to the CD via the MCD.
Abstract:
A network includes network nodes (12a and 12b) and a gateway (20). Each network node (12a) has a corresponding unique in-site Ipv6 address (16a) for communication with the site (14), each in-site address having a first Ipv6 address prefix that is not advertised outside the site. Network nodes can obtain from within the site a unique extra-site Ipv6 address for mobile or extra-site communications (26a). The extra-site Ipv6 address has a second Ipv6 address prefix, distinct from the first Ipv6 address prefix, advertised by the gateway (20) to the prescribed site (14) and the wide area network (22). The gateway establishes a tunnel (24) to each in-site node (12a) using extra-site and in-site Ipv6 addresses a binding cache entry specifying the addresses.
Abstract:
Mobile routers establish a tree-based network topology in an ad hoc mobile network, the tree-based network topology having a single clusterhead and attached mobile routers. Each attached mobile router has a default egress interface configured for sending messages toward the clusterhead, and ingress interfaces configured for receiving messages from attached network nodes that are away from the clusterhead. A neighbor advertisement message received from an ingress interface away from a clusterhead is used by the attached mobile router to identify specified network prefixes that are reachable via the source of the neighbor advertisement message. The attached mobile router outputs on its default upstream interface a second neighbor advertisement message that specifies the network prefix used by the attached mobile router, and the specified network prefixes from the neighbor advertisement message received on the ingress interface. Hence, connectivity is established with minimal routing overhead.