Abstract: One embodiment includes signaling, by a first network node to a transmission unit owner node, identifying one or more remaining wireless time slot-frequency pairings of a current transmission unit assigned to the first network node that will not be used by the first network node during the current transmission unit. The transmission unit owner node reassigns one or more of the remaining wireless time slot-frequency pairings to a second network node in the network to use during the current transmission unit. One embodiment includes communicating information between a first network node and a second network node using a particular time slot-frequency pairing, including a particular frame time from the second network node to the first network node, a particular acknowledgement time from the first network node to the second network node, and a particular acknowledgment of the acknowledgment time from the second network node to the first network node.

Abstract: In one embodiment, a device (e.g., path computation device) informs a network management device of a plurality of possible probing profiles, where nodes of a computer network receive the plurality of possible probing profiles from the network management device. Based on determining that particular information is desired from one or more particular nodes of the nodes of the computer network, the device may then select one or more particular probing profiles of the plurality of possible probing profiles based on the particular information, and instructs the one or more particular nodes to probe one or more particular destination nodes according to the one or more particular probing profiles.

Abstract: In one embodiment, a first node in a network receives one or more bitmaps from one or more child nodes of the first node according to a directed acyclic graph (DAG). Each of the one or more child nodes is associated with a corresponding unique bit position in the one or more bitmaps. The first node stores, in a forwarding table, the one or more bitmaps received from the one or more child nodes of the first node. The first node receives a message that includes a destination bitmap that identifies one or more destinations of the message via one or more set bits at bit positions associated with the one or more child nodes. The first node forwards the message towards the identified one or more destinations based on the destination bitmap and the one or more bitmaps stored in the forwarding table of the first node.

Abstract: In one embodiment, a method comprises a path computation device receiving device information from member network devices, each member network device belonging to a directed acyclic graph to a destination in a low power lossy network; and the path computation device classifying each member network device belonging to a directed acyclic graph as belonging to a dominating set, for generation of optimized routes distinct from any directed acyclic graph, for reaching any one of the member network devices of the dominating set.

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 method comprises receiving, by an apparatus, first data at a first bitrate and second data at a second bitrate faster than the first bitrate; de-interleaving, by the apparatus, the first data into first de-interleaved data and the second data into second de-interleaved data; and controlling transmission of the first and second data in a single modulated light beam transmitted by a light emitting diode, the controlling including outputting portions of the first and second de-interleaved data to the light emitting diode, and controlling transmission of the light emitting diode.

Abstract: In one embodiment, a method comprises generating, by a network device, a Bloom filter bit vector based on applying Bloom filter parameters to a candidate address autoconfigured by the network device; and selectively repeating, by the network device, the autoconfiguring of the candidate address until the corresponding Bloom filter bit vector includes a bit set at a reserved bit vector position that is reserved for the network device, the reserved bit vector position providing uniqueness of the candidate address within a link layer domain.

Abstract: In one embodiment, a method comprises: generating, by a first network device in a network, a Bloom filter bit vector representing device addresses of devices having attached to at least one of the first network device or a second network device in the network; and determining whether a new device address is not a duplicate of any of the device addresses in the network based on the Bloom filter bit vector.

Abstract: One embodiment includes: determining, by a particular networked device, sending and receiving time slots for progressively communicating a particular packet among nodes of an arc of an Available Routing Construct (ARC) chain topology network in both directions on the arc to reach each edge node of the arc; and determining, by the particular networked device, for each edge node of the arc a predetermined respective time slot for communicating the particular packet to a respective child node on a second arc of the ARC chain topology network. One embodiment includes respectively installing said determined time slots in said nodes of the arc. In one embodiment, the network is a wireless deterministic network. In one embodiment, the predetermined respective time slot for each particular edge node is after all time slots in which the particular packet could be received by said particular edge node.

Abstract: In one embodiment, an initial path is established in a wireless deterministic network between a source and a destination through one or more intermediate nodes, which are typically informed of a required metric between the source and the destination for communicating a packet. The initial path is locally (e.g., without contacting a path computation engine) reconfigured to bypass at least one of the intermediate nodes creating a new path, with the new path meeting the requirement(s) of the metric. Note, “locally reconfiguring” refers to the network nodes themselves determining a replacement path without reliance on a path computation engine or other entity (e.g., network management system, operating support system) in determining the replacement path. In one embodiment, a network node not on the initial path replaces a node on the initial path while using the same receive and send timeslots used in the initial path.

Abstract: In one embodiment, a device determines that a latency between a receive timeslot of a channel hopping schedule of the device and a transmit timeslot of the channel hopping schedule is greater than a latency threshold for a particular traffic flow to be received during the receive timeslot. The device requests an additional transmit timeslot for the channel hopping schedule from a parent node of the device in the network. The device receives an indication of a newly allocated transmit timeslot for the channel hopping schedule from the parent node. The device maps the receive timeslot to one of the transmit timeslots of the channel hopping schedule, wherein the particular traffic flow is to be forwarded to a second device during the mapped transmit timeslot.

