| 摘要 |
The routing cycles method establishes a connection between a source network node and a destination network node based on a cycles graph. For each connection request, the network identifies ‘k’ valid solution cycles on the cycles graph, taking into account any constraints imposed by the type of routing requested. Each valid solution cycle is then split into a pair of routes, which are validated against explicit constraints received with the request, if any. The performance of each pair is then estimated and the pairs are ordered in a list based on their performance. The pair ordering is carried out based on the cost of the routes and on the chance of a successful set-up, which is given by an estimated Q factor. The network attempts to set up the connection according to the class of service for the respective request, first along the best route(s) from the list. Failing this, it will try the second best route(s), etc.
|
