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

101. 发明申请

US20130223237A1 DIVERSE PATHS USING A SINGLE SOURCE ROUTE IN COMPUTER NETWORKS 有权
标题翻译：在计算机网络中使用单个源路由的多样化PATHS
公开(公告)号：US20130223237A1
公开(公告)日：2013-08-29
申请号：US13406823
申请日：2012-02-28
申请人： Jonathan W. Hui , Jean-Philippe Vasseur
发明人： Jonathan W. Hui , Jean-Philippe Vasseur
IPC分类号： H04L12/56 , H04L12/26
CPC分类号： H04L45/34 , H04L45/24 , H04W84/18
摘要： In one embodiment, a source device determines a source route from itself to a destination device in a computer network, and forwards a first packet on the source route with the source route included within the first packet. In addition, the source device generates a second packet with the source route included within the second packet, the second packet also including an indication to cause one or more of a plurality of transit devices to forward the second packet to a reachable 1-hop neighbor of a device in the source route two hops away from the respective transit device. The source device may then forward the second packet itself, as do one the one or more transit devices on a diverse path based on the source route, to a particular reachable 1-hop neighbor of a particular device in the source route two hops away from the source (or transit) device.
摘要翻译：在一个实施例中，源设备确定从计算机网络中的自身到目的地设备的源路由，并且在源路由上转发包括在第一分组内的源路由的第一分组。另外，源设备生成第二分组，其中源路由包括在第二分组内，第二分组还包括导致多个传输设备中的一个或多个将第二分组转发到可达的1跳邻居的指示的源路由中的设备离开相应的传输设备两跳。源设备然后可以将第二分组自身转发到基于源路由的不同路径上的一个或多个传输设备的一个或多个传输设备到源路由中的特定设备的特定可达1跳邻居，源（或转接）设备。

102. 发明申请

US20130223225A1 COMPUTING RISK-SHARING METRICS IN SHARED-MEDIA COMMUNICATION NETWORKS 有权
标题翻译：在共享媒体通信网络中计算风险共享度量
公开(公告)号：US20130223225A1
公开(公告)日：2013-08-29
申请号：US13403023
申请日：2012-02-23
申请人： Jonathan W. Hui , Jean-Philippe Vasseur
发明人： Jonathan W. Hui , Jean-Philippe Vasseur
IPC分类号： H04L12/24 , H04L12/26
CPC分类号： H04L12/10 , H04L41/0836 , H04L41/142 , H04L41/147 , H04L67/12 , H04W4/38 , H04W4/70
摘要： In one embodiment, a routing node determines a risk-sharing metric between pairs of nodes in a shared-media communication network, and may then compute a plurality of routes that minimizes the risk-sharing metric between the routes, to correspondingly route traffic according to the computed plurality of routes. Additionally, in another embodiment, a particular node in the shared-media communication network may determine a risk-sharing metric between itself and each of one or more other nodes in the shared-media communication network. The particular node may then share the one or more determined risk-sharing metrics with one or more routing nodes in the shared-media communication network, accordingly.
摘要翻译：在一个实施例中，路由节点确定共享 - 媒体通信网络中的节点对之间的风险共享度量，然后可以计算使路由之间的风险共享度量最小化的多个路由，以相应地根据计算出的多条路线。另外，在另一个实施例中，共享 - 媒体通信网络中的特定节点可以确定其与共享媒体通信网络中的一个或多个其他节点之间的风险共享度量。因此，特定节点可以相应地与共享媒体通信网络中的一个或多个路由节点共享一个或多个确定的风险共享度量。

103. 发明申请

US20130219478A1 REDUCED AUTHENTICATION TIMES FOR SHARED-MEDIA NETWORK MIGRATION 有权
标题翻译：减少媒体网络移动的认证时间
公开(公告)号：US20130219478A1
公开(公告)日：2013-08-22
申请号：US13400991
申请日：2012-02-21
申请人： Atul B. Mahamuni , Carol Barrett , Jean-Philippe Vasseur
发明人： Atul B. Mahamuni , Carol Barrett , Jean-Philippe Vasseur
IPC分类号： G06F21/20
CPC分类号： H04L63/065 , H04L45/00 , H04W40/24
摘要： In one embodiment, a management device in a computer network determines when nodes of the computer network join any one of a plurality of field area routers (FARs), which requires a shared-media mesh security key for that joined FAR. The management device also maintains a database that indicates to which FAR each node in the computer network is currently joined, and to which FARs, if any, each node had previously joined, where the nodes are configured to maintain the mesh security key for one or more previously joined FARs in order to return to those previously joined FARs with the maintained mesh security key. Accordingly, in response to an updated mesh security key for a particular FAR of the plurality of FARs, the management node initiates distribution of the updated mesh security key to nodes having previously joined that particular FAR that are not currently joined to that particular FAR.
摘要翻译：在一个实施例中，计算机网络中的管理设备确定计算机网络的何时节点连接多个场区域路由器（FAR）中的任何一个，其需要该加入的FAR的共享媒体网状安全密钥。管理设备还维护一个数据库，指示计算机网络中每个节点当前加入哪个FAR，以及每个节点先前已加入的哪个FAR（如果有的话），其中节点被配置为维护一个或多个节点的网状安全密钥以前加入的FAR，以便返回到以前加入的FAR与维护的网状安全密钥。因此，响应于针对多个FAR的特定FAR的更新的网状安全密钥，管理节点发起更新的网状安全密钥到先前已加入到当前未连接到该特定FAR的特定FAR的节点的分发。

