专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

21. 发明授权

US08223668B2 Method and apparatus for exchanging routing information and the establishment of connectivity across multiple network areas 失效
标题翻译：用于交换路由信息和跨多个网络区域建立连接的方法和装置
公开(公告)号：US08223668B2
公开(公告)日：2012-07-17
申请号：US11899118
申请日：2007-09-04
申请人： David Allan , Nigel Bragg , Paul Unbehagen , Peter Ashwood-Smith , Yin Guoli
发明人： David Allan , Nigel Bragg , Paul Unbehagen , Peter Ashwood-Smith , Yin Guoli
IPC分类号： H04L12/66 , H04L12/28 , G06F15/16
CPC分类号： H04L41/12 , H04L12/462 , H04L45/02 , H04L45/04 , H04L45/66
摘要： Routes may be installed across multiple link state protocol controlled Ethernet network areas by causing ABBs to leak I-SID information advertised by BEBs a L1 network area into an L2 network area. ABBs will only leak I-SIDs for BEBs where it is the closest ABB for that BEB. Where another ABB on the L2 network also leaks the same I-SID into the L2 network area from another L1 network area, the I-SID is of multi-area interest. ABBs will advertise I-SIDs that are common to the L1 and L2 networks back into their respective L1 network. Within each L1 and L2 network area, forwarding state will be installed between network elements advertising common interest in an ISID, so that multi-area paths may be created to span the L1/L2/L1 network areas. ABBs may summarize BEB multicast trees such that the set of trees for a given I-SID transiting the ABB is condensed into a common tree. The L2 network may further be implemented as a second layer implemented using a L1/L2/L1 network structure, so that the L1/L2/L1 network structure may recurse an arbitrary number of times.
摘要翻译：可以通过使ABB将由L1B网络区域发布的I-SID信息泄漏到L2网络区域中，将多个链路状态协议控制的以太网网络上的路由安装到L2网络区域。 ABB只会泄漏BEB的I-SID，而该BEB是该BEB最接近的ABB。在L2网络上的另一个ABB也从另一个L1网络区域将相同的I-SID泄漏到L2网络区域中，I-SID具有多方面的兴趣。 ABB将通过将L1和L2网络通用的I-SID广播回各自的L1网络。在每个L1和L2网络区域内，转发状态将被安装在对ISID广播共同兴趣的网元之间，从而可以创建多区域路径来跨越L1 / L2 / L1网络区域。 ABB可能会总结BEB组播树，以便将通过ABB的给定I-SID的树组合成一个公共树。 L2网络还可以被实现为使用L1 / L2 / L1网络结构实现的第二层，使得L1 / L2 / L1网络结构可以递归任意次数。

22. 发明授权

US07995569B2 Virtual routers for GMPLS networks 有权
标题翻译：用于GMPLS网络的虚拟路由器
公开(公告)号：US07995569B2
公开(公告)日：2011-08-09
申请号：US11338118
申请日：2006-01-23
申请人： Peter Ashwood-Smith , Darek Skalecki , Gerard Swinkels , David Miedema
发明人： Peter Ashwood-Smith , Darek Skalecki , Gerard Swinkels , David Miedema
IPC分类号： H04L12/50 , H04L12/28
CPC分类号： H04L45/00 , H04L45/50 , H04L45/586
摘要： Virtual routers that abstract photonic sub-domains are provided for GMPLS networks. A virtual router uses a link viability matrix to keep track of the set of viable connections between inputs and outputs of a photonic sub-domain. A virtual router may receive RSVP-TE signaling messages and either allocate a working input to output link pair or, if explicitly signaled, verify that the requested link is currently viable. A virtual router also advertises, in its link state updates, the current set of possible outputs for any input link. Shortest path computations can be implemented utilizing virtual routers by modifying a topology graph in accordance with the link viability matrix of the virtual router.
摘要翻译：为GMPLS网络提供了抽象光子子域的虚拟路由器。虚拟路由器使用链路可行性矩阵来跟踪光子子域的输入和输出之间的一组可行的连接。虚拟路由器可以接收RSVP-TE信令消息，并且分配工作输入以输出链路对，或者如果明确地发信号，则验证所请求的链路当前是否可行。虚拟路由器还在其链路状态更新中通告任何输入链路的当前可能输出集合。可以通过根据虚拟路由器的链路可行性矩阵修改拓扑图来利用虚拟路由器来实现最短路径计算。

23. 发明授权

