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

51. 发明申请

US20060209716A1 Dynamic retrieval of routing information for inter-AS TE-LSPs 有权
公开(公告)号：US20060209716A1
公开(公告)日：2006-09-21
申请号：US11081097
申请日：2005-03-15
申请人： Stefano Previdi , Jean-Philippe Vasseur
发明人： Stefano Previdi , Jean-Philippe Vasseur
IPC分类号： H04L12/28 , H04L12/56
CPC分类号： H04L47/825 , H04L45/02 , H04L45/04 , H04L45/50 , H04L47/15 , H04L47/70 , H04L47/724 , H04L47/785
摘要： A technique dynamically triggers an exchange of reachability information between a tail-end (remote) domain target node (e.g., a tail-end node) of a traffic engineering (TE) label switched path (LSP) and a local domain head-end node of the TE-LSP in a computer network. The inter-domain information retrieval technique is illustratively based on triggering a Border Gateway Protocol (BGP) session whereby at least a portion of the reachability, i.e., routing, information of the tail-end node is transmitted to the head-end node of the TE-LSP in accordance with BGP. Specifically, once a TE-LSP is established between the head-end node and the tail-end node, the head-end node triggers the tail-end node, e.g., through extensions to a request/response signaling exchange, to establish the BGP session. Establishment of the BGP session enables transmission of the routing information from the tail-end node to the head-end node. The head-end node uses the routing information to calculate routes, i.e., address prefixes and associated attributes, reachable from the tail-end node for insertion into its routing table.

52. 发明申请

US20060200579A1 Computation of a shortest inter-domain TE-LSP across a set of autonomous systems 有权
标题翻译：跨一组自治系统的最短域间TE-LSP的计算
公开(公告)号：US20060200579A1
公开(公告)日：2006-09-07
申请号：US11073348
申请日：2005-03-04
申请人： Jean-Philippe Vasseur , Stefano Previdi
发明人： Jean-Philippe Vasseur , Stefano Previdi
IPC分类号： G06F15/173
CPC分类号： H04L45/12 , H04L45/04 , H04L45/42 , H04L45/50
摘要： A technique calculates a shortest path for a traffic engineering (TE) label switched path (LSP) from a head-end node in a local domain to a tail-end node of a remote domain in a computer network. The novel path calculation technique determines a set of different remote domains through which the TE-LSP may traverse to reach the tail-end node (e.g., along “domain routes”). Once the set of possible routes is determined, the head-end node sends a path computation request to one or more path computation elements (PCEs) of its local domain requesting a computed path for each domain route. Upon receiving path responses for each possible domain route, the head-end node selects the optimal (shortest) path, and establishes the TE-LSP accordingly.
摘要翻译：一种技术计算从本地域中的头端节点到计算机网络中远程域的尾端节点的流量工程（TE）标签交换路径（LSP）的最短路径。新颖的路径计算技术确定了一组不同的远程域，TE-LSP可以通过该组来遍历尾端节点（例如沿着“域路由”）。一旦确定了可能的路由集合，则前端节点向其本地域的一个或多个路径计算元件（PCE）发送路径计算请求，请求每个域路由的计算路径。在接收每个可能的域路由的路径响应时，前端节点选择最优（最短）路径，并相应建立TE-LSP。

53. 发明申请

