公开(公告)号：US07177951B1

公开(公告)日：2007-02-13

申请号：US09625624

申请日：2000-07-26

申请人： Douglas Dykeman ,  Michael Osbourne ,  Paolo Scotton ,  Olen Stokes ,  Claude Basso ,  Marianne Aubry ,  Minh-Tri Do Khac

发明人： Douglas Dykeman ,  Michael Osbourne ,  Paolo Scotton ,  Olen Stokes ,  Claude Basso ,  Marianne Aubry ,  Minh-Tri Do Khac

IPC分类号： G06F15/16

CPC分类号： H04L29/12254 ,  H04L29/12009 ,  H04L29/12783 ,  H04L29/12801 ,  H04L41/0893 ,  H04L41/12 ,  H04L45/02 ,  H04L45/04 ,  H04L49/3081 ,  H04L61/2038 ,  H04L61/35 ,  H04L61/6004 ,  H04L2012/5621 ,  H04L2012/5627 ,  H04L2012/5685 ,  H04Q11/0478

摘要： Address management methods and apparatus are provided for a node serving as peer group leader for a peer group of nodes in one level of the hierarchy of a PNNI hierarchical network, whereby the peer group leader represents the peer group to one or more neighboring nodes in the next level up of the hierarchy. The peer group leader has a memory (2) for storing peer group topology data (4), comprising address data which is supplied to the peer group leader from nodes in the peer group and represents addresses for access by the network, and peer group leader topology data (5), comprising address data which is supplied to said neighboring nodes by the peer group leader and represents addresses accessible via the peer group. The address management method comprises: checking whether addresses represented by said address data are accessible via the peer group; notifying said neighboring nodes of changes in the accessibility of addresses so identified; and updating said peer group leader topology data (5) in accordance with said changes.

摘要翻译： 为PNNI分级网络的层级的一个级别中的对等组节点作为对等组组长的节点提供地址管理方法和装置，由此对等组组长表示对等体组到一个或多个相邻节点 下一级别的层次结构。 对等组组长具有用于存储对等组群拓扑数据（4）的存储器（2），包括从对等组中的节点提供给对等组组长的地址数据，表示网络接入的地址和对等组组长 拓扑数据（5），包括由对等组组长提供给所述相邻节点并且表示经由对等组可访问的地址的地址数据。 地址管理方法包括：检查由所述地址数据表示的地址是否可通过对等体组访问; 通知所述相邻节点对所识别的地址的可访问性的变化; 以及根据所述改变更新所述对等群组领导拓扑数据（5）。

公开(公告)号：US06370119B1

公开(公告)日：2002-04-09

申请号：US09036354

申请日：1998-03-06

申请人： Claude Basso ,  Paolo Scotton

发明人： Claude Basso ,  Paolo Scotton

IPC分类号： G01R3108

CPC分类号： H04L45/14 ,  H04L45/12 ,  H04L45/123 ,  H04L45/124

摘要： A method and system is described for determining the optimal path for routing a communication in a communication network between a source node and at least one destination node. The determination is based upon evaluation of the path offering the widest bandwidth in the direction of data transmission, the lowest additive cost, and the lowest hop count. Each link of the network is associated with at least a restrictive cost and an additive cost reflecting selected link characteristics. A path is characterized by a restrictive cost and an additive cost derived from the link costs of its component links. A connection to be routed identifies a source node, a destination node and a maximum restrictive cost allowed for routing the connection. All acceptable paths from the source node to all the other nodes of the network are determined and stored. These paths deemed acceptable and are stored if they have the lowest restrictive cost that allows the routing of the connection, and if they have the lowest additive cost and minimum hop count. Finally, from the plurality of stored acceptable paths, the path that originates from the source node and terminates at the destination node is selected as the optimal path to route the connection.

摘要翻译： 描述了一种方法和系统，用于确定用于在源节点和至少一个目的地节点之间的通信网络中路由通信的最佳路径。 该决定是基于在数据传输方向上提供最宽带宽的路径评估，最低附加成本和最低跳数。 网络的每个链路至少具有限制性成本和反映所选链路特征的附加成本。 路径的特征在于限制性成本和来自其组件链路的链路成本的附加成本。 要路由的连接标识源节点，目的地节点和允许路由连接的最大限制性成本。 确定并存储从源节点到网络的所有其他节点的所有可接受的路径。 这些路径被认为是可接受的，并且如果它们具有允许连接路由的限制性成本最低，并且如果它们具有最低的附加成本和最小跳数，则被存储。 最后，从多个存储的可接受路径中，选择源自源节点并终止于目的节点的路径作为路由连接的最佳路径。