US07941531B2 Age biased distributed collision resolution without clocks 有权
标题翻译：年龄偏差的分布式碰撞解决方案，无钟表
公开(公告)号：US07941531B2
公开(公告)日：2011-05-10
申请号：US12276623
申请日：2008-11-24
申请人： Emre Gunduzhan , Peter Ashwood-Smith
发明人： Emre Gunduzhan , Peter Ashwood-Smith
IPC分类号： G06F15/173
CPC分类号： H04L47/805 , H04L45/16 , H04L47/70 , H04L47/826 , H04W28/26
摘要： A method resolves collisions in a networking system that includes a plurality of entities operable to transmit an intention to reserve a resource. A first request to reserve resources, which includes a listing of the resources along the first transmission path and a first intention priority value, is broadcast through the networking system. The first intention priority value is determined as a function of other intention priority values previously broadcast through the networking system. A second request is received. The second request includes a second intention priority value and at least one of the same resources included in the first request, thereby indicating a collision. The collision is resolved by comparing the first intention priority value to the second intention priority value. If the collision is resolved in favor of the first request, data is routed through the networking system using the resources along the first transmission path.
摘要翻译：一种方法解决了一种联网系统中的冲突，其包括可操作以发送预留资源的意图的多个实体。通过网络系统广播第一个保留资源的请求，其包括沿着第一传输路径的资源列表和第一意图优先级值。第一意图优先级值被确定为通过网络系统先前广播的其他意图优先级值的函数。接收到第二个请求。第二请求包括第二意图优先级值和包括在第一请求中的相同资源中的至少一个，从而指示冲突。通过将第一意图优先级值与第二意图优先级值进行比较来解决冲突。如果冲突有利于第一个请求被解决，则数据通过网络系统使用沿着第一传输路径的资源进行路由。

24. 发明授权

US07639631B2 Parallel constraint based path computation using path vector 失效
标题翻译：使用路径向量的基于并行约束的路径计算
公开(公告)号：US07639631B2
公开(公告)日：2009-12-29
申请号：US11239111
申请日：2005-09-30
申请人： Peter Ashwood-Smith , Darek Skalecki , Gary McKenna
发明人： Peter Ashwood-Smith , Darek Skalecki , Gary McKenna
IPC分类号： H04L12/28 , G01R31/08
CPC分类号： H04L45/12 , H04L45/02 , H04L45/18 , H04L45/26
摘要： Methods of computing a path through a network between a source node and a destination node. At the source node, an explore message is launched into at least one link hosted by the source node. The explore message includes a path vector containing a node identifier of the source node. At a node intermediate the source node and the destination node, the explore message is received, and each link hosted by the node that can be operably added to the path is identified. A respective node identifier of the node is added to the path vector of the explore message, which is then forwarded through each identified link. At the destination node, the respective path vector is extracted from at least one received explore message.
摘要翻译：计算通过源节点和目标节点之间的网络的路径的方法。在源节点上，将至少一个由源节点托管的链接启动探索消息。探索消息包括包含源节点的节点标识符的路径向量。在源节点和目的地节点之间的节点处，接收到探索消息，并且识别由可被可操作地添加到路径的节点托管的每个链路。节点的相应节点标识符被添加到探索消息的路径向量中，然后通过每个识别的链路进行转发。在目的地节点处，从至少一个接收到的探测消息中提取相应的路径向量。

25. 发明授权

US07466681B2 Method and apparatus for sensor network routing 失效
标题翻译：传感器网络路由的方法和装置
公开(公告)号：US07466681B2
公开(公告)日：2008-12-16
申请号：US10804740
申请日：2004-03-19
申请人： Peter Ashwood-Smith , Donald Fedyk
发明人： Peter Ashwood-Smith , Donald Fedyk
IPC分类号： H04Q7/24
CPC分类号： H04W40/28 , H04L45/20 , H04W40/00 , H04W84/18
摘要： Sensor network routing uses distance information of sensors relative to a collector node, optionally along with non-unique key information, to route broadcasts from addressless sensors to a selected addressless collector. Distance calculation messages (DCMs) are used to set distance values on sensors relative to collectors. The distance values enable messages to propagate toward collectors to reduce the number of broadcasts. Self-assigned key information may be added to DCMs propagating in the network to enable routes to be determined through the network without assigning addresses to the participants. By storing the key information associated with the route, and causing sensors to only rebroadcast a message if the message contains a matching key at the matching distance position, broadcast paths may be created on the network. Optionally, diverse collectors and paths may be selected on the network by exchanging traffic condition indications and preferentially selecting paths with better traffic conditions.
摘要翻译：传感器网络路由使用传感器相对于收集器节点的距离信息，可选地与非唯一密钥信息一起将广播从无地址传感器路由到所选择的无地址收集器。距离计算消息（DCM）用于设置传感器相对于收集器的距离值。距离值使得消息能够向收藏者传播以减少广播数量。可以将自分配的密钥信息添加到在网络中传播的DCM，以通过网络确定路由，而不向参与者分配地址。通过存储与路由相关联的密钥信息，并且如果消息在匹配的距离位置包含匹配密钥，并且使得传感器仅重传广播消息，则可以在网络上创建广播路径。可选地，可以通过交换交通状况指示并优先选择具有更好的交通状况的路径来在网络上选择不同的收集器和路径。

