公开(公告)号：US20120307832A1

公开(公告)日：2012-12-06

申请号：US13589372

申请日：2012-08-20

申请人： David Allan ,  Nigel Bragg ,  Jerome Chiabaut

发明人： David Allan ,  Nigel Bragg ,  Jerome Chiabaut

IPC分类号： H04L12/28

CPC分类号： H04L45/24 ,  H04L12/66 ,  H04L45/00 ,  H04L45/12 ,  H04L45/66

摘要： Each equal cost path is assigned a path ID created by concatenating an ordered set of link IDs which form the path through the network. The link IDs are created from the node IDs on either set of the link. The link IDs are sorted from lowest to highest to facilitate ranking of the paths. The low and high ranked paths are selected from this ranked list as the first set of diverse paths through the network. Each of the link IDs on each of the paths is then renamed, for example by inverting either all of the high node IDs or low node IDs. After re-naming the links, new path IDs are created by concatenating an ordered set of renamed link IDs. The paths are then re-ranked and the low and high re-ranked paths are selected from this re-ranked list as the second set of diverse paths.

摘要翻译： 为每个相等的成本路径指定了通过连接形成通过网络的路径的有序的链路ID组创建的路径ID。 链接ID是从链路的任一组上的节点ID创建的。 链接ID从最低到最高排列，以便于路径的排名。 从这个排名列表中选择低和高排名的路径作为通过网络的第一组不同路径。 然后，每个路径上的每个链路ID被重命名，例如通过反转所有高节点ID或低节点ID。 在链接重新命名之后，通过连接重命名的链接ID的有序集来创建新的路径ID。 然后将路径重新排列，并且从该重新排列的列表中选择低和高重新排序的路径作为第二组不同路径。

公开(公告)号：US20090180400A1

公开(公告)日：2009-07-16

申请号：US12260558

申请日：2008-10-29

申请人： Jerome Chiabaut ,  David Allan ,  Nigel Bragg

发明人： Jerome Chiabaut ,  David Allan ,  Nigel Bragg

IPC分类号： H04L12/28

CPC分类号： H04L41/12 ,  H04L12/18 ,  H04L12/462 ,  H04L45/02 ,  H04L45/021 ,  H04L45/16 ,  H04L45/18 ,  H04L45/22 ,  H04L45/28 ,  H04L45/48

摘要： A method of installing forwarding state in a link state protocol controlled network node having a topology database representing a known topology of the network, and at least two ports for communication with corresponding peers of the network node. A unicast path is computed from the node to a second node in the network, using the topology database, and unicast forwarding state associated with the computed unicast path installed in a filtering database (FDB) of the node. Multicast forwarding state is removed for multicast trees originating at the second node if an unsafe condition is detected. Subsequently, a “safe” indication signal is advertised to each of the peers of the network node. The “safe” indication signal comprises a digest of the topology database. A multicast path is then computed from the network node to at least one destination node of a multicast tree originating at the second node. Finally, multicast forwarding state associated with the computed multicast path is installed in the filtering database (FDB) of the network node, when predetermined safe condition is satisfied.

摘要翻译： 一种在具有表示网络的已知拓扑的拓扑数据库的链路状态协议控制网络节点中安装转发状态的方法，以及用于与网络节点的相应对等体进行通信的至少两个端口。 使用拓扑数据库从网络中的节点到第二节点计算单播路径，以及与安装在节点的过滤数据库（FDB）中的计算的单播路径相关联的单播转发状态。 如果检测到不安全状况，则组播转发状态将被删除。 随后，向网络节点的每个对等体通告“安全”指示信号。 “安全”指示信号包括拓扑数据库的摘要。 然后，从网络节点计算多播路径到源于第二节点的多播树的至少一个目的地节点。 最后，当满足预定的安全条件时，安装在网络节点的过滤数据库（FDB）中与计算出的组播路径相关联的组播转发状态。

公开(公告)号：US08605627B2

公开(公告)日：2013-12-10

申请号：US13204309

申请日：2011-08-05

申请人： Jerome Chiabaut ,  David Allan ,  Nigel Bragg

发明人： Jerome Chiabaut ,  David Allan ,  Nigel Bragg

IPC分类号： H04L12/28

CPC分类号： H04L45/122 ,  H04L45/04 ,  H04L45/16 ,  H04L45/48 ,  H04L45/66

