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

Author

Fortin, Alexandre ; Hail, Nourredine ; Jaumard, Brigitte

Author_Institution

Dept. of Electr. Eng., Ecole Polytech. de Montreal, Que., Canada

Volume

3

fYear

2003

fDate

20-20 March 2003

Firstpage

1439

Abstract

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.

Keywords

3G mobile communication; multimedia communication; search problems; telecommunication congestion control; telecommunication traffic; 3G multimedia network; 3G multiservice network; GoS; QoS; call admission control procedure; grade of service; mathematical model; multihour network; network dimensioning; quality of service; single path routing; tabu search heuristic; Base stations; Computer science; Downlink; Mathematical model; Multiaccess communication; Operations research; Quality of service; Radio network; Routing; Traffic control;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications and Networking, 2003. WCNC 2003. 2003 IEEE

Conference_Location

New Orleans, LA, USA

ISSN

1525-3511

Print_ISBN

0-7803-7700-1

Type

conf

DOI

10.1109/WCNC.2003.1200598

Filename

1200598