Method for computing routing graphs for multi-path routing

摘要

The present method is instrumental in building routing graphs for multi-path routing with an optimised number of nodes that exhibit a minimum number of routing alternatives for routing to a given destination. According to the method the routing graph is built up of primitives which are stepwise added to an incomplete routing graph (R'd). The central primitive consists of a node (u) with a minimum number of outbound links to the incomplete routing graph (R'd). By adding this primitive to the incomplete routing graph (R'd) the node (u) is provided with at least the minimum number of alternative routings to the given destination. Further primitives are presented that complement the central primitive. The invention gives rise to an enhanced network resilience and allows for an improved control of network congestion. <IMAGE>