会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • Technique for dynamically restoring original TE-LSP attributes for interdomain TE-LSPs
    • 用于动态恢复域间TE-LSP的原始TE-LSP属性的技术
    • US20070208871A1
    • 2007-09-06
    • US11368160
    • 2006-03-03
    • Jean-Philippe VasseurCarol IturraldeGeorge Swallow
    • Jean-Philippe VasseurCarol IturraldeGeorge Swallow
    • G06F15/16
    • H04L45/50H04L45/04
    • A technique dynamically restores original attributes of a Traffic Engineering La-bel Switched Path (TE-LSP) that are provided in a source domain for a destination domain when traversing one or more intermediate domains that may translate the TE-LSP attributes in a computer network. According to the novel technique, a head-end node requests an interdomain TE-LSP having one or more original TE-LSP attributes (e.g., priority, bandwidth, etc.) using a signaling exchange. The head-end node may also request restoration of the original TE-LSP attributes upon entrance into the destination domain. Intermediate domains (e.g., border routers of the domains) receiving the request may translate the original TE-LSP attributes into corresponding intermediate domain TE-LSP attributes. When the request reaches the destination domain, the intermediate domain TE-LSP attributes of the requested TE-LSP are restored into the original TE-LSP attributes.
    • 一种技术动态地恢复在遍历可能转换计算机网络中的TE-LSP属性的一个或多个中间域时为目的地域提供的源域中提供的流量工程La-bel交换路径(TE-LSP)的原始属性 。 根据该新技术,前端节点使用信令交换请求具有一个或多个原始TE-LSP属性(例如,优先级,带宽等)的域间TE-LSP。 前端节点还可以在进入目的地域时请求恢复原始TE-LSP属性。 接收请求的中间域(例如,域的边界路由器)可以将原始TE-LSP属性转换为相应的中间域TE-LSP属性。 当请求到达目的域时,请求的TE-LSP的中间域TE-LSP属性恢复为原始TE-LSP属性。
    • 2. 发明申请
    • DYNAMICALLY AND EFFICIENTLY FORMING HIERARCHICAL TUNNELS
    • 动态和有效地形成分层隧道
    • US20120183000A1
    • 2012-07-19
    • US13433011
    • 2012-03-28
    • Jean-Philippe VasseurCarol Iturralde
    • Jean-Philippe VasseurCarol Iturralde
    • H04L12/56
    • H04L12/4633
    • In one embodiment, a hierarchical tunnel that encapsulates a plurality of child tunnels along a shared path segment is used. The shared path segment extends from a head-end node across one or more intermediate nodes to a tail-end node. A state of a child tunnel of the plurality of child tunnels encapsulated within the hierarchical tunnel is refreshed by the head-end node sending one or more refresh messages along the child tunnel that include a request that the one or more intermediate nodes remove the state of the child tunnel without sending error messages, and sending one or more encapsulated refresh messages within the hierarchical tunnel that cause the tail-end node to continue propagation of refresh messages along the child tunnel.
    • 在一个实施例中,使用沿共享路径段封装多个子隧道的分层隧道。 共享路径段从头端节点跨越一个或多个中间节点延伸到尾端节点。 封装在分级隧道内的多个子隧道的子隧道的状态由头端节点刷新,该端隧道沿着子隧道发送一个或多个刷新消息,该消息包括一个或多个中间节点去除 子隧道,而不发送错误消息,并且在分层隧道内发送一个或多个封装的刷新消息,使得尾端节点继续沿着子隧道传播刷新消息。
    • 3. 发明授权
    • Technique for dynamically restoring original TE-LSP attributes for interdomain TE-LSPs
    • 用于动态恢复域间TE-LSP的原始TE-LSP属性的技术
    • US08966113B2
    • 2015-02-24
    • US11368160
    • 2006-03-03
    • Jean-Philippe VasseurCarol IturraldeGeorge Swallow
    • Jean-Philippe VasseurCarol IturraldeGeorge Swallow
    • G06F15/173H04L12/723H04L12/715G06F15/16
    • H04L45/50H04L45/04
    • A technique dynamically restores original attributes of a Traffic Engineering Label Switched Path (TE-LSP) that are provided in a source domain for a destination domain when traversing one or more intermediate domains that may translate the TE-LSP attributes in a computer network. According to the novel technique, a head-end node requests an interdomain TE-LSP having one or more original TE-LSP attributes (e.g., priority, bandwidth, etc.) using a signaling exchange. The head-end node may also request restoration of the original TE-LSP attributes upon entrance into the destination domain. Intermediate domains (e.g., border routers of the domains) receiving the request may translate the original TE-LSP attributes into corresponding intermediate domain TE-LSP attributes. When the request reaches the destination domain, the intermediate domain TE-LSP attributes of the requested TE-LSP are restored into the original TE-LSP attributes.
    • 当遍历可能转换计算机网络中的TE-LSP属性的一个或多个中间域时,技术动态地恢复在目的地域的源域中提供的流量工程标签交换路径(TE LSP)的原始属性。 根据该新技术,前端节点使用信令交换请求具有一个或多个原始TE-LSP属性(例如,优先级,带宽等)的域间TE-LSP。 前端节点还可以在进入目的地域时请求恢复原始TE-LSP属性。 接收请求的中间域(例如,域的边界路由器)可以将原始TE-LSP属性转换为相应的中间域TE-LSP属性。 当请求到达目的域时,请求的TE-LSP的中间域TE-LSP属性恢复为原始TE-LSP属性。
    • 4. 发明授权
    • Dynamically and efficiently forming hierarchical tunnels
    • 动态有效地形成等级隧道
    • US08363571B2
    • 2013-01-29
    • US13433011
    • 2012-03-28
    • Jean-Philippe VasseurCarol Iturralde
    • Jean-Philippe VasseurCarol Iturralde
    • H04L12/28H04L12/26H04L12/56G08C15/00H04J3/14G06F15/16
    • H04L12/4633
    • In one embodiment, a hierarchical tunnel that encapsulates a plurality of child tunnels along a shared path segment is used. The shared path segment extends from a head-end node across one or more intermediate nodes to a tail-end node. A state of a child tunnel of the plurality of child tunnels encapsulated within the hierarchical tunnel is refreshed by the head-end node sending one or more refresh messages along the child tunnel that include a request that the one or more intermediate nodes remove the state of the child tunnel without sending error messages, and sending one or more encapsulated refresh messages within the hierarchical tunnel that cause the tail-end node to continue propagation of refresh messages along the child tunnel.
    • 在一个实施例中,使用沿共享路径段封装多个子隧道的分层隧道。 共享路径段从前端节点跨越一个或多个中间节点延伸到尾端节点。 封装在分级隧道内的多个子隧道的子隧道的状态由头端节点刷新,该端隧道沿着子隧道发送一个或多个刷新消息,该消息包括一个或多个中间节点去除 子隧道,而不发送错误消息,并且在分层隧道内发送一个或多个封装的刷新消息,使得尾端节点继续沿着子隧道传播刷新消息。
    • 5. 发明授权
    • Dynamically and efficiently forming hierarchical tunnels
    • 动态有效地形成等级隧道
    • US08199642B2
    • 2012-06-12
    • US11589600
    • 2006-10-30
    • Jean-Philippe VasseurCarol Iturralde
    • Jean-Philippe VasseurCarol Iturralde
    • G08C15/00H04L12/28H04L12/56G06F15/173
    • H04L12/4633
    • In one embodiment, a node (e.g., a grooming node) determines a set of attribute groups (AGs) of existing child tunnels through the network, where an AG is a group of one or more compatible attributes among child tunnels, e.g., excluding bandwidth. The grooming node also determines a set of corresponding child tunnels that belong to a particular AG and that follow a shared path segment through the network, and may establish an hierarchical tunnel that encapsulates the set of corresponding child tunnels along the shared path segment. In another embodiment, a node requests that the one or more intermediate nodes of the hierarchical tunnel each remove the state of a child tunnel without sending any error messages, and sends refresh messages encapsulated within the hierarchical tunnel in a manner that allows a tail-end node to continue any necessary propagation of refresh messages along the child tunnel.
    • 在一个实施例中,节点(例如,修饰节点)通过网络确定现有子隧道的一组属性组(AG),其中AG是子隧道中的一个或多个兼容属性的组,例如排除带宽 。 梳理节点还确定属于特定AG并且通过网络遵循共享路径段的一组对应子隧道,并且可以建立沿共享路径段封装相应子隧道集合的分层隧道。 在另一个实施例中,节点请求分层隧道的一个或多个中间节点每个消除子隧道的状态,而不发送任何错误消息,并且以允许后端的方式发送封装在分级隧道内的刷新消息 节点继续沿着子隧道进行刷新消息的任何必要的传播。
    • 6. 发明申请
    • Dynamically and efficiently forming hierarchical tunnels
    • 动态有效地形成等级隧道
    • US20080069007A1
    • 2008-03-20
    • US11589600
    • 2006-10-30
    • Jean-Philippe VasseurCarol Iturralde
    • Jean-Philippe VasseurCarol Iturralde
    • H04L12/28H04L12/56
    • H04L12/4633
    • In one embodiment, a node (e.g., a grooming node) determines a set of attribute groups (AGs) of existing child tunnels through the network, where an AG is a group of one or more compatible attributes among child tunnels, e.g., excluding bandwidth. The grooming node also determines a set of corresponding child tunnels that belong to a particular AG and that follow a shared path segment through the network, and may establish an hierarchical tunnel that encapsulates the set of corresponding child tunnels along the shared path segment. In another embodiment, a node requests that the one or more intermediate nodes of the hierarchical tunnel each remove the state of a child tunnel without sending any error messages, and sends refresh messages encapsulated within the hierarchical tunnel in a manner that allows a tail-end node to continue any necessary propagation of refresh messages along the child tunnel.
    • 在一个实施例中,节点(例如,修饰节点)通过网络确定现有子隧道的一组属性组(AG),其中AG是子隧道中的一个或多个兼容属性的组,例如排除带宽 。 梳理节点还确定属于特定AG并且通过网络遵循共享路径段的一组对应子隧道,并且可以建立沿着共享路径段封装相应子隧道集合的分层隧道。 在另一个实施例中,节点请求分层隧道的一个或多个中间节点每个消除子隧道的状态,而不发送任何错误消息,并且以允许后端的方式发送封装在分级隧道内的刷新消息 节点继续沿着子隧道进行刷新消息的任何必要的传播。
    • 7. 发明授权
    • Local path repair in a wireless deterministic network
    • 无线确定性网络中的本地路径修复
    • US09319962B2
    • 2016-04-19
    • US14043974
    • 2013-10-02
    • Patrick WetterwaldJean-Philippe VasseurPascal Thubert
    • Patrick WetterwaldJean-Philippe VasseurPascal Thubert
    • H04W40/04H04W72/04H04W40/34H04W40/38H04L12/721H04L12/707H04L12/703
    • H04W40/04H04L45/12H04L45/22H04L45/28H04W40/34H04W40/38H04W72/0446Y02D70/144Y02D70/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.
    • 在一个实施例中,通过一个或多个中间节点在源和目的地之间的无线确定性网络中建立初始路径,所述中间节点通常被通知源和目的地之间用于传送分组的所需度量。 初始路径在本地(例如,不接触路径计算引擎)被重新配置为绕过创建新路径的至少一个中间节点,新路径满足度量的要求。 注意,“本地重新配置”是指网络节点本身在不依赖路径计算引擎或其他实体(例如,网络管理系统,操作支持系统))确定替换路径时确定替换路径。 在一个实施例中,不在初始路径上的网络节点替换初始路径上的节点,同时使用在初始路径中使用的相同的接收和发送时隙。
    • 8. 发明授权
    • Technique for efficient load balancing of TE-LSPs
    • TE-LSP高效负载均衡技术
    • US09306831B2
    • 2016-04-05
    • US11057641
    • 2005-02-14
    • Jean-Philippe Vasseur
    • Jean-Philippe Vasseur
    • H04L12/26G06F15/173H04L12/701H04L12/707H04L12/723
    • H04L45/00H04L45/24H04L45/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. 发明授权
    • Dynamic multicast mode selection in a communication network
    • 通信网络中的动态组播模式选择
    • US09288066B2
    • 2016-03-15
    • US13293871
    • 2011-11-10
    • Jonathan W. HuiJean-Philippe Vasseur
    • Jonathan W. HuiJean-Philippe Vasseur
    • H04L12/28H04L12/18H04L12/751H04L12/721H04L12/761H04J1/16
    • H04L12/18H04L45/02H04L45/14H04L45/16
    • In one embodiment, a network device selectively operates according to a sparse multicast mode where the network device stores individual devices interested in one or more multicast groups and distributes corresponding multicast group traffic based on the individual devices. Alternatively, the network device selectively operates according to a dense multicast mode where the network device maintains a list of the one or more multicast groups in which at least one device is interested and distributes corresponding multicast group traffic through broadcasting. By determining one or more resource-related characteristics, the network device may then select between operation in the sparse multicast mode and the dense multicast mode based on the resource-related characteristics.
    • 在一个实施例中,网络设备根据稀疏多播模式选择性地操作,其中网络设备存储对一个或多个多播组感兴趣的各个设备,并且基于各个设备分发相应的多播组业务。 或者,网络设备根据密集组播模式选择性地操作,其中网络设备维护其中至少一个设备感兴趣的一个或多个多播组的列表,并且通过广播来分发对应的多播组业务。 通过确定一个或多个资源相关特征,网络设备然后可以基于资源相关特性在稀疏组播模式和密集组播模式之间进行选择。