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

81. 发明申请

US20130336103A1 INTER-DOMAIN SIGNALING TO UPDATE REMOTE PATH COMPUTATION ELEMENTS AFTER A CALL SET-UP FAILURE 有权
标题翻译：呼叫建立失败后的域内信号更新远程路径计算元素
公开(公告)号：US20130336103A1
公开(公告)日：2013-12-19
申请号：US13524168
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi
发明人： Jean-Philippe Vasseur , Stefano Previdi
IPC分类号： H04L29/14 , H04L12/26 , H04L12/24
CPC分类号： H04L41/12 , H04L45/04 , H04L45/22 , H04L45/28 , H04L45/50 , H04L47/724 , H04L47/785 , H04L47/825
摘要： In one embodiment, a router in a non-originating domain receives a signal to establish a tunnel, the signal having an identification (ID) of an originating path computation element (PCE) of an originating domain from where the signal to establish the tunnel originated. In response to determining that establishment of the tunnel fails, the router may signal the failure of the establishment to a local PCE of the non-originating domain, the signaling indicating the ID of the originating PCE to cause the local PCE to provide updated routing information of the non-originating domain to the originating PCE.
摘要翻译：在一个实施例中，非起始域中的路由器接收建立隧道的信号，该信号具有始发域的始发路径计算元件（PCE）的标识（ID），其中建立隧道的信号源自。响应于确定隧道的建立失败，路由器可以将建立的失败信号发送到非始发域的本地PCE，该信令指示发起PCE的ID，以使本地PCE提供更新的路由信息的非始发域到原始PCE。

82. 发明申请

US20120233473A1 Power Management in Networks 审中-公开
标题翻译：网络中的电源管理
公开(公告)号：US20120233473A1
公开(公告)日：2012-09-13
申请号：US13043169
申请日：2011-03-08
申请人： Jean-Philippe Vasseur , Yegnanarayanan Chandramouli , Stefano Previdi , Aravind Sitaraman
发明人： Jean-Philippe Vasseur , Yegnanarayanan Chandramouli , Stefano Previdi , Aravind Sitaraman
IPC分类号： G06F1/00 , G06F15/173
CPC分类号： G06F1/3206 , G06Q10/06 , G06Q50/06
摘要： In one implementation, the power consumption by network devices may be managed by accessing a routing protocol that manages an allocation of processing resources in a network. The routing protocol may be used for generating a first configuration, for which a utilization of resources may be determined. A first cost for the first configuration may be determined. A second configuration may be identified to support the utilization of the resources. A second cost may be determined for the second configuration. The first cost may be compared to the second cost. The prospective performance of the network for the second configuration may be assessed. Based on the results of the comparison and the assessment, the network may be configured to use the second configuration. Processing resources may be activated on inactive network devices to support the second configuration and deactivated on active network devices that are not utilized in the second configuration.
摘要翻译：在一个实现中，可以通过访问管理网络中的处理资源的分配的路由协议来管理网络设备的功耗。路由协议可以用于生成可以确定资源利用的第一配置。可以确定第一配置的第一个成本。可以识别第二配置以支持资源的利用。可以针对第二配置确定第二成本。第一个成本可以与第二个成本进行比较。可以评估网络对于第二配置的预期性能。基于比较和评估的结果，可以将网络配置为使用第二配置。可以在非活动网络设备上激活处理资源以支持第二配置，并在第二配置中未使用的活动网络设备上停用。

83. 发明授权

US08077721B2 Methods and apparatus providing two stage tunneling 有权
标题翻译：提供两级隧道的方法和装置
公开(公告)号：US08077721B2
公开(公告)日：2011-12-13
申请号：US11725157
申请日：2007-03-15
申请人： Robert Raszuk , Stefano Previdi , Jean-Philippe Vasseur
发明人： Robert Raszuk , Stefano Previdi , Jean-Philippe Vasseur
IPC分类号： H04L12/28
CPC分类号： H04L45/50 , H04L12/4633 , H04L45/04
摘要： A system receives a packet at a first node. The packet is destined for a second node. The system identifies a full routing node from a plurality of network devices. The full routing node is capable of providing routing information for each of the nodes within the plurality of network devices. The plurality of network devices comprises a subset of nodes, and a subset of full routing nodes. The subset of nodes is not capable of providing routing information for each of the nodes within the plurality of network devices. The system transmits the packet to the full routing node for future transmission to the second node.
摘要翻译：系统在第一节点处接收分组。数据包将发往第二个节点。该系统从多个网络设备中识别完整的路由节点。完整路由节点能够为多个网络设备内的每个节点提供路由信息。多个网络设备包括节点的子集，以及完整路由节点的子集。节点的子集不能为多个网络设备内的每个节点提供路由信息。系统将数据包发送到完整路由节点，以便将来传输到第二个节点。

84. 发明授权

US07869351B2 Communication techniques and generic layer 3 automatic switching protection 有权
标题翻译：通信技术和通用层3自动切换保护
公开(公告)号：US07869351B2
公开(公告)日：2011-01-11
申请号：US11713504
申请日：2007-03-02
申请人： David D. Ward , Earl Hardin Booth, III , Stefano Previdi
发明人： David D. Ward , Earl Hardin Booth, III , Stefano Previdi
IPC分类号： G01R31/08
CPC分类号： H04J3/14 , H04J2203/006 , H04J2203/0083 , H04L12/66
摘要： In one embodiment, software code in a respective computer system such as one or more data communication devices establishes multiple layer 2 network links between a first data communication device and a second data communication device. The first data communication device and the second data communication device include corresponding layer 3 interfaces enabling layer 3 network communications over each of the multiple layer 2 network links. The first and second data communication devices route traffic over one (e.g., a primary layer 2 link) of the multiple layer 2 network links using the layer 3 network communications. The private links are media independent. Upon detection of a failure associated with the primary layer 2 link, the data communication devices can automatically switch to sending traffic over a backup link of the multiple layer 2 network links without disrupting publicly advertised routing topology information.
摘要翻译：在一个实施例中，诸如一个或多个数据通信设备的相应计算机系统中的软件代码在第一数据通信设备和第二数据通信设备之间建立多个第2层网络链路。第一数据通信设备和第二数据通信设备包括相应的层3接口，其能够在多层2网络链路中的每一个上实现层3网络通信。第一和第二数据通信设备使用第3层网络通信路由多层2网络链路的一个（例如，主层2链路）上的业务。私人链接是媒体独立的。在检测到与主层2链路相关联的故障时，数据通信设备可以自动切换到通过多层2网络链路的备份链路发送流量，而不会中断公开发布的路由拓扑信息。