Abstract: In one embodiment, a method comprises identifying, by a network device operating in a network topology as a directed acyclic graph (DAG) root, a source-route path for reaching a destination device in the network topology; determining whether one or more parent devices along the source-route path between the network device and the destination device are capable of storing a route entry specifying routing information for reaching the destination device; and causing installation of a route entry for reaching the destination device in one or more of the parent devices determined as capable of storing the corresponding route entry.

Abstract: In one embodiment, sensor data is transported in a network to a rendezvous point network node, which consolidates the information into a consolidated result which is communicated to the destination. Such consolidation by a network node reduces the number of paths required in the network between the sensors and the destination. One embodiment includes acquiring, by each of a plurality of originating nodes in a wireless deterministic network, external data related to a same physical event; communicating through the network said external data from each of the plurality of originating nodes to a rendezvous point network node (RP) within the network; processing, by the RP, said external data from each of the plurality of originating nodes to produce a consolidated result; and communicating the consolidated result to a destination node of the network. In one embodiment, the network is a low power lossy network (LLN).

Abstract: In one embodiment, a method comprises receiving, by an apparatus, a Media Access Control (MAC) frame destined for a destination device; dividing, by the apparatus, the MAC frame into frame fragments; coding the frame fragments into encoded cells; and causing, by the apparatus, transmission of selected subsets of the encoded cells, as distinct flows of the encoded cells, by respective optical physical layer transmitter devices reachable by the destination device.

Abstract: A system includes an on-board unit (OBU) in communication with an internal subsystem in a vehicle on at least one Ethernet network and a node on a wireless network. A method in one embodiment includes receiving a message on the Ethernet network in the vehicle, encapsulating the message to facilitate translation to Ethernet protocol if the message is not in Ethernet protocol, and transmitting the message in Ethernet protocol to its destination. Certain embodiments include optimizing data transmission over the wireless network using redundancy caches, dictionaries, object contexts databases, speech templates and protocol header templates, and cross layer optimization of data flow from a receiver to a sender over a TCP connection. Certain embodiments also include dynamically identifying and selecting an operating frequency with least interference for data transmission over the wireless network.

Abstract: In one embodiment, a particular device (e.g., switch) receives a neighbor discovery (ND) message from a non-trusted non-switch device, the ND message having an associated address, and creates a corresponding binding entry for the address in a temporary tentative state without forwarding the ND message. In addition, the switch then generates and forwards a first duplicate address detection (DAD) message on behalf of the non-trusted non-switch device. In response to receiving a second DAD message from a non-owner device, the switch may either drop the second DAD message when a corresponding second address of the second DAD message is stored as a tentative-state entry, or else forward the second DAD message to a corresponding owner device of the second address for neighbor advertisement (NA) defense when the second address is not stored as a tentative-state entry.

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 multicast listeners from a multicast source, each routing arc comprising a first network device as a first end of the routing arc, a second network device as a second end of the routing arc, and at least a third network device configured for receiving from each of the first and second network devices a copy of a multicast packet originated from the multicast source; and causing the multicast packet to be propagated throughout the loop-free routing topology based on the first and second ends of each routing arc forwarding the corresponding copy into the corresponding routing arc.

Abstract: The invention prevents robots from browsing a Web site beyond a welcome page. When an initial request from an undefined originator is received, the Web site responds to it with a welcome page including a challenge. Then, on receiving a further request from the undefined originator, the Web site can check whether the challenge is fulfilled or not. If fulfilled, the undefined originator is assumed to be a human being and authorized to go on. If the challenge is not fulfilled, the undefined originator is assumed to be a robot, in which case site access is further denied. The invention prevents Web site contents from being investigated by robots while not requiring users to have to log on.

Abstract: In one embodiment, a method comprises creating, in a computing network, a hierarchal routing topology for reaching a destination, the hierarchal routing topology comprising a single parent supernode providing reachability to the destination, and a plurality of child supernodes, each child supernode comprising one or more exit network devices each providing a corresponding link to the parent supernode; receiving, in one of the child supernodes, a data packet for delivery to the destination; causing the data packet to traverse along any available data link in the one child supernode independent of any routing topology established by network devices in the one child supernode, until the data packet reaches one of the exit network devices; and the one exit network device forwarding the data packet to the parent supernode, via the corresponding link, for delivery to the destination.

Abstract: One embodiment allocates and uses exclusive and overlapping transmission units in a network. One embodiment includes sending information, from a first network node in a network, during an exclusive transmission unit, wherein the exclusive transmission unit includes one or more wireless time slot-frequency pairings assigned to the first network node to send info nation without another assigned network transmission unit providing overlapping time slot-frequency interference from another network node communicating in the network. One embodiment includes sending information, from the first network node, during an overlapping transmission unit, wherein the overlapping transmission unit includes one or more wireless time slot-frequency pairings assigned to the first network node to send information, with the overlapping transmission unit overlapping in time slot-frequency with one or more other assigned network transmission units that will cause interference if simultaneously used.