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

21. 发明申请

US20060101142A1 Technique for selecting a path computation element 有权
标题翻译：选择路径计算元素的技术
公开(公告)号：US20060101142A1
公开(公告)日：2006-05-11
申请号：US10983280
申请日：2004-11-05
申请人： Jean-Philippe Vasseur , David Ward , Muthurajah Sivabalan , Stefano Previdi
发明人： Jean-Philippe Vasseur , David Ward , Muthurajah Sivabalan , Stefano Previdi
IPC分类号： G06F15/173
CPC分类号： H04L45/42 , H04L45/04 , H04L45/12 , H04L45/127 , H04L45/44 , H04L45/58
摘要： A technique efficiently selects a Path Computation Element (PCE) to compute a path between nodes of a computer network. The PCE selection technique is illustratively based on dynamic advertisements of the PCE's available path computation resources, using (i) a low-pass filter algorithm to compute such resources, and (ii) threshold determinations to control distribution of those advertisements. To that end, the novel technique enables one or more PCEs to dynamically send (advertise) their available path computation resources to a Path Computation Client (PCC) by way of the controlled advertisements. In addition, the technique enables the PCC to efficiently select a PCE (or set of PCEs) to service a path computation request based upon those available resources.
摘要翻译：一种技术有效地选择路径计算元素（PCE）来计算计算机网络的节点之间的路径。 PCE选择技术说明性地基于PCE可用路径计算资源的动态广告，使用（i）低通滤波器算法来计算这样的资源，以及（ii）阈值确定以控制这些广告的分布。为此，新技术使得一个或多个PCE能够通过受控广告动态地向路径计算客户端（PCC）发送（通告）它们的可用路径计算资源。此外，该技术使得PCC能够基于这些可用资源有效地选择PCE（或一组PCE）来服务路径计算请求。

22. 发明申请

US20060198321A1 System and methods for network reachability detection 有权
标题翻译：网络可达性检测的系统和方法
公开(公告)号：US20060198321A1
公开(公告)日：2006-09-07
申请号：US11072082
申请日：2005-03-04
申请人： Thomas Nadeau , Mohammed Sayeed , Michael Piecuch , James Guichard , Jean-Philippe Vasseur
发明人： Thomas Nadeau , Mohammed Sayeed , Michael Piecuch , James Guichard , Jean-Philippe Vasseur
IPC分类号： H04L12/56 , H04L12/28
CPC分类号： H04L43/50 , H04L45/04 , H04L45/36 , H04L45/50 , H04L69/16
摘要： A mechanism for ASBRs to identify the originating node, or router, in an LSP conversant autonomous system (AS), such as an MPLS VPN environment, maintains the identity of the originating node and successive nodes in subsequent autonomous systems along the path to the node to be pinged. The identity of the transporting nodes is stored in a stack or other object associated with the ping request (ping), such that the pinged node may employ the stored identity as a set of return path routing information. Successive ASBRs store their identity on the stack, in an ordered manner, along the path to the destination. Upon reaching the destination (ping) node, the destination node employs the identity of the first node on the stack to send the acknowledgment, or ping response. Each successive ASBR, therefore, pops (retrieves) the next node identity from the stack and redirects (sends) the ping response to the retrieved node.
摘要翻译：用于识别LSP熟练自治系统（AS）（例如MPLS VPN环境）中的始发节点或路由器的机制在沿着节点的路径的后续自治系统中维护始发节点和连续节点的身份要ping 传输节点的身份存储在与ping请求（ping）相关联的堆栈或其他对象中，使得被ping过的节点可以将所存储的身份用作一组返回路径路由信息。连续的ASBR将按照有序的方式将其身份存储在堆栈中，沿着目的地的路径。在到达目的地（ping）节点时，目的地节点采用栈上的第一个节点的身份来发送确认或ping响应。因此，每个连续的ASBR从堆栈中弹出（检索）下一个节点标识，并将ping响应重定向（发送）到检索到的节点。

23. 发明授权

