This paper proposes and examines adaptive routing algorithms for communication networks that are subject to damage. These algorithms route calls through the network when the network configuration is not fully known, and adaptively reorder the routing tables as they gather more information about the network configuration. We concentrate on learing mechanisms that reorder the routing tables in real-time. For example, the success-to-top mechanism moves the table entry that led to a successful connection of a call to the top of the routing table. Success-to-top leaves the relative order of the other entries in the routing table unchanged. Other possible schemes include failure-to-bottom (entries that lead to unsuccessful connection attempts are placed on the bottom of the list), and success-up-one (in which the successful entry is moved up by one in the routing table). Markow chain models are described for success-to-top and failure-to-bottom schemes. Analytical expressions for the steady-state probabilities are used to form measures for these two strategies. We compare these measures for a wide selection of blocking probabilities. Further, a simulation provides network measurements not available from the analytical model. The simulation also examines information sharing mechanisms in which a single call is used to change the routing tables at many nodes. We address several mechanisms for information sharing and compare their merits.
Adaptive routing for damaged networks
Eine anpassungsfaehige Leitweglenkung fuer zerstoerte Nachrichtennetze
Proc., 1983 IEEE Military Communications Conf. ; 1 ; 282-288
1983
7 Seiten, 5 Bilder, 1 Tabelle, 16 Quellen
Conference paper
English
Adaptive Control of Damaged Parafoils
British Library Conference Proceedings | 2013
|Adaptive Control of Damaged Parafoils
AIAA | 2013
|Optimal order- routing policy for adaptive routing in real road networks
Elsevier | 2023
|Adaptive Transit Routing in Stochastic Time-Dependent Networks
British Library Online Contents | 2016
|Adaptive Transit Routing in Stochastic Time-Dependent Networks
Online Contents | 2016
|