Abstract: In one embodiment, a device in a network receives data associated with a particular location. The device determines when the device is at the particular location by monitoring a local position of the device relative to the particular location. The device identifies a node in the network as being co-located with the device at the particular location. The device shares the data with the identified node based on the device and the node being co-located at the particular location.

Abstract: In one embodiment, a device in a network identifies a node in the network that is not synchronized to a network time synchronization mechanism. The device determines a scheduled reception time for a particular deterministic traffic flow at which the device is to receive the traffic flow from the node. The device sends, prior to the scheduled reception time, a request to the node for the particular deterministic traffic flow. The request identifies the particular deterministic traffic flow and causes the node to send the traffic flow to the device. The device receives the particular deterministic traffic flow from the node at the scheduled reception time.

Abstract: In one embodiment, a method includes receiving a packet from an end node, the packet comprising an authenticated source MAC (Media Access Control) address and a source IP (Internet Protocol) address computed based on the authenticated source MAC address, and verifying the source IP address in the received packet, wherein verifying the source IP address comprises computing an IP address based on the authenticated source MAC address and comparing the computed IP address to the source IP address in the received packet to verify the source IP address. An apparatus is also disclosed herein.

Abstract: In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node, each routing arc comprising a first network node as a first end of the routing arc, a second network node as a second end of the routing arc, and at least a third network node configured for routing any network traffic along the routing arc toward the destination node via any one of the first or second ends of the routing arc, at least one of the first, second, or third network nodes are implemented as a ring-based network having a prescribed ring topology; and establishing loop-free label switched paths for reaching the destination network node via the routing arcs of the loop-free routing topology, the label switched paths independent and distinct from any attribute of the prescribed ring topology.

Abstract: In one embodiment, a device in a network receives a notification from a neighbor of the device indicative of a child node of the device requesting a parent change from the device to the neighbor. The device updates an existing routing path from the device to the child node to be routed through the neighbor, in response to receiving the notification from the neighbor. The device receives an instruction to remove the updated routing path from the device to the child node through the neighbor. The device removes the updated routing path from the device to the child node, in response to receiving the instruction to remove the updated routing path.

Abstract: In one embodiment, a device in a network receives one or more packets that are part of a traffic flow. The device provides a sample packet to a path computation element (PCE) that includes a signature that uniquely identifies the traffic flow. The device receives a traffic flow policy for the traffic flow from a policy engine and enforces the traffic flow policy for the traffic flow.

Abstract: In one embodiment, an intermediate node in a contention-based shared-media computer network determines a scheduled window within which a packet (with an assigned priority) should be transmitted by the intermediate node. In particular, the intermediate node may specifically determine whether an actual transmission time is prior to, during, or after the window, and sets a priority of the packet as either i) a reduced priority when the actual transmission time is prior to the window, ii) the assigned priority when the actual transmission time is during the window, or iii) an augmented priority when the actual transmission time is after the window. As such, the intermediate node may then transmit the packet from the intermediate node with the set priority at the actual transmission time.

Abstract: In one embodiment, a method comprises: receiving, by a network device in a data network, a wireless data packet containing new data; responding to the wireless data packet, by the network device, by initiating a prescribed randomized collision avoidance method requiring the network device to first wait at least a first half of a prescribed minimum contention interval before attempting transmission at a randomized position within a second half of the prescribed minimum contention interval; selectively retransmitting, by the network device, the wireless data packet based on determining, at the randomized position, that the network device has not received a prescribed number of copies of the wireless data packet; and selectively sending, by the network device to a path computation element in the data network, a message requesting membership in a dominating set in response to transmission of the wireless data packet by the network device.

Abstract: In one embodiment, a device in a wireless network receives a request from a node in the network requesting electrical power. The device determines one or more power transmission parameters for the node. The device determines a power transmission schedule for the node. The device sends wireless network communications to the node in response to the request and based on the determined one or more power transmission parameters and transmission schedule for the node. The node converts the wireless network communications into stored electrical power.

Abstract: In one embodiment, a method comprises detecting, by a network device, an endpoint device attempting to access a data network via a data link; and generating, by the network device, a unique device signature for identifying the endpoint device based on the network device identifying a sequence of link layer data packets transmitted by the endpoint device upon connection to the data link, the unique device signature identifying a behavior of the endpoint device independent of any link layer address used by the endpoint device.

