Minimum interference routing with applications to MPLS traffic engineering

摘要: This paper presents a new algorithm for dynamic routing of bandwidth-guaranteed tunnels when tunnel requests arrive one-by-one and there is no priori knowledge regarding future requests. problem motivated by service provider needs fast deployment services the consequent need in backbone networks provisioning paths. Offline algorithms cannot be used since they require all that are to routed. Instead, on-line handle arriving satisfy as many potential demands possible needed. The newly developed an based on idea routed must follow route does not "interfere too much" with may critical demand. We show this NP-hard. then develop path selection heuristic deferred loading certain "critical" links. These links identified that, if heavily loaded, would make it impossible between ingress-egress pairs. Like min-hop routing, presented uses link-state information some auxiliary capacity selection. Unlike previous algorithms, proposed exploits any available network points even though themselves unknown.