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

1. 发明授权

US09391878B2 Reliable packet delivery with overlay network (RPDON) 有权
标题翻译：覆盖网络可靠的分组传输（RPDON）
公开(公告)号：US09391878B2
公开(公告)日：2016-07-12
申请号：US13358130
申请日：2012-01-25
申请人： Kalyan Bade , Atul B. Mahamuni , Carol Barrett , Jean-Philippe Vasseur
发明人： Kalyan Bade , Atul B. Mahamuni , Carol Barrett , Jean-Philippe Vasseur
IPC分类号： H04L1/00 , H04L12/725 , H04L12/18 , H04L1/18 , H04L12/26 , H04L12/24
CPC分类号： H04L45/30 , H04L1/0086 , H04L1/1838 , H04L1/1877 , H04L1/1896 , H04L12/1868 , H04L41/0893 , H04L43/10 , H04L45/3065
摘要： In one embodiment, a device in a computer network establishes a reliable map that defines a set of packet criteria for which reliability is desired over an unreliable link to a peer device. In response to receiving a first packet from the peer device over the unreliable link, the device acknowledges the first packet to the peer device when the first packet matches the packet criteria of the reliable map. Also, in response to receiving a second packet destined via the peer device over the unreliable link, the device buffers the second packet when the second packet matches the packet criteria of the reliable map and retransmits the buffered second packet over the unreliable link to the peer device until acknowledged by the peer device.
摘要翻译：在一个实施例中，计算机网络中的设备建立可靠的映射，其定义了通过对对等设备的不可靠链路来期望可靠性的一组分组标准。响应于通过不可靠链路从对等设备接收到第一分组，当第一分组匹配可靠地图的分组标准时，设备向对等设备确认第一分组。此外，响应于通过不可靠链路接收经由对等设备发送的第二分组，当第二分组与可靠映射的分组标准匹配时，设备缓冲第二分组，并且经由不可靠链路将对缓冲的第二分组重传到对等体设备，直到对等设备确认。

2. 发明申请

US20130188471A1 RELIABLE PACKET DELIVERY WITH OVERLAY NETWORK (RPDON) 有权
标题翻译：可靠的分组交付与覆盖网络（RPDON）
公开(公告)号：US20130188471A1
公开(公告)日：2013-07-25
申请号：US13358130
申请日：2012-01-25
申请人： Kalyan Bade , Atul B. Mahamuni , Carol Barrett , Jean-Philippe Vasseur
发明人： Kalyan Bade , Atul B. Mahamuni , Carol Barrett , Jean-Philippe Vasseur
IPC分类号： H04L12/24
CPC分类号： H04L45/30 , H04L1/0086 , H04L1/1838 , H04L1/1877 , H04L1/1896 , H04L12/1868 , H04L41/0893 , H04L43/10 , H04L45/3065
摘要： In one embodiment, a device in a computer network establishes a reliable map that defines a set of packet criteria for which reliability is desired over an unreliable link to a peer device. In response to receiving a first packet from the peer device over the unreliable link, the device acknowledges the first packet to the peer device when the first packet matches the packet criteria of the reliable map. Also, in response to receiving a second packet destined via the peer device over the unreliable link, the device buffers the second packet when the second packet matches the packet criteria of the reliable map and retransmits the buffered second packet over the unreliable link to the peer device until acknowledged by the peer device.
摘要翻译：在一个实施例中，计算机网络中的设备建立可靠的映射，其定义了通过对对等设备的不可靠链路来期望可靠性的一组分组标准。响应于通过不可靠链路从对等设备接收到第一分组，当第一分组匹配可靠地图的分组标准时，设备向对等设备确认第一分组。此外，响应于通过不可靠链路接收经由对等设备发送的第二分组，当第二分组与可靠映射的分组标准匹配时，设备缓冲第二分组，并且经由不可靠链路将对缓冲的第二分组重传到对等体设备，直到对等设备确认。

3. 发明授权