摘要： A method of multicast route computation in a link state protocol controlled network. A spanning tree is computed from a first node to every other node in the network using a known spanning tree protocol. The network is then divided into two or more partitions, each partition encompassing an immediate neighbor node of the first node and any nodes of the network subtending the neighbor node on the spanning tree. Two or more of the partitions are merged when a predetermined criterion is satisfied. Nodes within all of the partitions except a largest one of the partitions are then identified, and each identified node examined to identify node pairs for which a respective shortest path traverses the first node.

摘要翻译： 一种链路状态协议控制网络中组播路由计算的方法。 使用已知的生成树协议从网络中的第一节点到每个其他节点计算生成树。 然后将网络划分成两个或更多个分区，每个分区包含第一节点的直接邻居节点和对生成树上的邻居节点的网络的任何节点。 当满足预定标准时，两个或多个分区被合并。 然后识别除了最大分区之外的所有分区内的节点，并且检查每个识别的节点以识别相应的最短路径穿过第一节点的节点对。

公开(公告)号：US07911944B2

公开(公告)日：2011-03-22

申请号：US11964478

申请日：2007-12-26

申请人： Jerome Chiabaut ,  David Allan ,  Nigel Bragg ,  Peter Ashwood Smith

发明人： Jerome Chiabaut ,  David Allan ,  Nigel Bragg ,  Peter Ashwood Smith

IPC分类号： G01R31/08

CPC分类号： H04L45/12 ,  H04L45/00 ,  H04L45/22 ,  H04L45/24

摘要： A consistent tie-breaking decision between equal-cost shortest (lowest cost) paths is achieved by comparing an ordered set of node identifiers for each of a plurality of end-to-end paths. Alternatively, the same results can be achieved, on-the-fly, as a shortest path tree is constructed, by making a selection of an equal-cost path using the node identifiers of the diverging branches of the tree. Both variants allow a consistent selection to be made of equal-cost paths, regardless of where in the network the shortest paths are calculated. This ensures that traffic flow between any two nodes, in both the forward and reverse directions, will always follow the same path through the network.

摘要翻译： 通过比较多个端到端路径中的每一个的有序节点标识符集来实现等成本最短（最低成本）路径之间的一致的打破决定。 或者，通过使用树的分支分支的节点标识符选择等价路径，可以实时地实现与最短路径树相同的结果。 这两种变体允许对等成本路径进行一致的选择，而不管网络中哪些地方计算最短路径。 这确保任何两个节点之间在正向和反向方向上的业务流量将始终遵循通过网络的相同路径。

公开(公告)号：US20060029032A1

公开(公告)日：2006-02-09

申请号：US10910685

申请日：2004-08-03

申请人： David Allan ,  Nigel Bragg ,  Liam Casey ,  Jerome Chiabaut

发明人： David Allan ,  Nigel Bragg ,  Liam Casey ,  Jerome Chiabaut

IPC分类号： H04L12/28

CPC分类号： H04L47/825 ,  H04L12/4679 ,  H04L45/04 ,  H04L45/50 ,  H04L47/15 ,  H04L47/20 ,  H04L47/70 ,  H04L47/724 ,  H04L47/762 ,  H04L47/781 ,  H04L47/822

摘要： A method and system for providing a virtual private communication network to transport customer data between a set of customer devices coupled to a provider network. A committed information rate is advertised to a provider tandem. The provider tandem determines whether sufficient network resources exist to successfully transport to a destination customer device all offered data from the set of customer devices.

摘要翻译： 一种用于提供虚拟专用通信网络以在耦合到提供商网络的一组客户设备之间传送客户数据的方法和系统。 承诺的信息速率被通告给提供商。 提供商串联确定是否存在足够的网络资源以成功地将目标客户设备传送到来自该组客户设备的所有提供的数据。

公开(公告)号：US09444720B2

公开(公告)日：2016-09-13

申请号：US12435973

申请日：2009-05-05

申请人： David Allan ,  Nigel Bragg ,  Jerome Chiabaut

发明人： David Allan ,  Nigel Bragg ,  Jerome Chiabaut

IPC分类号： H04L12/701 ,  H04L12/721 ,  H04L12/761 ,  H04L12/18 ,  H04L12/46

