On the solution of reroute sequence planning problem in MPLS networks

Computer Networks

Volumn 42, Issue 2, 2003, Pages 199-210

  Józsa, Balázs Gábor ^a,b   Makai, Márton ^c  

^a ERICSSON RESEARCH   (Hungary)

^b BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

^c EÖTVÖS LORÁND UNIVERSITY   (Hungary)

Author keywords

MPLS; Path optimization; Rerouting; Sequence planning; Traffic engineering

Indexed keywords

ALGORITHMS; INTERNET; TELECOMMUNICATION TRAFFIC;

MULTIPROTOCOL LABEL SWITCHING (MPLS) NETWORKS;

SWITCHING NETWORKS;

EID: 0037544302     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1389-1286(03)00189-0     Document Type: Article

References (21)

1. Alon N. A parallel algorithmic version of the local lemma. Random Structures & Algorithms. 2:1991;367-378.
2. J. Ash, Y. Lee, P. Ashwood-Smith, B. Jamoussi, D. Fedyk, D. Skalecki, L. Li, LSP modification using CR-LDP, Internet Engineering Task Force, Request For Comments (Proposed Standard) 3214, January 2002.
3. Awduche D. MPLS and traffic engineering in IP networks. IEEE Communications Magazine. 37(12):1999;42-47.
4. D. Awduche, J. Malcolm, J. Agogbua, M. O'Dell, J. McManus, Requirements for traffic engineering over MPLS, Internet Engineering Task Force, Request For Comments (Proposed Standard) 2702, September 1999.
5. Bárány I., Grinberg V.S. On some combinatorial questions in finite-dimensional spaces. Linear Algebra and its Applications. 41:1981;1-9.
6. Bárány I., Fiala T. Többgépes ütemezési problémák közel optimális megoldása. Szigma. 15(3):1982;177-191. (in Hungarian).
7. Beck J. An algorithmic approach to the Lovász local lemma. Random Structures & Algorithms. 2:1991;343-365.
8. Beck J., Sós V.T. Discrepancy theory. Graham R., Grötsel M., Lovász L. Handbook of Combinatorics. 1995;1405-1446 Elsevier, Amsterdam.
9. Erdos P., Lovász L. Problems and results on 3-chromatic hypergraphs and some related questions. Hajnal A.et al. Infinite and Finite Sets. Colloq. Math. Soc. J. Bolyai. vol. 11:1975;609-627 North-Holland, Amsterdam.
10. Grinberg V.S., Sevastyanov S.V. O velicine konstanty Steinica. Funkcionalnij Analiz i Prilozen. 14/2:1980;56-57. (in Russian); [Functional Analysis and its Applications 14 (1980) 125-126], MR 81h:52008.
11. Hochbaum D.S. Approximation Algorithms for NP-hard Problems. 1997;PWS Publishing Company, Boston, MA. (Chapter 1).
12. Hoeffding W. Probability inequalities for sums of bounded random variables. American Statistical Association Journal. 58:1963;13-30.
13. B. Jamoussi (Ed.), Constraint-based LSP setup using LDP, Internet Engineering Task Force, Request For Comments (Proposed Standard) 3212, January 2002.
14. Józsa B.G., Király Z., Magyar G., Szentesi Á An efficient algorithm for global path optimization in MPLS networks. Optimization and Engineering. 2(3):2001;321-347.
15. B.G. Józsa, G. Magyar, Reroute sequence planning for label switched paths in multiprotocol label switching networks, in: IEEE Symposium on Computers and Communications, Hammamet, Tunisia, 2001.
16. B.G. Józsa, Reroute sequence planning for protected traffic flows in GMPLS networks, in: IEEE International Conference on Communications, New York, 2002.
17. Raghavan P. Probabilistic construction of deterministic algorithms: approximating packing integer programs. Journal of Computer and System Sciences. 37:1988;130-143.
18. Sevastyanov S.V. On some geometric methods in scheduling theory: a survey. Discrete Applied Mathematics. 55:1994;59-82.
19. Spencer J. Balancing games. Journal of Combinatorial Theory Series B. 23:1977;68-74.
20. Spencer J. Balancing vectors in the max norm. Combinatorica. 6:1986;55-65.
21. Xiao X., Hannan A., Bailey B., Ni L.M. Traffic engineering with MPLS in the internet. IEEE Network. 14(2):2000;28-33.