公开(公告)号：US08040906B2

公开(公告)日：2011-10-18

申请号：US12490187

申请日：2009-06-23

申请人： Abel Dasylva ,  Delfin Montuno ,  Peter Ashwood Smith ,  Francois Blouin ,  Tadeusz Drwiega

发明人： Abel Dasylva ,  Delfin Montuno ,  Peter Ashwood Smith ,  Francois Blouin ,  Tadeusz Drwiega

IPC分类号： H04L12/28

CPC分类号： H04L45/122 ,  H04L12/185 ,  H04L45/02 ,  H04L45/12 ,  H04L45/16 ,  H04L45/48

摘要： A set of critical nodes or links is identified on the network through which most of the shortest paths on the network occur. Each node compares their distance to end points on the network with a distance between the end points and each of the distinct critical nodes. Where the distance between the end points and the critical nodes is shorter than the distance between the end points and the node, the node is not on the shortest path and does not install forwarding state. Where the distance between the end points and the critical node is larger than or equal to the distance between the end points and the node, the node may be on the shortest path between the pair of end nodes and installs forwarding state. Installation of forwarding state may cause packet duplication, but determining forwarding state is dramatically simplified. The level of duplication may be reduced by selecting a larger number of critical nodes on the network.

摘要翻译： 在网络上识别出一组关键节点或链路，通过该关键节点或链路，网络上的大多数最短路径都会发生。 每个节点将其距离与网络上的终点进行比较，并在终点与每个不同关键节点之间建立距离。 终点与关键节点之间的距离短于端点与节点之间的距离，节点不在最短路径上，不会安装转发状态。 在端点和关键节点之间的距离大于或等于端点和节点之间的距离的情况下，节点可以在一对端节点之间的最短路径上，并安装转发状态。 转发状态的安装可能会导致数据包复制，但是显着地简化了确定转发状态。 可以通过在网络上选择更多的关键节点来减少重复级别。

公开(公告)号：US20120033552A1

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

申请号：US13250034

申请日：2011-09-30

申请人： Abel Dasylva ,  Delfin Montuno ,  Peter Ashwood Smith ,  Francois Blouin ,  Tadeusz Drwiega

发明人： Abel Dasylva ,  Delfin Montuno ,  Peter Ashwood Smith ,  Francois Blouin ,  Tadeusz Drwiega

IPC分类号： H04L12/26

CPC分类号： H04L45/122 ,  H04L12/185 ,  H04L45/02 ,  H04L45/12 ,  H04L45/16 ,  H04L45/48

摘要： A set of critical nodes or links is identified on the network through which most of the shortest paths on the network occur. Each node compares their distance to end points on the network with a distance between the end points and each of the distinct critical nodes. Where the distance between the end points and the critical nodes is shorter than the distance between the end points and the node, the node is not on the shortest path and does not install forwarding state. Where the distance between the end points and the critical node is larger than or equal to the distance between the end points and the node, the node may be on the shortest path between the pair of end nodes and installs forwarding state. Installation of forwarding state may cause packet duplication, but determining forwarding state is dramatically simplified.

摘要翻译： 在网络上识别出一组关键节点或链路，通过该关键节点或链路，网络上的大多数最短路径都会发生。 每个节点将其距离与网络上的终点进行比较，并在终点与每个不同关键节点之间建立距离。 终点与关键节点之间的距离短于端点与节点之间的距离，节点不在最短路径上，不会安装转发状态。 在端点和关键节点之间的距离大于或等于端点和节点之间的距离的情况下，节点可以在一对端节点之间的最短路径上，并安装转发状态。 转发状态的安装可能会导致数据包复制，但是显着地简化了确定转发状态。

公开(公告)号：US08605628B2

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

申请号：US13250034

申请日：2011-09-30

申请人： Abel Dasylva ,  Delfin Montuno ,  Peter Ashwood Smith ,  Francois Blouin ,  Tadeusz Drwiega

发明人： Abel Dasylva ,  Delfin Montuno ,  Peter Ashwood Smith ,  Francois Blouin ,  Tadeusz Drwiega

IPC分类号： H04L12/28 ,  H04J1/16

CPC分类号： H04L45/122 ,  H04L12/185 ,  H04L45/02 ,  H04L45/12 ,  H04L45/16 ,  H04L45/48