26. 发明授权

US07440438B2 Refresh and filtering mechanisms for LDP based VPLS and L2VPN solutions 失效
标题翻译：基于LDP的VPLS和L2VPN解决方案的刷新和过滤机制
公开(公告)号：US07440438B2
公开(公告)日：2008-10-21
申请号：US10885212
申请日：2004-07-06
申请人： Hamid Ould-Brahim , Peter Ashwood-Smith , Donald Fedyk
发明人： Hamid Ould-Brahim , Peter Ashwood-Smith , Donald Fedyk
IPC分类号： H04B7/208 , H04Q7/00 , G06F15/173
CPC分类号： H04L45/00 , H04L12/4641 , H04L45/50 , H04L63/0272 , H04L63/029
摘要： Refresh and filtering mechanisms for LDP based VPLS and L2VPN solutions are disclosed. A method for improving information communication in a network is achieved by these refresh and filtering mechanisms. The network includes provider edge devices which can communicate with each other. The provider edge devices run a communications protocol. The method includes a step of using the communications protocol in providing a first of the provider edge devices with a list of layer-2 virtual private network instances to which a second of the provider edge devices belongs. Another step in the method is filtering layer-2 virtual private network information to be communicated to the second provider edge device from the first provider edge device by reference to the layer-2 virtual private network instances to which the second provider edge device belongs.
摘要翻译：公开了基于LDP的VPLS和L2VPN解决方案的刷新和过滤机制。通过这些刷新和过滤机制实现了改善网络中的信息通信的方法。该网络包括可以彼此通信的提供商边缘设备。提供商边缘设备运行通信协议。该方法包括使用通信协议向提供商边缘设备中的第一个提供第二层提供商边缘设备所属的第二层虚拟专用网络实例的列表的步骤。该方法的另一步是通过参考第二供应商边缘设备所属的第2层虚拟专用网络实例来从第一供应商边缘设备过滤第2层虚拟专用网络信息以从第一供应商边缘设备传送到第二供应商边缘设备。

27. 发明申请

US20050220096A1 Traffic engineering in frame-based carrier networks 审中-公开
标题翻译：基于帧的运营商网络中的流量工程
公开(公告)号：US20050220096A1
公开(公告)日：2005-10-06
申请号：US10818685
申请日：2004-04-06
申请人： Robert Friskney , Nigel Bragg , Simon Parry , Peter Ashwood-Smith , David Allan
发明人： Robert Friskney , Nigel Bragg , Simon Parry , Peter Ashwood-Smith , David Allan
IPC分类号： H04L12/46 , H04L12/56
CPC分类号： H04L45/74 , H04L12/4641 , H04L12/4645 , H04L45/54 , H04L45/64 , H04L45/66 , H04L47/122 , H04L49/205 , H04L49/253 , H04L49/254 , H04L49/351 , H04L49/354
摘要： The invention relates to enabling traffic engineering in frame-based 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 address corresponding to a destination 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 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—ie the ability to perform traffic engineering.
摘要翻译：本发明涉及在诸如以太网的基于帧的网络中启用流量工程。描述了在包括诸如以太网交换机的节点（71-75和78）的基于帧的通信网络中建立连接（76,77）的方法和连接控制器。通过在各种节点中配置用于转发数据帧（例如以太网帧）的映射来建立连接。所述映射来自a）与所述连接的目的地节点（73）对应的目的地地址的组合，以及b）诸如VLAN标签的标识符。映射到各个节点的选定输出端口。通过使用目的地地址和标识符的组合，映射使得属于不同连接（76,77）的数据帧在节点（75）处被差分地转发（即，在不同输出端口上转发），尽管具有相同目的地的不同连接节点。这使路由连接具有灵活性，即执行流量工程的能力。

28. 发明申请