Abstract: Systems, methods, and computer-readable storage media for multi-destination TCP communications using bit indexed explicit replication (BIER). In some examples, a system can generate a TCP packet associated with a TCP session involving a set of destination devices, and encode an array of bits into the TCP packet to yield a TCP multicast packet. The array of bits can define the destination devices as destinations for the multicast packet. The system can transmit the TCP multicast packet towards the destination devices through a BIER domain. The system can receive acknowledgements from a first subset of the destination devices. Based on the acknowledgements, the system can determine that the first subset of the destination devices received the multicast packet and a second subset of the destination devices did not receive the multicast packet. The system can then retransmit the multicast packet to the second subset of the destination devices.

Abstract: In one embodiment, a device in a network sets a timer interval based in part on a distance between the device and a backbone of the network. The device receives a unicast communication destined for a remote destination that was sent via broadcast. The device determines a count of receipt acknowledgements of the communication sent by other devices in the network. At the end of the timer interval, the device sends a receipt acknowledgement of the communication via broadcast, in response to the count of receipt acknowledgements sent by other devices in the network being below a threshold amount.

Abstract: In one embodiment, a device in a network sends a first multicast message to a plurality of destinations in the network. The first multicast message includes a first bitmap that identifies the destinations. The device receives one or more acknowledgements from a subset of the destinations. The device determines a retransmission bitmap that identifies those of the plurality of destinations that did not acknowledge the first multicast message, based on the received one or more acknowledgements. The device sends a retransmission multicast message to those of the plurality of destinations that did not acknowledge the first multicast message. The retransmission multicast message includes the retransmission bitmap.

Abstract: In one embodiment, a method comprises: generating, by a transmitting network device, a hashed source media access control (MAC) address and a hashed destination MAC address based on hashing a MAC address of the transmitting network device and a destination MAC address of a destination wireless network device, respectively, relative to an epochal transmission sequence value; and transmitting a data frame at a time slot associated with the epochal transmission sequence value, using the hashed source MAC address and the hashed destination MAC address, to the destination wireless network device.

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: In one embodiment, a device both communicates with a network operating a distributed proactive routing protocol, and participates in a centralized path computation protocol. The device communicates routing characteristics of the distributed proactive routing protocol for the network from the network to the centralized path computation protocol, and also communicates one or more computed paths from the centralized path computation protocol to the network, where the computed paths from the centralized path computation protocol are based on the routing characteristics of the distributed proactive routing protocol for the network.

Abstract: In one embodiment, a multicast listener device floods a path lookup request to search for a multicast tree, and may then receive path lookup responses from candidate nodes on the multicast tree, where each of the path lookup responses indicates a unicast routing cost from a respective candidate node to the multicast listener device, and where each of the candidate nodes is configured to suppress a path lookup response if a total path latency from a source of the multicast tree to the multicast listener device via that respective candidate node is greater than a maximum allowable path latency. The multicast listener device may then select a particular candidate node as a join point for the multicast tree based on the particular node having a lowest associated unicast routing cost to the multicast listener device from among the candidate nodes, and joins the multicast tree at the selected join point.

Abstract: In one embodiment, a device in a network receives data regarding traffic volumes of deterministic and non-deterministic traffic along a first path in the network. The device predicts, using the received data, an increase in the traffic volume of the non-deterministic traffic along the first path in the network. The device identifies a period of time associated with the predicted increase in the traffic volume of the non-deterministic traffic along the first path. The device causes the deterministic traffic to be sent along a second path in the network during the identified period of time, to allow the first path to accommodate the predicted increase in the traffic volume of the non-deterministic traffic along the first path.

Abstract: In one embodiment, a method comprises a network device identifying, in a time slotted network allocated timeslots for exclusive control of data transmissions with at least a second network device, a first schedule of first timeslots allocated for transmission and reception of packets having a first priority and a second schedule of second timeslots allocated for transmission and reception of packets having a second priority lower than the first priority, the second schedule overlapping the first schedule; and the network device shifting the second schedule of timeslots, relative to the first schedule, by a slot-frame shift (SFS) interval that causes a corresponding listen-before-talk interval in each of the second timeslots to be initiated coincident with or after transmission is enabled for any packet having the first priority.

Abstract: In one embodiment, a scheduling device in a network receives routing metrics regarding a network path between a device controller and a networked device. The scheduling device also receives controller metrics for the device controller. The scheduling device determines time costs associated with the network path and one or more control operations performed by the device controller, based on the routing and controller metrics. The scheduling device generates a communication schedule based on the time costs and instructs the device controller and the networked device to use the communication schedule.