公开(公告)号：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.

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

公开(公告)号：US20120219288A1

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

申请号：US13220318

申请日：2011-08-29

申请人： Kim B. Roberts ,  Jerome Chiabaut

发明人： Kim B. Roberts ,  Jerome Chiabaut

IPC分类号： H04B17/00

CPC分类号： H04J3/14 ,  H04J3/0605 ,  H04J3/0623 ,  H04J3/1611 ,  H04J3/1617 ,  H04L1/0002 ,  H04L1/0017

摘要： Link bandwidth is varied based on the subscriber traffic load. Varying the link bandwidth has the effect of varying the actual noise margin of the link (in an inverse elation), so that the noise margin will vary inversely with the traffic load. A beneficial result is that, because the noise margin is increased during “off-peak” traffic periods, rapidly varying and burst impairments can be absorbed without causing data loss. In effect, the respective probability distributions of error bursts and traffic load are separated. Data loss only becomes a significant risk when peaks in both distributions coincide. However, the probability of that event occurring is comparatively low. This enables a lower noise margin allocation during design of the link, which dramatically reduces the link cost.

摘要翻译： 链路带宽根据用户流量负载而变化。 改变链路带宽具有改变链路的实际噪声容限（反向相关）的效果，使得噪声容限将与业务负载成反比变化。 有利的结果是，由于在“非高峰”运行期间噪声容限增加，所以可以在不造成数据丢失的情况下吸收快速变化和爆发损伤。 实际上，错误突发和业务负载的各自的概率分布被分离。 数据丢失仅在两个分布的峰值一致时才成为重大风险。 然而，事件发生的概率相对较低。 这使得在链路设计期间能够进行更低的噪声容限分配，这显着降低了链路成本。

公开(公告)号：US08009985B1

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

申请号：US10436129

申请日：2003-05-13

申请人： Kim B. Roberts ,  Jerome Chiabaut

发明人： Kim B. Roberts ,  Jerome Chiabaut

IPC分类号： H04J14/00

CPC分类号： H04J3/14 ,  H04J3/0605 ,  H04J3/0623 ,  H04J3/1611 ,  H04J3/1617 ,  H04L1/0002 ,  H04L1/0017

摘要： Link bandwidth is varied based on the subscriber traffic load. Varying the link bandwidth has the effect of varying the actual noise margin of the link (in an inverse relation), so that the noise margin will vary inversely with the traffic load. A beneficial result is that, because the noise margin is increased during “off-peak” traffic periods, rapidly varying and burst impairments can be absorbed without causing data loss. In effect, the respective probability distributions of error bursts and traffic load are separated. Data loss only becomes a significant risk when peaks in both distributions coincide. However, the probability of that event occurring is comparatively low. This enables a lower noise margin allocation during design of the link, which dramatically reduces the link cost.

摘要翻译： 链路带宽根据用户流量负载而变化。 改变链路带宽具有改变链路的实际噪声容限（反向关系）的效果，使得噪声容限将与业务负载成反比变化。 有利的结果是，由于在“非高峰”运行期间噪声容限增加，所以可以在不造成数据丢失的情况下吸收快速变化和爆发损伤。 实际上，错误突发和业务负载的各自的概率分布被分离。 数据丢失仅在两个分布的峰值一致时才成为重大风险。 然而，事件发生的概率相对较低。 这使得在链路设计期间能够进行更低的噪声容限分配，这显着降低了链路成本。

公开(公告)号：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.

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

公开(公告)号：US08861335B2

公开(公告)日：2014-10-14

申请号：US13586620

申请日：2012-08-15

申请人： Liam Casey ,  David Allan ,  Nigel L. Bragg ,  Jerome Chiabaut ,  Peter Ashwood Smith

发明人： Liam Casey ,  David Allan ,  Nigel L. Bragg ,  Jerome Chiabaut ,  Peter Ashwood Smith

IPC分类号： G01R31/08

CPC分类号： H04L41/0654 ,  H04L12/66 ,  H04L45/02 ,  H04L45/22 ,  H04L45/245 ,  H04L45/48 ,  H04L45/74 ,  H04L47/41 ,  H04L2212/00 ,  Y02D50/30

摘要： A system for interfacing a client system in a first network domain with a Provider Link State Bridging (PLSB) domain includes at least two Backbone Edge Bridges (BEBs) of the PLSB domain. Each BEB is an end-point of a connection in the first network domain to the client system and an end-point of at least a unicast path in the PLSB domain. An inter-node trunk is provided in the PLSB domain for interconnecting the BEBs. A phantom node is defined in the PLSB domain and is notionally located on the inter-node trunk. Each of the BEBs is configured such that: an ingress packet received from the client system via the connection in the first network domain is forwarded through a path notionally rooted at the phantom node; and an egress packet destined for the client system is forwarded to the client system through the connection in the first network domain.