US09197508B2 Time-based scheduling for tunnels computed by a stateful path computation element 有权
标题翻译：由状态路径计算元素计算的隧道的基于时间的调度
公开(公告)号：US09197508B2
公开(公告)日：2015-11-24
申请号：US13524751
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils , George Swallow
发明人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils , George Swallow
IPC分类号： H04L12/24 , H04L12/26 , H04L12/911
CPC分类号： H04L41/0896 , H04L41/147 , H04L47/823 , H04L47/825 , H04L47/826
摘要： In one embodiment, a path computation element (PCE) in a computer network receives one or more path computation requests (PCReqs), and records a time of each PCReq and the corresponding requested bandwidth. Based on this information, the PCE may determine a traffic profile of the computer network, and may augment a traffic engineering database (TED) with requested bandwidth according to time based on the traffic profile. As such, prior to a particular time, the PCE may determine placement of tunnels within the traffic profile for the particular time.
摘要翻译：在一个实施例中，计算机网络中的路径计算元件（PCE）接收一个或多个路径计算请求（PCReq），并记录每个PCReq的时间和相应的请求带宽。基于该信息，PCE可以确定计算机网络的流量简档，并且可以基于流量简档来根据时间来增加具有所请求带宽的流量工程数据库（TED）。因此，在特定时间之前，PCE可以在特定时间内确定隧道在业务简档内的布置。

24. 发明授权

US08817591B2 Inter-domain signaling to update remote path computation elements after a call set-up failure 有权
标题翻译：呼叫建立失败后更新远程路径计算元素的域间信令
公开(公告)号：US08817591B2
公开(公告)日：2014-08-26
申请号：US13524168
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi
发明人： Jean-Philippe Vasseur , Stefano Previdi
IPC分类号： H04L1/00 , H04L12/26
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。

25. 发明申请

US20130336116A1 CONGESTION-BASED NOTIFICATION DURING FAST REROUTE OPERATIONS IN STATEFUL PATH COMPUTATION ELEMENT ENVIRONMENTS 有权
标题翻译：紧急路线计算元件环境中快速REROUTE操作下的基于约束的通知
公开(公告)号：US20130336116A1
公开(公告)日：2013-12-19
申请号：US13524135
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils
发明人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils
IPC分类号： H04L12/56
CPC分类号： H04L45/125 , H04L45/22 , H04L45/28 , H04L47/11 , H04L47/825
摘要： In one embodiment, once activation of use of a backup tunnel is detected for a primary tunnel, then a level of congestion of the path of the backup tunnel may be determined. In response to the level being greater than a threshold, a head-end node of the primary tunnel is triggered to reroute the primary tunnel (e.g., requesting to a path computation element). Conversely, in response to the level not being greater than the threshold, the backup tunnel is allowed to remain activated.
摘要翻译：在一个实施例中，一旦检测到主隧道的备用隧道的使用的激活，则可以确定备用隧道的路径的拥塞级别。响应于该级别大于阈值，主隧道的前端节点被触发以重新路由主隧道（例如，请求到路径计算元件）。相反，响应级别不大于阈值，允许备份隧道保持激活。

26. 发明申请