公开(公告)号：US6104715A

公开(公告)日：2000-08-15

申请号：US974285

申请日：1997-11-19

申请人： Claude Basso ,  Richard H. Boivie ,  Jean L. Calvignac ,  Douglas Dykeman ,  Daniel Orsatti ,  Robert A. Sultan ,  Fabrice J. Verplanken

发明人： Claude Basso ,  Richard H. Boivie ,  Jean L. Calvignac ,  Douglas Dykeman ,  Daniel Orsatti ,  Robert A. Sultan ,  Fabrice J. Verplanken

IPC分类号： H04L12/56 ,  H04Q11/04

CPC分类号： H04L49/3081 ,  H04Q11/0478 ,  H04L2012/5648

摘要： This invention relates to the merging of data cells arriving at an Asynchronous Transfer Mode (ATM) switching node from data frames originating with a number of senders. As is standard in ATM networks, each originating frame is segmented into a series of cells each having Virtual Path Identifier (VPI) and a Virtual Channel Identifier (VCI) in its header portion. On arrival at each switching node, the VCI of the first cell of a frame is overwritten by a new outgoing VCI value that is used for all other cells of the frame. Thus, the actual movement of each cell through the network is controlled only by the cell's VPI, whereas the VCI field is used only to distinguish frames from each other. A feature of the invention is that it can accommodate Early Packet Discard in a simple way by associated any discard indication determined for a frame with the outgoing VCI value which also applies to all cells of the entire frame.

摘要翻译： 本发明涉及到达异码传输模式（ATM）交换节点的数据单元与源自多个发送者的数据帧的合并。 如ATM网络中的标准，每个始发帧被分段成一系列小区，每个小区在其报头部分中具有虚拟路径标识符（VPI）和虚拟信道标识符（VCI）。 在到达每个交换节点时，帧的第一个单元的VCI被用于帧的所有其他单元的新的输出VCI值覆盖。 因此，通过网络的每个小区的实际移动仅由小区的VPI控制，而VCI字段仅用于将帧彼此区分开。 本发明的一个特征在于，它可以通过相关联的任何丢弃指示来适应早期分组丢弃，所述丢弃指示对于具有输出VCI值的帧也是适用于整个帧的所有小区。

公开(公告)号：US07573885B1

公开(公告)日：2009-08-11

申请号：US09633767

申请日：2000-08-07

申请人： Harold Douglas Dykeman ,  Paolo Michele Scotton ,  Claude Basso ,  Philippe Damon

发明人： Harold Douglas Dykeman ,  Paolo Michele Scotton ,  Claude Basso ,  Philippe Damon

IPC分类号： H04L12/28

CPC分类号： H04L45/22 ,  H04L45/00 ,  H04L45/04 ,  H04L45/06 ,  H04L45/1283 ,  H04L45/28

摘要： Methods and apparatus are provided for alternative routing of a connection between a source node and a destination node in a PNNI hierarchical network. The alternative routing method comprises responding to a failed connection between said nodes due to a sole-access element of the network structure as seen by the source node, where a said sole-access element is an element which provides sole access to the destination node in said network structure, by: selecting at least one non-sole-access element of the route used by the failed connection in said network structure; identifying an alternative route for the connection in said network structure which does not utilize the at least one selected element; and using the alternative route for establishment of the connection between said nodes.

摘要翻译： 提供了用于在PNNI分层网络中的源节点和目的地节点之间的连接的替代路由的方法和装置。 替代路由方法包括由于源节点所看到的网络结构的唯一接入元件，响应所述节点之间的故障连接，其中所述唯一接入元件是提供对目的地节点的唯一接入的元素 所述网络结构通过：在所述网络结构中选择由所述故障连接使用的路由的至少一个非唯一接入元件; 识别所述网络结构中不利用所述至少一个所选元素的所述连接的替代路由; 并且使用替代路由来建立所述节点之间的连接。

公开(公告)号：US09571502B2

公开(公告)日：2017-02-14

申请号：US13616256

申请日：2012-09-14

申请人： Claude Basso ,  Natarajan Vaidhyanathan ,  Colin B. Verrilli

发明人： Claude Basso ,  Natarajan Vaidhyanathan ,  Colin B. Verrilli

IPC分类号： G06F15/173 ,  H04L29/06 ,  H04L12/00

CPC分类号： H04L63/101 ,  H04L12/00 ,  H04L29/06823

