A solving method for singly routing traffic demand in telecommunication networks;Une MÉthode de RÉsolution Pour le ProblÈme de Monoroutage des Demandes de Trafic dans un RÉseau de TÉlÉcommunication

Annales des Telecommunications/Annals of Telecommunications

Volumn 56, Issue 3-4, 2001, Pages 140-149

  Geffard, J ^a  

^a ORANGE LABS   (France)

Author keywords

Graph flow; Heuristic method; Mathematical programming; Network routing; Relaxation method; Telecommunication network; Teletraffic

Indexed keywords

BANDWIDTH; FLOW GRAPHS; INTERNET PROTOCOLS; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; TELECOMMUNICATION INDUSTRY; ASYNCHRONOUS TRANSFER MODE; CONSTRAINT THEORY; HEURISTIC METHODS; ROUTERS; TELECOMMUNICATION TRAFFIC;

POINT-TO-POINT DEMANDS; RELAXATION METHODS; ROUTING TRAFFIC; SINGLE PATH; SOLVING METHOD; TELECOMMUNICATIONS INDUSTRY; TELECOMMUNICATIONS NETWORKS; TELETRAFFIC; TRAFFIC DEMANDS; VIRTUAL CHANNELS;

HEURISTIC METHODS; TELECOMMUNICATION NETWORKS;

EID: 0035270039     PISSN: 00034347     EISSN: 19589395     Source Type: Journal    
DOI: 10.1007/BF03002697     Document Type: Article

References (15)

1. Ahuja (R.K.), Magnanti (T.L.), andOrlin (J.B.), Network Flows: Theory, Algorithm, and Applications,Prentice Hall, Englewood Cliffs, NJ, 1993.
2. Barnhart, (C.),Hane (C.A.),Johnson (E.L.),Sigismoncli (G.), A column generation and partitioning approach for multicommodity flow problems,Telecommunication Systems 3 pp. 329–358, 1995a.
3. Ben-Ameur (W.),Liau (B.),Gourdin. (W.E.), Internet routing and topology issues submitted to Networks (presented in drcn 2000), 2000.
4. Barnhart (C.), Johnson (E.L.), Nemhauser (G.L.), Savelsbergh (G.L.), Branch-and-price: Column generation for solving huge integer programs,Operations Research. 46(3) pp. 316–329, 1998. DOI: 10.1287/opre.46.3.316
5. Chardaire (P.),Lisser (A.), Simplex and interior point specialized algorithms for solving nonoriented multicommodity flow problems,Accepted subject to revision in Operations Research, revise version available at http://www.uea.ac.uk/People/pc, 1998
6. CPLEx Inc. cplex callable library,cplex Optimization, 1994.
7. Dantzig (G.B.),Wolfe (P.), Decomposition principle for linear programs,Oper. Res. 8 pp. 108–111, 1960.
8. Ghu (W.), Nemhauser (G.L.), andSavelsbergh (M.P.W.), Lifted cover inequalities for 0-1 integer programs I: computation, Report coc-95-02,Industrial ans System Engineering, Georgia Institute of Technology, Atlanta, GA, 1995.
9. Ghu (W.), Nemhauser (G.L.), andSavelsbergh (M.P.W.), Lifted cover inequalities for 0-1 integer programs II: complexity, Report coc-95-03,Industrial ans System Engineering, Georgia Institute of Technology, Atlanta, GA, 1995.
10. Lutton (J.L.),Geffard (J.), Dimensionnement pour des réseaux de télécommunication sûrs,in proceeding of francoro II,Sousse, 1998.
11. Nace (D.), Ben-Ameur (W.), Méthodes, techniques et stratégies de reroutage pour les réseaux de télécommunication,Calculateurs Parallèles, Vol. 11, 1999.
12. Nemhauser (G.L.),Wolsey (L.A.), Integer and combinatorial optimization,Wiley Interscience, 1988.
13. Minoux (M.), Programmation mathématique: Théorie et algorithmes,Dunod, 1983.
14. Padberg (N.), Rinakdi (G.), A branch-and-cut algorithm for the resolution of large-scale symmetric travelling salesman problems,SIAM Review 33, pp. 60–100, 1991. DOI: 10.1137/1033004
15. Park (K.), Kang (S.), Park (S.), An integer programming approach to the bandwidth paching problem,Management Science, Vol. 42, # 9, 1996.