Showing papers on "Routing table published in 1975"
TL;DR: It has turned out that due to the requirements for TIDAS the best routing procedure is a one-parametric adaptive method, which has built-in instruments to adapt to the different situations that can arise in the net, for instance, when line and/or node errors occur.
Abstract: In this paper an investigation of some routing methods suitable for a special computer communication network called TIDAS-T, in which the traffic exchange is done according to the store and forward message-switching technique, is elucidated. The properties of different routing procedures and sensitivity of some parameter settings during the various conditions, that may occur in this network, have been studied by simulations with a specially made model for the TIDAS-T computer network. It has turned out that due to the requirements for TIDAS the best routing procedure is a one-parametric adaptive method, which has built-in instruments to adapt to the different situations that can arise in the net, for instance, when line and/or node errors occur. This procedure is in principal similar to the one used in the Advanced Research Projects Agency (ARPA) net. However, some extensions and added features, such as the introduction of the concepts split horizon, immediate updating mode and skipping constant, have given the procedure more power to react on complex net errors and to reduce circulating traffic. The method is in principal quite general and will therefore be suitable for many other message-switching computer networks. However, the parameter settings in the procedure are specially tuned for this network by simulation runs.
41 citations
18 Feb 1975
TL;DR: Comparisons of existing adaptive routing techniques are presented to provide the basis for extension of the theory in two areas: priority assignment for messages reaching an assigned aging threshold, and prevention of messages looping within the network.
Abstract: : Adaptive routing algorithms in store-and-forward communication networks are demonstrated to decrease average message delay, to increase message throughput, and to decrease the number of undelivered messages Comparisons of existing adaptive routing techniques are presented to provide the basis for extension of the theory in two areas: priority assignment for messages reaching an assigned aging threshold, and prevention of messages looping within the network Optimization of a defined measurement parameter, throughput factor, phi (t,k) is performed in terms of the priority threshold setting k A closed form solution for phi (t,k) is obtained on a 3-node network assuming infinite buffers and fixed routing Included are simulations on damaged and undamaged systems for specific inter-connected networks with finite buffers and adaptive routing Comparisons are made for the predicted phi (t,k) versus the simulated results on an undamaged network
4 citations