Adaptive Feedback Compensation for Distributed Load-Based Routing Systems in Datagram Packet-Switched Communications Networks

摘要

This paper advanced the idea that the incorporation of AFC into routing systems enables significant performance advantages above moderate offered loads. Dynamical instabilities at moderate offered loads were observed with the current nonadaptive feedback compensation technique and the need for AFC, which compensates for the decreasing applicability of the implicit routing assignment independence assumption of Dijkstra's SPF Algorithm, was argued. A GA which searches for the optimal number, and distribution, of updating routing assignments during each routing update interval was proposed as a means to implement AFC.