m (Scipediacontent moved page Draft Content 467483496 to Heusse Gravey 2003a) |
|||
Line 3: | Line 3: | ||
International audience; This paper presents a method for dynamic load balancing in data networks. When multiple routes are available, it determines their load shares as a function of a composite metric that takes into account the paths? length and load. A general resource preservation mechanism is also presented that complements the proposed random routing strategy when the network is heavily loaded. We compare our approach with trunk reservation in the particular case of fully meshed networks and evaluate its performance in any network, where an equivalent mechanism is missing. We validate our approach by means of simulation and provide insights on the routing solutions that it obtains. | International audience; This paper presents a method for dynamic load balancing in data networks. When multiple routes are available, it determines their load shares as a function of a composite metric that takes into account the paths? length and load. A general resource preservation mechanism is also presented that complements the proposed random routing strategy when the network is heavily loaded. We compare our approach with trunk reservation in the particular case of fully meshed networks and evaluate its performance in any network, where an equivalent mechanism is missing. We validate our approach by means of simulation and provide insights on the routing solutions that it obtains. | ||
− | |||
− | |||
− | |||
− | |||
− | |||
Line 19: | Line 14: | ||
* [https://hal.archives-ouvertes.fr/hal-02174625/file/heusse2003.pdf https://hal.archives-ouvertes.fr/hal-02174625/file/heusse2003.pdf] | * [https://hal.archives-ouvertes.fr/hal-02174625/file/heusse2003.pdf https://hal.archives-ouvertes.fr/hal-02174625/file/heusse2003.pdf] | ||
+ | |||
+ | * [https://hal.archives-ouvertes.fr/hal-02174625 https://hal.archives-ouvertes.fr/hal-02174625], | ||
+ | : [https://hal.archives-ouvertes.fr/hal-02174625/document https://hal.archives-ouvertes.fr/hal-02174625/document], | ||
+ | : [https://hal.archives-ouvertes.fr/hal-02174625/file/heusse2003.pdf https://hal.archives-ouvertes.fr/hal-02174625/file/heusse2003.pdf] | ||
+ | |||
+ | * [https://www.sciencedirect.com/science/article/pii/S1388343703801737 https://www.sciencedirect.com/science/article/pii/S1388343703801737], | ||
+ | : [https://www.scipedia.com/public/Heusse_Gravey_2003a https://www.scipedia.com/public/Heusse_Gravey_2003a], | ||
+ | : [https://hal.archives-ouvertes.fr/hal-02174625 https://hal.archives-ouvertes.fr/hal-02174625], | ||
+ | : [https://hal-univ-tlse3.archives-ouvertes.fr/INSMI/hal-01848250 https://hal-univ-tlse3.archives-ouvertes.fr/INSMI/hal-01848250], | ||
+ | : [https://hal.archives-ouvertes.fr/hal-02174625/document https://hal.archives-ouvertes.fr/hal-02174625/document], | ||
+ | : [https://academic.microsoft.com/#/detail/192682845 https://academic.microsoft.com/#/detail/192682845] |
International audience; This paper presents a method for dynamic load balancing in data networks. When multiple routes are available, it determines their load shares as a function of a composite metric that takes into account the paths? length and load. A general resource preservation mechanism is also presented that complements the proposed random routing strategy when the network is heavily loaded. We compare our approach with trunk reservation in the particular case of fully meshed networks and evaluate its performance in any network, where an equivalent mechanism is missing. We validate our approach by means of simulation and provide insights on the routing solutions that it obtains.
The different versions of the original document can be found in:
Published on 01/01/2003
Volume 2003, 2003
DOI: 10.1016/s1388-3437(03)80173-7
Licence: CC BY-NC-SA license
Are you one of the authors of this document?