Reliable bulk data dissemination using rateless codes
    122.
    发明授权
    Reliable bulk data dissemination using rateless codes 有权
    使用无码代码进行可靠的批量数据传播

    公开(公告)号:US09350683B2

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

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

    Simultaneous acknowledgments for multicast packets
    123.
    发明授权
    Simultaneous acknowledgments for multicast packets 有权
    同时确认组播数据包

    公开(公告)号:US09350645B2

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

    申请号:US13920758

    申请日:2013-06-18

    Abstract: In one embodiment, a multicast communication is received at a particular node of a plurality of nodes receiving the multicast communication in a network. The particular node selects a subset of subcarriers using a probabilistic data structure, such that each of the plurality of nodes selects a respective subset of subcarriers using the probabilistic data structure. The particular node transmits an acknowledgement of receipt of the multicast communication on the subset of subcarriers selected by the particular node. The transmission occurs simultaneously with transmissions of acknowledgements from the other of the plurality of nodes.

    Abstract translation: 在一个实施例中,在网络中接收多播通信的多个节点的特定节点处接收多播通信。 特定节点使用概率数据结构选择子载波子集,使得多个节点中的每一个节点使用概率数据结构来选择子载波的相应子集。 特定节点在由特定节点选择的子载波子集上发送接收到多播通信的确认。 传输与来自多个节点中的另一个的确认的发送同时发生。

    FAST NETWORK FORMATION USING A BATTERY-BACKED NETWORK BACKBONE
    124.
    发明申请
    FAST NETWORK FORMATION USING A BATTERY-BACKED NETWORK BACKBONE 有权
    使用电池背板网络的快速网络形成

    公开(公告)号:US20160134161A1

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

    申请号:US14569060

    申请日:2014-12-12

    Abstract: In one embodiment, a device in a network detects a power outage event in the network. The device causes an unprotected node in the network to use a first routing topology that includes a power-protected backbone, in response to detecting the power outage event. The power-protected backbone includes one or more nodes that are protected against the power outage event and the unprotected node is not protected against the power outage event. The device routes data for the unprotected node using the first routing topology. The device causes the unprotected node to use a second routing topology that optimizes a path from the unprotected node to a root node of the network based on one or more performance criteria.

    Abstract translation: 在一个实施例中,网络中的设备检测网络中的断电事件。 响应于检测到停电事件,该设备使得网络中的未受保护的节点使用包括受功率保护的主干的第一路由拓扑。 功率受保护的骨干网包括一个或多个受到停电事件保护的节点,并且不受保护的节点不被保护以免发生停电事件。 设备使用第一路由拓扑路由数据路由未保护节点的数据。 该设备使未受保护的节点使用第二路由拓扑,其基于一个或多个性能标准优化从未受保护的节点到网络的根节点的路径。

    Enabling dynamic routing topologies in support of real-time delay traffic
    125.
    发明授权
    Enabling dynamic routing topologies in support of real-time delay traffic 有权
    启用支持实时延迟流量的动态路由拓扑

    公开(公告)号:US09306841B2

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

    申请号:US13668904

    申请日:2012-11-05

    CPC classification number: H04L45/48 H04L45/02 H04W40/24 H04W84/18

    Abstract: In one embodiment, a device determines a set of sources and used destinations for traffic in a computer network, where nodes of the network are configured to send all traffic to the used destinations through a root node of the computer network according to a directed acyclic graph (DAG). The device may then also determine a set of capable nodes as common ancestors to source-destination pairs that provide a more optimal path between the source-destination pairs than traversing the root node, and instructs the set of capable nodes to store downward routes to forward traffic for one or more of the used destinations according to the stored downward route rather than through the root node.

    Abstract translation: 在一个实施例中,设备确定计算机网络中的通信量的一组源和所使用的目的地,其中网络的节点被配置为根据有向非循环图通过计算机网络的根节点向所使用的目的地发送所有业务 (DAG)。 然后,设备还可以确定一组能力节点作为源 - 目的地对的共同祖先,其在源 - 目的地对之间提供比遍历根节点更优选的路径,并且指示该组能力节点存储向下的路由以向前 根据存储的向下路由而不是通过根节点的一个或多个所使用的目的地的流量。

    FAST FREQUENCY-HOPPING SCHEDULE RECOVERY
    126.
    发明申请
    FAST FREQUENCY-HOPPING SCHEDULE RECOVERY 审中-公开
    快速频率调度表恢复

    公开(公告)号:US20160080030A1

    公开(公告)日:2016-03-17

    申请号:US14953997

    申请日:2015-11-30

    CPC classification number: H04B1/7156 H04W56/001

    Abstract: In one embodiment, a device determines a need to resynchronize a broadcast and unicast frequency-hopping schedules on its network interface. In response to the need, the device may solicit the broadcast schedule from one or more neighbor devices having the synchronized broadcast schedule, and then establishes the unicast schedule for the network interface using communication during the synchronized broadcast schedule.

    Abstract translation: 在一个实施例中,设备确定需要在其网络接口上重新同步广播和单播跳频计划。 响应于需要,设备可以从具有同步广播调度的一个或多个相邻设备征求广播调度,然后在同步的广播调度中使用通信建立网络接口的单播调度。

    PER-CHANNEL ADAPTIVE CODE RATES IN CHANNEL-HOPPING NETWORKS
    127.
    发明申请
    PER-CHANNEL ADAPTIVE CODE RATES IN CHANNEL-HOPPING NETWORKS 有权
    渠道自适应网络中的每通道自适应代码率

    公开(公告)号:US20160021647A1

    公开(公告)日:2016-01-21

    申请号:US14336546

    申请日:2014-07-21

    Abstract: In one embodiment, a channel on which a receiving node will receive a data packet that is transmitted at a particular time in a channel-hopping network is determined according to a channel-hopping receive schedule of the receiving node. Channel characteristics of the determined channel are computed. Then, a code rate of the data packet is selected based on the computed channel characteristics of the determined channel. After the code rate selection, the data packet is transmitted on the determined channel to the receiving node using the selected code rate.

    Abstract translation: 在一个实施例中,根据接收节点的信道跳跃接收调度确定接收节点将在其上接收在特定时间在信道跳跃网络中发送的数据分组的信道。 计算确定通道的通道特性。 然后,基于所确定的信道的计算的信道特性来选择数据分组的编码率。 在码率选择之后,使用所选择的码率在所确定的信道上向接收节点发送数据分组。

    TRAFFIC CLASS CAPACITY ALLOCATION IN COMPUTER NETWORKS
    128.
    发明申请
    TRAFFIC CLASS CAPACITY ALLOCATION IN COMPUTER NETWORKS 审中-公开
    计算机网络中的交通类容量分配

    公开(公告)号:US20160021596A1

    公开(公告)日:2016-01-21

    申请号:US14559148

    申请日:2014-12-03

    Abstract: In one embodiment, a device in a network identifies one or more traffic classes used by one or more nodes in the network. The device determines routing requirements for a particular traffic class of the one or more traffic classes. The device generates a channel assignment that assigns the particular traffic class to a particular channel based on the routing requirements for the particular traffic class. The device provides the channel assignment to the one or more nodes. The one or more nodes use the channel assignment to route traffic of the particular traffic class within the network.

    Abstract translation: 在一个实施例中,网络中的设备识别由网络中的一个或多个节点使用的一个或多个业务类别。 该设备确定一个或多个业务类别的特定业务类别的路由需求。 该设备生成一个信道分配,根据特定流量类别的路由要求,将特定流量类别分配给特定信道。 该设备向一个或多个节点提供信道分配。 一个或多个节点使用信道分配来在网络内路由特定业务类的业务。

    Mintree-based routing in highly constrained networks
    129.
    发明授权
    Mintree-based routing in highly constrained networks 有权
    在高度有限的网络中基于Mintree的路由

    公开(公告)号:US09219682B2

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

    申请号:US13668894

    申请日:2012-11-05

    CPC classification number: H04L45/48 H04L45/02

    Abstract: In one embodiment, a capable node in a computer network may host a path computation element, receive one or more neighborhood discovery messages including neighborhood information from a plurality of nodes in the computer network, and compute a minimum spanning tree (MinTree) for the computer network based on the neighborhood information. The MinTree may divide the plurality of nodes in the computer network into a first subset of routing nodes and a second subset of host nodes. The first subset of routing nodes may form one or more interconnected paths of routing nodes within the MinTree, and each host node within the second subset of host nodes may be located within one hop of at least one routing node. The capable node may then communicate a MinTree message to the plurality of nodes in the computer network to build the MinTree by enabling routing on each routing node.

    Abstract translation: 在一个实施例中,计算机网络中的能力节点可以承载路径计算元件,从计算机网络中的多个节点接收包括邻域信息的一个或多个邻域发现消息,并计算计算机的最小生成树(MinTree) 基于邻居信息的网络。 MinTree可以将计算机网络中的多个节点划分为路由节点的第一子集和主节点的第二子集。 路由节点的第一子集可以在MinTree内形成路由节点的一个或多个互连路径,并且主节点的第二子集内的每个主机节点可以位于至少一个路由节点的一跳内。 有能力的节点可以然后通过在每个路由节点上启用路由来将MinTree消息传送到计算机网络中的多个节点以构建MinTree。

    DYNAMICALLY ADJUSTING ROUTE OR LINK TOPOLOGY TO MINIMIZE SELF-INTERFERENCE
    130.
    发明申请
    DYNAMICALLY ADJUSTING ROUTE OR LINK TOPOLOGY TO MINIMIZE SELF-INTERFERENCE 有权
    动态调整路线或链接拓扑以最小化自我干扰

    公开(公告)号:US20150341140A1

    公开(公告)日:2015-11-26

    申请号:US14284569

    申请日:2014-05-22

    Abstract: In one embodiment, a method is disclosed in which physical layer information is received from one or more nodes along a path in a network. Self-interference information is also received from the one or more network nodes. The presence of self-interference along the path is identified and a transmission strategy of the one or more nodes is altered based on the identified self-interference and the received physical layer information.

    Abstract translation: 在一个实施例中,公开了一种方法,其中沿着网络中的路径从一个或多个节点接收物理层信息。 还从一个或多个网络节点接收自干扰信息。 识别沿着路径的自干扰的存在,并且基于所识别的自干扰和接收的物理层信息来改变一个或多个节点的传输策略。

Patent Agency Ranking