ALRP: scalability study of ant based local repair routing protocol for mobile adhoc networks
WSEAS Transactions on Computer Research
Maximum entropy method and underdetermined systems applied to computer network topology and routing
AIC'09 Proceedings of the 9th WSEAS international conference on Applied informatics and communications
Routing protocol extension for resilient GMPLS multi-domain networks
WSEAS TRANSACTIONS on COMMUNICATIONS
A heuristic algorithm for the network design problem
NN'10/EC'10/FS'10 Proceedings of the 11th WSEAS international conference on nural networks and 11th WSEAS international conference on evolutionary computing and 11th WSEAS international conference on Fuzzy systems
An algorithm for the network design problem based on the maximum entropy method
AMERICAN-MATH'10 Proceedings of the 2010 American conference on Applied mathematics
| Hi-index | 0.00 |
This paper examines problems that arise from the fact that dynamic routing never relies on the precise, current information about the network state. It is a normal expectation that dynamic routing has to give better results than a static one. However, it takes some time to collect information about the network current state, and optimization is always done with that imprecise information. This situation is examined by a complete mathematical analysis of a simple network. We show that dynamic routing gives better results than static, as expected, but that the margin is much smaller then intuitively expected. Further analysis shows that that minor advantage can easily be lost if there is even a small error in the dynamic routing tables, and actually dynamic routing can easily become worse than static. Quantitative analysis shows that delays in building routing tables can affect dynamic routing performance unexpectedly strongly. The conclusion is that dynamic routing should not try to adapt to traffic changes very fast.