US08949959B2 Reduced authentication times for shared-media network migration 有权
标题翻译：降低了共享媒体网络迁移的验证时间
公开(公告)号：US08949959B2
公开(公告)日：2015-02-03
申请号：US13400991
申请日：2012-02-21
申请人： Atul B. Mahamuni , Carol Barrett , Jean-Philippe Vasseur
发明人： Atul B. Mahamuni , Carol Barrett , Jean-Philippe Vasseur
IPC分类号： H04L29/00
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的节点的分发。

4. 发明申请

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的节点的分发。

5. 发明授权

US09081567B1 Method and apparatus to control routing convergence during node reboot by entering a freeze state that inhibits routing convergence during the reboot process 有权
标题翻译：通过在重启过程中输入禁止路由收敛的冻结状态来控制节点重启期间的路由收敛的方法和装置
公开(公告)号：US09081567B1
公开(公告)日：2015-07-14
申请号：US13188356
申请日：2011-07-21
申请人： Atul B. Mahamuni , Jean-Philippe Vasseur
发明人： Atul B. Mahamuni , Jean-Philippe Vasseur
IPC分类号： G06F9/00 , G06F15/177 , H04L12/28 , G06F1/32
CPC分类号： G06F1/3203 , G06F1/3206
摘要： In one embodiment, a technique may enable control of routing convergence in a computer network during reboot of a node of a routing topology represented by a directed acyclic graph (DAG). The rebooting node, e.g., a DAG root node, may transmit a reboot notification message to nodes of the routing topology indicating that the rebooting node is unavailable during a subsequent reboot process. In response to receiving and processing the reboot notification message, the nodes of the routing topology may enter a DAG freeze state that inhibits (prevents) routing convergence in the routing topology during the reboot process so as prevent adverse consequences on network stability, such as collapse of the DAG. Thereafter upon completion of the reboot process, the rebooting node may transmit a clear message to the nodes of the routing topology that instructs the nodes to exit the DAG freeze state.
摘要翻译：在一个实施例中，一种技术可以在由有向无环图（DAG）表示的路由拓扑的节点的重新启动期间能够控制计算机网络中的路由收敛。重新启动节点（例如，DAG根节点）可以向路由拓扑的节点发送重新启动通知消息，指示重新启动节点在后续重新启动过程中不可用。响应于接收和处理重新启动通知消息，路由拓扑的节点可能会在重新启动过程中进入禁止（防止）路由拓扑中的路由收敛的DAG冻结状态，以防止对网络稳定性的不利影响，例如崩溃的DAG。此后，在完成重新启动过程之后，重新启动节点可以向指示节点退出DAG冻结状态的路由拓扑的节点发送清除消息。

6. 发明授权

US08630177B2 Dynamic directed acyclic graph (DAG) root bypass for computer networks 有权
标题翻译：用于计算机网络的动态有向无环图（DAG）根旁路
公开(公告)号：US08630177B2
公开(公告)日：2014-01-14
申请号：US13405828
申请日：2012-02-27
申请人： Jean-Philippe Vasseur , Jonathan W. Hui , Atul B. Mahamuni
发明人： Jean-Philippe Vasseur , Jonathan W. Hui , Atul B. Mahamuni
IPC分类号： G01R31/08
CPC分类号： H04L45/34 , H04L43/0876 , H04L45/12 , H04L45/14 , H04L45/16 , H04L45/22 , H04L45/38 , H04L45/48
摘要： In one embodiment, traffic flows through a root node of a primary directed acyclic graph (DAG) in a computer network are monitored to detect whether a particular traffic flow is above a path cost threshold. If so, then a corresponding source device may be instructed to cease using the primary DAG for the particular traffic flow, and specific action may be taken based on whether the particular traffic flow is point-to-point (P2P) or point-to-multipoint (P2MP). In particular, in response to the particular traffic flow being P2P, a source route may be computed and sent to the source device to cause the source device to use the source route for the particular traffic flow, while in response to the particular traffic flow being P2MP, the source device may be instructed to create a secondary DAG for the particular traffic flow with the source device as the secondary DAG root.
摘要翻译：在一个实施例中，监视计算机网络中通过主要有向非循环图（DAG）的根节点的流量，以检测特定业务流是否高于路径开销阈值。如果是，则可以指示对应的源设备停止对特定业务流使用主DAG，并且可以基于特定业务流是点对点（P2P）还是点对点（peer-to- 多点（P2MP）。特别地，响应于特定业务流为P2P，可以计算源路由并将其发送到源设备，以使源设备使用用于特定业务流的源路由，同时响应于特定业务流 P2MP，可以指示源设备为源设备作为辅助DAG根创建用于特定业务流的辅助DAG。