US20070047469A1 Efficient constrained shortest path first optimization technique 有权
标题翻译：有效约束最短路径优化技术
公开(公告)号：US20070047469A1
公开(公告)日：2007-03-01
申请号：US11210910
申请日：2005-08-24
申请人： Jean-Philippe Vasseur , Stefano Previdi
发明人： Jean-Philippe Vasseur , Stefano Previdi
IPC分类号： H04L12/28
CPC分类号： H04L45/12 , H04L45/02 , H04L45/028 , H04L45/28 , H04L45/302 , H04L45/50
摘要： A technique performs an efficient constrained shortest path first (CSPF) optimization of Traffic Engineering (TE) Label Switched Paths (LSPs) in a computer network. The novel CSPF technique is triggered upon the detection of an event in the computer network that could create a more optimal path, such as, e.g., a new or restored network element or increased path resources. Once the novel CSPF technique is triggered, the computing node (e.g., a head-end node of the TE-LSP or a Path Computation Element, PCE) determines the set of nodes adjacent to the event, and further determines which of those adjacent nodes are within the TE-LSP (“attached nodes”). The computing node performs a CSPF computation rooted at the closest attached node to determine whether a new computed path cost is less than a current path cost (e.g., by a configurable amount), and if so, triggers optimization of the TE-LSP along the new path.
摘要翻译：一种技术在计算机网络中执行流量工程（TE）标签交换路径（LSP）的有效约束最短路径优先（CSPF）优化。检测到计算机网络中可能产生更为优化的路径（例如，新的或恢复的网络元件或增加的路径资源）的事件触发了新的CSPF技术。一旦新颖的CSPF技术被触发，计算节点（例如，TE-LSP的头端节点或路径计算元件PCE）确定与事件相邻的节点集合，并进一步确定那些相邻节点中的哪一个在TE-LSP（“附属节点”）内。计算节点执行根据最接近的附加节点的CSPF计算，以确定新的计算路径开销是否小于当前路径开销（例如，通过可配置的量），如果是，则触发TE-LSP沿着新途径

27. 发明申请

US20060164975A1 Loop prevention technique for MPLS using two labels 有权
公开(公告)号：US20060164975A1
公开(公告)日：2006-07-27
申请号：US11046163
申请日：2005-01-26
申请人： Clarence Filsfils , Jim Guichard , Jean-Philippe Vasseur , Stefano Previdi , Robert Raszuk
发明人： Clarence Filsfils , Jim Guichard , Jean-Philippe Vasseur , Stefano Previdi , Robert Raszuk
IPC分类号： H04L12/28 , G08C15/00
CPC分类号： H04L45/00 , H04L45/18 , H04L45/22 , H04L45/28 , H04L45/50 , H04W12/02
摘要： A fast reroute (FRR) technique is implemented at the edge of a network. In accordance with the technique, if an edge device detects a node or link failure that prevents it from communicating with a neighboring routing domain, the edge device reroutes at least some data packets addressed to that domain to a backup edge device which, in turn, forwards the packets to the neighboring domain. The rerouted packets are designated as being “protected” (i.e., rerouted) data packets before they are forwarded to the backup edge device. To differentiate which data packets are protected and which are not, the backup edge device employs different sets of VPN label values for protected and non-protected network traffic. That is, the backup edge device may allocate two different VPN label values for at least some destination address prefixes that are reachable through the neighboring domain: a first VPN label value for FRR protected traffic and a second VPN label value for non-protected traffic. Upon receiving a data packet containing a protected VPN label value, the backup edge device is not permitted to reroute the packet a second time, e.g., in response to another inter-domain node or link failure, thereby preventing loops from developing at the edge of the network.

28. 发明申请

US20130336126A1 TIME-BASED SCHEDULING FOR TUNNELS COMPUTED BY A STATEFUL PATH COMPUTATION ELEMENT 有权
标题翻译：一个稳定的路径计算元素计算的隧道的基于时间的调度
公开(公告)号：US20130336126A1
公开(公告)日：2013-12-19
申请号：US13524751
申请日：2012-06-15
申请人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils , George Swallow
发明人： Jean-Philippe Vasseur , Stefano Previdi , Clarence Filsfils , George Swallow
IPC分类号： H04L12/24 , H04L12/26
CPC分类号： H04L41/0896 , H04L41/147 , H04L47/823 , H04L47/825 , H04L47/826
摘要： In one embodiment, a path computation element (PCE) in a computer network receives one or more path computation requests (PCReqs), and records a time of each PCReq and the corresponding requested bandwidth. Based on this information, the PCE may determine a traffic profile of the computer network, and may augment a traffic engineering database (TED) with requested bandwidth according to time based on the traffic profile. As such, prior to a particular time, the PCE may determine placement of tunnels within the traffic profile for the particular time.
摘要翻译：在一个实施例中，计算机网络中的路径计算元件（PCE）接收一个或多个路径计算请求（PCReq），并记录每个PCReq的时间和相应的请求带宽。基于该信息，PCE可以确定计算机网络的流量简档，并且可以基于流量简档来根据时间来增加具有所请求带宽的流量工程数据库（TED）。因此，在特定时间之前，PCE可以在特定时间内确定隧道在业务简档内的布置。