US20050207376A1 Method and apparatus for sensor network routing 失效
标题翻译：传感器网络路由的方法和装置
公开(公告)号：US20050207376A1
公开(公告)日：2005-09-22
申请号：US10804740
申请日：2004-03-19
申请人： Peter Ashwood-Smith , Donald Fedyk
发明人： Peter Ashwood-Smith , Donald Fedyk
IPC分类号： H04L12/56 , H04W40/00 , H04W40/28 , H04W84/18
CPC分类号： H04W40/28 , H04L45/20 , H04W40/00 , H04W84/18
摘要： Sensor network routing uses distance information of sensors relative to a collector node, optionally along with non-unique key information, to route broadcasts from addressless sensors to a selected addressless collector. Distance calculation messages (DCMs) are used to set distance values on sensors relative to collectors. The distance values enable messages to propagate toward collectors to reduce the number of broadcasts. Self-assigned key information may be added to DCMs propagating in the network to enable routes to be determined through the network without assigning addresses to the participants. By storing the key information associated with the route, and causing sensors to only rebroadcast a message if the message contains a matching key at the matching distance position, broadcast paths may be created on the network. Optionally, diverse collectors and paths may be selected on the network by exchanging traffic condition indications and preferentially selecting paths with better traffic conditions.
摘要翻译：传感器网络路由使用传感器相对于收集器节点的距离信息，可选地与非唯一密钥信息一起将广播从无地址传感器路由到所选择的无地址收集器。距离计算消息（DCM）用于设置传感器相对于收集器的距离值。距离值使得消息能够向收藏者传播以减少广播数量。可以将自分配的密钥信息添加到在网络中传播的DCM，以通过网络确定路由，而不向参与者分配地址。通过存储与路由相关联的密钥信息，并且如果消息在匹配的距离位置包含匹配密钥，并且使得传感器仅重传广播消息，则可以在网络上创建广播路径。可选地，可以通过交换交通状况指示并优先选择具有更好的交通状况的路径来在网络上选择不同的收集器和路径。

29. 发明申请

US20050094577A1 Virtual private networks within a packet network having a mesh topology 有权
标题翻译：具有网状拓扑的分组网络内的虚拟专用网络
公开(公告)号：US20050094577A1
公开(公告)日：2005-05-05
申请号：US10694833
申请日：2003-10-29
申请人： Peter Ashwood-Smith
发明人： Peter Ashwood-Smith
IPC分类号： H04L12/46 , H04L12/56 , H04L12/28
CPC分类号： H04L45/02 , H04L45/50
摘要： A method of creating virtual private networks within a packet network having a mesh topology. A flexible virtual private network is established based upon a topology calculated at each member node. The network is set up using label switched paths between adjacent member nodes according to the topology. The topology may be a ring or a tree. A virtual ring is created as a closed-loop sequence of label switched paths established between a set of member nodes. The closed-loop sequence of label switched paths is established by the member nodes as each member node connects to its neighbours on the virtual ring. The virtual ring may expand by adding member nodes and may contract by removing member nodes. A member node's position on the virtual ring may be established using a sortable value.
摘要翻译：一种在具有网格拓扑的分组网络内创建虚拟专用网络的方法。基于在每个成员节点处计算的拓扑建立灵活的虚拟专用网络。根据拓扑结构，使用相邻成员节点之间的标签交换路径建立网络。拓扑可以是环或树。创建虚拟环作为在一组成员节点之间建立的标签交换路径的闭环序列。标签交换路径的闭环序列由成员节点建立，因为每个成员节点连接到虚拟环上的邻居。虚拟环可以通过添加成员节点来扩展，并且可以通过删除成员节点来收缩虚拟环。成员节点在虚拟环上的位置可以使用可分类值建立。

30. 发明授权

US11451475B2 Packet forwarding based on geometric location 有权
公开(公告)号：US11451475B2
公开(公告)日：2022-09-20
申请号：US16721171
申请日：2019-12-19
申请人： William Carson McCormick , Peter Ashwood-Smith
发明人： William Carson McCormick , Peter Ashwood-Smith
IPC分类号： H04W56/00 , H04L47/10 , H04L45/12 , H04W84/18 , H04L45/48 , H04L47/70
摘要： The present invention is provides a method and apparatus for routing a data packet in a network. For each nearby device capable of routing the packet toward a further destination, an associated cost or utility is determined. The device with lowest cost or highest utility is selected and the packet is forwarded toward same. The selecting may use a comparator tree. The cost or utility may be associated with forwarding the data packet from the candidate device toward the further destination. The cost or utility may be based on a distance from candidate device to the further destination, and may be determined using a Haversine function or approximation thereof, or by computing an inner product of a first vector and a second vector originating at a center of Earth, the first vector directed toward the candidate device, the second vector directed toward the further destination.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式