Theory of linear and integer programming
Theory of linear and integer programming
On-line load balancing with applications to machine scheduling and virtual circuit routing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Routing high-bandwidth traffic in max-min fair share networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Load-sensitive routing of long-lived IP flows
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Evaluating the impact of stale link state on quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
On the solution of reroute sequence planning problem in MPLS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Competitive routing of virtual circuits in ATM networks
IEEE Journal on Selected Areas in Communications
RATES: a server for MPLS traffic engineering
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
In this paper we evaluate approaches that allow the re-routing of a set of already established label switched paths (LSPs) in multiprotocol label switching (MPLS) networks when a new LSP demand faces constrained shortest path first failure. Two optimization algorithms are proposed: one is based on an integer linear programming formulation of the problem, while the other one is a heuristic method based on Dijkstra's shortest path first algorithm: We analyze the efficiency of our algorithms in a dynamic network environment. The simulation experiments show that our method significantly increases the total network throughput. We also investigate the limitations of the applicability of proposed methods considering their running time.