US20060120288A1 Inter-domain TE-LSP selection 有权
标题翻译：域间TE-LSP选择
公开(公告)号：US20060120288A1
公开(公告)日：2006-06-08
申请号：US11001784
申请日：2004-12-02
申请人： Jean-Philippe Vasseur , Stefano Previdi
发明人： Jean-Philippe Vasseur , Stefano Previdi
IPC分类号： H04J1/16 , H04L12/56
CPC分类号： H04L47/10 , H04L45/04 , H04L45/24 , H04L45/50 , H04L47/125
摘要： A technique selects a traffic engineering (TE) label switched path (LSP) from among a plurality of TE-LSPs, each of which spans multiple domains of a computer network from a head-end node of a local domain to a tail-end node of a remote domain, in order to reach one or more address prefixes within the remote domain. The inter-domain TE-LSP selection technique comprises a selection algorithm executed by the head-end node and based on predetermined TE-LSP attributes (e.g., bandwidth, cost, etc.) and/or address prefix reachability attributes (e.g., cost from a tail-end node to the prefix) to select an appropriate inter-domain TE-LSP for the reachable address prefix. The selection algorithm is embodied in one of two modes: (i) a hierarchical selection mode, or (ii) a weighted selection mode. In addition, the technique comprises a load balancing aspect that cooperates with the selection algorithm to enable the head-end node to balance traffic loads among the multiple TE-LSPs based on the results of the selection algorithm.
摘要翻译：一种技术从多个TE-LSP中选择流量工程（TE）标签交换路径（LSP），每个TE-LSP跨越从本地域的头端节点到终端节点的计算机网络的多个域的远程域，以便达到远程域内的一个或多个地址前缀。域间TE-LSP选择技术包括由前端节点执行并基于预定的TE-LSP属性（例如，带宽，成本等）和/或地址前缀可达性属性（例如，来自到前缀的尾端节点）为可达地址前缀选择适当的域间TE-LSP。选择算法以两种模式之一体现：（i）分层选择模式，或（ii）加权选择模式。此外，该技术包括与选择算法配合的负载平衡方面，以使头端节点能够基于选择算法的结果来平衡多个TE-LSP之间的业务负载。

54. 发明申请

US20060117110A1 Propagation of routing information in RSVP-TE for inter-domain TE-LSPs 有权
公开(公告)号：US20060117110A1
公开(公告)日：2006-06-01
申请号：US11001349
申请日：2004-12-01
申请人： Jean-Philippe Vasseur , Stefano Previdi
发明人： Jean-Philippe Vasseur , Stefano Previdi
IPC分类号： G06F15/16
CPC分类号： H04L45/507 , H04L45/00 , H04L45/04 , H04L45/50
摘要： A technique dynamically retrieves reachability information from a target node, including a tail-end or any intermediate node, along a traffic engineering (TE) label switched path (LSP) that spans multiple domains in a computer network. The interdomain information retrieval technique is illustratively based on a request/response signaling exchange whereby at least a portion of the reachability, i.e., routing, information maintained by the target node is propagated to a head-end node of the TE-LSP. The routing information may comprise a list of address prefixes reachable by the target node, but may optionally include next-hop and metric attributes associated with those prefixes. The head-end node uses the retrieved routing information to calculate routes reachable from the target node for insertion into its routing table.

55. 发明授权

US07974285B2 Method and apparatus for identifying an egress point to a network location 有权
标题翻译：用于识别到网络位置的出口点的方法和装置
公开(公告)号：US07974285B2
公开(公告)日：2011-07-05
申请号：US11045015
申请日：2005-01-26
申请人： Stefano Benedetto Previdi , Clarence Filsfils , Jean-Philippe Vasseur , Benoit Claise , David Ward
发明人： Stefano Benedetto Previdi , Clarence Filsfils , Jean-Philippe Vasseur , Benoit Claise , David Ward
IPC分类号： H04L12/28 , H04L12/56 , G06F15/173
CPC分类号： H04L45/02
摘要： A method of identifying an egress point to a network location in a data communications network comprising a plurality of nodes and links there between comprises the step, performed at the identifying node, of receiving a notification through the network advertising an adjacency to a network location. The method further comprises the steps, performed at the identifying node, of deriving from the notification adjacency information and identifying, from the adjacency information, the egress point.
摘要翻译：一种识别包括在其中的多个节点和链路的数据通信网络中的网络位置的出口点的方法包括：在识别节点执行的步骤，通过网络接收通知与网络位置相邻的通知。所述方法还包括在所述识别节点处执行的从所述通知邻接信息导出并从所述邻接信息识别所述出口点的步骤。

56. 发明申请

