Method and apparatus for timing and monitoring inactivity periods
    71.
    发明授权
    Method and apparatus for timing and monitoring inactivity periods 失效
    定时和监测不活动期的方法和装置

    公开(公告)号:US5878382A

    公开(公告)日:1999-03-02

    申请号:US807490

    申请日:1997-02-27

    CPC classification number: G06F1/3228 G06F11/3423 G06F2201/86

    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 translation: 一种用于在时间段D内检测活动或事件不存在的方法和装置将时间段D划分成N个相等的时间子周期。 发生事件或活动时,寄存器被重置。 该登记册在每个子时期结束时递增,并进行检查,以确定其是否超过值N,在这种情况下,在该时间段内没有活动D.测量的精度通过增加或减少 N和子周期通过将D除以N来确定。

    OAM and time slot control in a vertical ladder topology network

    公开(公告)号:US10299265B2

    公开(公告)日:2019-05-21

    申请号:US15275542

    申请日:2016-09-26

    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.

    Generating a loop-free routing topology based on merging buttressing arcs into routing arcs
    73.
    发明授权
    Generating a loop-free routing topology based on merging buttressing arcs into routing arcs 有权
    基于将支撑弧合并到路由弧中生成无环路由拓扑

    公开(公告)号:US09413638B2

    公开(公告)日:2016-08-09

    申请号:US13467603

    申请日:2012-05-09

    CPC classification number: H04L45/18 H04L45/02 H04L45/128 H04L45/22 H04L45/24

    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 translation: 在一个实施例中,一种方法包括在计算网络中创建包括用于到达目的地设备的多个路由弧的无环路由拓扑,每个路由选择弧路由沿着路由选择弧的任何网络业务经由任何一个 所述创建包括形成具有连接到所述路线弧中的第一路线弧的始发端的支撑弧,以及连接到所述路线弧中的第二路径弧的终止端,所述支撑弧从所述第一 所述第一路由的第一高度高于所述第二路由选择弧的对应的第二高度; 并且通过所述支撑弧和所述第一路由弧或所述第二路由弧中的至少一个将所述网络业务转发到所述目的地设备。

    Reassignment of unused portions of a transmission unit in a network
    74.
    发明授权
    Reassignment of unused portions of a transmission unit in a network 有权
    重新分配网络中传输单元的未使用部分

    公开(公告)号:US09356759B2

    公开(公告)日:2016-05-31

    申请号:US13954846

    申请日:2013-07-30

    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 translation: 一个实施例包括由第一网络节点向传输单元所有者节点发送信令,识别分配给第一网络节点的当前传输单元的剩余无线时隙 - 频率配对,该第一网络节点将不被第一网络节点使用 当前的传输单元。 传输单元所有者节点将剩余无线时隙 - 频率配对中的一个或多个重新分配给网络中在当前传输单元期间使用的第二网络节点。 一个实施例包括使用包括从第二网络节点到第一网络节点的特定帧时间的特定时隙频率配对在第一网络节点和第二网络节点之间传送信息,从第一网络节点到 第二网络节点以及从第二网络节点到第一网络节点的确认时间的特定确认。

    Hierarchal label distribution and route installation in a loop-free routing topology using routing arcs at multiple hierarchal levels for ring topologies
    75.
    发明授权
    Hierarchal label distribution and route installation in a loop-free routing topology using routing arcs at multiple hierarchal levels for ring topologies 有权
    分层标签分发和路由安装在无环路由拓扑中,使用环形拓扑的多层次级别的路由选择

    公开(公告)号:US09338086B2

    公开(公告)日:2016-05-10

    申请号:US13620677

    申请日:2012-09-14

    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 translation: 在一个实施例中,一种方法包括在计算网络中创建包括用于到达目的地网络节点的多个路由弧的无环路由拓扑,每个路由弧包括作为路由电弧的第一端的第一网络节点, 第二网络节点作为路由电弧的第二端,以及至少第三网络节点,被配置为经由路由选择电弧的第一或第二端中的任何一个路由沿着路由电弧的任何网络业务,至少 第一,第二或第三网络节点之一被实现为具有规定的环形拓扑的基于环的网络; 以及建立无循环标签交换路径,用于经由无环路由拓扑的路由弧到达目的网络节点,标签交换路径与规定的环形拓扑的任何属性独立且不同。

    Resilient forwarding of packets in an ARC chain topology network
    76.
    发明授权
    Resilient forwarding of packets in an ARC chain topology network 有权
    在ARC链拓扑网络中弹性转发数据包

    公开(公告)号:US09226292B2

    公开(公告)日:2015-12-29

    申请号:US14020932

    申请日:2013-09-09

    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 translation: 一个实施例包括:通过可用路由构造(ARC)链拓扑网络转发特定分组。 在一个实施例中,该转发包括:将接收特定分组的多个弧的圆弧上的每个特定非边缘节点的特定分组发送到没有将特定分组发送到所述特定非边缘的弧上的每个兄弟 节点,而如果从所述特定边缘节点的两个兄弟节点接收到,则不发送特定分组; 以及在接收到特定分组之后,通过弧上的两个边缘节点的每个特定边缘节点将特定分组发送到多个弧的第二弧上的相应子节点。 在一个实施例中,网络是具有预分配时隙的无线确定性网络,用于由网络的每个节点接收和随后发送相同的特定分组。

    Filtering on Classes and Particulars of a Packet Destination Address at Lower-Protocol Layers in a Networked Device
    77.
    发明申请
    Filtering on Classes and Particulars of a Packet Destination Address at Lower-Protocol Layers in a Networked Device 有权
    过滤网络设备中较低协议层的数据包目的地地址的类别和详细信息

    公开(公告)号:US20150139225A1

    公开(公告)日:2015-05-21

    申请号:US14155582

    申请日:2014-01-15

    CPC classification number: H04L45/16 H04L12/185 H04L12/1886 H04L69/22

    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 translation: 在一个实施例中,网络设备中的较低协议层在将信息从接收的分组发送到较高协议层之前,基于目的地地址的类别和特定的过滤分组。 例如,某些受限网络包括不具有为网络中使用的每个多播地址维护多播分发条目的能力的网络节点。 通过仅转发多播地址的一部分,除了实际的多播用户之外,分组经常被递送到节点。 通过在较低协议层(例如,第2层或第3层)处对这些错误传递的分组进行过滤,可以避免较高协议层的处理周期。 另外在一个实施例中,类和细节被确定性地确定(例如,使用相同的散列函数),使得可以通过订阅对应的多播组来发现和使用服务。

    Installation of Time Slots for Sending a Packet through an ARC Chain Topology Network
    78.
    发明申请
    Installation of Time Slots for Sending a Packet through an ARC Chain Topology Network 有权
    安装通过ARC链拓扑网络发送数据包的时隙

    公开(公告)号:US20150023326A1

    公开(公告)日:2015-01-22

    申请号:US14020930

    申请日:2013-09-09

    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 translation: 一个实施例包括:由特定联网设备确定发送和接收时隙,用于在弧上的两个方向上的可用路由构造(ARC)链拓扑网络的弧的节点之间逐渐传送特定分组,以到达每个边缘节点 的弧; 以及由所述特定网络设备为所述弧的每个边缘节点确定用于将所述特定分组传送到所述ARC链拓扑网络的第二弧上的相应子节点的预定相应时隙。 一个实施例包括在电弧的所述节点中分别安装所述确定的时隙。 在一个实施例中,网络是无线确定性网络。 在一个实施例中,每个特定边缘节点的预定相应时隙在所有特定分组可被所述特定边缘节点接收的所有时隙之后。

    BICASTING USING NON-CONGRUENT PATHS IN A LOOP-FREE ROUTING TOPOLOGY HAVING ROUTING ARCS
    79.
    发明申请
    BICASTING USING NON-CONGRUENT PATHS IN A LOOP-FREE ROUTING TOPOLOGY HAVING ROUTING ARCS 有权
    在具有路由ARCS的无循环路由拓扑中使用非约束条件

    公开(公告)号:US20140098711A1

    公开(公告)日:2014-04-10

    申请号:US13648500

    申请日:2012-10-10

    CPC classification number: H04L45/18 H04L41/0803 H04L45/02 H04L45/128 H04L45/24

    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 translation: 在一个实施例中,一种方法包括在计算网络中创建包括用于到达目的地网络节点的多个路由弧的无环路由拓扑,每个路由弧包括作为路由电弧的第一端的第一网络节点, 作为所述路由选择电弧的第二端的第二网络节点,以及至少第三网络节点,被配置为经由所述路由选择电弧的任何网络业务通过所述路由电弧的所述第一或第二端中的任何一个路向所述目的地节点,所述环路 - 提供第一和第二非一致路径的自由路由拓扑; 以及分别经由所述第一和第二非全等路径将包括来自网络节点的第一方向上的数据分组和来自所述网络节点的第二方向的所述数据分组的多播复制同时发送到所述目的地节点。

    ROUTING USING CACHED SOURCE ROUTES FROM MESSAGE HEADERS
    80.
    发明申请
    ROUTING USING CACHED SOURCE ROUTES FROM MESSAGE HEADERS 有权
    使用来自消息头的缓存源路由进行路由

    公开(公告)号:US20140029445A1

    公开(公告)日:2014-01-30

    申请号:US13562070

    申请日:2012-07-30

    CPC classification number: H04L45/34 H04L45/742

    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.

    Abstract translation: 在一个实施例中,计算机网络的中间节点可以接收用于目的地的消息。 消息可以包括指示源路由的报头。 中间节点可以基于源路由确定与下一跳相关联的目的地的路由条目的路由条目,并缓存路由条目。 中间节点可以进一步接收针对不指示下一跳的目的地的第二消息,并且根据缓存的路由条目发送第二消息。

Patent Agency Ranking