-
公开(公告)号：US07639631B2
公开(公告)日：2009-12-29
申请号：US11239111
申请日：2005-09-30
摘要： 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.
摘要翻译： 计算通过源节点和目标节点之间的网络的路径的方法。 在源节点上，将至少一个由源节点托管的链接启动探索消息。 探索消息包括包含源节点的节点标识符的路径向量。 在源节点和目的地节点之间的节点处，接收到探索消息，并且识别由可被可操作地添加到路径的节点托管的每个链路。 节点的相应节点标识符被添加到探索消息的路径向量中，然后通过每个识别的链路进行转发。 在目的地节点处，从至少一个接收到的探测消息中提取相应的路径向量。
-
公开(公告)号：US20070076629A1
公开(公告)日：2007-04-05
申请号：US11239111
申请日：2005-09-30
IPC分类号： H04L12/28
摘要： 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.
摘要翻译： 计算通过源节点和目标节点之间的网络的路径的方法。 在源节点上，将至少一个由源节点托管的链接启动探索消息。 探索消息包括包含源节点的节点标识符的路径向量。 在源节点和目的地节点之间的节点处，接收到探索消息，并且识别由可被可操作地添加到路径的节点托管的每个链路。 节点的相应节点标识符被添加到探索消息的路径向量中，然后通过每个识别的链路进行转发。 在目的地节点处，从至少一个接收到的探测消息中提取相应的路径向量。
-
公开(公告)号：US07995569B2
公开(公告)日：2011-08-09
申请号：US11338118
申请日：2006-01-23
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信令消息，并且分配工作输入以输出链路对，或者如果明确地发信号，则验证所请求的链路当前是否可行。 虚拟路由器还在其链路状态更新中通告任何输入链路的当前可能输出集合。 可以通过根据虚拟路由器的链路可行性矩阵修改拓扑图来利用虚拟路由器来实现最短路径计算。
-
公开(公告)号：US07774474B2
公开(公告)日：2010-08-10
申请号：US10744838
申请日：2003-12-23
CPC分类号： H04L41/0659 , H04L45/24 , H04L45/28
摘要： A method and system for resynchronizing a control layer and a line layer by tracing the data path through the line layer and, at the control layer, reclaiming ownership of disowned connections corresponding to the traced data path. Beginning at a head-end controller, the data path is traced by identifying the next controller along the data path and sending a set-up message containing the local state information necessary for a second controller to identify the connection within its associated network element that is associated with the data path. The second controller receives the set-up message and claims ownership of its portion of the data path. It then identifies the next leg or hop in the data path, modifies the set-up message to add data regarding the next hop, and sends the modified set-up message to the next controller along the data path. The process is repeated so as to dynamically establish a control connection corresponding to and synchronized with the existing data path.
摘要翻译： 通过跟踪通过线路层的数据路径，并且在控制层，回收对跟踪的数据路径的未知连接的所有权，来重新同步控制层和线路层的方法和系统。 从头端控制器开始，通过沿着数据路径识别下一个控制器来跟踪数据路径，并发送包含第二控制器所需的本地状态信息的建立消息，以识别其相关网络元件内的连接 与数据路径相关联。 第二控制器接收建立消息并声明其部分数据路径的所有权。 然后，它识别数据路径中的下一个分支或跳跃，修改建立消息以添加关于下一跳的数据，并且将修改的建立消息沿着数据路径发送到下一个控制器。 重复该过程，以动态地建立与现有数据路径相对应并与其同步的控制连接。
-
公开(公告)号：US20060221981A1
公开(公告)日：2006-10-05
申请号：US11338118
申请日：2006-01-23
IPC分类号： H04L12/56
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-domains. 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信令消息，并且分配工作输入以输出链路对，或者如果明确地发信号，则验证所请求的链路当前是否可行。 虚拟路由器还在其链路状态更新中通告任何输入链路的当前可能输出集合。 可以通过根据虚拟路由器的链路可行性矩阵修改拓扑图来利用虚拟路由器来实现最短路径计算。
-
公开(公告)号：US20050198312A1
公开(公告)日：2005-09-08
申请号：US10744838
申请日：2003-12-23
IPC分类号： G06F15/16
CPC分类号： H04L41/0659 , H04L45/24 , H04L45/28
摘要： A method and system for resynchronizing a control layer and a line layer by tracing the data path through the line layer and, at the control layer, reclaiming ownership of disowned connections corresponding to the traced data path. Beginning at a head-end controller, the data path is traced by identifying the next controller along the data path and sending a set-up message containing the local state information necessary for a second controller to identify the connection within its associated network element that is associated with the data path. The second controller receives the set-up message and claims ownership of its portion of the data path. It then identifies the next leg or hop in the data path, modifies the set-up message to add data regarding the next hop, and sends the modified set-up message to the next controller along the data path. The process is repeated so as to dynamically establish a control connection corresponding to and synchronized with the existing data path.
摘要翻译： 通过跟踪通过线路层的数据路径，并且在控制层，回收对跟踪的数据路径的未知连接的所有权，来重新同步控制层和线路层的方法和系统。 从头端控制器开始，通过沿着数据路径识别下一个控制器来跟踪数据路径，并发送包含第二控制器所需的本地状态信息的建立消息，以识别其相关网络元件内的连接 与数据路径相关联。 第二控制器接收建立消息并声明其部分数据路径的所有权。 然后，它识别数据路径中的下一个分支或跳跃，修改建立消息以添加关于下一跳的数据，并且将修改的建立消息沿着数据路径发送到下一个控制器。 重复该过程，以动态地建立与现有数据路径相对应并与其同步的控制连接。
-
公开(公告)号：US08750141B2
公开(公告)日：2014-06-10
申请号：US12612869
申请日：2009-11-05
IPC分类号： H04L12/28
CPC分类号： H04L45/02 , H04L43/0811 , H04L45/021 , H04L45/22 , H04L45/28 , H04L45/308 , H04L45/32
摘要： Connection constraints are flooded using an extension to a routing protocol being used to control forwarding on network. Nodes maintain topology and connection database and calculate routes for connections based on the constraints. If a node is on a calculated route for a connection it will install forwarding state for the connection. Since each node has a consistent view of the network topology and has been provided with the constraints associated with the connection, each node on the network will calculate the same route for the connection. When a failure occurs, the nodes will calculate restoration paths for the connections on a network-wide priority basis to enable restoration paths to be created for the affected connections without requiring the restoration paths to be signaled. Time-stamps are used to allow events to be applied by nodes in a consistent order regardless of the order in which they arrive.
摘要翻译： 连接约束使用对用于控制网络转发的路由协议的扩展来淹没。 节点维护拓扑和连接数据库，并根据约束计算连接路由。 如果一个节点处于连接的计算路由上，它将为连接安装转发状态。 由于每个节点具有网络拓扑的一致视图，并且已经提供了与连接相关联的约束，网络上的每个节点将为连接计算相同的路由。 当故障发生时，节点将在网络优先级基础上计算连接的恢复路径，以便为受影响的连接创建恢复路径，而不需要发送恢复路径。 时间标签用于允许节点以一致的顺序应用事件，而不管它们到达的顺序如何。
-
公开(公告)号：US20110255443A1
公开(公告)日：2011-10-20
申请号：US13167251
申请日：2011-06-23
IPC分类号： 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信令消息，并且分配工作输入以输出链路对，或者如果明确地发信号，则验证所请求的链路当前是否可行。 虚拟路由器还在其链路状态更新中通告任何输入链路的当前可能输出集合。 可以通过根据虚拟路由器的链路可行性矩阵修改拓扑图来利用虚拟路由器来实现最短路径计算。
-
公开(公告)号：US10133890B2
公开(公告)日：2018-11-20
申请号：US15249934
申请日：2016-08-29
申请人： Peter Ashwood-Smith
发明人： Peter Ashwood-Smith
摘要： There is provided a Radio Frequency Identification tag that is sensitive to stress induced in a component to which the tag is coupled. In some embodiments, the RFID tag includes an electrically conductive loop that it configured to retain the RFID tag in a first operational state and upon breakage of the electrically conductive loop the RFID tag changes into a second operational state. By adhering the stress sensitive RFID tag to a particular component or location thereon, the operation state change of the RFID tag can be indicative of a the particular component reaching a known physical change. Moreover, a change in the operational state of the RFID tag can be detected by an appropriate RFID detector or scanner without the need for visual inspection, and thus provides evaluation of components that are positioned in hard to reach locations or hidden behind one or more coverings.
-
公开(公告)号：US20180278466A1
公开(公告)日：2018-09-27
申请号：US15465012
申请日：2017-03-21
IPC分类号： H04L12/24 , H04L12/911
摘要： A method and apparatus for instantiating network slices using connectivity and computing resources, is provided. Information regarding connectivity and computing resources for supporting network slices is used to identify shared risk groups. Each shared risk group includes those resources expected to be disabled by a common failure event. A first set of functions, such as virtual network functions, belonging to a network slice, is instantiated on a first subset of the resources. The union of all shared risk groups which include at least one of the first subset of resources is disjoint from the union of all shared risk groups which include at least one of a second subset of resources. The second subset of resources is allocated for instantiating a second set of functions which are redundant with the first set of functions. As such, redundant network slices and/or functions thereof can be provided which are robust to failure.
-
-
-
-
-
-
-
-
-
搜索结果
88 条记录 (耗时 0.026 秒)