CPC分类号： H04L45/12 ,  H04L12/185 ,  H04L12/4641 ,  H04L45/00 ,  H04L45/16 ,  H04L45/66 ,  H04L67/1044 ,  H04L67/1046 ,  H04N1/333

摘要： Interest in multicast group membership may be advertised via a routing system on an Ethernet network along with an indication of an algorithm to be used by the nodes on the network to calculate the distribution tree or trees for the multicast. Each node, upon receipt of the advertisement, will determine the algorithm that is to be used to produce the multicast tree and will use the algorithm to calculate whether it is on a path between nodes advertising common interest in the multicast. Example algorithms may include shortest path algorithms and spanning tree algorithms. This allows multicast membership to be managed via the routing control plane, while enabling spanning tree processes to be used to forward multicast traffic. Since spanning tree is able to install multicast state per service rather than per source per service, this reduces the amount of forwarding state required to implement multicasts on the routed Ethernet mesh network.

摘要翻译： 可以通过以太网网络上的路由系统以及由网络上的节点使用的算法的指示来广播对组播组成员的兴趣，以计算组播的分布树或树。 每个节点在接收到广告时将确定要用于生成多播树的算法，并且将使用该算法来计算是否在节点之间的路径上，广播广播上的共同兴趣。 示例算法可以包括最短路径算法和生成树算法。 这允许通过路由控制平面管理多播成员资格，同时使用生成树进程来转发组播流量。 由于生成树能够按服务安装多播状态，而不是每个服务的每个源，因此减少了在路由以太网网络上实现组播所需的转发状态量。

公开(公告)号：US20110128857A1

公开(公告)日：2011-06-02

申请号：US13023823

申请日：2011-02-09

申请人： Jerome Chiabaut ,  David Allan ,  Nigel Bragg ,  Peter Ashwood Smith

发明人： Jerome Chiabaut ,  David Allan ,  Nigel Bragg ,  Peter Ashwood Smith

IPC分类号： H04L12/26

CPC分类号： H04L45/12 ,  H04L45/00 ,  H04L45/22 ,  H04L45/24

摘要： A consistent tie-breaking decision between equal-cost shortest (lowest cost) paths is achieved by comparing an ordered set of node identifiers for each of a plurality of end-to-end paths. Alternatively, the same results can be achieved, on-the-fly, as a shortest path tree is constructed, by making a selection of an equal-cost path using the node identifiers of the diverging branches of the tree. Both variants allow a consistent selection to be made of equal-cost paths, regardless of where in the network the shortest paths are calculated. This ensures that traffic flow between any two nodes, in both the forward and reverse directions, will always follow the same path through the network.

摘要翻译： 通过比较多个端到端路径中的每一个的有序节点标识符集来实现等成本最短（最低成本）路径之间的一致的断开决定。 或者，通过使用树的分支分支的节点标识符选择等价路径，可以实时地实现与最短路径树相同的结果。 这两种变体允许对等成本路径进行一致的选择，而不管网络中哪些地方计算最短路径。 这确保任何两个节点之间在正向和反向方向上的业务流量将始终遵循通过网络的相同路径。

公开(公告)号：US07924836B2

公开(公告)日：2011-04-12

申请号：US12260558

申请日：2008-10-29

申请人： Jerome Chiabaut ,  David Allan ,  Nigel Bragg

发明人： Jerome Chiabaut ,  David Allan ,  Nigel Bragg

IPC分类号： H04L12/28

CPC分类号： H04L41/12 ,  H04L12/18 ,  H04L12/462 ,  H04L45/02 ,  H04L45/021 ,  H04L45/16 ,  H04L45/18 ,  H04L45/22 ,  H04L45/28 ,  H04L45/48

摘要： A method of installing forwarding state in a link state protocol controlled network node having a topology database representing a known topology of the network, and at least two ports for communication with corresponding peers of the network node. A unicast path is computed from the node to a second node in the network, using the topology database, and unicast forwarding state associated with the computed unicast path installed in a filtering database (FDB) of the node. Multicast forwarding state is removed for multicast trees originating at the second node if an unsafe condition is detected. Subsequently, a “safe” indication signal is advertised to each of the peers of the network node. The “safe” indication signal comprises a digest of the topology database. A multicast path is then computed from the network node to at least one destination node of a multicast tree originating at the second node. Finally, multicast forwarding state associated with the computed multicast path is installed in the filtering database (FDB) of the network node, when predetermined safe condition is satisfied.

