COMPETITIVE ROUTING OF VIRTUAL CIRCUITS IN ATM NETWORKS

Classical routing and admission control strategies achieve provably go od performance by relying on an assumption that the virtual circuits a rrival pattern can be described by some a priori known probabilistic m odel. Recently a new on-line routing framework, based on the notion of competitive analysis, was proposed This framework is geared toward de sign of strategies that have provably good performance even in the cas e where there are no statistical assumptions on the arrival pattern an d parameters of the virtual circuits. The on-line strategies motivated by this framework are quite different from the min-hop and reservatio n-based strategies. This paper surveys the on-line routing framework, the proposed routing and admission control strategies, and discusses s ome of the implementation issues.