85. 发明申请

US20100202448A1 ROUTING-BASED PROXIMITY FOR COMMUNICATION NETWORKS 有权
标题翻译：基于路由的通信网络接近
公开(公告)号：US20100202448A1
公开(公告)日：2010-08-12
申请号：US12368436
申请日：2009-02-10
申请人： Stefano Previdi , Jining Tian , Steven Luong , Bruce Davie , Jan Medved
发明人： Stefano Previdi , Jining Tian , Steven Luong , Bruce Davie , Jan Medved
IPC分类号： H04L12/56
CPC分类号： H04W4/02 , H04L45/02 , H04L45/306 , H04L67/1072 , H04L67/18 , H04L67/28
摘要： A node in an overlay network requests a ranked list of other nodes in the overlay network that can provide a desired piece of content or service to the requesting node. A separate node such as a router generates the ranked list using a routing algorithm, returning the list to the requesting node so that the requesting node may acquire the desired content or service from the nearest node in the overlay network.
摘要翻译：覆盖网络中的节点请求覆盖网络中可以向请求节点提供期望的一段内容或服务的其他节点的排名列表。诸如路由器的单独的节点使用路由算法生成排名列表，将列表返回到请求节点，使得请求节点可以从覆盖网络中的最近节点获取期望的内容或服务。

86. 发明申请

US20080212610A1 Communication techniques and generic layer 3 automatic switching protection 有权
标题翻译：通信技术和通用层3自动切换保护
公开(公告)号：US20080212610A1
公开(公告)日：2008-09-04
申请号：US11713504
申请日：2007-03-02
申请人： David D. Ward , Earl Hardin Booth , Stefano Previdi
发明人： David D. Ward , Earl Hardin Booth , Stefano Previdi
IPC分类号： H04J3/16
CPC分类号： H04J3/14 , H04J2203/006 , H04J2203/0083 , H04L12/66
摘要： In one embodiment, software code in a respective computer system such as one or more data communication devices establishes multiple layer 2 network links between a first data communication device and a second data communication device. The first data communication device and the second data communication device include corresponding layer 3 interfaces enabling layer 3 network communications over each of the multiple layer 2 network links. The first and second data communication devices route traffic over one (e.g., a primary layer 2 link) of the multiple layer 2 network links using the layer 3 network communications. The private links are media independent. Upon detection of a failure associated with the primary layer 2 link, the data communication devices can automatically switch to sending traffic over a backup link of the multiple layer 2 network links without disrupting publicly advertised routing topology information.
摘要翻译：在一个实施例中，诸如一个或多个数据通信设备的相应计算机系统中的软件代码在第一数据通信设备和第二数据通信设备之间建立多个第2层网络链路。第一数据通信设备和第二数据通信设备包括相应的层3接口，其能够在多层2网络链路中的每一个上实现层3网络通信。第一和第二数据通信设备使用第3层网络通信路由多层2网络链路的一个（例如，主层2链路）上的业务。私人链接是媒体独立的。在检测到与主层2链路相关联的故障时，数据通信设备可以自动切换到通过多层2网络链路的备份链路发送流量，而不会中断公开发布的路由拓扑信息。

87. 发明申请

US20070189193A1 Rerouting multicast traffic in response to detecting imminent network disruption 有权
标题翻译：响应于即将发生的网络中断，重新路由多播流量
公开(公告)号：US20070189193A1
公开(公告)日：2007-08-16
申请号：US11355525
申请日：2006-02-16
申请人： Stefano Previdi , Dino Farinacci , Ijsbrand Wijnands , Arjen Boers
发明人： Stefano Previdi , Dino Farinacci , Ijsbrand Wijnands , Arjen Boers
IPC分类号： H04L12/28
CPC分类号： H04L45/16 , H04L12/1868 , H04L45/02 , H04L45/28 , H04L45/48
摘要： Various systems and method for rerouting multicast traffic in response to detecting imminent network disruption are disclosed. One method involves detecting an imminent topology change and, in response, identifying a new multicast distribution tree for a multicast group. A join message for the multicast group is then sent towards a root of the new multicast distribution tree. Multicast traffic addressed to the multicast group continues to be forwarded via the current multicast distribution tree, subsequent to sending the join message. The multicast traffic is not forwarded via the new multicast distribution tree until one or more multicast data packets have been received via the new multicast distribution tree.
摘要翻译：公开了响应于即将发生的网络中断而重新组播多播流量的各种系统和方法。一种方法涉及检测即将发生的拓扑变化，并且作为响应，识别组播组的新的多播分发树。然后将多播组的加入消息发送到新的多播分发树的根。发送加入消息后，寻址到组播组的组播流量将继续通过当前的组播分发树进行转发。组播流量不会通过新的组播分发树转发，直到通过新的组播分发树接收到一个或多个组播数据包。

88. 发明申请

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.

89. 发明申请

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。

90. 发明申请

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之间的业务负载。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式