摘要： A set of critical nodes or links is identified on the network through which most of the shortest paths on the network occur. Each node compares their distance to end points on the network with a distance between the end points and each of the distinct critical nodes. Where the distance between the end points and the critical nodes is shorter than the distance between the end points and the node, the node is not on the shortest path and does not install forwarding state. Where the distance between the end points and the critical node is larger than or equal to the distance between the end points and the node, the node may be on the shortest path between the pair of end nodes and installs forwarding state. Installation of forwarding state may cause packet duplication, but determining forwarding state is dramatically simplified.

摘要翻译： 在网络上识别出一组关键节点或链路，通过该关键节点或链路，网络上的大多数最短路径都会发生。 每个节点将其距离与网络上的终点进行比较，并在终点与每个不同关键节点之间建立距离。 终点与关键节点之间的距离短于端点与节点之间的距离，节点不在最短路径上，不会安装转发状态。 在端点和关键节点之间的距离大于或等于端点和节点之间的距离的情况下，节点可以在一对端节点之间的最短路径上，并安装转发状态。 转发状态的安装可能会导致数据包复制，但是显着地简化了确定转发状态。

公开(公告)号：US20100322244A1

公开(公告)日：2010-12-23

申请号：US12490187

申请日：2009-06-23

申请人： Abel Dasylva ,  Delfin Montuno ,  Peter Ashwood Smith ,  Francois Blouin ,  Tadeusz Drwiega

发明人： Abel Dasylva ,  Delfin Montuno ,  Peter Ashwood Smith ,  Francois Blouin ,  Tadeusz Drwiega

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

CPC分类号： H04L45/122 ,  H04L12/185 ,  H04L45/02 ,  H04L45/12 ,  H04L45/16 ,  H04L45/48

摘要： A set of critical nodes or links is identified on the network through which most of the shortest paths on the network occur. Each node compares their distance to end points on the network with a distance between the end points and each of the distinct critical nodes. Where the distance between the end points and the critical nodes is shorter than the distance between the end points and the node, the node is not on the shortest path and does not install forwarding state. Where the distance between the end points and the critical node is larger than or equal to the distance between the end points and the node, the node may be on the shortest path between the pair of end nodes and installs forwarding state. Installation of forwarding state may cause packet duplication, but determining forwarding state is dramatically simplified. The level of duplication may be reduced by selecting a larger number of critical nodes on the network.

摘要翻译： 在网络上识别出一组关键节点或链路，通过该关键节点或链路，网络上的大多数最短路径都会发生。 每个节点将其距离与网络上的终点进行比较，并在终点与每个不同关键节点之间建立距离。 终点与关键节点之间的距离短于端点与节点之间的距离，节点不在最短路径上，不会安装转发状态。 在端点和关键节点之间的距离大于或等于端点和节点之间的距离的情况下，节点可以在一对端节点之间的最短路径上，并安装转发状态。 转发状态的安装可能会导致数据包复制，但是显着地简化了确定转发状态。 可以通过在网络上选择更多的关键节点来减少重复级别。

公开(公告)号：US08330601B2

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

申请号：US11525298

申请日：2006-09-22

申请人： Peter Ashwood Smith ,  Delfin Y. Montuno ,  Abel Dasylva

发明人： Peter Ashwood Smith ,  Delfin Y. Montuno ,  Abel Dasylva

IPC分类号： G08B13/14

CPC分类号： G08B13/2428 ,  G01S5/0247 ,  G01S13/758 ,  G06K7/10079 ,  G06K19/07749 ,  G06K19/07767 ,  G06K2017/0045

摘要： Three dimensional RF tag signatures may be obtained from a three dimensional RF tag or multiple two or three dimensional RF tags so that information in addition to presence information may be obtained. In one embodiment, a three dimensional RF tag having two or more power coils disposed in non-coplanar planes enables the coils to experience different levels of excitation from an electromagnetic field. This information may be transmitted along with the RF tag response to enable the orientation of the RF tag relative to an RF tag reader to be determined. In another embodiment, multiple RF tags (either standard RF tags or three dimensional RF tags) may be used on a given article and a response signature from the article as a whole may be recorded. The three dimensional response signature thus collected may be compared with previous versions of the response signature to determine if the article has been altered.

摘要翻译： 可以从三维RF标签或多个二维或三维RF标签获得三维RF标签签名，使得可以获得除存在信息之外的信息。 在一个实施例中，具有设置在非共面平面中的两个或更多个功率线圈的三维RF标签使得线圈能够经历来自电磁场的不同激励水平。 该信息可以与RF标签响应一起发送，以使RF标签相对于RF标签读取器的取向得以确定。 在另一个实施例中，可以在给定物品上使用多个RF标签（标准RF标签或三维RF标签），并且可以记录来自整个物品的响应签名。 如此收集的三维响应签名可以与响应签名的先前版本进行比较，以确定文章是否已被更改。

