Seamless multipath retransmission using source-routed tunnels
    21.
    发明授权
    Seamless multipath retransmission using source-routed tunnels 有权
    使用源路由隧道进行无缝多路径重传

    公开(公告)号:US09154370B2

    公开(公告)日:2015-10-06

    申请号:US13669210

    申请日:2012-11-05

    Abstract: In one embodiment, a device receives a destination unreachable message originated by a particular node along a first source route, the message carrying an encapsulated packet as received by the particular node. In response, the device may determine a failed link along the first source route based on a tunnel header and the particular node. Once determining an alternate source route without the failed link, the device may re-encapsulate and re-transmit the original packet on an alternate source route with a new tunnel header indicating the alternate source route (e.g., and a new hop limit count for the tunnel header and an adjusted hop limit count in the original packet).

    Abstract translation: 在一个实施例中,设备从第一源路由接收由特定节点发起的目的地不可达消息,该消息携带由特定节点接收的封装分组。 作为响应,设备可以基于隧道报头和特定节点来确定沿着第一源路由的故障链路。 一旦确定了没有故障链路的替代源路由,设备可以在备用源路由上重新封装并重新发送原始分组,其中新的隧道报头指示替代源路由(例如,并且新的跳数限制计数为 隧道报头和原始分组中的调整跳频限制计数)。

    Managing host routes for local computer networks with a plurality of field area routers
    22.
    发明授权
    Managing host routes for local computer networks with a plurality of field area routers 有权
    管理具有多个场地路由器的本地计算机网络的主机路由

    公开(公告)号:US09130863B2

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

    申请号:US14311537

    申请日:2014-06-23

    CPC classification number: H04L45/22 H04L45/64

    Abstract: In one embodiment, a particular field area router (FAR), in a local computer network (e.g., a mesh network) having a plurality of FARs, advertises a common subnet prefix assigned to the local computer network into a global computer network. Each of the plurality of FARs of the local computer network is configured to accept any traffic destined to the local computer network, and a tunnel overlay is built among the plurality of FARs. Upon receiving a packet at the particular FAR destined to a particular device in the local computer network, and in response to the particular FAR not having a host route to the particular device, it forwards the packet on the tunnel overlay to another of the plurality of FARs of the local computer network.

    Abstract translation: 在一个实施例中,具有多个FAR的本地计算机网络(例如,网状网络)中的特定场区域路由器(FAR)将分配给本地计算机网络的公共子网前缀通告给全局计算机网络。 本地计算机网络的多个FAR中的每一个被配置为接受去往本地计算机网络的任何流量,并且在多个FAR之间建立隧道覆盖。 一旦在特定的FAR上收到一个目的地是本地计算机网络中的特定设备的分组,并且响应于特定的FAR没有到该特定设备的主机路由,它将隧道覆盖上的分组转发到多个 本地计算机网络的FAR。

    PHASE DETERMINATION IN SMART GRID NETWORKS
    23.
    发明申请
    PHASE DETERMINATION IN SMART GRID NETWORKS 有权
    智能网络网络中的相位确定

    公开(公告)号:US20150200713A1

    公开(公告)日:2015-07-16

    申请号:US14154127

    申请日:2014-01-13

    Abstract: In a multiple interface, low power and lossy network comprising multiple nodes, a root phase device obtains phase differential and absolute phase information from the devices in various network paths. Each device in a network path determines the differential phase data compared to its parent device in a network path. The device transmits the differential phase data to the parent device. The parent device transmits the differential phase data up the network path toward the root phase device. The root phase device collects the differential phase data and transmits the data to a central device. The central device determines the absolute phase of all devices. The root phase device can propagate absolute phase information to all devices within the network. Each device determines the absolute phase data by comparing the phase data of the device with the absolute phase data. The phase data is transmitted to a central device.

    Abstract translation: 在包括多个节点的多接口,低功率和有损网络中,根相设备从各种网络路径中的设备获取相位差和绝对相位信息。 网络路径中的每个设备确定与网络路径中的其父设备相比较的差分相位数据。 设备将差分相位数据发送到父设备。 父设备将网络路径上的差分相位数据发送到根相设备。 根相设备收集差分相位数据并将数据发送到中央设备。 中央设备确定所有设备的绝对相位。 根相设备可以将绝对相位信息传播到网络中的所有设备。 每个器件通过将器件的相位数据与绝对相位数据进行比较来确定绝对相位数据。 相位数据被发送到中央设备。

    DYNAMIC HOPPING SEQUENCE COMPUTATION IN CHANNEL HOPPING COMMUNICATION NETWORKS
    24.
    发明申请
    DYNAMIC HOPPING SEQUENCE COMPUTATION IN CHANNEL HOPPING COMMUNICATION NETWORKS 审中-公开
    通道通信网络中的动态搜索序列计算

    公开(公告)号:US20150110159A1

    公开(公告)日:2015-04-23

    申请号:US14579375

    申请日:2014-12-22

    Abstract: In one embodiment, a device in a channel hopping, communication network independently maintains a slot counter, and computes a channel identification (ID) based on a function having inputs of a unique feature of the device, ii) a current slot of the slot counter, and iii) a set of possible channel IDs. Accordingly, the device configures its radio to receive on the computed channel ID for the respective current slot. In another embodiment, the device may determine, for a neighbor device, a current neighbor slot and unique neighbor feature, and correspondingly computes a neighbor channel ID based on the function using the unique neighbor feature, the current neighbor slot, and the set of a possible channel IDs. As such, the device configures its radio to transmit on the computed neighbor channel ID for the respective current neighbor slot.

    Abstract translation: 在一个实施例中,信道跳跃,通信网络中的设备独立地维护时隙计数器,并且基于具有设备的唯一特征的输入的功能来计算信道标识(ID),ii)时隙计数器的当前时隙 ,以及iii)一组可能的频道ID。 因此,设备将其无线电配置为针对相应的当前时隙的所计算的信道ID进行接收。 在另一个实施例中,设备可以为邻居设备确定当前相邻时隙和唯一邻居特征,并且基于使用唯一邻居特征,当前相邻时隙和所述一组的相应功能来相应地计算邻居信道ID 可能的频道ID。 因此,设备将其无线电配置为针对相应的当前相邻时隙的所计算的邻居信道ID进行发送。

    OVERLAYING RECEIVE SCHEDULES FOR ENERGY-CONSTRAINED DEVICES IN CHANNEL-HOPPING NETWORKS
    25.
    发明申请
    OVERLAYING RECEIVE SCHEDULES FOR ENERGY-CONSTRAINED DEVICES IN CHANNEL-HOPPING NETWORKS 有权
    在通道网络中覆盖能量约束设备的覆盖时间表

    公开(公告)号:US20140376567A1

    公开(公告)日:2014-12-25

    申请号:US13921680

    申请日:2013-06-19

    Abstract: In one embodiment, a time at which a first device in a frequency-hopping communication network is expected to transmit a data message is determined. A first schedule is then generated based on the determined time, and the first schedule is overlaid on a frequency-hopping schedule for a second device in the network. The first schedule defines a first timeslot during which the second device listens for the data message, while the frequency-hopping schedule defines second timeslots during which the second device listens for data messages from other devices in the network. Notably, a duration of the first timeslot is greater than respective durations of the second timeslots.

    Abstract translation: 在一个实施例中,确定跳频通信网络中的第一设备期望发送数据消息的时间。 然后基于所确定的时间生成第一调度,并且第一调度被叠加在网络中的第二设备的跳频调度上。 第一调度定义了第二设备在其中侦听数据消息的第一时隙,而跳频调度定义了第二时隙,在第二时隙期间,第二设备监听来自网络中的其他设备的数据消息。 值得注意的是,第一时隙的持续时间大于第二时隙的相应持续时间。

    RELIABLE BULK DATA DISSEMINATION USING RATELESS CODES
    26.
    发明申请
    RELIABLE BULK DATA DISSEMINATION USING RATELESS CODES 有权
    可靠的大容量数据显示使用无痕码

    公开(公告)号:US20140372585A1

    公开(公告)日:2014-12-18

    申请号:US13920802

    申请日:2013-06-18

    CPC classification number: H04L49/20 H03M13/3761 H04L1/004 H04L1/0076

    Abstract: In one embodiment, an aggregating node receives feedback messages from one or more destination nodes in the network. The destination nodes are designated to receive data as packets from a source node using rateless coding. Further, the feedback messages indicate whether packets are needed at a corresponding destination node to complete the data. Then, the feedback messages are aggregated into a single aggregated message, and the aggregated message is transmitted toward the source node.

    Abstract translation: 在一个实施例中,聚合节点从网络中的一个或多个目的地节点接收反馈消息。 目的地节点被指定为使用无编码编码从源节点接收数据作为数据包。 此外,反馈消息指示在相应目的地节点处是否需要分组来完成数据。 然后,将反馈消息聚合成单个聚合消息,并将聚合消息发送到源节点。

    CONTROLLING ROUTING DURING SCHEDULED NODE DOWNTIME
    28.
    发明申请
    CONTROLLING ROUTING DURING SCHEDULED NODE DOWNTIME 有权
    在调度节点停止期间控制路由

    公开(公告)号:US20140314096A1

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

    申请号:US13868290

    申请日:2013-04-23

    CPC classification number: H04L45/22 H04L45/28

    Abstract: In one embodiment, a first node in a shared-media communication network may receive a message indicated a scheduled downtime of a second node located between the first node and a destination. The first node may determine whether to perform a search for an alternate route toward the destination. In response to determining to perform the search, the first node may perform the search for an alternate route toward the destination for use at least during the scheduled downtime.

    Abstract translation: 在一个实施例中,共享媒体通信网络中的第一节点可以接收指示位于第一节点和目的地之间的第二节点的预定停机时间的消息。 第一节点可以确定是否执行到目的地的替代路由的搜索。 响应于确定执行搜索,第一节点可以执行搜索到目的地的替代路由以至少在预定的停机期间使用。

    BINARY SEARCH-BASED APPROACH IN ROUTING-METRIC AGNOSTIC TOPOLOGIES FOR NODE SELECTION TO ENABLE EFFECTIVE LEARNING MACHINE MECHANISMS
    29.
    发明申请
    BINARY SEARCH-BASED APPROACH IN ROUTING-METRIC AGNOSTIC TOPOLOGIES FOR NODE SELECTION TO ENABLE EFFECTIVE LEARNING MACHINE MECHANISMS 有权
    基于二进制搜索的路由选择方法,用于选择有效的学习机器机制

    公开(公告)号:US20140219078A1

    公开(公告)日:2014-08-07

    申请号:US13946268

    申请日:2013-07-19

    Abstract: In one embodiment, nodes are polled in a network for Quality of Service (QoS) measurements, and a QoS anomaly that affects a plurality of potentially faulty nodes is detected based on the QoS measurements. A path, which traverses the plurality of potentially faulty nodes, is then computed from a first endpoint to a second endpoint. Also, a median node that is located at a point along the path between the first endpoint and the second endpoint is computed. Time-stamped packets are received from the median node, and the first endpoint and the second endpoint of the path are updated based on the received time-stamped packets, such that an amount of potentially faulty nodes is reduced. Then, the faulty node is identified from a reduced amount of potentially faulty nodes.

    Abstract translation: 在一个实施例中,在用于服务质量(QoS)测量的网络中轮询节点,并且基于QoS测量来检测影响多个潜在故障节点的QoS异常。 然后,从第一端点到第二端点计算遍历多个潜在故障节点的路径。 此外,计算位于沿着第一端点和第二端点之间的路径的点处的中间节点。 从中间节点接收时间戳的分组,并且基于接收的时间戳分组来更新路径的第一端点和第二端点,使得可能故障节点的量减少。 然后,从减少量的潜在故障节点识别故障节点。

    PUSH-BASED SHORT-CUT REQUESTS WITHIN A DIRECTED ACYCLIC GRAPH
    30.
    发明申请
    PUSH-BASED SHORT-CUT REQUESTS WITHIN A DIRECTED ACYCLIC GRAPH 有权
    基于按键的短切割请求在方向图中

    公开(公告)号:US20140129734A1

    公开(公告)日:2014-05-08

    申请号:US13668744

    申请日:2012-11-05

    CPC classification number: H04L45/121 H04L45/14 H04L45/302 H04L45/42 H04L45/48

    Abstract: In one embodiment, a root of a directed acyclic graph (DAG) may determine transmission of critical traffic from a first device to a second device in a computer network using the DAG, and may also determine a maximum tolerable delay of the critical traffic. As such, the root may compute, based on a known topology of the computer network, a constrained shortest path first (CSPF) point-to-point (P2P) path from the first device to the second device to meet the maximum tolerable delay. The root may then inform the first device of the P2P path to the second device to cause the first device to use the P2P path for the critical traffic.

    Abstract translation: 在一个实施例中,有向非循环图(DAG)的根可以使用DAG来确定计算机网络中的第一设备到第二设备的关键业务的传输,并且还可以确定关键业务的最大容许延迟。 因此,根可以基于计算机网络的已知拓扑来计算从第一设备到第二设备的约束最短路径优先(CSPF)点到点(P2P)路径以满足最大可容忍延迟。 然后,根可以将第一设备通知到第二设备的P2P路径,以使第一设备将P2P路径用于关键业务。

Patent Agency Ranking