A GRASP with Path-Relinking for Private Virtual Circuit Routing

Networks

Volumn 41, Issue 2, 2003, Pages 104-114

  Resende, Mauricio G C ^a   Ribeiro, Celso C ^b  

^a AT AND T LABS RESEARCH   (United States)

^b PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Bandwidth packing; Frame relay; GRASP; Metaheuristics; Multicommodity network flows; Offline rerouting; Path relinking; Private virtual circuit; Routing

Indexed keywords

FRAME RELAY; GRASP; METAHEURISTICS; MULTICOMMODITY NETWORK FLOWS; OFFLINE REROUTING; PATHLINKING; PRIVATE VIRTUAL CIRCUITS (PVC); ROUTING;

ALGORITHMS; BANDWIDTH; COMPUTER SCIENCE; CONGESTION CONTROL (COMMUNICATION); PROBLEM SOLVING; QUALITY OF SERVICE; ROUTERS;

COMPUTER NETWORKS;

EID: 2142736143     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10065     Document Type: Article

References (32)

1. R.M. Aiex, M.G.C. Resende, P.M. Pardalos, and G. Toraldo, GRASP with path-relinking for the three-index assignment problem, Technical report, AT&T Labs Research, 2000.
2. R.M. Aiex, M.G.C. Resende, and C.C. Ribeiro, Probability distribution of solution time in GRASP: An experimental investigation, J Heurist 8 (2002), 343-373.
3. A. Amiri, E. Rolland, and R. Barkhi, Bandwidth packing with queueing delay costs: Bounding and heuristic solution procedures, Eur J Oper Res 112 (1999), 635-645.
4. C. Barnhart, C.A. Hane, and P.H. Vance, Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems, Oper Res 48 (2000), 318-326.
5. D. Bertsekas and R. Gallager, Data networks, 2nd ed., Prentice-Hall, Englewood Cliffs, NJ, 1992.
6. S. Binato, W.J. Hery, D. Loewenstern, and M.G.C. Resende, "A GRASP for job shop scheduling," Essays and surveys on metaheuristics, C.C. Ribeiro and P. Hansen (Editors), Kluwer, Boston, 2002, pp. 59-79.
7. J.L. Bresina, Heuristic-biased stochastic sampling, Proc 13th National Conf on Artificial Intelligence, American Association for Artificial Intelligence, Portland, 1996, pp. 271-278.
8. K. Calvert, M. Doar, and E.W. Zegura, Modeling Internet topology, IEEE Commun Mag 35 (1997), 160-163.
9. S.A. Canuto, M.G.C. Resende, and C.C. Ribeiro, Local search with perturbations for the prize-collecting Steiner tree problem in graphs, Networks 38 (2001), 50-58.
10. I. Chlamtac, A. Faragó, and T. Zhang, Optimizing the system of virtual paths, IEEE/ACM Trans Network 2 (1994), 581-587.
11. G. Dahl, A. Martin, and M. Stoer, Routing through virtual paths in layered telecommunication networks, Oper Res 47 (1999), 693-702.
12. S. Even, A. Itai, and A. Shamir, On the complexity of timetable and multicommodity flow problems, SIAM J Comput 5 (1976), 691-703.
13. T.A. Feo and M.G.C. Resende, Greedy randomized adaptive search procedures, J Global Optim 6 (1995), 109-133.
14. B. Fortz and M. Thorup, Internet traffic engineering by optimizing OSPF weights, Proc IEEE INFOCOM 2000 - The Conference on Computer Communications, IEEE, Tel-Aviv, pp. 519-528.
15. M. Gerla, J.A.S. Monteiro, and R. Pazos, Topology design and bandwidth allocation in ATM nets, IEEE J Select Areas Commun 7 (1989), 1253-1262.
16. F. Glover, "Tabu search and adaptive memory programming - advances, applications and challenges," Interfaces in computer science and operations research, R.S. Barr, R.V. Helgason, and J.L. Kennington (Editors), Kluwer, Boston, 1996, pp. 1-75.
17. F. Glover, "Multi-start and strategic oscillation methods - principles to exploit adaptive memory," Computing tools for modeling, optimization and simulation: Interfaces in computer science and operations research, M. Laguna and J.L. Gonzáles-Velarde (Editors), Kluwer, Boston, 2000, pp. 1-24.
18. F. Glover and M. Laguna, Tabu search, Kluwer, Boston, 1997.
19. F. Glover, M. Laguna, and R. Martí, Fundamentals of scatter search and path relinking, Control Cybernet 39 (2000), 653-684.
20. M. Laguna and F. Glover, Bandwidth packing: A tabu search approach, Mgmt Sci 39 (1993), 492-500.
21. M. Laguna and R. Martí, GRASP and path relinking for 2-layer straight line crossing minimization, INFORMS J Comput 11 (1999), 44-52.
22. L.J. LeBlanc, J. Chifflet, and P. Mahey, Packet routing in telecommunication networks with path and flow restrictions, INFORMS J Comput 11 (1999), 188-197.
23. A. Ouorou, P. Mahey, and J.P. Vial, A survey of algorithms for convex multicommodity flow problems, Mgmt Sci 46 (2000), 126-147.
24. M. Parker and J. Ryan, A column generation algorithm for bandwidth packing, Telecommun Syst 2 (1994), 185-195.
25. L.I.P. Resende and M.G.C. Resende, "A GRASP for frame relay permanent virtual circuit routing," Extended abstracts of MIC'99 - The III Metaheuristics International Conference, Angra dos Reis, 1999, P. Hansen and C.C. Ribeiro (Editors), pp. 397-401.
26. C.C. Ribeiro, E. Uchoa, and R.F. Werneck, A hybrid GRASP with perturbations for the Steiner problem in graphs, INFORMS J Comput 14 (2002), 228-246.
27. C.-C. Shyur and U.-E. Wen, Optimizing the system of virtual paths by tabu search, Eur J Oper Res 129 (2001), 650-662.
28. C.S. Sung and S.K. Park, An algorithm for configuring embedded networks in reconfigurable telecommunication networks, Telecommun Syst 4 (1995), 241-271.
29. B.M. Waxman, Routing of multipoint connections, IEEE J Selected Areas in Commun 6 (1998), 1617-1622.
30. J.R. Yee and F.Y.S. Lin, A routing algorithm for virtual circuit data networks with multiple sessions per O-D pair, Networks 22 (1992), 185-208.
31. E.W. Zegura, GT-ITM: Georgia Tech internetwork topology models (software), Technical report, Georgia Institute of Technology, 1996 (online document at http://www. cc.gatech.edu/fac/Ellen.Zegura/gt-itm/gt-itm.tar.gz, last visited on November 12, 2002).
32. E.W. Zegura, K.L. Calvert, and S. Bhattacharjee, How to model an internetwork, Proc 15th IEEE Conf Comput Commun (INFOCOM), IEEE Press, San Francisco, 1996, pp. 594-602.