公开(公告)号：US08565244B2

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

申请号：US12334013

申请日：2008-12-12

申请人： Nigel L. Bragg ,  David Allan ,  Peter Ashwood Smith ,  Paul Ungehagen

发明人： Nigel L. Bragg ,  David Allan ,  Peter Ashwood Smith ,  Paul Ungehagen

IPC分类号： H04L12/28

CPC分类号： H04L45/12 ,  H04L12/4625 ,  H04L45/22 ,  H04L45/28 ,  H04L47/125

摘要： A method of peer interfacing a Link-State controlled network domain with an Ethernet Bridging controlled network domain. A pair of peer attachment points are provided between the Link-State controlled network domain and the Ethernet Bridging domain. The peer attachment points are respective endpoints of a set of one or more LAN segments defined within the Ethernet Bridging domain. The set of LAN segments are represented as a virtual node in the Link-State controlled network domain. The virtual node is represented in the Link-State controlled network domain as connected to each of the peer attachment points via a respective virtual link. The virtual links are configured such that frames to or from an address in the Link-State controlled network domain are forwarded over a tree passing through only one of the peer attachments points.

公开(公告)号：US20120307625A1

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

申请号：US13588126

申请日：2012-08-17

申请人： Ravi Ravindran ,  Peter Ashwood Smith ,  Hong Zhang

发明人： Ravi Ravindran ,  Peter Ashwood Smith ,  Hong Zhang

IPC分类号： H04L12/437 ,  H04L12/24 ,  H04L12/42

CPC分类号： H04L45/12 ,  H04L41/06 ,  H04L45/00 ,  H04L45/02 ,  H04L45/123 ,  H04L45/18 ,  H04L45/22 ,  H04L45/28

摘要： A weighting process may be used to select between alternate neighbors in a RAPID calculation to enable policy and/or traffic engineering considerations to affect the selection of an alternate path through the network. The information used to weight the neighbors may static administratively assigned weighting information or dynamic weighting information such as local statistical traffic condition information. The process may take into account the amount of traffic being handled by the current primary next hop for the destination, the available capacity of the available alternate neighbors, the ability of the alternate neighbors to handle the additional traffic, and other considerations. Weighting may occur after a set of available loop free alternate neighbors has been determined. Alternatively, weighting may occur before the RAPID calculation has been performed to cause the neighbors to be ordered prior to RAPID processing. This may enable RAPID calculation to stop without considering all available neighbors.

摘要翻译： 可以使用加权过程来在RAPID计算中的备选邻居之间进行选择，以使策略和/或流量工程注意事项能够影响通过网络的备用路径的选择。 用于加权邻居的信息可以静态地管理地分配加权信息或动态加权信息，例如本地统计交通状况信息。 该过程可以考虑由目的地的当前主要下一跳处理的业务量，可用备用邻居的可用容量，备用邻居处理附加业务的能力以及其他考虑。 在确定了一组可用的无环路交替邻居之后，可能会发生加权。 或者，可以在执行RAPID计算之前进行加权，以使得在RAPID处理之前对邻居进行排序。 这可能使RAPID计算停止，而不考虑所有可用的邻居。

公开(公告)号：US08194668B2

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

申请号：US12196909

申请日：2008-08-22

申请人： Robert Friskney ,  Nigel Bragg ,  Simon Parry ,  Peter Ashwood Smith ,  David Allan ,  Simon Brueckheimer

发明人： Robert Friskney ,  Nigel Bragg ,  Simon Parry ,  Peter Ashwood Smith ,  David Allan ,  Simon Brueckheimer

IPC分类号： H04L12/28

CPC分类号： H04L41/0823 ,  H04L12/4645 ,  H04L45/00 ,  H04L45/16 ,  H04L45/54 ,  H04L45/64 ,  H04L45/66 ,  H04L45/72 ,  H04L49/205 ,  H04L49/253 ,  H04L49/254 ,  H04L49/351 ,  H04L49/354

摘要： The invention relates to enabling differential forwarding in address-based carrier networks such as Ethernet networks. There is described a method of and connection controller for establishing connections (76, 77) in a frame-based communications network comprising nodes (71-75 and 78) such as Ethernet switches. The connections are established by configuring, in various of the nodes, mappings for forwarding data frames, such as Ethernet frames. The mappings are from a combination of a) a destination (or source) address corresponding to a destination (or source) node (73) of the connection and b) an identifier, such as a VLAN tag. The mappings are to selected output ports of the various nodes. By using the combination of destination (or source) address AND identifier, the mappings enable data frames belonging to different connections (76, 77) to be forwarded differentially (ie forwarded on different output ports) at a node (75) despite the different connections having the same destination node. This enables flexibility in routing connections and the ability to perform traffic engineering.

