-
公开(公告)号:US20020061010A1
公开(公告)日:2002-05-23
申请号:US10050306
申请日:2002-01-15
Applicant: Nokia Corporation
Inventor: Jyrki Akkanen
IPC: H04L012/28
Abstract: This invention relates to routing in a communication network. In particular, the invention concerns routing in telecommunication and cellular networks. The idea of the invention is to preprocess the network in order to accelerate the routing process. The preprocessing comprises finding the difficult network portions, and removing trivial network portions from the network topology. As a result of these phases the network is divided into small subnetworks. After the preprocessing predetermined endpoints of a single route are added into the subnetworks for finding the route through the network. After that, traffic in each subnetwork is routed separately. Traffic in the network parts between the subnetworks, or between the endpoints and the subnetworks, may need additional routing.
Abstract translation: 本发明涉及通信网络中的路由。 特别地,本发明涉及电信和蜂窝网络中的路由。 本发明的思想是预处理网络以加速路由过程。 预处理包括找到困难的网络部分,以及从网络拓扑中去除平凡的网络部分。 作为这些阶段的结果,网络被划分成小的子网络。 在单个路由的预处理预定端点被添加到子网中以找到通过网络的路由之后。 之后,每个子网的流量单独路由。 子网之间或端点与子网之间网络部分的通信可能需要额外的路由。
-
公开(公告)号:US20020060987A1
公开(公告)日:2002-05-23
申请号:US10042671
申请日:2002-01-09
Applicant: Nokia Corporation
Inventor: Jyrki Akkanen , Jukka Nurminen
IPC: H04J001/16 , H04J003/14
Abstract: This invention relates to routing in a communication network. The invention offers a method to make a protected routing through all the layers of a communication network. The bottom layer is the foundation for all protected routes. The routing order is from bottom to top. First, the first layer above the bottom layer is routed into the bottom layer. The links which do not need protection can be routed via the shortest path. The links which need protection are routed in a way that there exist two, as short as possible, separate paths. The other links are routed in a similar way. Finally the top layer is routed into the layer below the top layer.
Abstract translation: 本发明涉及通信网络中的路由。 本发明提供了一种通过通信网络的所有层进行受保护路由的方法。 底层是所有受保护路线的基础。 路由顺序是从下到上。 首先,底层上方的第一层被路由到底层。 不需要保护的链路可以通过最短路径进行路由。 需要保护的链路以尽可能短的方式存在两条独立的路径进行路由。 其他链接以相似的方式路由。 最后,顶层被路由到顶层以下的层。
-