|
Vol: 4(4) No: 1 / March 1994 Dynamic Routing on Obsolete Traffic Information Milan Tuba Mathematics Faculty, University of Beograd, Studentski trg 16, 1100 Beograd, Yugoslavia Keywords: dynamic routing, internet, network traffic Abstract This paper gives a theoretical explanation for unexpected delays in the INTERNET, after highly dynamic routing introduced. It is a continuation of a previous paper, where is was shown that optional dynamic routing gives only slightly better results then optional static routing. Here, we show how the small advantage can be last, and why dynamic routing can because worse than static. It takes some time to collect information about network traffic and to calculate routing tables based on that information. By the time new routing tables are calculated, they are already obsolete. By complete mathematical analysis of a simple network, we show that dynamic routing based on obsolete traffic information gives more results than optional static routing, even for relatively minor errors in traffic estimate. References [1] Berstein, H. Some Comments on Highly Dynamic Network Rouring, New York University Tehnical Report # 371, 1988, pp. 11. [2] Blokijl, R. RIPE Terms of Reference, RFC 1181, 1990. [3] Brown, H-W. Models of PolicyBased Routing, RFC 1104, 1989. [4] Clark, D. Policy Routing in Internet Protocols, RFC. 1102, 1989. [5] Hedrick, C. Routing Information Protocol, RFC. 1058, 1988. [6] Mills, D. L. Exterior Gateway Protocol Formal Specification, RFC 904, 1984. [7] Tuba, M. New Approach to Topology and Routing Problems in Network Design, Ph. D. thesis, University of Beograde, 1993, pp. 138 (in Serbian) [8] Tuba, M. Optimal Bifurcated Routing in Computer Networks, Proceedings 38th Conference on ETRAN, Nis, Yugoslavia, 1994. [9] Tuba, M. A comparison of Dynamic and Static Routing in Computer Networks, Mathematica Balkanica, Vol. 9, 1995. |