A GRASP with path‐relinking for private virtual circuit routing

A frame relay service offers virtual private networks to customers by provisioning a set of long-term private virtual circuits (PVCs) between customer endpoints on a large backbone network. During the provisioning of a PVC, routing decisions are made without any knowledge of future requests. Over time, these decisions can cause inefficiencies in the network and occasional offline rerouting of the PVCs is needed. In this paper, the offline PVC routing problem is formulated as an integer multicommodity flow problem with additional constraints and with an objective function that minimizes propagation delays and/or network congestion. We propose variants of a GRASP with path-relinking heuristic for this problem. Experimental results for realistic-size problems are reported, showing that the proposed heuristics are able to improve the solutions found with standard routing techniques. Moreover, the structure of our objective function provides a useful strategy for setting the appropriate value of its weight parameter, to achieve some quality of service (QoS) level defined by a desired balance between propagation delay and delay due to network congestion. © 2003 Wiley Periodicals, Inc.

[1]  Jennifer Ryan,et al.  A column generation algorithm for bandwidth packing , 1993, Telecommun. Syst..

[2]  Fred W. Glover,et al.  Tabu Search , 1997, Handbook of Heuristics.

[3]  S. Binato,et al.  A GRASP FOR JOB SHOP SCHEDULING , 2001 .

[4]  Imrich Chlamtac,et al.  Optimizing the system of virtual paths , 1994, TNET.

[5]  John L. Bresina,et al.  Heuristic-Biased Stochastic Sampling , 1996, AAAI/IAAI, Vol. 1.

[6]  Chang Sup Sung,et al.  An algorithm for configuring embedded networks in reconfigurable telecommunication networks , 1995, Telecommun. Syst..

[7]  Frank Yeong-Sung Lin,et al.  A routing algorithm for virtual circuit data networks with multiple sessions per O - D pair , 1992, Networks.

[8]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[9]  Erik Rolland,et al.  Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures , 1999, Eur. J. Oper. Res..

[10]  Philippe Mahey,et al.  A Survey of Algorithms for Convex Multicommodity Flow Problems , 2000 .

[11]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

[12]  Alon Itai,et al.  On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..

[13]  Celso C. Ribeiro,et al.  A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs , 2002, INFORMS J. Comput..

[14]  Larry J. LeBlanc,et al.  Packet Routing in Telecommunication Networks with Path and Flow Restrictions , 1999, INFORMS J. Comput..

[15]  Cynthia Barnhart,et al.  Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..

[16]  Mario Gerla,et al.  Topology design and bandwidth allocation in ATM nets , 1989, IEEE J. Sel. Areas Commun..

[17]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[18]  Mikkel Thorup,et al.  Increasing Internet Capacity Using Local Search , 2004, Comput. Optim. Appl..

[19]  Celso C. Ribeiro,et al.  Local search with perturbations for the prize‐collecting Steiner tree problem in graphs , 2001, Networks.

[20]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[21]  F. Glover,et al.  Fundamentals of Scatter Search and Path Relinking , 2000 .

[22]  Fred Glover,et al.  Multi-Start and Strategic Oscillation Methods - Principles to Exploit Adaptive Memory , 2000 .

[23]  F. Glover,et al.  Bandwidth packing: a tabu search approach , 1993 .

[24]  Ue-Pyng Wen,et al.  Optimizing the system of virtual paths by tabu search , 2001, Eur. J. Oper. Res..

[25]  Geir Dahl,et al.  Routing Through Virtual Paths in Layered Telecommunication Networks , 1999, Oper. Res..

[26]  Daniel O. Awduche,et al.  Requirements for Traffic Engineering Over MPLS , 1999, RFC.

[27]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

[28]  Celso C. Ribeiro,et al.  Probability Distribution of Solution Time in GRASP: An Experimental Investigation , 2002, J. Heuristics.

[29]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[30]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..

[31]  Mikkel Thorup,et al.  Internet traffic engineering by optimizing OSPF weights , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[32]  Panos M. Pardalos,et al.  GRASP With Path Relinking For The Three-Index Assignment Problem , 2000 .