Network server and load balancing routing method for networks thereof
First Claim
1. A load balancing routing method for networks, comprising:
- receiving a network topology graph and a plurality of expected bandwidth demands corresponding to a plurality of source-destination pairs by using a network server;
calculating a plurality of link criticalities of a plurality of links established based on the source-destination pairs according to the network topology graph and the expected bandwidth demands and calculating a plurality of expected loads of the links according to the link criticalities by using the network server, and the link criticality corresponding to each of the links is y/x, wherein x is a total number of paths between the source-destination pairs, y is a number of paths between the source-destination pairs that pass through the link, and the expected load of each of the links is equal to a sum of products between the link criticalities and the expected bandwidth demands of the link corresponding to all source-destination pairs;
calculating a plurality of cost values according to a plurality of residual capacities and the corresponding expected loads of the links by using the network server, wherein each of the cost values is obtained by dividing the expected load corresponding to each of the links by the residual capacity corresponding to the link; and
selecting a better transmission path corresponding to each of the source-destination pairs according to a weighted sum of the cost values corresponding to the links in the source-destination pair by using the network server.
1 Assignment
0 Petitions
Accused Products
Abstract
A load balancing routing method for networks is disclosed. The routing method includes following steps. A network topology graph and a plurality of expected bandwidth demands corresponding to a plurality of source-destination pairs are received by a network server. A plurality of link criticalities of a plurality of links established according to the source-destination pairs is calculated by the network server according to the network topology graph and the expected bandwidth demands. A plurality of expected loads of the links is calculated by the network server according to the link criticalities. A plurality of cost values is calculated according to a plurality of residual capacities of the links and the corresponding expected loads. A better transmission path corresponding to each of the source-destination pairs is selected by the network server according to the weighted sum of the cost values corresponding to the links in the source-destination pair.
-
Citations
22 Claims
-
1. A load balancing routing method for networks, comprising:
-
receiving a network topology graph and a plurality of expected bandwidth demands corresponding to a plurality of source-destination pairs by using a network server; calculating a plurality of link criticalities of a plurality of links established based on the source-destination pairs according to the network topology graph and the expected bandwidth demands and calculating a plurality of expected loads of the links according to the link criticalities by using the network server, and the link criticality corresponding to each of the links is y/x, wherein x is a total number of paths between the source-destination pairs, y is a number of paths between the source-destination pairs that pass through the link, and the expected load of each of the links is equal to a sum of products between the link criticalities and the expected bandwidth demands of the link corresponding to all source-destination pairs; calculating a plurality of cost values according to a plurality of residual capacities and the corresponding expected loads of the links by using the network server, wherein each of the cost values is obtained by dividing the expected load corresponding to each of the links by the residual capacity corresponding to the link; and selecting a better transmission path corresponding to each of the source-destination pairs according to a weighted sum of the cost values corresponding to the links in the source-destination pair by using the network server. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A network server, comprising:
a processor, used to receive a network topology graph and a plurality of expected bandwidth demands corresponding to a plurality of source-destination pairs, and calculates a plurality of link criticalities of a plurality of links established based on the source-destination pairs according to the network topology graph and the expected bandwidth demands and calculates a plurality of expected loads of the links according to the link criticalities, wherein the link criticality corresponding to each of the links is y/x, wherein x is a total number of paths between the source-destination pairs, y is a number of paths between the source-destination pairs that pass through the link, and the expected load of each of the links is equal to a sum of products between the link criticalities and the expected bandwidth demands of the link corresponding to all source-destination pairs, the processor further calculates a plurality of cost values according to a plurality of residual capacities and the corresponding expected loads of the links, wherein each of the cost values is obtained by dividing the expected load corresponding to each of the links by the residual capacity corresponding to the link, and the processor selects a better transmission path corresponding to each of the source-destination pairs according to a weighted sum of the cost values corresponding to the links in the source-destination pair. - View Dependent Claims (13, 14, 15, 16, 17, 18, 19, 20, 21, 22)
Specification