Routing and Admission Control in General Topology Networks with Poisson Arrivals

Emerging high speed networks will carry tra c for services such as video-on-demand and video teleconferencing that require resource reservation along the path on which the tra c is sent. High bandwidth-delay product of these networks prevents circuit rerouting, i.e. once a circuit is routed on a certain path, the bandwidth taken by this circuit remains unavailable for the duration holding time of this circuit. As a result, such networks will need e ective routing and admission control strategies. Recently developed online routing and admission control strategies have logarithmic competitive ratios with respect to the admission ratio the fraction of admitted circuits. Such guarantees on performance are rather weak in the most interesting case where the rejection ratio of the optimum algorithm is very small or even 0. Unfortunately, these guarantees can not be improved in the context of the considered models, making it impossible to use these models to identify algorithms that are going...

• Type: Conference
• Year: 1996
• Where: SODA
• Authors: Anil Kamath, Omri Palmon, Serge A. Plotkin
• Keywords: Admission Control Strategies, Algorithms, Holding Times, Rejection Ratio, SODA 1996