专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

81. 发明授权

US09013983B2 Proactive source-based reverse path validation in computer networks 有权
标题翻译：计算机网络中基于源的反向路径验证
公开(公告)号：US09013983B2
公开(公告)日：2015-04-21
申请号：US13230154
申请日：2011-09-12
申请人： Jean-Philippe Vasseur , Jonathan W. Hui
发明人： Jean-Philippe Vasseur , Jonathan W. Hui
IPC分类号： G01R31/08 , H04L29/08 , H04L12/26 , H04L12/751 , H04L12/721 , H04L12/707 , H04L12/703 , H04L12/24
CPC分类号： H04L67/145 , H04L41/12 , H04L43/10 , H04L45/026 , H04L45/22 , H04L45/28 , H04L45/34 , H04L45/36
摘要： In one embodiment, a network device may receive an indication of a particular future message time, and determines a path validation time that is prior to the particular future message time by an amount at least long enough to detect and report a route change of a path from the network device to a source of the particular future message, wherein the source utilizes the path in reverse to reach the network device for the particular future message. Accordingly, the network device sends, at the path validation time, a keepalive message on the path, where in response to a failure of the keepalive message on the path, the network device repairs the path to the source with a particular route change, and reports the particular route change to the source, e.g., such that in response, the source may transmit the particular future message on the changed path in reverse.
摘要翻译：在一个实施例中，网络设备可以接收特定未来消息时间的指示，并且确定在特定未来消息时间之前的路径验证时间至少足够长的时间量以检测和报告路径的路由改变从网络设备到特定的未来消息的源，其中源使用相反的路径到达用于特定将来消息的网络设备。因此，网络设备在路径验证时间发送路径上的keepalive消息，响应于该路径上的keepalive消息的故障，网络设备以特定路由更改修复到源的路径，以及报告到源的特定路由更改，例如，作为响应，源可以相反地在改变的路径上发送特定的将来消息。

82. 发明授权

US08861390B2 Estimated transmission overhead (ETO) metrics for variable data rate communication links 有权
标题翻译：可变数据速率通信链路的估计传输开销（ETO）度量
公开(公告)号：US08861390B2
公开(公告)日：2014-10-14
申请号：US13191617
申请日：2011-07-27
申请人： Jonathan W. Hui , Jean-Philippe Vasseur
发明人： Jonathan W. Hui , Jean-Philippe Vasseur
IPC分类号： H04Q11/00 , H04L12/825 , H04L12/753 , H04L12/801 , H04L12/721 , H04W84/18 , H04W4/00
CPC分类号： H04L47/25 , H04L45/123 , H04L45/48 , H04L47/34 , H04W4/38 , H04W84/18
摘要： In one embodiment, an expected transmission count (ETX) link metric is computed for a link between a transmitter and a receiver in a communication network, the ETX representative of an expected number of transmissions necessary for a message to be successfully received by the receiver over the link, and a data rate of the link at which the ETX is computed is also determined. From these, an estimated transmission overhead (ETO) link metric for the link may be computed by dividing the ETX by the data rate. In one embodiment, the data rate of the link may be adjusted based on the ETO (e.g., to minimize the ETO). In another embodiment, routes through the communication network may be selected based on ETO values along the route.
摘要翻译：在一个实施例中，为通信网络中的发射机和接收机之间的链路计算出期望的传输计数（ETX）链路量度，ETX表示接收机成功接收消息所需的预期传输次数链路以及计算ETX的链路的数据速率也被确定。由此可以通过将ETX除以数据速率来计算链路的估计传输开销（ETO）链路度量。在一个实施例中，可以基于ETO来调整链路的数据速率（例如，以最小化ETO）。在另一个实施例中，可以基于沿路由的ETO值来选择通过通信网络的路由。

83. 发明授权

