Browse > Article

A Processor Assignment Problem for ATM Switch Configuration  

Han, Junghee (College of Business Administration, Kangwon National University)
Lee, YoungHo (Department of Industrial Systems and Information Engineering, Korea University)
Publication Information
Management Science and Financial Engineering / v.10, no.2, 2004 , pp. 89-102 More about this Journal
Abstract
In this paper, we deal with a processor assignment problem that minimizes the total traffic load of an ATM switch controller by optimally assigning processors to ATM interface units. We develop an integer programming (IP) model for the problem, and devise an effective tabu search heuristic. Computational results reveal the efficacy of the proposed tabu search procedure, finding a good quality solution within 5% of optimality gap.
Keywords
Graph partitioning; Tabu search; ATM switch;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Gil, C., J. Ortega, M. G. Montoya, and R. Banos, 'A mixed heuristic for circuit partitioning,' Computational Optimization and Applications 23(2002), 321-340   DOI
2 Kernighan, B. and S. Lin, 'An efficient heuristic procedure for partitioning graphs,' Bell Systems Technical Journal 49 (1970), 291-307   DOI
3 Kim, Y. H. and B. R. Moon, 'Lock-gain based graph partitioning,' Journal of Heuristics 10 (2004), 37-57   DOI
4 Minoux, M., 'On some large-scale L P relaxations for the graph partitioning problem and their optimal solutions,' Annals of Operations Research 58 (1995), 143-154   DOI
5 3GPP, http://www.3gpp.org/ftp/Specs/html-info/25-series.htm. 2004
6 Kirkpatrick, S., C. D. Gelatt Jr. and M. P. Vecchi, 'Optimization by simulated annealing,' Science 220 (1983), 671-680   DOI   PUBMED   ScienceOn
7 Adil, G. K. and J. B. Ghosh, 'Analysis of Lagrangian lower bounds for a graph partitioning problem,' Operations Research 47 (1999), 785-788   DOI   ScienceOn
8 CPLEX, Using the CPLEX Callable Library, Version 9.0, ILOG, Inc., 2004
9 Vigo, D. and V. Maniezzo, 'A genetic/tabu thresholding hybrid algorithm for the process allocation problem,' Journal of Heuristic 3(1997), 91-110   DOI
10 Wiangtong, T., P. Cheung and W. Luk, 'Comparing three heuristic search methods for functional partitioning in hardware-software codesign,' Design Automation for Embedded Systems 6 (2002), 425-449   DOI
11 Bui, T. N. and B. R. Moon, 'Genetic algorithm and graph partitioning,' IEEE Transaction on Computers 45(1996), 841-855   DOI   ScienceOn
12 WCDMA system architecture group, Technical description of WCDMA RNC system, LG Electronics, Inc., 2002
13 Banos, R., C. Gil, J. Ortega and F. G. Montoya, 'A parallel multilevel metatheuristic for graph partitioning,' Journal of Heuristics 10 (2004), 315-336   DOI
14 Myung, Y. S, 'The graph partition problem,' Journal of the Korean Operations Research and Management Science Society 28 (2003), 131-143.   과학기술학회마을
15 Glover, F. and M. Laguna, Tabu Search, Kluwer Academic Publishers, Boston, 1997
16 Randall, M. and A. Abramson, 'A parallel tabu search algorithm for combinatorial optimization problems,' In Proceedings of 6th Australasian Conference on Parallel and Real Time Systems, Springer-Verlag, (1999), 68-79
17 Tu, C. C., C. K. Shieh, and H. Cheng, 'Algorithms for graph partitioning problems by means of eigenspace relaxations,' European Journal of Operational Research 123 (2000), 86-104   DOI   ScienceOn
18 Ahuja, R. K., T. L. Magnanti, and J. B. Orlin, Network Flows, Prentice Hall, New Jersey, 1993