#### DMCA

## MPLS (2000)

### Citations

13826 |
Computers and Intractability: A Guide to the Theory of NP-Completeness
- Garey, Johnson
- 1979
(Show Context)
Citation Context ...that we can set up the new LSP. The non-trivial problem here is to find an existing LSP that can be re-routed so that after the re-routing the new LSP can also be established. This problem is NP-hard =-=[7]-=-, therefore we propose a heuristic algorithm for its solution. Since we need path information of already established LSPs, the re-optimization can be done primarily in a network operation center rathe... |

9 |
Minimum Interference Routing with Applications to
- Kodialam, Lakshman
- 2000
(Show Context)
Citation Context ...ds proposed for ATM networks (see e. g. [4], [5]) could be re-used to improve LSP path selection performance, by implementing local strategies that result in globally near-optimal solutions. Recently =-=[6]-=- proposed the concept of minimum interference routing that is based on this idea. The newly developed algorithm presented in this papersIEEE ICCCN 2000 2 is intended to be used in the case when on-dem... |

7 |
Requirements for traffic engineering over MPLS. Request for Comments (Informational) 2702, Internet Engineering Task Force
- Awduche, Malcolm, et al.
- 1999
(Show Context)
Citation Context ...formance on the long run. One solution for this is to perform periodical (not too frequent, e. g. daily or weekly) global re-optimization of LSPs with a centralized off-line network optimization tool =-=[3]-=-. Another approach is to make the CSPF computation itself more intelligent by implementing akindofpreventive strategy. Concepts used in dynamic routing methods proposed for ATM networks (see e. g. [4]... |

2 |
Haynal’s ISP
- Haynal, Russ
(Show Context)
Citation Context ...T IP Backbone. It contains 25 backbone nodes and 88 links, resulting in an average 3.52 node degree. The exact topology and capacity values of this network (and of many others) are publicly available =-=[11]-=-. The main purpose of the first round of our simulations was to determine the difference in successful LSP establishment probability between the constrained shortest path first (CSPF) algorithm and ou... |

1 |
Competitive Routing of Virtual Circuits in ATM
- Plotkin
- 1995
(Show Context)
Citation Context ...[3]. Another approach is to make the CSPF computation itself more intelligent by implementing akindofpreventive strategy. Concepts used in dynamic routing methods proposed for ATM networks (see e. g. =-=[4]-=-, [5]) could be re-used to improve LSP path selection performance, by implementing local strategies that result in globally near-optimal solutions. Recently [6] proposed the concept of minimum interfe... |

1 |
Áron Szentesi, Balázs Szviatovszki, Analysis of link cost functions for
- Magi, Nagy
- 1998
(Show Context)
Citation Context ...Another approach is to make the CSPF computation itself more intelligent by implementing akindofpreventive strategy. Concepts used in dynamic routing methods proposed for ATM networks (see e. g. [4], =-=[5]-=-) could be re-used to improve LSP path selection performance, by implementing local strategies that result in globally near-optimal solutions. Recently [6] proposed the concept of minimum interference... |

1 |
Theory of Linear and Integer Programming 1986
- Schrijver
(Show Context)
Citation Context ...describe how to solve efficiently the ILP problem formulated in the previous section. Basically, any ILP software package can be used. The ILP solver packages use the so-called branch&bound technique =-=[8]-=- to solve an integer program. In our case this means solving several times the problem (2),(1a)-(1e) with some predefined variables but without the integrality constraints.sIEEE ICCCN 2000 4 We tested... |

1 |
Jeroen Dirks, lp solve 2.2, ftp://ftp.es.ele.tue.nl/pub/lp solve
- Berkelaar
(Show Context)
Citation Context ...rogram. In our case this means solving several times the problem (2),(1a)-(1e) with some predefined variables but without the integrality constraints.sIEEE ICCCN 2000 4 We tested the lp solve package =-=[9]-=- and it gave good results. However, we found that for larger graphs lp solve can be slow. This comes from the fact that lp solve uses the simplex method to solve the LP problem, which can be inefficie... |