摘要： Access control lists (ACLs) permit network administrators to manage network traffic flowing through a networking element to optimize network security, performance, quality of service (QoS), and the like. If a networking element has multiple ACLs directed towards different types of network optimization, each ACL may return a separate action set that identifies one or more actions the networking element should perform based on a received frame. In some cases, these action sets may conflict. To resolve the conflicts, a networking element may include resolution logic that selects one of the conflicting actions based on a predefined precedence value assigned to each action in an action set. By comparing the different precedence values, the resolution logic generates a new action set based on the actions with the highest precedence value.

摘要翻译： 访问控制列表（ACL）允许网络管理员管理流经网络元件的网络流量，以优化网络安全性，性能，服务质量（QoS）等。 如果网络元件具有针对不同类型的网络优化的多个ACL，则每个ACL可以返回单独的动作集合，其识别基于接收到的帧的网络元件应该执行的一个或多个动作。 在某些情况下，这些操作集可能会发生冲突。 为了解决冲突，网络元件可以包括分辨率逻辑，其基于分配给动作集中的每个动作的预定义优先级值来选择冲突动作之一。 通过比较不同的优先级值，分辨率逻辑基于具有最高优先级值的动作生成新的动作集。

公开(公告)号：US08942095B2

公开(公告)日：2015-01-27

申请号：US13302489

申请日：2011-11-22

申请人： Francois Abel ,  Claude Basso ,  Jean L. Calvignac ,  Natarajan Vaidhyanathan ,  Fabrice Jean Verplanken ,  Colin B. Verrilli

发明人： Francois Abel ,  Claude Basso ,  Jean L. Calvignac ,  Natarajan Vaidhyanathan ,  Fabrice Jean Verplanken ,  Colin B. Verrilli

IPC分类号： H04L12/54 ,  H04L12/851 ,  H04L29/06

CPC分类号： H04L47/2441 ,  H04L69/22

摘要： A method, a system, and a computer program product is disclosed for identifying a quality of service (QoS) classification of a packet in a network by a network processor. The method comprising: providing a table wherein a priority value with a maximum of N values is used as an index into the table to retrieve a QoS classification having a maximum of M values with M less than N; receiving a data packet in a stream of data packets; extracting at least two priority indicator values from the packet; converting the at least two priority indicator values into a priority value; utilizing the priority value as an index into the table; extracting the entry in the table corresponding to the priority value as the QoS classification of the packet; and utilizing the QoS classification for subsequent processing of the data packet.

摘要翻译： 公开了一种方法，系统和计算机程序产品，用于通过网络处理器来识别网络中的分组的服务质量（QoS）分类。 该方法包括：提供一个表，其中将具有最大N个值的优先级值用作表中的索引以检索具有M小于N的最大M个值的QoS分类; 在数据包流中接收数据包; 从分组中提取至少两个优先级指示符值; 将所述至少两个优先级指示符值转换为优先级值; 利用优先级值作为表中的索引; 提取对应于优先级值的表中的条目作为分组的QoS分类; 并利用QoS分类来对数据分组进行后续处理。

公开(公告)号：US08913620B2

公开(公告)日：2014-12-16

申请号：US13420203

申请日：2012-03-14

申请人： Claude Basso ,  Todd A. Greenfield ,  Bruce M. Walk

发明人： Claude Basso ,  Todd A. Greenfield ,  Bruce M. Walk

IPC分类号： H04L12/28 ,  H04L1/00 ,  H04L12/66 ,  H04H20/71 ,  H04J3/16 ,  H04J3/24 ,  H04J3/26 ,  G06F15/173 ,  H04W72/00

CPC分类号： H04L45/16 ,  H04L49/201 ,  H04L49/351 ,  H04L49/70

摘要： A distributed switch may include a hierarchy with one or more levels of surrogate sub-switches (and surrogate bridge elements) that enable the distributed switch to scale bandwidth based on the size of the membership of a multicast group. When a sub-switch receives a multicast data frame, it forwards the packet to one of the surrogate sub-switches. Each surrogate sub-switch may then forward the packet to another surrogate in a different hierarchical level or to a destination computing device. Because the surrogates may transmit the data frame in parallel using two or more connection interfaces, the bandwidth used to forward the multicast packet increases for each surrogate used.

摘要翻译： 分布式交换机可以包括具有使得分布式交换机能够基于多播组的成员资格的大小来缩放带宽的代理子交换机（和代理桥元素）的一个或多个级别的层级。 当子交换机接收到组播数据帧时，它将数据包转发到其中一个代理子交换机。 然后，每个代理子交换机可以将分组转发到不同层级的另一个代理或转发到目的地计算设备。 由于代理可以使用两个或多个连接接口并行传输数据帧，所以用于转发组播数据包的带宽随着使用的每个代理而增加。

公开(公告)号：US08891535B2

公开(公告)日：2014-11-18