摘要翻译： 用于将第一网络域中的客户端系统与提供者链路状态桥接（PLSB）域接口的系统包括至少两个PLSB域的骨干边缘桥（BEB）。 每个BEB是第一网络域中的客户端系统的连接端点和PLSB域中至少一个单播路径的端点。 在PLSB域中提供节点间中继以互连BEB。 在PLSB域中定义了虚拟节点，并且概念上位于节点间中继线上。 每个BEB被配置为使得经由第一网络域中的连接从客户端系统接收的入口分组通过一个有意识地根植于虚拟节点的路径转发; 并且去往客户端系统的出口分组通过第一网络域中的连接被转发到客户端系统。

公开(公告)号：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。 然后将路径重新排列，并且从该重新排列的列表中选择低和高重新排序的路径作为第二组不同路径。

公开(公告)号：US20100020797A1

公开(公告)日：2010-01-28

申请号：US12575190

申请日：2009-10-07

申请人： Liam M. CASEY ,  David Ian ALLAN ,  Nigel Lawrence BRAGG ,  Jerome CHIABAUT

发明人： Liam M. CASEY ,  David Ian ALLAN ,  Nigel Lawrence BRAGG ,  Jerome CHIABAUT

IPC分类号： H04L12/56

CPC分类号： H04L12/462 ,  H04L12/4641 ,  H04L45/02 ,  H04L45/026 ,  H04L45/04 ,  H04L45/16 ,  H04L45/18 ,  H04L45/66

摘要： A method ensures that multicast packets follow the same loop-free path followed by unicast packets in a packet communication network. The communication network includes at least one first area interconnected through at least one area border node (“ABN”) to a second area. Each ABN has a first level port connected to each first area and a second level port connected to the second area. Each multicast packet forwarded includes a header having a root-id identifying a root of a multicast tree. A data packet is received at an ABN. Responsive to receiving a multicast packet at a second level port of an area border node, the root-id of the multicast packet is examined and if the multicast packet is to be forwarded over at least one of the first level ports, a different root-id is substituted into the packet before the packet is forwarded over the first level port.

摘要翻译： 一种方法可以确保组播数据包遵循相同的无循环路径，随后是分组通信网络中的单播数据包。 通信网络包括通过至少一个区域边界节点（“ABN”）互连到第二区域的至少一个第一区域。 每个ABN具有连接到每个第一区域的第一级端口和连接到第二区域的第二级端口。 转发的每个组播数据包包括一个具有标识多播树根的根ID的报头。 在ABN处接收数据分组。 响应于在区域边界节点的第二级端口处接收到组播数据包，检查组播数据包的根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）中与计算出的组播路径相关联的组播转发状态。

公开(公告)号：US20050226219A1

公开(公告)日：2005-10-13

申请号：US10822427

申请日：2004-04-12

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

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

IPC分类号： H04L12/28 ,  H04L12/56 ,  H04M7/00

CPC分类号： H04L47/365 ,  H04L47/10 ,  H04L47/14 ,  H04L47/283 ,  H04L65/80 ,  H04W28/06 ,  H04W76/10 ,  H04W84/12 ,  H04W88/08

摘要： A system for increasing the call capacity of an access point in a WLAN, allowing the number of WLAN phones that can be supported to be increased. The system determines whether a maximum total voice path delay would be exceeded if the packetization delay is increased for packets in a call. In the event that the packetization delay can be increased without the total delay exceeding the maximum delay, the disclosed system increases the size of packets used in the call, if all participating devices can process the increased packet size. The maximum delay may be predetermined, and reflect a maximum delay that cannot be exceeded without adversely impacting the voice quality of a call. If the two end points for a call are determined to be physically “local” to each other, packetization delay for the call may be increased based on the assumption that the increased packetization delay will not decrease the voice quality of the call.

摘要翻译： 用于增加WLAN中接入点的呼叫容量的系统，允许增加可支持的WLAN电话的数量。 如果呼叫中的分组的分组化延迟增加，则系统确定是否将超过最大总话音路径延迟。 如果可以增加分组化延迟而没有超过最大延迟的总延迟，则所公开的系统增加了呼叫中使用的分组的大小，如果所有参与的设备都可以处理增加的分组大小。 最大延迟可以是预定的，并且反映不能超过的最大延迟，而不会不利地影响呼叫的语音质量。 如果呼叫的两个端点被确定为彼此物理上“本地”，则可以基于增加的分组化延迟不会降低呼叫的语音质量的假设来增加呼叫的分组化延迟。