-
1.发明申请公开(公告)号：US20060209719A1
公开(公告)日：2006-09-21
申请号：US11084387
申请日：2005-03-18
申请人： Stefano Previdi , David Ward , Jonathan Barth , John Harper , Ian Shand
发明人： Stefano Previdi , David Ward , Jonathan Barth , John Harper , Ian Shand
IPC分类号： H04L12/28
CPC分类号： H04L45/22 , H04L12/4633 , H04L45/00 , H04L45/02 , H04L45/026 , H04L2212/00
摘要： A system and method routes data traffic over a unidirectional link of a computer network configured to implement a routing protocol, such as the ISIS routing protocol. To that end, the invention extends the ISIS routing protocol to allow dynamic discovery of neighboring routers (i.e., neighbors) that are connected via the unidirectional link and subsequent establishment of an adjacency between the neighbors over the link. Adjacency establishment is illustratively effected through the use of novel type/length/value (TLV) encoded formats appended to ISIS Hello packets to convey information between the neighbors.
-
公开(公告)号：US20070091795A1
公开(公告)日：2007-04-26
申请号：US11254587
申请日：2005-10-20
申请人： Olivier Bonaventure , Pierre Francois , Clarence Filsfils , Stewart Bryant , David Ward , John Scudder , Stefano Previdi , Ian Shand , Gargi Nalawade
发明人： Olivier Bonaventure , Pierre Francois , Clarence Filsfils , Stewart Bryant , David Ward , John Scudder , Stefano Previdi , Ian Shand , Gargi Nalawade
CPC分类号： H04L45/22 , H04L45/04 , H04L45/28 , H04L2212/00
摘要： A method of constructing a backup path in an autonomous system (AS) for failure of an inter-AS link is described. The method comprises identifying an alternate inter-AS path and constructing a tunnel to an end point on the alternate path.
摘要翻译： 描述了在自治系统（AS）中构建用于AS间链路故障的备用路径的方法。 该方法包括识别替代的AS间路径并构建到备用路径上的终点的隧道。
-
公开(公告)号：US20070041379A1
公开(公告)日：2007-02-22
申请号：US11188221
申请日：2005-07-22
申请人： Stefano Previdi , Ian Shand , Stewart Bryant
发明人： Stefano Previdi , Ian Shand , Stewart Bryant
IPC分类号： H04L12/56
CPC分类号： H04L45/22 , H04L29/12783 , H04L45/02 , H04L45/28 , H04L61/35
摘要： A method of advertising repair capability in a network repair scheme using network repair addresses for repairing around a repairable network component in a data communications network having, as components, nodes and links therebetween, comprises establishing whether an alternate repair path is available around a repairable component. If such a repair path is available, the method further comprises issuing a corresponding notification to nodes in the network.
摘要翻译： 一种在网络修复方案中使用网络修复地址进行广告维修能力的方法，所述网络修复地址用于修复数据通信网络中的可修复网络组件，所述可修复网络组件具有作为其之间的节点和链路的组件，包括确定备用维修路径是否可用于可修复组件 。 如果这样的修复路径可用，则该方法还包括向网络中的节点发出相应的通知。
-
4.发明申请Method and apparatus for constructing a backup route in a data communications network 有权在数据通信网络中构建备份路由的方法和装置公开(公告)号：US20070038767A1
公开(公告)日：2007-02-15
申请号：US10340371
申请日：2003-01-09
申请人： Kevin Miles , Ian Charles Shand , Stewart Bryant , Stefano Previdi , John Harper , Clarence Filsfils
发明人： Kevin Miles , Ian Charles Shand , Stewart Bryant , Stefano Previdi , John Harper , Clarence Filsfils
IPC分类号： G06F15/16
摘要： A method is disclosed for constructing a backup route from a source node around an adjacent component. The source node derives a first set of nodes reachable from it without traversing the adjacent component and a second set of nodes from which a neighbor node of adjacent components is reachable without traversing the adjacent component. The source node then constructs a backup route via an intermediate node in the intersection of the first and second sets.
摘要翻译： 公开了一种用于从邻近组件周围的源节点构建备用路由的方法。 源节点导出可从其到达的第一组节点，而不穿过相邻组件和相邻组件的相邻节点可到达的第二组节点，而不穿过相邻组件。 源节点然后经由第一和第二组的交集中的中间节点构建备用路由。
-
公开(公告)号：US07747777B2
公开(公告)日：2010-06-29
申请号：US11948799
申请日：2007-11-30
IPC分类号： G06F15/173
摘要： In one embodiment, an apparatus comprises logic for optimizing network resources usage. The logic is operable to store IGP information, where the IGP information includes a set of attribute values associated with each of a set of content servers. When the logic receives a request for content from a remote peer, the logic determines one or more content servers that can provide the requested content. The logic then retrieves, from the IGP information, a plurality of attribute values associated with a non-looping path from each of the one or more content servers. For each of the one or more content servers, the retrieved attribute values include: one or more capacity values indicating capacities of one or more communication links on the non-looping path from that content server; and one or more utilization values indicating utilizations of the one or more communication links on the non-looping path from that content server. The logic then selects a content server based on the retrieved attribute values, and causes the request for the content to be sent to the selected content server.
摘要翻译： 在一个实施例中，一种装置包括用于优化网络资源使用的逻辑。 逻辑可操作地存储IGP信息，其中IGP信息包括与一组内容服务器中的每一个相关联的一组属性值。 当逻辑从远程对等体接收到对内容的请求时，逻辑确定可以提供所请求的内容的一个或多个内容服务器。 然后，逻辑从IGP信息中检索与一个或多个内容服务器中的每一个的非循环路径相关联的多个属性值。 对于所述一个或多个内容服务器中的每一个，所检索的属性值包括：指示来自该内容服务器的非循环路径上的一个或多个通信链路的容量的一个或多个容量值; 以及指示来自该内容服务器的非循环路径上的一个或多个通信链路的利用的一个或多个利用率值。 然后，该逻辑基于所检索的属性值选择一个内容服务器，并且将该内容的请求发送到所选择的内容服务器。
-
6.发明申请Method and apparatus to compute local repair paths taking into account link resources and attributes 有权考虑链路资源和属性来计算局部修复路径的方法和装置公开(公告)号：US20060140111A1
公开(公告)日：2006-06-29
申请号：US11025179
申请日：2004-12-29
摘要： A technique for calculating local repair paths through a computer network using one or more dynamically measured parameters in place of, or in addition to, statically assigned cost metrics. The dynamically measured parameters include various statistical measures of resources and attributes associated with data links and/or network nodes in the computer network. In operation, an intermediate node monitors a set of local link and/or node parameters. The node may generate an advertisement in response to at least one of its monitored parameters crossing a predetermined threshold value or changing value by a predetermined percentage or amount. The advertisement is “flooded” so as to advertise the dynamically measured parameter value to other neighboring intermediate nodes. After receiving the advertisement, each node may recalculate one or more local repair paths based on the advertised parameter value. The node may utilize a recalculated repair path if it provides an appreciably lower-cost path, e.g., by a predetermined percentage, as compared with the currently deployed repair path.
摘要翻译： 一种用于通过使用一个或多个动态测量参数来代替静态分配的成本度量来计算通过计算机网络的局部修复路径的技术。 动态测量的参数包括与计算机网络中的数据链路和/或网络节点相关联的资源和属性的各种统计测量。 在操作中，中间节点监视一组本地链路和/或节点参数。 该节点可以响应于其所监视的参数中的至少一个与预定阈值相交或者以预定百分比或数量改变值来生成广告。 广告被“淹没”，以便将动态测量的参数值通告给其他相邻的中间节点。 在接收到广告之后，每个节点可以基于所通告的参数值重新计算一个或多个本地修复路径。 如果节点可以使用重新计算的修复路径，如果其与当前部署的修复路径相比提供了明显较低成本的路径，例如，以预定百分比。
-
公开(公告)号：US20060126495A1
公开(公告)日：2006-06-15
申请号：US11001149
申请日：2004-12-01
申请人： James Guichard , Jean-Philippe Vasseur , Thomas Nadeau , Clarence Filsfils , David Ward , Stefano Previdi
发明人： James Guichard , Jean-Philippe Vasseur , Thomas Nadeau , Clarence Filsfils , David Ward , Stefano Previdi
IPC分类号： H04J1/16
CPC分类号： H04L45/22 , H04L41/0677 , H04L43/50 , H04L45/02 , H04L45/28
摘要： A path verification protocol (PVP) which enumerates a series of messages sent to a set of nodes, or routers, along a suspected path identifies forwarding plane problems for effecting changes at the control plane level. The messages include a command requesting interrogation of a further remote node for obtaining information about the path between the node receiving the PVP message and the further remote node. The node receiving the PVP message replies with a command response indicative of the outcome of attempts to reach the further remote node. The series of messages collectively covers a set of important routing points along a path from the originator to the recipient. The aggregate command responses to the series of PVP messages is analyzed to identify not only whether the entire path is operational, but also the location and nature of the problem.
-
8.发明申请System and method for reporting out-of-resources (OOR) conditions in a data network 有权在数据网络中报告资源不足（OOR）条件的系统和方法公开(公告)号：US20060092952A1
公开(公告)日：2006-05-04
申请号：US10964184
申请日：2004-10-13
申请人： Sami Boutros , Muthurajah Sivabalan , David Ward , Stefano Previdi , Jean-Philippe Vasseur , Rodolphe Figaro , Reshad Rahman
发明人： Sami Boutros , Muthurajah Sivabalan , David Ward , Stefano Previdi , Jean-Philippe Vasseur , Rodolphe Figaro , Reshad Rahman
IPC分类号： H04L12/56
CPC分类号： H04L47/125 , H04L41/06 , H04L45/00 , H04L45/50 , H04L47/2408 , H04L47/745
摘要： A system and method for advertising out-of-resources (OOR) conditions for entities, such as nodes, line cards and data links, in a manner that does not involve using a maximum cost to indicate the entity is “out-of-resources.” According to the technique, an OOR condition for an entity is advertised in one or more type-length-value (TLV) objects contained in an advertisement message. The advertisement message is flooded to nodes on a data network to inform them of the entity's OOR condition. Head-end nodes that process the advertisement message may use information contained in the TLV object to determine a path for a new label switched path (LSP) that does not include the entity associated with the OOR condition.
摘要翻译： 用于以不涉及使用最大成本来指示实体的方式向诸如节点，线路卡和数据链路的实体（例如节点，线路卡和数据链路）广告外部资源（OOR）条件的系统和方法是“超出资源 “。 根据该技术，在广告消息中包含的一个或多个类型长度值（TLV）对象中通告实体的OOR条件。 广告消息被洪泛到数据网络上的节点，以通知他们实体的OOR条件。 处理广告消息的头端节点可以使用包含在TLV对象中的信息来确定不包括与OOR条件相关联的实体的新标签交换路径（LSP）的路径。
-
公开(公告)号：US08488444B2
公开(公告)日：2013-07-16
申请号：US11824885
申请日：2007-07-03
申请人： Clarence Filsfils , Stefano Previdi , David Ward
发明人： Clarence Filsfils , Stefano Previdi , David Ward
IPC分类号： G01R31/08
摘要： A method and system for failure notification at a remote node in communication with a local node are disclosed. The local node is configured for faster failure detection than the remote node. In one embodiment, the method includes establishing a failure monitoring session between the local node and the remote node, receiving at the remote node, a failure notification from the local node, the failure notification sent using a protocol of the failure monitoring session, and rerouting traffic at the remote node in response to the failure notification.
-
公开(公告)号：US20090144390A1
公开(公告)日：2009-06-04
申请号：US11948799
申请日：2007-11-30
IPC分类号： G06F15/16
摘要： In one embodiment, an apparatus comprises logic for optimizing network resources usage. The logic is operable to store IGP information, where the IGP information includes a set of attribute values associated with each of a set of content servers. When the logic receives a request for content from a remote peer, the logic determines one or more content servers that can provide the requested content. The logic then retrieves, from the IGP information, a plurality of attribute values associated with a non-looping path from each of the one or more content servers. For each of the one or more content servers, the retrieved attribute values include: one or more capacity values indicating capacities of one or more communication links on the non-looping path from that content server; and one or more utilization values indicating utilizations of the one or more communication links on the non-looping path from that content server. The logic then selects a content server based on the retrieved attribute values, and causes the request for the content to be sent to the selected content server.
摘要翻译： 在一个实施例中，一种装置包括用于优化网络资源使用的逻辑。 逻辑可操作地存储IGP信息，其中IGP信息包括与一组内容服务器中的每一个相关联的一组属性值。 当逻辑从远程对等体接收到对内容的请求时，逻辑确定可以提供所请求的内容的一个或多个内容服务器。 然后，逻辑从IGP信息中检索与一个或多个内容服务器中的每一个的非循环路径相关联的多个属性值。 对于所述一个或多个内容服务器中的每一个，所检索的属性值包括：指示来自该内容服务器的非循环路径上的一个或多个通信链路的容量的一个或多个容量值; 以及指示来自该内容服务器的非循环路径上的一个或多个通信链路的利用的一个或多个利用率值。 然后，该逻辑基于所检索的属性值选择一个内容服务器，并且将该内容的请求发送到所选择的内容服务器。
-
-
-
-
-
-
-
-
-
搜索结果
91 条记录 (耗时 0.028 秒)
