Dynamic interval routing on asynchronous rings

We consider the problem of routing in an asynchronous dynamically changing ring of processors using schemes that minimize the storage space for the routing information. In general, applying static techniques to a dynamic network would require significant re-computation. Moreover, the known dynamic techniques applied to the ring lead to inefficient schemes. In this paper we introduce a new technique, Dynamic Interval Routing, and we show trade offs between the stretch, the adaptation cost and the size of the update messages used by routing schemes based upon it. We give three algorithms for rings of maximum size N: the first two are deterministic, one with adaptation cost zero but stretch N/2, the other with adaptation cost O(N) messages of O (log N) bits and stretch 1. The third algorithm is randomized, uses update messages of size O(k log N), has adaptation cost O(k) and expected stretch 1+1/k, for any k⩾1. All schemes require O(log N) bits per node for the routing information and all messages headers are of O(log N) bits