| 摘要 |
Various techniques for managing forwarding tables in computer networks are disclosed herein. A computer network 100 includes multiple network nodes 102a-102d interconnecting multiple endpoints 108, a route resolver 104, and a network controller 106. A method includes receiving, by the network controller 106, an indication of a network condition 122 in the computer network 100 having a network node 102b, and determining, by the network controller 106 a routing table key 124 based on the received indication of the network condition in the computing network. The routing table key corresponds to a routing table for the network node 102b that is pre- computed under the indicated network condition in the computer network. The method then includes transmitting the determined routing table key 124 to the network node 102b for routing data in the computer network, for example by retrieving a corresponding routing table from a corresponding storage device 112b to replace an existing routing table for directing traffic. The route resolver 104 can be configured to compute a set of routing tables for the network nodes 102 under various network conditions or scenarios in the computer network 100, for example, when one of the network links 114 fails; when two or more of the network links 114 fail; when one of the network nodes 102 fails; when two or more of the network nodes 102 fail; when one network node 102 fails and a network link 114 unrelated to the network node 102 also fails; or when one or more network links 114 have throughput restrictions. Thus, the pre- computed routing table corresponds to a desired pattern of network traffic in the computer network under the indicated network condition and time-consuming ad hoc computation of the routing table for the indicated network condition can be avoided. As such, network traffic in the computer network 100 can converge more quickly to the desired pattern than conventional networks. |