摘要翻译： 一种在具有表示网络的已知拓扑的拓扑数据库的链路状态协议控制网络节点中安装转发状态的方法，以及用于与网络节点的相应对等体进行通信的至少两个端口。 使用拓扑数据库从网络中的节点到第二节点计算单播路径，以及与安装在节点的过滤数据库（FDB）中的计算的单播路径相关联的单播转发状态。 如果检测到不安全状况，则组播转发状态将被删除。 随后，向网络节点的每个对等体通告“安全”指示信号。 “安全”指示信号包括拓扑数据库的摘要。 然后，从网络节点计算多播路径到源于第二节点的多播树的至少一个目的地节点。 最后，当满足预定的安全条件时，安装在网络节点的过滤数据库（FDB）中与计算出的组播路径相关联的组播转发状态。

公开(公告)号：US08248925B2

公开(公告)日：2012-08-21

申请号：US12574872

申请日：2009-10-07

申请人： David Allan ,  Nigel Bragg ,  Jerome Chiabaut

发明人： David Allan ,  Nigel Bragg ,  Jerome Chiabaut

IPC分类号： G01R31/08

CPC分类号： H04L45/24 ,  H04L12/66 ,  H04L45/00 ,  H04L45/12 ,  H04L45/66

摘要： Each equal cost path is assigned a path ID created by concatenating an ordered set of link IDs which form the path through the network. The link IDs are created from the node IDs on either set of the link. The link IDs are sorted from lowest to highest when creating the path ID to facilitate ranking of the paths. The low and high ranked paths are selected from this ranked list as the first set of diverse paths through the network. Each of the link IDs on each of the paths is then renamed, for example by inverting either all of the high node IDs or low node IDs. After re-naming the links, new path IDs are created by concatenating an ordered set of renamed link IDs. The paths are then re-ranked and the low and high re-ranked paths are selected from this re-ranked list as the second set of diverse paths through the network. Selective naming of node IDs and use of different inversion functions can be exploited to further optimize distribution of traffic on the network.

摘要翻译： 为每个相等的成本路径指定了通过连接形成通过网络的路径的有序的链路ID组创建的路径ID。 链接ID是从链路的任一组上的节点ID创建的。 当创建路径ID以便于路径的排序时，链接ID从最低到最高排序。 从这个排名列表中选择低和高排名的路径作为通过网络的第一组不同路径。 然后，每个路径上的每个链路ID被重命名，例如通过反转所有高节点ID或低节点ID。 在链接重新命名之后，通过连接重命名的链接ID的有序集来创建新的路径ID。 然后将路径重新排序，并且从该重新排列的列表中选择低和高重新排序的路径作为通过网络的第二组不同路径。 可以利用节点ID的选择性命名和不同的反演功能的使用来进一步优化网络上的流量分配。

公开(公告)号：US08005016B2

公开(公告)日：2011-08-23

申请号：US12259650

申请日：2008-10-28

申请人： Jerome Chiabaut ,  David Allan ,  Nigel Bragg

发明人： Jerome Chiabaut ,  David Allan ,  Nigel Bragg

IPC分类号： H04L12/28

CPC分类号： H04L45/122 ,  H04L45/04 ,  H04L45/16 ,  H04L45/48 ,  H04L45/66

摘要： A method of multicast route computation in a link state protocol controlled network. A spanning tree is computed from a first node to every other node in the network using a known spanning tree protocol. The network is then divided into two or more partitions, each partition encompassing an immediate neighbor node of the first node and any nodes of the network subtending the neighbor node on the spanning tree. Two or more of the partitions are merged when a predetermined criterion is satisfied. Nodes within all of the partitions except a largest one of the partitions are then identified, and each identified node examined to identify node pairs for which a respective shortest path traverses the first node.

摘要翻译： 一种链路状态协议控制网络中组播路由计算的方法。 使用已知的生成树协议从网络中的第一节点到每个其他节点计算生成树。 然后将网络划分成两个或更多个分区，每个分区包含第一节点的直接邻居节点和对生成树上的邻居节点的网络的任何节点。 当满足预定标准时，两个或多个分区被合并。 然后识别除了最大分区之外的所有分区内的节点，并且检查每个识别的节点以识别相应的最短路径穿过第一节点的节点对。