Efficient On-line Call Control Algorithms (Extended Abstract)

We study the problem of on-line cull control, i.e., the problem of accepting or rejecting an incoming call without knowledge of future calls. The problem is part of the more general problem of bandwidth allocation and management. Intuition suggests that knowledge of future call arrivals can be crucial to the performance of the system. In this paper, however, we present on-line call control algorithms that, in some circumstances, are competitive, i.e., perform (up to a constant fa.ctor) as well as their off-line, clairvoyant counterparts. We also prove the optimdity of some of our algorithms. The model we consider in this paper is that of a line of nodes, and investiga.te a variety of cases concerning the vuhe of the calls. The value is gained only if the call terminates successfully; otherwiseif the call is rejected, or prematurely terminated-no value is gained. The per