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

81. 发明授权

US08593986B2 Lightweight storing mode for constrained computer networks 有权
标题翻译：用于受限计算机网络的轻量级存储模式
公开(公告)号：US08593986B2
公开(公告)日：2013-11-26
申请号：US13150956
申请日：2011-06-01
申请人： Jean-Philippe Vasseur , Jonathan W. Hui
发明人： Jean-Philippe Vasseur , Jonathan W. Hui
IPC分类号： H04J1/16
CPC分类号： H04L45/34 , H04L45/74
摘要： In one embodiment, a management device, such as a root node, monitors Internet Protocol (IP) overhead (e.g., IP header sizes during source-routing or route table sizes) within a directed acyclic graph (DAG) in a computer network. If it is determined that the IP overhead is above a configured threshold, then in response, a trigger is initiated to have devices within the DAG label-switch downward traffic directed away from the root node within the DAG. In another embodiment, a device communicating within a DAG stores IP routes corresponding to upward traffic from the device directed toward a root of the DAG, and IP-routes upward traffic based on the IP routes. Conversely, the device also stores labels corresponding to downward traffic from the device directed away from the root of the DAG, and label-switches downward traffic based on the labels, accordingly.
摘要翻译：在一个实施例中，诸如根节点的管理设备在计算机网络中的有向无环图（DAG）内监视互联网协议（IP）开销（例如，源路由或路由表大小期间的IP报头大小）。如果确定IP开销高于配置的阈值，则作为响应，启动触发以使DAG标签中的设备向下转发指向远离DAG内的根节点。在另一个实施例中，在DAG内通信的设备存储对应于来自指向DAG的根的设备的向上业务的IP路由，并且基于IP路由IP路由上行业务。相反，该设备还存储对应于来自远离DAG的根的设备的向下流量的标签，并且相应地基于标签对下行流量进行标签交换。

82. 发明授权

US08553688B2 Dynamic allocation of context identifiers for header compression 有权
标题翻译：标头压缩的上下文标识符的动态分配
公开(公告)号：US08553688B2
公开(公告)日：2013-10-08
申请号：US13192750
申请日：2011-07-28
申请人： Jean-Philippe Vasseur , Jonathan W. Hui
发明人： Jean-Philippe Vasseur , Jonathan W. Hui
IPC分类号： H04L12/28 , H04J1/16
CPC分类号： H04L61/6072 , H04L45/04 , H04L45/38 , H04L45/54 , H04L45/70 , H04L45/745 , H04L61/106 , H04L61/6059
摘要： In one embodiment, routable traffic through one or more border routers between a local computer network and a global computer network is monitored in order to characterize use of one or more global prefixes of the traffic. A particular set of the global prefixes, up to a maximum number, that are most frequently used may be mapped into a set of context identifiers (IDs) having a shorter bit-length than the global prefixes. The context IDs may then be distributed into the local computer network, and the one or more border routers convert between the context IDs and the global prefixes, accordingly.
摘要翻译：在一个实施例中，监视本地计算机网络和全局计算机网络之间的一个或多个边界路由器的可路由业务，以便表征业务的一个或多个全局前缀的使用。可以将最常使用的最大数量的全局前缀的特定集合映射到具有比全局前缀更短的位长的上下文标识符（ID）集合中。然后，上下文ID可以被分发到本地计算机网络中，并且一个或多个边界路由器相应地在上下文ID和全局前缀之间转换。

83. 发明授权

US08531976B2 Locating tunnel failure based on next-next hop connectivity in a computer network 有权
标题翻译：基于计算机网络中的下一跳连接定位隧道故障
公开(公告)号：US08531976B2
公开(公告)日：2013-09-10
申请号：US12044620
申请日：2008-03-07
申请人： Jean-Philippe Vasseur , Danny Prairie
发明人： Jean-Philippe Vasseur , Danny Prairie
IPC分类号： H04J1/16
CPC分类号： H04L41/0677 , H04L43/0811
摘要： In one embodiment, a trigger is signaled to protect a tunnel from a head-end node to one or more tail-end nodes in a computer network via one or more intermediate nodes along the tunnel. One or more receiving nodes along the tunnel receive the trigger, and in response, establish a tunnel connectivity verification session from the receiving node to a corresponding downstream next-next-hop (NNHOP) node along the tunnel. Illustratively, the head-end node may thus recompute a new tunnel path excluding a path segment corresponding to a particular failed tunnel connectivity verification session.
摘要翻译：在一个实施例中，通过沿着隧道的一个或多个中间节点，用信号通知触发器以保护隧道从计算机网络中的头端节点到一个或多个尾端节点。沿着隧道的一个或多个接收节点接收触发，并且作为响应，建立从接收节点到沿着隧道的对应的下游下一跳（NNHOP）节点的隧道连接性验证会话。说明性地，头端节点因此可以重新计算除了对应于特定故障隧道连通性验证会话的路径段的新隧道路径。

84. 发明申请