29. 发明申请

US20130013809A1 MANAGING HOST ROUTES FOR LOCAL COMPUTER NETWORKS WITH A PLURALITY OF FIELD AREA ROUTERS 有权
标题翻译：管理具有多个现场区域路由器的本地计算机网络的主机路由
公开(公告)号：US20130013809A1
公开(公告)日：2013-01-10
申请号：US13176301
申请日：2011-07-05
申请人： Jean-Philippe Vasseur , Jonathan W. Hui , Stefano Previdi , Shmuel Shaffer
发明人： Jean-Philippe Vasseur , Jonathan W. Hui , Stefano Previdi , Shmuel Shaffer
IPC分类号： G06F15/173
CPC分类号： H04L45/22 , H04L45/64
摘要： In one embodiment, a particular field area router (FAR), in a local computer network (e.g., a mesh network) having a plurality of FARs, advertises a common subnet prefix assigned to the local computer network into a global computer network. Each of the plurality of FARs of the local computer network is configured to accept any traffic destined to the local computer network, and a tunnel overlay is built among the plurality of FARs. Upon receiving a packet at the particular FAR destined to a particular device in the local computer network, and in response to the particular FAR not having a host route to the particular device, it forwards the packet on the tunnel overlay to another of the plurality of FARs of the local computer network.
摘要翻译：在一个实施例中，具有多个FAR的本地计算机网络（例如，网状网络）中的特定场区域路由器（FAR）将分配给本地计算机网络的公共子网前缀通告给全局计算机网络。本地计算机网络的多个FAR中的每一个被配置为接受去往本地计算机网络的任何流量，并且在多个FAR之间建立隧道覆盖。一旦在特定的FAR上收到一个目的地是本地计算机网络中的特定设备的分组，并且响应于特定的FAR没有到该特定设备的主机路由，它将隧道覆盖上的分组转发到多个本地计算机网络的FAR。

30. 发明授权

US07471636B2 Methods and apparatus based on message transmission times 有权
标题翻译：基于消息传输时间的方法和设备
公开(公告)号：US07471636B2
公开(公告)日：2008-12-30
申请号：US11063803
申请日：2005-02-23
申请人： Jean-Philippe Vasseur , Stefano Previdi , James N. Guichard , David D. Ward
发明人： Jean-Philippe Vasseur , Stefano Previdi , James N. Guichard , David D. Ward
IPC分类号： H04L12/26
CPC分类号： H04L12/56
摘要： A data communication device (e.g., a router) originates a network configuration message in response to a network topology change or so as to refresh a configuration message. The data communication device encodes a timestamp in the network configuration message. The timestamp indicates a time of originating the network configuration message. Further, the data communication device transmits the network configuration message over the network to other network devices that, in turn, initiate further broadcast of at least a portion of contents of the network configuration message. Based on the timestamp of the network configuration message, the data communication devices receiving the network configuration message identify transmission time value indicating how long the network configuration message takes to be conveyed over the network to the other network devices. The data communication devices utilize the transmission time value as a timeout period for determining whether a data communication device failure occurs.
摘要翻译：数据通信设备（例如，路由器）响应于网络拓扑变化而发起网络配置消息，以便刷新配置消息。数据通信设备对网络配置消息中的时间戳进行编码。时间戳表示发起网络配置消息的时间。此外，数据通信设备通过网络将网络配置消息发送到其他网络设备，其进一步发起网络配置消息的至少一部分内容的进一步广播。基于网络配置消息的时间戳，接收网络配置消息的数据通信设备识别表示网络配置消息通过网络传送到其他网络设备多长时间的传输时间值。数据通信设备利用传输时间值作为用于确定数据通信设备故障是否发生的超时周期。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式