In this paper, on-line allocation of routes to virtual circuits (point-to-point) is considered which the goal is to route all requests while minimize sum of link bandwidths or maximize reliability in two different constraint problems. It is concentrated on the case of permanent virtual circuits (i.e., once a circuit is established, it exists forever). To obtain routing results, competitive algorithms are introduced for new problems.
