Routing and Admission Control in General Topology Networks

摘要

The paper suggests a new non-greedy routing and admission control algorithm forgeneral topology networks. In contrast to previous algorithms, the algorithm does not require advance knowledge of the traffic patterns. The algorithm combines key ideas from a recently developed theoretical algorithm with a stochastic analysis developed in the context of reservation-based algorithms. The authors evaluate the performance of their algorithm using extensive simulations on an existing commercial network topology and on variants of that topology. The simulations show that the algorithm outperforms greedy admission control over a broad range of network environments. The simulations also illuminate some important characteristics of the algorithm. For example, the authors characterize the importance of the implicit routing effects of the admission control part of the algorithm.