A tabu search heuristic for the dimensioning of 3G multi-service networks

In this paper, we propose a mathematical model for the dimensioning of a 3G multimedia network and design a Tabu search heuristic to solve it. The model is an anticipative one in which we assume that we know a priori the traffic over the planning period, and the dimensioning is consequently defined with a kind of best possible call admission control procedure. Due to the potentially large number of sessions and periods, solving the mathematical program can be done only for small size instances, so a heuristic approach is required for solving larger instances. Experimental results are provided for some multi-service multi-period problems.

[1]  Brigitte Jaumard,et al.  Causal and anticipative models for the dimensioning of 3G multiservice networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[2]  Bezalel Gavish,et al.  A system for routing and capacity assignment in computer communication networks , 1989, IEEE Trans. Commun..

[3]  Christophe Cordier,et al.  On WCDMA downlink multiservice coverage and capacity , 2001, IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211).

[4]  Catherine Voisin.  Dd'un modµ d'optimisation pour le dimensionnement de reseaux troisiµ g¶¶ , 2002 .

[5]  Antti Toskala,et al.  WCDMA for UMTS: Radio Access for Third Generation Mobile Communications , 2000 .

[6]  Amitava Dutta,et al.  A Multiperiod Capacity Planning Model for Backbone Computer Communication Networks , 1992, Oper. Res..

[7]  Theodore S. Rappaport,et al.  Wireless Network Evolution: 2G to 3G , 2001 .

[8]  A. Viterbi.  CDMA: Principles of Spread Spectrum Communication , 1995 .

[9]  Z. Dziong,et al.  An analysis of near optimal call admission and routing model for multi-service loss networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[10]  Deep Medhi,et al.  Network dimensioning and performance of multiservice, multirate loss networks with dynamic routing , 1997, TNET.

[11]  André Girard,et al.  Dimensioning of adaptively routed networks , 1993, TNET.

[12]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[13]  Pierre Hansen,et al.  Algorithms for the maximum satisfiability problem , 1987, Computing.

[14]  András Rácz,et al.  Voice QoS in third-generation mobile systems , 1999, IEEE J. Sel. Areas Commun..

[15]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[16]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the multiple node case , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[17]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[18]  Deep Medhi,et al.  Some approaches to solving a multihour broadband network capacity design problem with single-path routing , 2000, Telecommun. Syst..