US20130232193A1 Control-Plane Interface Between Layers in a Multilayer Network 审中-公开
标题翻译：多层网络层之间的控制平面接口
公开(公告)号：US20130232193A1
公开(公告)日：2013-09-05
申请号：US13783368
申请日：2013-03-03
申请人： Zafar Ali , Clarence Filsfils , Ornan Alexander Gerstel , Jean-Philippe Vasseur , Walid Wakim , Matthew Hartley , George Leonard Swallow
发明人： Zafar Ali , Clarence Filsfils , Ornan Alexander Gerstel , Jean-Philippe Vasseur , Walid Wakim , Matthew Hartley , George Leonard Swallow
IPC分类号： H04L29/06
CPC分类号： H04L29/06047 , H04L67/42
摘要： In one embodiment, information is exchanged between independent control planes of different layers in a multilayer network, such as, but not limited to, between a packet switching client-layer network and an optical server-layer network. This exchanged information includes signaling regarding a server-layer communications service, having server-layer characteristics, within the server-layer network for use in communicatively coupling at least two devices of the client-layer network. In one embodiment, the client-layer network specifies at least one of these server-layer characteristics that the server-layer communications service provided by the server-layer network must have. In one embodiment, the server-layer network signal to the client-layer network at least one of these server-layer characteristics of the existing server-layer communications service. In one embodiment, this signaling between the client-layer network and the server-layer network includes sending extended Resource Reservation Protocol (RSVP) messages.
摘要翻译：在一个实施例中，信息在多层网络中的不同层的独立控制平面之间交换，诸如但不限于分组交换客户端层网络和光服务器层网络之间。这种交换的信息包括关于在服务器层网络内具有服务器层特性的服务器层通信服务的信令，用于通信地耦合客户端层网络的至少两个设备。在一个实施例中，客户端层网络指定由服务器层网络提供的服务器层通信服务必须具有的这些服务器层特性中的至少一个。在一个实施例中，服务器层网络向客户端层网络发送现有服务器层通信服务的这些服务器层特性中的至少一个的信号。在一个实施例中，客户端层网络和服务器层网络之间的这种信令包括发送扩展资源预留协议（RSVP）消息。

85. 发明申请

US20130227055A1 MANAGING FATE-SHARING IN SHARED-MEDIA COMMUNICATION NETWORKS 有权
标题翻译：在共享媒体通信网络中管理FATE共享
公开(公告)号：US20130227055A1
公开(公告)日：2013-08-29
申请号：US13403103
申请日：2012-02-23
申请人： Jean-Philippe Vasseur , Jonathan W. Hui
发明人： Jean-Philippe Vasseur , Jonathan W. Hui
IPC分类号： G06F15/16
CPC分类号： H04L43/04 , G06F11/2002 , H04L41/145 , H04L45/14 , H04L45/22 , H04L45/28 , H04W40/34
摘要： In one embodiment, a management device receives one or more fate-sharing reports locally generated by one or more corresponding reporting nodes in a shared-media communication network, the fate-sharing reports indicating a degree of localized fate-sharing between one or more pairs of nodes local to the corresponding reporting nodes. The management device may then determine, globally from aggregating the fate-sharing reports, one or more fate-sharing groups indicating sets of nodes having a global degree of fate-sharing within the communication network. As such, the management device may then advertise the fate-sharing groups within the communication network, wherein nodes of the communication network are configured to select a plurality of next-hops that minimizes fate-sharing between the plurality of next-hops.
摘要翻译：在一个实施例中，管理设备接收在共享 - 媒体通信网络中由一个或多个对应的报告节点本地生成的一个或多个命运共享报告，命运共享报告指示一个或多个对之间的局部化命运共享程度的节点本地到相应的报告节点。然后，管理设备可以全局地从聚合命运共享报告中确定一个或多个命运共享组，指示在通信网络内具有全局命中共享度的节点集合。这样，管理装置然后可以通告通信网络内的命运共享组，其中通信网络的节点被配置为选择使多个下一跳之间的命运共享最小化的多个下一跳。

86. 发明申请

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跳邻居，源（或转接）设备。

87. 发明申请

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.
摘要翻译：在一个实施例中，路由节点确定共享 - 媒体通信网络中的节点对之间的风险共享度量，然后可以计算使路由之间的风险共享度量最小化的多个路由，以相应地根据计算出的多条路线。另外，在另一个实施例中，共享 - 媒体通信网络中的特定节点可以确定其与共享媒体通信网络中的一个或多个其他节点之间的风险共享度量。因此，特定节点可以相应地与共享媒体通信网络中的一个或多个路由节点共享一个或多个确定的风险共享度量。

88. 发明申请

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

89. 发明申请

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.
摘要翻译：在一个实施例中，通信网络中的本地节点确定其相邻节点的集合，并且基于本地节点与特定节点之间的距离的变化率来确定每个特定邻居节点将被探测的相应出现频率邻居节点。本地节点然后可以根据相应出现频率来探测每个特定的邻居节点，以确定本地节点和每个特定的相邻节点之间的距离变化速率，以及用于到达每个特定邻居节点的一个或多个路由度量。因此，本地节点可以基于探测来选择相应路由拓扑的相邻节点集合中的合适的优选下一跳节点。

90. 发明申请

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.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式