7. 发明申请

US20130223218A1 DYNAMIC DIRECTED ACYCLIC GRAPH (DAG) ROOT BYPASS FOR COMPUTER NETWORKS 有权
标题翻译：用于计算机网络的动态方向定向图（DAG）根旁路
公开(公告)号：US20130223218A1
公开(公告)日：2013-08-29
申请号：US13405828
申请日：2012-02-27
申请人： Jean-Philippe Vasseur , Jonathan W. Hui , Atul B. Mahamuni
发明人： Jean-Philippe Vasseur , Jonathan W. Hui , Atul B. Mahamuni
IPC分类号： H04L12/24
CPC分类号： H04L45/34 , H04L43/0876 , H04L45/12 , H04L45/14 , H04L45/16 , H04L45/22 , H04L45/38 , H04L45/48
摘要： In one embodiment, traffic flows through a root node of a primary directed acyclic graph (DAG) in a computer network are monitored to detect whether a particular traffic flow is above a path cost threshold. If so, then a corresponding source device may be instructed to cease using the primary DAG for the particular traffic flow, and specific action may be taken based on whether the particular traffic flow is point-to-point (P2P) or point-to-multipoint (P2MP). In particular, in response to the particular traffic flow being P2P, a source route may be computed and sent to the source device to cause the source device to use the source route for the particular traffic flow, while in response to the particular traffic flow being P2MP, the source device may be instructed to create a secondary DAG for the particular traffic flow with the source device as the secondary DAG root.
摘要翻译：在一个实施例中，监视计算机网络中通过主要有向非循环图（DAG）的根节点的流量，以检测特定业务流是否高于路径开销阈值。如果是，则可以指示对应的源设备停止对特定业务流使用主DAG，并且可以基于特定业务流是点对点（P2P）还是点对点（peer-to- 多点（P2MP）。特别地，响应于特定业务流为P2P，可以计算源路由并将其发送到源设备，以使源设备使用用于特定业务流的源路由，同时响应于特定业务流 P2MP，可以指示源设备为源设备作为辅助DAG根创建用于特定业务流的辅助DAG。

8. 发明授权

US09319962B2 Local path repair in a wireless deterministic network 有权
标题翻译：无线确定性网络中的本地路径修复
公开(公告)号：US09319962B2
公开(公告)日：2016-04-19
申请号：US14043974
申请日：2013-10-02
申请人： Patrick Wetterwald , Jean-Philippe Vasseur , Pascal Thubert
发明人： Patrick Wetterwald , Jean-Philippe Vasseur , Pascal Thubert
IPC分类号： H04W40/04 , H04W72/04 , H04W40/34 , H04W40/38 , H04L12/721 , H04L12/707 , H04L12/703
CPC分类号： H04W40/04 , H04L45/12 , H04L45/22 , H04L45/28 , H04W40/34 , H04W40/38 , H04W72/0446 , Y02D70/144 , Y02D70/32
摘要： In one embodiment, an initial path is established in a wireless deterministic network between a source and a destination through one or more intermediate nodes, which are typically informed of a required metric between the source and the destination for communicating a packet. The initial path is locally (e.g., without contacting a path computation engine) reconfigured to bypass at least one of the intermediate nodes creating a new path, with the new path meeting the requirement(s) of the metric. Note, “locally reconfiguring” refers to the network nodes themselves determining a replacement path without reliance on a path computation engine or other entity (e.g., network management system, operating support system) in determining the replacement path. In one embodiment, a network node not on the initial path replaces a node on the initial path while using the same receive and send timeslots used in the initial path.
摘要翻译：在一个实施例中，通过一个或多个中间节点在源和目的地之间的无线确定性网络中建立初始路径，所述中间节点通常被通知源和目的地之间用于传送分组的所需度量。初始路径在本地（例如，不接触路径计算引擎）被重新配置为绕过创建新路径的至少一个中间节点，新路径满足度量的要求。注意，“本地重新配置”是指网络节点本身在不依赖路径计算引擎或其他实体（例如，网络管理系统，操作支持系统））确定替换路径时确定替换路径。在一个实施例中，不在初始路径上的网络节点替换初始路径上的节点，同时使用在初始路径中使用的相同的接收和发送时隙。