104. 发明申请

US20130188513A1 FAST-TRACKING APPROACH FOR BUILDING ROUTING TOPOLOGIES IN FAST-MOVING NETWORKS 有权
标题翻译：在快速移动网络中构建路由拓扑的快速跟踪方法
公开(公告)号：US20130188513A1
公开(公告)日：2013-07-25
申请号：US13358361
申请日：2012-01-25
申请人： Jean-Philippe Vasseur , Sateesh K. Addepalli , Raghuram S. Sudhaakar , Kevin C. Lee
发明人： Jean-Philippe Vasseur , Sateesh K. Addepalli , Raghuram S. Sudhaakar , Kevin C. Lee
IPC分类号： H04W84/18
CPC分类号： H04L45/028 , H04L45/54 , H04L45/70 , H04W40/20 , H04W40/248
摘要： In one embodiment, a local node in a communication network determines a set of its neighbor nodes, and determines a respective occurrence frequency at which each particular neighbor node is to be probed based on a rate of change in distance between the local node and the particular neighbor node. The local node may then probe each particular neighbor node according to the respective occurrence frequency to determine the rate of change in distance between the local node and each particular neighbor node, and one or more routing metrics for reaching each particular neighbor node. As such, the local node may select, based on the probing, a suitable preferred next-hop node of the set of neighbor nodes for a corresponding routing topology.
摘要翻译：在一个实施例中，通信网络中的本地节点确定其相邻节点的集合，并且基于本地节点与特定节点之间的距离的变化率来确定每个特定邻居节点将被探测的相应出现频率邻居节点。本地节点然后可以根据相应出现频率来探测每个特定的邻居节点，以确定本地节点和每个特定的相邻节点之间的距离变化速率，以及用于到达每个特定邻居节点的一个或多个路由度量。因此，本地节点可以基于探测来选择相应路由拓扑的相邻节点集合中的合适的优选下一跳节点。

105. 发明申请

US20130159479A1 QUALITY OF SERVICE (QOS) CONFIGURATION IN LOW-POWER AND LOSSY NETWORKS 有权
公开(公告)号：US20130159479A1
公开(公告)日：2013-06-20
申请号：US13331890
申请日：2011-12-20
申请人： Jean-Philippe Vasseur
发明人： Jean-Philippe Vasseur
IPC分类号： G06F15/177
CPC分类号： H04L49/205 , H04L45/302 , H04L45/38 , H04L47/10
摘要： In one embodiment, a distributed intelligence agent (DIA) in a computer network performs deep packet inspection on received packets to determine packet flows, and calculates per-flow service level agreement (SLA) metrics for the packets based on timestamp values placed in the packets by respective origin devices in the computer network. By comparing the SLA metrics to respective SLAs to determine whether the respective SLAs are met, then in response to a particular SLA not being met for a particular flow, the DIA may download determined quality of service (QoS) configuration parameters to one or more visited devices along n calculated paths from a corresponding origin device for the particular flow to the DIA. In addition, in one or more embodiments, the QoS configuration parameters may be adjusted or de-configured based on whether they were successful.

106. 发明申请

US20130121176A1 COMMUNICATION PROTOCOL FOR ENERGY-HARVESTING DEVICES 有权
标题翻译：用于能量收集设备的通信协议
公开(公告)号：US20130121176A1
公开(公告)日：2013-05-16
申请号：US13297997
申请日：2011-11-16
申请人： Sateesh K. Addepalli , Raghuram S. Sudhaakar , Jean-Philippe Vasseur
发明人： Sateesh K. Addepalli , Raghuram S. Sudhaakar , Jean-Philippe Vasseur
IPC分类号： H04L12/26
CPC分类号： H04L67/12 , H05B37/0272
摘要： In one embodiment, an energy-harvesting communication device of a communication network accumulates energy, e.g., electromagnetic energy. Upon detecting that the accumulated energy surpasses a sufficient threshold, the communication device may transmit a message into the communication network using the accumulated energy as an unreliable and unsynchronized broadcast transmission to any available receiver within the communication network.
摘要翻译：在一个实施例中，通信网络的能量收集通信设备累积能量，例如电磁能量。在检测到累积能量超过足够的阈值时，通信设备可以使用累积的能量将消息发送到通信网络中的任何可用接收机的不可靠和不同步的广播传输。

