Abstract:
A method and apparatus for detecting the absence of an activity or event during a time period D divides the time period D into N equal time sub-periods. A register is reset upon the occurrence of an event or activity. The register is incremented at the end of each sub-period and examined to determine if it exceeds the value N in which case there has been no activity during the time period D. The precision of the measurement is regulated by increasing or decreasing the value of N and the sub-periods are determined by dividing D by N.
Abstract:
In one embodiment, a network of nodes is configured to communicate according to a configuration of a vertical ladder topology as well as monitoring communication in the network, and/or selectively controls whether or not provisioned particular links will be used. One embodiment colors nodes of the network (e.g., a wireless deterministic network) along different paths through the network and marks packets with the color of each traversed node to track a path taken by a packet. One embodiment sends a particular packet through the network and marks over which links the packet traverses and aggregates these traversed links of other copies of the particular packet. One embodiment controls whether or not the provisioned time slots are used based on flooding a control packet through the network with enable or disable information for each of these links.
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 device, each routing arc routing any network traffic along the routing arc toward the destination device via any one of first or second ends of the corresponding routing arc, the creating including forming a buttressing arc having an originating end joined to a first of the routing arcs and a terminating end joined to a second of the routing arcs, the buttressing arc inheriting from the first routing arc a first height to the destination device, the first height of the first routing arc higher than a corresponding second height of the second routing arc; and causing the network traffic to be forwarded, to the destination device, via the buttressing arc and at least one of the first routing arc or the second routing arc.
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 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:
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:
In one embodiment, a lower protocol layer in a network device filters packets based on a class and a particular of a destination address prior to sending information from the received packet to a higher protocol layer. For example, certain constrained networks include network nodes that do not have the ability to maintain a multicast distribution entry for each multicast address used in the network. By only forwarding on a portion of a multicast address, packets are often delivered to nodes in addition to the actual multicast subscribers. By filtering these incorrectly delivered packets at a lower protocol layer (e.g., layer-2 or layer-3), processing cycles at higher protocol layers are avoided. Additionally in one embodiment, class and particulars are deterministically determined (e.g., using a same hashing function) such that services can be discovered and used by subscribing to a corresponding multicast group.
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, 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, the loop-free routing topology providing first and second non-congruent paths; and forwarding bicasting data, comprising a data packet in a first direction from a network node and a bicasted copy of the data packet in a second direction from the network node, concurrently to the destination node respectively via the first and second non-congruent paths.
Abstract:
In one embodiment, an intermediate node of a computer network can receive a message intended for a destination. The message can include a header indicating a source route. The intermediate node can determine a routing entry for a routing entry for the destination associated with a next hop based on the source route and cache the routing entry. The intermediate node can further receive a second message intended for the destination that does not indicate the next hop, and transmit the second message according to the cached routing entry.