9. 发明授权

US09306831B2 Technique for efficient load balancing of TE-LSPs 有权
标题翻译： TE-LSP高效负载均衡技术
公开(公告)号：US09306831B2
公开(公告)日：2016-04-05
申请号：US11057641
申请日：2005-02-14
申请人： Jean-Philippe Vasseur
发明人： Jean-Philippe Vasseur
IPC分类号： H04L12/26 , G06F15/173 , H04L12/701 , H04L12/707 , H04L12/723
CPC分类号： H04L45/00 , H04L45/24 , H04L45/502
摘要： A technique efficiently load balances traffic engineering (TE) label switched paths (LSPs) from a head-end node to a tail-end node of a computer network. The novel load balancing technique identifies (e.g., at the head-end node or a path computation element, PCE) a set of paths with equal costs from the head-end node to the tail-end node, where each path of the set is composed of one or more associated links. “Link values” such as, e.g., the number of unconstrained TE-LSPs on the link, the amount of available bandwidth on the link, or the percent of total available bandwidth already in use on the link, are applied to each link of each path. The most restrictive link values (link availability) of each path of the set, such as, e.g., the link with the lowest amount of available bandwidth, etc., are then compared. Upon comparing the link availability, the novel technique load balances established and/or new TE-LSPs from the head-end node to the tail-end node over the set of paths accordingly.
摘要翻译：技术有效地将流量工程（TE）标签交换路径（LSP）从头端节点负载平衡到计算机网络的尾端节点。新颖的负载平衡技术在头端节点到尾端节点识别（例如，在头端节点或路径计算元件PCE）具有相同成本的路径集合，其中集合的每个路径为由一个或多个相关联的链接组成。 “链路值”例如链路上的无约束TE-LSP的数量，链路上的可用带宽的数量或链路上已经使用的总可用带宽的百分比被应用于每个链路的每个链路路径。然后比较集合的每个路径的最严格的链路值（链路可用性），例如具有最低可用带宽量的链路等。在比较链路可用性时，新技术相应地通过该组路径从前端节点到尾端节点建立和/或新的TE-LSP平衡。

10. 发明授权

US09300569B2 Compressing data packet routing information using bloom filters 有权
标题翻译：使用布隆过滤器压缩数据包路由信息
公开(公告)号：US09300569B2
公开(公告)日：2016-03-29
申请号：US13563077
申请日：2012-07-31
申请人： Jonathan W. Hui , Jean-Philippe Vasseur , Wei Hong
发明人： Jonathan W. Hui , Jean-Philippe Vasseur , Wei Hong
IPC分类号： H04L12/54 , H04L12/721 , H04L12/751 , G06F17/30 , H04L12/743
CPC分类号： H04L45/14 , G06F17/30162 , H04L45/02 , H04L45/12 , H04L45/7453 , H04L47/70
摘要： In one embodiment, a Transit Information Bloom Filter (TIBF) signal component is generated for use with a routing protocol control message, the TIBF signal component identifying at least one parent node for a corresponding routing topology. The TIBF signal component is encoded in a generated Bloom filter. The parameters of the generated Bloom filter are based at least on one parent node to be encoded and a desired false positive rate for the Bloom filter. The address for each parent node is also encoded in the Bloom filter.
摘要翻译：在一个实施例中，生成与路由协议控制消息一起使用的传输信息布隆过滤器（TIBF）信号分量，所述TIBF信号组件标识用于相应路由拓扑的至少一个父节点。 TIBF信号分量在生成的Bloom过滤器中进行编码。生成的Bloom过滤器的参数至少基于要编码的一个父节点和Bloom过滤器的所需假阳性率。每个父节点的地址也在Bloom过滤器中进行编码。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式