107. 发明申请

US20130067063A1 DYNAMIC KEEPALIVE PARAMETERS FOR REVERSE PATH VALIDATION IN COMPUTER NETWORKS 有权
标题翻译：用于计算机网络中反向路径验证的动态保持参数
公开(公告)号：US20130067063A1
公开(公告)日：2013-03-14
申请号：US13230373
申请日：2011-09-12
申请人： Jean-Philippe Vasseur , Jonathan W. Hui
发明人： Jean-Philippe Vasseur , Jonathan W. Hui
IPC分类号： G06F15/16
CPC分类号： H04L45/026 , H04L45/16 , H04L45/22 , H04L45/28 , H04L45/36 , H04L45/70
摘要： In one embodiment, a network device determines a path from itself to a source device in a computer network, where the source device utilizes the path in reverse to reach the network device. Based on determining a reliability of the path in reverse, the network device may dynamically adjust one or more keepalive parameters for keepalive messages sent on the path. Accordingly, the network device may then send keepalive messages on the path based on the dynamically adjusted keepalive parameters.
摘要翻译：在一个实施例中，网络设备确定在计算机网络中自身到源设备的路径，其中源设备利用相反的路径到达网络设备。基于反向确定路径的可靠性，网络设备可以动态调整在路径上发送的保持活动消息的一个或多个保持活动参数。因此，网络设备然后可以基于动态调整的保持活动参数在路径上发送保持活动消息。

108. 发明申请

US20130064072A1 PROACTIVE SOURCE-BASED REVERSE PATH VALIDATION IN COMPUTER NETWORKS 有权
标题翻译：计算机网络中基于源的反向路径验证
公开(公告)号：US20130064072A1
公开(公告)日：2013-03-14
申请号：US13230154
申请日：2011-09-12
申请人： Jean-Philippe Vasseur , Jonathan W. Hui
发明人： Jean-Philippe Vasseur , Jonathan W. Hui
IPC分类号： H04L12/26
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消息的故障，网络设备以特定路由更改修复到源的路径，以及报告到源的特定路由更改，例如，作为响应，源可以相反地在改变的路径上发送特定的将来消息。

109. 发明申请

US20130028104A1 ESTIMATED TRANSMISSION OVERHEAD (ETO) METRICS FOR VARIABLE DATA RATE COMMUNICATION LINKS 有权
标题翻译：用于可变数据速率通信链路的估计传输（ETO）量度
公开(公告)号：US20130028104A1
公开(公告)日：2013-01-31
申请号：US13191617
申请日：2011-07-27
申请人： Jonathan W. Hui , Jean-Philippe Vasseur
发明人： Jonathan W. Hui , Jean-Philippe Vasseur
IPC分类号： H04L12/26
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值来选择通过通信网络的路由。

110. 发明申请

US20130022083A1 SUB-SLOTTING TO IMPROVE PACKET SUCCESS RATE IN CARRIER SENSE MULTIPLE ACCESS NETWORKS 有权
标题翻译：子卡槽以提高载体感应多路访问网络中的分组成功率
公开(公告)号：US20130022083A1
公开(公告)日：2013-01-24
申请号：US13187075
申请日：2011-07-20
申请人： Jean-Philippe Vasseur , Jonathan W. Hui
发明人： Jean-Philippe Vasseur , Jonathan W. Hui
IPC分类号： H04B1/713
CPC分类号： H04W74/0808 , H04B1/713 , H04L12/4035 , H04L12/413 , H04W48/16 , H04W74/02
摘要： In one embodiment, a communication device in a frequency hopping communication network determines an intention to forward a first packet in a particular timeslot of a frequency hopping sequence. As such, the device scans in receive mode for an initial portion of the particular timeslot on a particular frequency known to neighbors of the communication device for reaching the communication device. In response to determining that the communication device is receiving a second packet during the initial portion, the device remains in receive mode to receive a remainder of the second packet. Conversely, in response to not receiving the second packet during the initial portion, the device proceeds to transmit the first packet during a remainder of the particular timeslot.
摘要翻译：在一个实施例中，跳频通信网络中的通信设备确定在跳频序列的特定时隙中转发第一分组的意图。这样，设备以接收通信设备的邻居已知的特定频率的特定时隙的初始部分以接收模式扫描以到达通信设备。响应于在初始部分期间确定通信设备正在接收第二分组，设备保持接收模式以接收第二分组的剩余部分。相反，响应于在初始部分期间没有接收到第二分组，设备继续在特定时隙的剩余时间期间发送第一分组。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式