US08837277B2 Source routing convergence in constrained computer networks 有权
标题翻译：受限计算机网络中的源路由收敛
公开(公告)号：US08837277B2
公开(公告)日：2014-09-16
申请号：US13151109
申请日：2011-06-01
申请人： Jean-Philippe Vasseur , Jonathan W. Hui
发明人： Jean-Philippe Vasseur , Jonathan W. Hui
IPC分类号： H04L1/00 , H04L12/54 , H04L12/721
CPC分类号： H04L45/22 , H04L12/56 , H04L45/24 , H04L45/28 , H04L45/34 , H04L45/48 , H04W40/30
摘要： In one embodiment, a source routing device (e.g., root device) pre-computes diverse source-routed paths to one or more nodes in a computer network. Upon receiving a particular packet, the device forwards the particular packet on a source-routed first path of the pre-computed diverse paths. In the event the device implicitly detects failure of the first path, then it forwards a copy of the particular packet on a source-routed second path of the pre-computed diverse paths in response. In one embodiment, implicit failure detection comprises seeing a second (repeated) packet with the same identification within a certain time since the first packet, and the second packet is forwarded on the second path. In another embodiment, implicit failure detection comprises not seeing a link-layer acknowledgment returned or receiving an error notification from a node along the broken path, and a stored copy of the particular packet is forwarded on the second path.
摘要翻译：在一个实施例中，源路由设备（例如，根设备）预先计算到计算机网络中的一个或多个节点的不同的源路由路径。在接收到特定分组时，设备在预先计算的不同路径的源路由第一路径上转发特定分组。在设备隐含地检测到第一路径的故障的情况下，其响应地在预先计算的不同路径的源路由第二路径上转发特定分组的副本。在一个实施例中，隐含故障检测包括在自第一分组之后的特定时间内看到具有相同标识的第二（重复）分组，并且第二分组在第二路径上转发。在另一个实施例中，隐含故障检测包括没有看到返回的链路层确认或从断开的路径接收到来自节点的错误通知，并且特定分组的存储副本在第二路径上转发。

84. 发明授权

US08699333B2 Congestion-based traffic shaping for distributed queuing in shared-media communication networks 有权
标题翻译：基于拥塞的流量整形，用于共享媒体通信网络中的分布式排队
公开(公告)号：US08699333B2
公开(公告)日：2014-04-15
申请号：US13248799
申请日：2011-09-29
申请人： Jean-Philippe Vasseur , Jonathan W. Hui
发明人： Jean-Philippe Vasseur , Jonathan W. Hui
IPC分类号： H04J1/16 , H04L12/28
CPC分类号： H04L47/17 , H04L47/24 , H04L47/263 , H04W28/021
摘要： In one embodiment, a device in a shared-media communication network determines a priority of a packet to be queued at the device, and based on the priority determines a length of time the packet is allowed to be queued before being successfully transmitted. After attempting to successfully transmit the queued packet within the shared-media communication network, in response to reaching a threshold amount of the length of time without having successfully transmitted the queued packet, the device may transmit a “shaping” request to one or more reachable neighbors in the shared-media communication network. Specifically, the shaping request is for a temporary reduction in bandwidth utilization by the reachable neighbors for traffic having a comparatively lesser priority than the priority of the packet.
摘要翻译：在一个实施例中，共享媒体通信网络中的设备确定要在设备上排队的分组的优先级，并且基于优先级确定分组被成功发送之前被排队的时间长度。在尝试在共享媒体通信网络内成功发送排队的分组之后，响应于达到一段时间长度而没有成功发送排队的分组，设备可以向一个或多个可达到的共享媒体通信网络中的邻居。具体地说，整形请求用于对于具有比分组的优先级相对较低优先级的业务的可达邻居的临时减少带宽利用。

85. 发明申请

US20140036908A1 RECORDING PACKET ROUTES USING BLOOM FILTERS 有权
标题翻译：使用BLOOM过滤器记录分组路由
公开(公告)号：US20140036908A1
公开(公告)日：2014-02-06
申请号：US13563573
申请日：2012-07-31
申请人： Jonathan W. Hui , Wei Hong , Jean-Philippe Vasseur
发明人： Jonathan W. Hui , Wei Hong , Jean-Philippe Vasseur
IPC分类号： H04L12/56
CPC分类号： H04L45/20 , H04L45/34 , H04L45/74 , H04W40/28
摘要： In one embodiment, a Bloom filter is provided in a data packet signal functional to preferably encode the identifier of each nodal device and record the nodal hop count the signal traverses across in a computer network. The Bloom filter provided in a data packet signal has one or more fields. The recorded nodal path may updated en-route as the data packet traverses a nodal path in the computer network and/or the order of nodes traversed by the data packet in the computer network are encoded in the bloom filter.
摘要翻译：在一个实施例中，布隆过滤器被提供在功能上的数据分组信号中，以优选地对每个节点设备的标识符进行编码，并记录信号在计算机网络中穿过的节点跳数。在数据分组信号中提供的布隆过滤器具有一个或多个字段。记录的节点路径可以随着数据分组穿越计算机网络中的节点路径和/或由计算机网络中的数据分组穿过的节点的顺序被编码在布隆过滤器中而被更新。

