Competitive admission control and routing for multi-service general topology networks
Abel Dasylva, R. Srikant · 2003
We consider the problem of routing permanent virtual circuits over general-topology networks under some shortest-path rule. We derive bounds on the competitiveness ratio of any online algorithm as a function of the cost function used to describe the congestion on each network element, link or node.