| 摘要 |
To perform routing in telecommunications networks it is proposed to partition the network, create a reduced graph on the partitions in a preprocessing step in which a dual graph of the network is constructed and the graph is reduced using connections determined by the characteristics of the apparatuses. The routing is then performed on the converted graph. Graph updating techniques to keep it coherent are also described. Each time a routing is requested for a type of traffic not yet considered, a reduced graph for that traffic is constructed while canceling the arch of the original graph which does not support that traffic. For each type of traffic only the reduced graph developed by graph partitioning as described above is kept in memory with considerable resource savings. |