86. 发明申请

US20140029445A1 ROUTING USING CACHED SOURCE ROUTES FROM MESSAGE HEADERS 有权
标题翻译：使用来自消息头的缓存源路由进行路由
公开(公告)号：US20140029445A1
公开(公告)日：2014-01-30
申请号：US13562070
申请日：2012-07-30
申请人： Jonathan W. Hui , Jean-Philippe Vasseur , Pascal Thubert , Patrick Wetterwald
发明人： Jonathan W. Hui , Jean-Philippe Vasseur , Pascal Thubert , Patrick Wetterwald
IPC分类号： H04L12/56 , H04L12/26
CPC分类号： H04L45/34 , H04L45/742
摘要： 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.
摘要翻译：在一个实施例中，计算机网络的中间节点可以接收用于目的地的消息。消息可以包括指示源路由的报头。中间节点可以基于源路由确定与下一跳相关联的目的地的路由条目的路由条目，并缓存路由条目。中间节点可以进一步接收针对不指示下一跳的目的地的第二消息，并且根据缓存的路由条目发送第二消息。

87. 发明申请

US20130279540A1 ON-DEMAND PAIR-WISE FREQUENCY-HOPPING SYNCHRONIZATION 有权
标题翻译：需求配对频率同步同步
公开(公告)号：US20130279540A1
公开(公告)日：2013-10-24
申请号：US13566875
申请日：2012-08-03
申请人： Jonathan W. Hui , Wei Hong , Jean-Philippe Vasseur
发明人： Jonathan W. Hui , Wei Hong , Jean-Philippe Vasseur
IPC分类号： H04B1/7156
CPC分类号： H04W72/0406 , H04L1/1607 , H04L2001/0093 , H04W72/005 , H04W72/1205 , H04W72/1263 , H04W72/1278 , H04W72/1289 , H04W84/18
摘要： In one embodiment, a device receives and stores a broadcast schedule, and may determine whether a neighbor unicast listening schedule is available for a neighboring device. If so, the device may transmit a data frame to the neighboring device pursuant to the neighbor unicast listening schedule. If a neighbor unicast listening schedule is not available, the device may transmit the data frame to the neighboring device pursuant to a broadcast schedule. Once the data frame is received by the neighboring device, pursuant to the neighbor unicast listening schedule or the broadcast schedule, an acknowledgement may be received from the neighboring device, which may include an updated neighbor unicast listening schedule for that neighboring device.
摘要翻译：在一个实施例中，设备接收并存储广播调度，并且可以确定邻居单播监听调度是否可用于相邻设备。如果是，则设备可以根据邻居单播监听时间表向相邻设备发送数据帧。如果邻居单播监听调度不可用，则设备可以根据广播时间表将数据帧发送到相邻设备。一旦相邻设备接收到数据帧，根据邻居单播监听调度或广播调度，可以从相邻设备接收确认，该确认可以包括该相邻设备的更新的邻居单播监听调度。

88. 发明申请