摘要翻译： 本发明涉及在诸如以太网的基于地址的运营商网络中启用差分转发。 描述了在包括诸如以太网交换机的节点（71-75和78）的基于帧的通信网络中建立连接（76,77）的方法和连接控制器。 通过在各种节点中配置用于转发数据帧（例如以太网帧）的映射来建立连接。 映射来自a）与该连接的目的地（或源）节点（73）对应的目的地（或源）地址的组合，以及b）诸如VLAN标签的标识符。 映射到各个节点的选定输出端口。 通过使用目的地（或源）地址AND标识符的组合，映射使得属于不同连接（76,77）的数据帧能够在节点（75）处差分地转发（即，在不同的输出端口上转发），尽管不同的连接 具有相同的目的地节点。 这使得路由连接的灵活性和执行流量工程的能力。

公开(公告)号：US07623446B1

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

申请号：US11271939

申请日：2005-11-14

申请人： David Allan ,  Peter Ashwood Smith

发明人： David Allan ,  Peter Ashwood Smith

IPC分类号： G01R31/08 ,  G06F11/00 ,  G08C15/00 ,  H04J1/16 ,  H04J3/14 ,  H04L1/00 ,  H04L12/26 ,  H04L12/28 ,  H04L12/56 ,  G06F15/173

CPC分类号： H04L12/42 ,  H04L1/22 ,  H04L12/4637 ,  H04L12/4641 ,  H04L41/20 ,  H04L45/04 ,  H04L45/507

摘要： A virtual ring representing a community of interest is constructed from an interconnected mesh of nodes in a packet network. The virtual ring instantiates ring labels in respective forwarding tables for each node in the virtual ring and then advertises the ring labels to all other nodes in the virtual ring, for example by flooding BGP advertisements. Data packets entering the ring are assigned a ring label which is then stripped off when exiting the ring. The data packets are forwarded around the virtual ring using the ring labels. The virtual ring can operate using BGP/LDP Multi Protocol Label Switching (MPLS). Multiple virtual rings can be bridged together using a central hub or alternatively multiple virtual rings can be redundantly bridged together using tandem hubs.

摘要翻译： 表示感兴趣社区的虚拟环由分组网络中的节点的互连网格构成。 虚拟环实例化虚拟环中每个节点的相应转发表中的环标签，然后将环标签通告给虚拟环中的所有其他节点，例如通过泛滥BGP通告。 进入环的数据包被分配一个环标签，然后在离开环时被剥离。 数据包使用环形标签在虚拟环路周围转发。 虚拟环可以使用BGP / LDP多协议标签交换（MPLS）进行操作。 多个虚拟环可以使用中央集线器桥接在一起，或者多个虚拟环可以使用串联集线器冗余桥接在一起。

公开(公告)号：US20090046719A1

公开(公告)日：2009-02-19

申请号：US12258497

申请日：2008-10-27

申请人： Peter Ashwood Smith

发明人： Peter Ashwood Smith

IPC分类号： H04L12/56

CPC分类号： H04L45/12 ,  H04L12/18 ,  H04L12/462 ,  H04L45/02 ,  H04L45/16 ,  H04L45/48 ,  H04W40/24

摘要： Shortest-path spanning trees are created outward from each portal on a Rbridge network with nodes on the network being assigned to the spanning trees. For those nodes equidistant to two portals, an election process is used to determine which tree the node should join. To enable routes associated with nodes on the Rbridge network to be distinguished from routes external to the Rbridge network, messages may be transmitted between the portals. The messages enable portals to identify routing updates received from the external network as containing internal routes, so that traffic that is required to pass between nodes on different trees may pass over the Rbridge network rather than over the external network.

摘要翻译： 最短路径生成树从Rbridge网络上的每个门户向外创建，网络上的节点分配给生成树。 对于与两个门户等距的那些节点，选择过程用于确定节点应该加入哪个树。 为了使与Rbridge网络上的节点相关联的路由与Rbridge网络外部的路由区分开，可以在门户之间传送消息。 这些消息使门户能够将从外部网络接收到的路由更新标识为包含内部路由，以便在不同树上的节点之间传递所需的流量可以通过Rbridge网络而不是通过外部网络。