申请号：US13352973

申请日：2012-01-18

申请人： Debra L. Angst ,  Claude Basso ,  Josep Cors ,  Rekha Mundhra ,  Natarajan Vaidhyanathan

发明人： Debra L. Angst ,  Claude Basso ,  Josep Cors ,  Rekha Mundhra ,  Natarajan Vaidhyanathan

IPC分类号： H04L12/28 ,  G06F15/173 ,  H04L12/44 ,  H04L12/751 ,  H04L12/801 ,  H04L12/24 ,  H04L12/931

CPC分类号： H04L12/44 ,  H04L12/18 ,  H04L12/4625 ,  H04L41/12 ,  H04L45/02 ,  H04L45/16 ,  H04L45/54 ,  H04L47/15 ,  H04L49/201 ,  H04L49/65 ,  H04L69/28

摘要： Apparatuses and methods to manage a global forwarding table in a distributed switch are provided. A particular method may include managing a global forwarding table in a distributed switch. The distributed switch may include a plurality of switch forwarding units. The method may start a timer for an entry in the global forwarding table, and the entry may include a multicast destination address and corresponding multicast membership information. The method may also, in response to expiration of the timer of the entry, check at least one hit status to determine whether at least one switch forwarding unit of the plurality of switch forwarding units has forwarded multicast data to the corresponding multicast membership information of the multicast destination address of the entry. The method may further determine whether the entry is a cast-out candidate based on the hit status.

摘要翻译： 提供了在分布式交换机中管理全局转发表的设备和方法。 特定方法可以包括管理分布式交换机中的全局转发表。 分布式交换机可以包括多个交换机转发单元。 该方法可以启动全局转发表中的条目的定时器，并且该条目可以包括多播目的地地址和相应的多播成员资格信息。 该方法还可以响应于条目的定时器的到期来检查至少一个命中状态，以确定多个交换机转发单元中的至少一个交换机转发单元是否已经将多播数据转发到相应的组播成员信息 组播目的地址。 该方法还可以基于命中状态进一步确定该条目是否是舍弃候选者。

公开(公告)号：US20140082168A1

公开(公告)日：2014-03-20

申请号：US13616256

申请日：2012-09-14

申请人： Claude Basso ,  Natarajan Vaidhyanathan ,  Colin B. Verrilli

发明人： Claude Basso ,  Natarajan Vaidhyanathan ,  Colin B. Verrilli

IPC分类号： G06F15/173

CPC分类号： H04L63/101 ,  H04L12/00 ,  H04L29/06823

摘要： Access control lists (ACLs) permit network administrators to manage network traffic flowing through a networking element to optimize network security, performance, quality of service (QoS), and the like. If a networking element has multiple ACLs directed towards different types of network optimization, each ACL may return a separate action set that identifies one or more actions the networking element should perform based on a received frame. In some cases, these action sets may conflict. To resolve the conflicts, a networking element may include resolution logic that selects one of the conflicting actions based on a predefined precedence value assigned to each action in an action set. By comparing the different precedence values, the resolution logic generates a new action set based on the actions with the highest precedence value.

摘要翻译： 访问控制列表（ACL）允许网络管理员管理流经网络元件的网络流量，以优化网络安全性，性能，服务质量（QoS）等。 如果网络元件具有针对不同类型的网络优化的多个ACL，则每个ACL可以返回单独的动作集合，其识别基于接收到的帧的网络元件应该执行的一个或多个动作。 在某些情况下，这些操作集可能会发生冲突。 为了解决冲突，网络元件可以包括分辨率逻辑，其基于分配给动作集中的每个动作的预定义优先级值来选择冲突动作之一。 通过比较不同的优先级值，分辨率逻辑基于具有最高优先级值的动作生成新的动作集。

公开(公告)号：US20140064277A1

公开(公告)日：2014-03-06

申请号：US13597784

申请日：2012-08-29

申请人： Claude Basso ,  David A. Shedivy ,  Colin B. Verrilli ,  Bruce M. Walk ,  Daniel Wind

发明人： Claude Basso ,  David A. Shedivy ,  Colin B. Verrilli ,  Bruce M. Walk ,  Daniel Wind

IPC分类号： H04L12/56

CPC分类号： H04L45/44 ,  H04L45/7453

摘要： Techniques are provided for hash-based routing table management in a distributed network switch. A frame having a source address and a destination address is received. If no routing entry for the source address is found in a routing table of a switch module in the distributed network switch, where the routing table is divided into slices of buckets, then routing information is determined for the source address and a routing entry is generated. The routing table is modified to include the routing entry and based on a set of hash functions and properties of the slices.