US20130159548A1 ASSISTED TRAFFIC ENGINEERING FOR MINIMALISTIC CONNECTED OBJECT NETWORKS 有权
标题翻译：用于最小连接对象网络的辅助交通工程
公开(公告)号：US20130159548A1
公开(公告)日：2013-06-20
申请号：US13331534
申请日：2011-12-20
申请人： Jean-Philippe Vasseur , Jonathan W. Hui
发明人： Jean-Philippe Vasseur , Jonathan W. Hui
IPC分类号： G06F15/173
CPC分类号： H04L45/125 , H04L45/02 , H04L47/125
摘要： In one embodiment, a distributed intelligence agent (DIA), hosted on a border router that provides access for a computer network to a global computer network, determines a routing topology of the computer network, and also computes a traffic matrix for the computer network based on source and destination addresses of traffic traversing the DIA, the traffic matrix providing an estimate for an amount of traffic on each link of the routing topology. Accordingly, the DIA may determine one or more portions of the routing topology for which traffic engineering (TE) should be applied based on a threshold for traffic loads on the links, and may notify one or more nodes in the computer network to change its respective current next-hop in the routing topology to an alternate next-hop based on a TE solution computed by the DIA.
摘要翻译：在一个实施例中，托管在边界路由器上的向计算机网络提供对全局计算机网络的访问的分布式智能代理（DIA）确定计算机网络的路由拓扑，并且还计算用于基于计算机网络的业务矩阵在通过DIA的流量的源和目的地址上，业务矩阵提供对路由拓扑的每个链路上的流量的估计。因此，DIA可以基于链路上的业务负载的阈值来确定应该对其应用流量工程（TE）的一个或多个部分，并且可以通知计算机网络中的一个或多个节点来改变其相应的基于由DIA计算的TE解决方案，路由拓扑中的当前下一跳到另一个下一跳。

89. 发明申请

US20130094537A1 DYNAMIC HOPPING SEQUENCE COMPUTATION IN CHANNEL HOPPING COMMUNICATION NETWORKS 有权
标题翻译：通道通信网络中的动态搜索序列计算
公开(公告)号：US20130094537A1
公开(公告)日：2013-04-18
申请号：US13272932
申请日：2011-10-13
申请人： Jonathan W. Hui , Jean-Philippe Vasseur
发明人： Jonathan W. Hui , Jean-Philippe Vasseur
IPC分类号： H04B1/7143 , H04B1/713
CPC分类号： H04B1/713 , H04B1/7143 , H04L45/14 , H04L45/16 , H04L45/18 , H04W40/14 , H04W40/246 , H04W48/18
摘要： 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 i) 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 possible channel IDs. As such, the device configures its radio to transmit on the computed neighbor channel ID for the respective current neighbor slot.
摘要翻译：在一个实施例中，信道跳频通信网络中的设备独立地维护时隙计数器，并且基于具有i）设备的唯一特征的输入的功能来计算信道标识（ID），ii）所述时隙的当前时隙计数器，和iii）一组可能的通道ID。因此，设备将其无线电配置为针对相应的当前时隙的所计算的信道ID进行接收。在另一个实施例中，设备可以为邻居设备确定当前相邻时隙和唯一邻居特征，并且基于使用唯一邻居特征，当前相邻时隙和可能的集合的功能来相应地计算邻居信道ID 频道ID。因此，设备将其无线电配置为针对相应的当前相邻时隙的所计算的邻居信道ID进行发送。

90. 发明申请

US20130031253A1 NETWORK MANAGEMENT SYSTEM SCHEDULING FOR LOW POWER AND LOSSY NETWORKS 有权
标题翻译：网络管理系统调度低功耗网络
公开(公告)号：US20130031253A1
公开(公告)日：2013-01-31
申请号：US13194186
申请日：2011-07-29
申请人： Jonathan W. Hui , Gilman Tolle , Jean-Philippe Vasseur
发明人： Jonathan W. Hui , Gilman Tolle , Jean-Philippe Vasseur
IPC分类号： G06F15/16
CPC分类号： H04L43/0811 , H04L43/0817 , H04L43/103 , H04W40/00 , Y02D70/00 , Y02D70/142 , Y02D70/144 , Y02D70/22 , Y04S40/168
摘要： In one embodiment, a network management system (NMS) determines an intent to initialize a request-response exchange with a plurality of clients in a low power and lossy network (LLN). In response, the NMS adaptively schedules corresponding responses from the clients to distribute the responses across a period of time based on a network state of the LLN. Accordingly, requests may be generated by the NMS with an indication of a corresponding schedule to be used by the clients to respond, and transmitted into the LLN to solicit the responses, which are then received at the NMS according to the indicated schedule.
摘要翻译：在一个实施例中，网络管理系统（NMS）确定在低功率和有损耗网络（LLN）中与多个客户端初始化请求 - 响应交换的意图。作为响应，NMS根据LLN的网络状态自适应地调度来自客户端的相应响应以在一段时间内分发响应。因此，可以由NMS产生请求，其中指示要被客户端使用的对应的调度表，并发送到LLN以征求响应，然后根据指示的时间表在NMS处接收响应。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式