-
1.发明授权Architecture and protection method for mesh protection of N services with M shared resources 有权具有M个共享资源的N个服务的网格保护架构和保护方法公开(公告)号：US09065759B2
公开(公告)日：2015-06-23
申请号：US13230521
申请日：2011-09-12
IPC分类号： H04L12/26 , H04L12/707
摘要： The embodiments disclosed herein provide a mechanism for sharing protection resources in an arbitrary network topology involving pre-computing the protection resources so that data-plane-based protection can be used to activate the protection resources upon detection of a failure, thus, providing faster switching times than typical control-plane-based solutions. This is accomplished by configuring a mesh network to include, for a working path in the network, one or more protection paths with the same end nodes as the working path, where each protection path includes at least one intermediate node that is not part of the working path. The intermediate node accepts a protection request from one of the end nodes and determines whether a local resource for a protection path is available. If the local resource is available, the intermediate node forwards the protection request along the protection path, but, if the local resource is unavailable, the intermediate node notifies the end node from which the protection request originated that the protection path is unavailable.
摘要翻译： 本文公开的实施例提供了一种用于在任意网络拓扑中共享保护资源的机制，其涉及预先计算保护资源，使得可以使用基于数据平面的保护来在检测到故障时激活保护资源，从而提供更快的切换 比典型的基于控制平面的解决方案。 这是通过配置网状网络来实现的，对于网络中的工作路径，包括具有与工作路径相同的端节点的一个或多个保护路径，其中每个保护路径包括至少一个不属于该路径的中间节点 工作路径 中间节点接受来自一个终端节点的保护请求，并确定保护路径的本地资源是否可用。 如果本地资源可用，则中间节点沿着保护路径转发保护请求，但是如果本地资源不可用，则中间节点通知保护请求发起的终端节点保护路径不可用。
-
2.发明申请ARCHITECTURE AND PROTECTION METHOD FOR MESH PROTECTION OF N SERVICES WITH M SHARED RESOURCES 有权具有M个共享资源的N个服务的MESH保护的架构和保护方法公开(公告)号：US20130064073A1
公开(公告)日：2013-03-14
申请号：US13230521
申请日：2011-09-12
IPC分类号： H04L12/26
摘要： The embodiments disclosed herein provide a mechanism for sharing protection resources in an arbitrary network topology involving pre-computing the protection resources so that data-plane-based protection can be used to activate the protection resources upon detection of a failure, thus, providing faster switching times than typical control-plane-based solutions. This is accomplished by configuring a mesh network to include, for a working path in the network, one or more protection paths with the same end nodes as the working path, where each protection path includes at least one intermediate node that is not part of the working path. The intermediate node accepts a protection request from one of the end nodes and determines whether a local resource for a protection path is available. If the local resource is available, the intermediate node forwards the protection request along the protection path, but, if the local resource is unavailable, the intermediate node notifies the end node from which the protection request originated that the protection path is unavailable.
摘要翻译： 本文公开的实施例提供了一种用于在任意网络拓扑中共享保护资源的机制，其涉及预先计算保护资源，使得可以使用基于数据平面的保护来在检测到故障时激活保护资源，从而提供更快的切换 比典型的基于控制平面的解决方案。 这是通过配置网状网络来实现的，对于网络中的工作路径，包括具有与工作路径相同的端节点的一个或多个保护路径，其中每个保护路径包括至少一个不属于该路径的中间节点 工作路径 中间节点接受来自一个终端节点的保护请求，并确定保护路径的本地资源是否可用。 如果本地资源可用，则中间节点沿着保护路径转发保护请求，但是如果本地资源不可用，则中间节点通知保护请求发起的终端节点保护路径不可用。
-
3.发明授权公开(公告)号：US08804485B2
公开(公告)日：2014-08-12
申请号：US13288405
申请日：2011-11-03
IPC分类号： G01R31/08
CPC分类号： G06F11/1402 , G06F11/0709 , H04L41/0663
摘要： In a telecommunications/data network, it is common to have multiple recovery domains each employing its own technique for recovering a fault that may be different from a technique employed by another domain. Permitting multiple recovery domains to recover a fault without coordination among the domains can result in adverse interactions, such as rapid and repeated changes in the actions taken or “flapping,” and repeated hits to traffic. A method and corresponding apparatus for coordinating fault recovery in a network, according to an embodiment of the present invention, notifies a first recovery domain that a second recovery domain is or is not taking action to recover a fault in the network. Coordinating the recovery efforts of the first and second recovery domains reduces fault recovery time and allows concurrent actions to be taken.
摘要翻译： 在电信/数据网络中，通常具有多个恢复域，每个恢复域采用其自己的技术来恢复可能与另一域使用的技术不同的故障。 允许多个恢复域恢复故障而不在域之间协调，可能会导致不利的交互，例如所采取的行动或“扑动”的快速和重复更改，以及重复点击流量。 根据本发明的实施例的用于协调网络中的故障恢复的方法和相应的装置通知第一恢复域第二恢复域正在或不采取行动来恢复网络中的故障。 协调第一个和第二个恢复域的恢复工作可以减少故障恢复时间，并允许采取并发操作。
-
4.发明申请METHOD AND APPARATUS FOR COORDINATING FAULT RECOVERY TECHNIQUES AMONG DOMAINS 有权用于协调域中的故障恢复技术的方法和装置公开(公告)号：US20120281523A1
公开(公告)日：2012-11-08
申请号：US13288405
申请日：2011-11-03
IPC分类号： H04L12/26
CPC分类号： G06F11/1402 , G06F11/0709 , H04L41/0663
摘要： In a telecommunications/data network, it is common to have multiple recovery domains each employing its own technique for recovering a fault that may be different from a technique employed by another domain. Permitting multiple recovery domains to recover a fault without coordination among the domains can result in adverse interactions, such as rapid and repeated changes in the actions taken or “flapping,” and repeated hits to traffic. A method and corresponding apparatus for coordinating fault recovery in a network, according to an embodiment of the present invention, notifies a first recovery domain that a second recovery domain is or is not taking action to recover a fault in the network. Coordinating the recovery efforts of the first and second recovery domains reduces fault recovery time and allows concurrent actions to be taken.
摘要翻译： 在电信/数据网络中，通常具有多个恢复域，每个恢复域采用其自己的技术来恢复可能与另一域使用的技术不同的故障。 允许多个恢复域恢复故障而不在域之间协调，可能会导致不利的交互，例如快速和重复的动作所采取或拍摄的动作，以及重复点击流量。 根据本发明的实施例的用于协调网络中的故障恢复的方法和相应的装置通知第一恢复域第二恢复域正在或不采取行动来恢复网络中的故障。 协调第一个和第二个恢复域的恢复工作可以减少故障恢复时间，并允许采取并发操作。
-
5.发明授权公开(公告)号：US09160686B2
公开(公告)日：2015-10-13
申请号：US12906670
申请日：2010-10-18
申请人： Mark E. Boduch , Jonathan B. Sadler
发明人： Mark E. Boduch , Jonathan B. Sadler
IPC分类号： H04B7/212 , H04J1/00 , H04L12/50 , H04L12/28 , H04L12/931 , H04L12/933 , H04L12/703 , H04L12/24
CPC分类号： H04L49/45 , H04B7/2125 , H04L41/069 , H04L45/28 , H04L49/1523
摘要： Example embodiments of the present invention relate to increasing an aggregate capacity of a network without using a centralized switch fabric. A method and corresponding apparatus in an example embodiment of the present invention relates to increasing overall aggregate capacity of a switching system. The example embodiment includes a first switching shelf having a first predetermined aggregate capacity, and multiple second switching shelves having a second predetermined aggregate capacity. The second predetermined aggregate capacity is less than the first predetermined aggregate capacity. The example embodiment increases the overall aggregate capacity as a function of connections between the first switching shelf and the multiple second switching shelves. The shelves are interconnected with interconnection links and can be configured to connect to additional shelves as the switching system grows to larger sizes. Embodiments can increase capacity while reducing cost within a network node.
摘要翻译： 本发明的示例性实施例涉及在不使用集中式交换结构的情况下增加网络的总容量。 本发明的示例性实施例中的方法和相应装置涉及增加交换系统的总体集总容量。 该示例性实施例包括具有第一预定聚集容量的第一开关架和具有第二预定总容量的多个第二切换架。 第二预定总容量小于第一预定总容量。 示例性实施例将总体容量增加为第一交换机架和多个第二切换架之间的连接的函数。 架子与互连链路互连，并且可以配置为在交换系统增长到更大的尺寸时连接到附加的架子。 实施例可以增加容量，同时降低网络节点内的成本。
-
6.发明授权Method and apparatus for least cost routing using multiple path accumulated constraints 有权使用多路径累积约束的最小成本路由的方法和装置公开(公告)号：US08693340B2
公开(公告)日：2014-04-08
申请号：US12727852
申请日：2010-03-19
IPC分类号： H04L12/26 , H04L12/56 , G06F15/173
CPC分类号： H04L45/00 , H04L43/0858 , H04L43/16 , H04L45/124
摘要： A cost of a path may not be the only factor in searching for a path solution in a network. For example, some applications are delay sensitive and require finding a path that does not exceed a latency constraint for the entire path. Accordingly, a method and corresponding apparatus for searching for a path solution in a network is provided that identifies combinations of partial paths that satisfy an end-to-end path constraint, compares attributes of the combinations of partial paths, prunes the combinations of partial paths based on results of the comparing to identify candidate combinations of partial paths, and selects a candidate combination of partial paths as the path solution. By pruning combinations of partial paths, considerable is saved compared to exhaustive comparing of every possible combination of partial paths and scalability is achieved.
摘要翻译： 路径的成本可能不是搜索网络中的路径解决方案的唯一因素。 例如，一些应用程序是延迟敏感的，并且需要找到不超过整个路径的延迟约束的路径。 因此，提供了一种用于搜索网络中的路径解决方案的方法和相应的装置，其识别满足端到端路径约束的部分路径的组合，比较部分路径的组合的属性，修剪部分路径的组合 基于比较的结果来识别部分路径的候选组合，并且选择部分路径的候选组合作为路径解。 通过修剪部分路径的组合，可以节省相当多的部分路径和可扩展性的可能组合的详尽比较。
-
7.发明申请公开(公告)号：US20070280276A1
公开(公告)日：2007-12-06
申请号：US11641303
申请日：2006-12-19
IPC分类号： H04L12/56
CPC分类号： H04L45/00 , H04L41/0806 , H04L69/14
摘要： An example embodiment of the present invention is a method of managing network communications layers on a network. The example embodiment (i) selects nodes in a network normally configured with server layer resources (e.g., SONET/SDH) to support client communications on a communications path between source nodes and destination nodes and (ii) instantiates client layer resources (e.g., Ethernet or IP) to support communications at branch nodes among the selected nodes at which communications paths from a common source node split to take different paths toward different destination nodes or at which communications paths toward a common destination node merge from different source nodes. Dynamic configuration of client layer resources is thus provided, and the given node may operate in an autonomous manner, instantiating client layer resources on an as needed basis.
摘要翻译： 本发明的示例性实施例是一种管理网络上的网络通信层的方法。 示例性实施例（i）选择通常配置有服务器层资源（例如，SONET / SDH）的网络中的节点，以支持源节点和目的地节点之间的通信路径上的客户端通信，以及（ii）实例化客户端层资源（例如，以太网 或IP）支持在所选择的节点中的分支节点处的通信，在所述节点中，来自公共源节点的通信路径被拆分以朝向不同的目的地节点采取不同的路径，或者朝向公共目的地节点的通信路径从不同的源节点合并。 因此提供了客户端层资源的动态配置，并且给定节点可以以自主的方式操作，根据需要实例化客户端层资源。
-
公开(公告)号：US08125891B2
公开(公告)日：2012-02-28
申请号：US12787015
申请日：2010-05-25
CPC分类号： H04L45/62 , H04J3/14 , H04J3/1611 , H04J2203/0053 , H04L45/02 , H04L45/123 , H04L45/32 , H04L45/50 , H04L45/64
摘要： Each node of a telecommunications network determines a connection type attributes available for each signal type supported by the node. Each signal type represents a different connection routing layer within the telecommunications network. Adaptation costs involved in traversing from one connection routing layer to another connection routing layer in the node are calculated. The connection type attributes and adaptation costs are included in a link state advertisement broadcasted by each node in the telecommunications network. A route calculation is performed for a desired signal to determine a route through the telecommunications network for the signal. The route calculation takes into account the various connection type attributes, availability, and adaptation costs in determining the shortest route for the signal through the telecommunications network.
摘要翻译： 电信网络的每个节点确定可用于由节点支持的每种信号类型的连接类型属性。 每个信号类型表示电信网络内不同的连接路由层。 计算从一个连接路由层遍历到该节点中的另一个连接路由层所涉及的适配成本。 连接类型属性和自适应成本包括在电信网络中的每个节点广播的链路状态广告中。 对所需信号执行路线计算，以确定通过电信网络的信号路线。 路由计算在确定通过电信网络的信号的最短路由时考虑到各种连接类型属性，可用性和适应成本。
-
公开(公告)号：US20100232416A1
公开(公告)日：2010-09-16
申请号：US12787015
申请日：2010-05-25
IPC分类号： H04L12/28
CPC分类号： H04L45/62 , H04J3/14 , H04J3/1611 , H04J2203/0053 , H04L45/02 , H04L45/123 , H04L45/32 , H04L45/50 , H04L45/64
摘要： Each node of a telecommunications network determines a connection type attributes available for each signal type supported by the node. Each signal type represents a different connection routing layer within the telecommunications network. Adaptation costs involved in traversing from one connection routing layer to another connection routing layer in the node are calculated. The connection type attributes and adaptation costs are included in a link state advertisement broadcasted by each node in the telecommunications network. A route calculation is performed for a desired signal to determine a route through the telecommunications network for the signal. The route calculation takes into account the various connection type attributes, availability, and adaptation costs in determining the shortest route for the signal through the telecommunications network.
摘要翻译： 电信网络的每个节点确定可用于由节点支持的每种信号类型的连接类型属性。 每个信号类型表示电信网络内不同的连接路由层。 计算从一个连接路由层遍历到该节点中的另一个连接路由层所涉及的适配成本。 连接类型属性和自适应成本包括在电信网络中的每个节点广播的链路状态广告中。 对所需信号执行路线计算，以确定通过电信网络的信号路线。 路由计算在确定通过电信网络的信号的最短路由时考虑到各种连接类型属性，可用性和适应成本。
-
公开(公告)号：US20090003231A1
公开(公告)日：2009-01-01
申请号：US12012208
申请日：2008-01-31
IPC分类号： H04L12/26
CPC分类号： H04L65/1083 , H04L45/00 , H04L45/304 , H04L45/308 , H04L45/38 , H04L45/64 , H04L47/20 , H04L65/1006 , H04W40/02
摘要： In today's network, enhancing or otherwise modifying signals in bearer flows in or at equipment already deployed in a network may be done by modifying or upgrading existing equipment, or otherwise invasively routing signals through identified network elements. In accordance with example embodiments of the present invention, signals for control plane flows are transparently monitored using policy based routing to direct control signals from a routing point to a signaling monitoring point. Bearer plane address information of a selected media processing point is substituted for other bearer plane address information in the control signal in a manner that causes subsequent bearer flows to be directed to the selected media processing point from the routing point by destination based routing. Bearer flows may be directed to a media processing point to apply signal enhancement to an encoded media signal on the bearer flows to produce an enhanced media encoded signal. Such embodiments enable service providers to upgrade networks with media processing in a low-cost, non-invasive manner.
摘要翻译： 在当今的网络中，可以通过修改或升级现有设备，或以其他方式通过已识别的网络元件入侵路由信号，来增强或以其他方式修改已部署在网络中的设备中的承载流中的信号。 根据本发明的示例性实施例，使用基于策略的路由来将控制平面流的信号透明地监视以将控制信号从路由点引导到信令监控点。 选择的媒体处理点的承载平面地址信息以控制信号中的其他承载平面地址信息的方式被替代，使得后续承载流通过基于目的地的路由从路由点指向所选择的媒体处理点。 承载流可以被引导到媒体处理点以对承载流上的编码媒体信号应用信号增强以产生增强的媒体编码信号。 这样的实施例使得服务提供商能够以低成本，非侵入性的方式以媒体处理来升级网络。
-
-
-
-
-
-
-
-
-
搜索结果
23 条记录 (耗时 0.024 秒)