US20060215577A1 System and methods for identifying network path performance 审中-公开
标题翻译：用于识别网络路径性能的系统和方法
公开(公告)号：US20060215577A1
公开(公告)日：2006-09-28
申请号：US11086007
申请日：2005-03-22
申请人： James Guichard , Jean-Philippe Vasseur , Thomas Nadeau , David Ward
发明人： James Guichard , Jean-Philippe Vasseur , Thomas Nadeau , David Ward
IPC分类号： H04L12/28
CPC分类号： H04L43/50 , H04L41/12 , H04L41/5003 , H04L45/00 , H04L45/121 , H04L45/123 , H04L45/124 , H04L45/22 , H04L45/26 , H04L45/302 , H04L45/42 , H04L45/50
摘要： A system and method for aggregating performance characteristics for core network paths allows computation of message traffic performance over each of the available candidate paths through the core for identifying an optimal core network path. Particular network traffic, or messages, include attributes indicative of performance, such as transport time, delay, jitter, and drop percentage, over individual hops along the candidate path. A diagnostic processor parses these messages to identify the attributes corresponding to performance, and analyzes the resulting parsed routing information to compute an expected performance, such as available bandwidth (e.g. transport rate) over the path. Messages including such attributes may include link state attribute (LSA) messages, diagnostic probe messages specifically targeted to enumerate such attributes, or other network suitable network traffic. In a particular configuration, the messages may be Path Verification Protocol (PVP) messages.
摘要翻译：用于聚合核心网络路径的性能特征的系统和方法允许通过核心的每个可用候选路径计算消息业务性能，用于识别最佳核心网路径。特定网络流量或消息包括指示性能的属性，例如沿着候选路径的单个跳跃的传输时间，延迟，抖动和丢弃百分比。诊断处理器解析这些消息以识别与性能相对应的属性，并分析所得到的解析路由信息以计算期望的性能，例如路径上的可用带宽（例如传输速率）。包括这些属性的消息可以包括链路状态属性（LSA）消息，专门用于枚举这样的属性的诊断探测消息，或其他网络合适的网络业务。在特定配置中，消息可以是路径验证协议（PVP）消息。

57. 发明授权

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.
摘要翻译：在一个实施例中，通过一个或多个中间节点在源和目的地之间的无线确定性网络中建立初始路径，所述中间节点通常被通知源和目的地之间用于传送分组的所需度量。初始路径在本地（例如，不接触路径计算引擎）被重新配置为绕过创建新路径的至少一个中间节点，新路径满足度量的要求。注意，“本地重新配置”是指网络节点本身在不依赖路径计算引擎或其他实体（例如，网络管理系统，操作支持系统））确定替换路径时确定替换路径。在一个实施例中，不在初始路径上的网络节点替换初始路径上的节点，同时使用在初始路径中使用的相同的接收和发送时隙。

58. 发明授权

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平衡。

59. 发明授权

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过滤器中进行编码。

60. 发明授权

US09288066B2 Dynamic multicast mode selection in a communication network 有权
标题翻译：通信网络中的动态组播模式选择
公开(公告)号：US09288066B2
公开(公告)日：2016-03-15
申请号：US13293871
申请日：2011-11-10
申请人： Jonathan W. Hui , Jean-Philippe Vasseur
发明人： Jonathan W. Hui , Jean-Philippe Vasseur
IPC分类号： H04L12/28 , H04L12/18 , H04L12/751 , H04L12/721 , H04L12/761 , H04J1/16
CPC分类号： H04L12/18 , H04L45/02 , H04L45/14 , H04L45/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.
摘要翻译：在一个实施例中，网络设备根据稀疏多播模式选择性地操作，其中网络设备存储对一个或多个多播组感兴趣的各个设备，并且基于各个设备分发相应的多播组业务。或者，网络设备根据密集组播模式选择性地操作，其中网络设备维护其中至少一个设备感兴趣的一个或多个多播组的列表，并且通过广播来分发对应的多播组业务。通过确定一个或多个资源相关特征，网络设备然后可以基于资源相关特性在稀疏组播模式和密集组播模式之间进行选择。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式