-
公开(公告)号：US08982900B2
公开(公告)日：2015-03-17
申请号：US13456133
申请日：2012-04-25
IPC分类号： H04L12/703 , H04L12/721
CPC分类号： H04L45/28 , H04L12/6418 , H04L45/12
摘要： Routing around intra-network element (intra-NE) disconnectivity is described. The routing is performed on one or more network element (NEs) of a channelized network. The routing involves performing a shortest-path-search (SPS) to determine a shortest non-disconnected path from a single path-ingress edge to a single path-egress edge. The SPS includes classifying a set of endpoints of each NE in the channelized network as an equivalence class of endpoints, classifying a set of paths-so-far between each NE in the channelized network as an equivalence class of paths-so-far, grouping each equivalence class of paths-so-far by the equivalence class of endpoints that includes a terminal endpoint of the path-so-far that is furthest from the single path-ingress edge, and exploring separately each equivalence class of edges that are incident to each NE when determining the shortest non-disconnected path from the single path-ingress edge to the single path-egress edge.
摘要翻译： 描述了围绕网内元件（NE内）断开连接的路由。 路由在信道化网络的一个或多个网元（NE）上执行。 该路由涉及执行最短路径搜索（SPS）以确定从单个路径入口边缘到单个路径出口边缘的最短非断开路径。 SPS包括将信道化网络中的每个NE的一组端点分类为端点的等价类，将在信道化网络中的每个NE之间的路径集合进行分类，作为到目前为止的路径的等价类别 每个等价类的路径 - 远远超过端点的等价类，其中包括距离单个路径入口边缘最远的路径的终端，并分别探索入侵到每个边缘的等价类别 当确定从单个路径入口边缘到单个路径出口边缘的最短非断开路径时，每个NE。
-
公开(公告)号：US20130287018A1
公开(公告)日：2013-10-31
申请号：US13456133
申请日：2012-04-25
IPC分类号： H04L12/50
CPC分类号： H04L45/28 , H04L12/6418 , H04L45/12
摘要： Routing around intra-network element (intra-NE) disconnectivity is described. The routing is performed on one or more network element (NEs) of a channelized network. The routing involves performing a shortest-path-search (SPS) to determine a shortest non-disconnected path from a single path-ingress edge to a single path-egress edge. The SPS includes classifying a set of endpoints of each NE in the channelized network as an equivalence class of endpoints, classifying a set of paths-so-far between each NE in the channelized network as an equivalence class of paths-so-far, grouping each equivalence class of paths-so-far by the equivalence class of endpoints that includes a terminal endpoint of the path-so-far that is furthest from the single path-ingress edge, and exploring separately each equivalence class of edges that are incident to each NE when determining the shortest non-disconnected path from the single path-ingress edge to the single path-egress edge.
摘要翻译： 描述了围绕网内元件（NE内）断开连接的路由。 路由在信道化网络的一个或多个网元（NE）上执行。 该路由涉及执行最短路径搜索（SPS）以确定从单个路径入口边缘到单个路径出口边缘的最短非断开路径。 SPS包括将信道化网络中的每个NE的一组端点分类为端点的等价类，将在信道化网络中的每个NE之间的路径集合进行分类，作为到目前为止的路径的等价类别 每个等价类的路径 - 远远超过端点的等价类，其中包括距离单个路径入口边缘最远的路径的终端，并分别探索入侵到每个边缘的等价类别 当确定从单个路径入口边缘到单个路径出口边缘的最短非断开路径时，每个NE。
-
搜索结果
2 条记录 (耗时 0.008 秒)
