Multiobjective network design for realistic traffic models

Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference

Volumn , Issue , 2007, Pages 1904-1911

  Banerjee, Nilanjan ^a   Kumar, Rajeev ^b  

^a University of Massachusetts Amherst   (United States)

^b INDIAN INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Combinatorial optimization; Genetic algorithm; Heuristics; Multiobjective optimization; Network topology design; Optimization methods; Pareto front; Self similar traffic

Indexed keywords

COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; HEURISTIC METHODS; MULTIOBJECTIVE OPTIMIZATION;

NETWORK TOPOLOGY DESIGN; OPTIMIZATION METHODS; PARETO FRONT; SELF-SIMILAR TRAFFIC;

TELECOMMUNICATION TRAFFIC;

EID: 34548076343     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1276958.1277341     Document Type: Conference Paper

References (25)

1. J. Arabas and S. Kozdrowski. Applying an evolutionary algorithm to telecommunication network design. IEEE Trans. Evolutionary Computation, 5(4), 309 - 322 2001.
2. A. Atamturk and D. Rajan. Survivable network design: simultaneous routing of flows and slacks. Research Report, IEOR, University of California at Berkeley.
3. L. W. Clarke and G. Anandalingam. An integrated system for designing minimum cost survivable telecommunication networks. IEEE. Trans. Systems, Man and Cybernetics- Part A, 26(6):856 - 862, 1996.
4. C. A. C. Coello, D. A. V. Veldhuizen, and G. B. Lamont. Evolutionary Algorithms for Solving Multiojective Problems. Boston, MA: Kluwer, 2002.
5. T. H. Cormen, C E. Leiserson, R. L. Rivest, and C Stein. Introduction to Algorithms. MIT Press, 2001.
6. K. Deb. Multiobjective Optimization Using Evolutionary Algorithms. Chichester, UK: Wiley, 2001.
7. N. Deo and P. Micikevicius. Comparison of prüfer-like codes for labeled trees. In Proc. 32nd South-Eastern Int. Conf. Combinatorics, Graph Theory and Computing, 2001.
8. T. A. Feo and M. G. C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 1995.
9. C. M. Fonseca and P. J. Fleming. Multiobjective optimization and multiple constraint handling with evolutionary algorithms - Part I: a unified formulation. IEEE Trans. Systems, Man and Cybernetics-Part A: Systems and Humans, 28(1):26 - 37, 1998.
10. H. Frank and W. Chou. Topological optimization of computer networks. Proc. IEEE, 60(11):1395 - 1397, 1972.
11. M. R. Garey and D. S. Johnson. Computers and Interactability: A Guide to the Theory of NP-Completeness. San Francisco, LA: Freeman, 1979.
12. S. Ghose, R. Kumar, N. Banerjee, and R. Datta. Multihop virtual topology design in WDM optical networks for self-similar traffic. Photonic Network Communications, 10(2):199 - 214, Sep. 2005.
13. D. S. Hochbaum. Approximation Algorithms for NP-Hard Problems. Boston, MA: PWS, 1997.
14. R. H. Jan, F. J. Hwang, and S. T. Cheng. Topological optimization of a communication network subject to a reliability constraint. IEEE Trans. Reliability, 42(1):63-69, 1993.
15. J. D. Knowles and D. W. Corne. A comparison of encodings and algorithms for multiobjective minimum spanning tree problems. In Proc. 2001 Congress on Evolutionary Computation (CEC-01), volume 1, pages 544 - 551, May 27-30 2001.
16. K. T. Ko, K. S. Tang, C. Chan, K. F. Man, and S. Kwong. Using multiobjective genetic algorithms to design mesh networks. IEEE Computer, 30(8):56 - 61, 1997.
17. R. Kumar and N. Banerjee. Multicriteria network design using evolutionary algorithm. In Proc. Genetic and Evolutionary Computations Conference (GECCO-03), LNCS 2023, pages 2179 - 2190. Springer Verlag, 2003.
18. R. Kumar, P. P. Parida, and M. Gupta. Topological design of communication networks using multiobjective genetic optimization. In Proc. Congress Evolutionary Computation (CEC-2002), pages 425 - 430. IEEE Press, 2002.
19. R. Kumar and P. I. Rockett. Improved Sampling of the Pareto-front in Multiobjective Genetic Optimization by Steady-State Evolution: A Pareto Converging Genetic Algorithm. Evolutionary Computation, 10(3):283 - 314, 2002.
20. R. Kumar, P. K. Singh, and P. P. Chakrabarti. Multiobjective EA approach for improved quality of solutions for spanning tree problem. In Proc. Int. Conf. Evolutionary Multi-Criterion Optimization (EMO-05), LNCS 3410, pages 811 - 825, 2005.
21. V. Paxson and S. Floyd. Wide-area traffic: The failure of Poisson modelling. IEEE/ACM Trans. Networking, 3(3):226 - 244, 1995.
22. G. R. Raidl and B. A. Julstrom. Greedy heuristics and an evolutionary algorithm for the bounded-diameter minimum spanning tree problem. In Proc. 18th ACM Symposium on Applied Computing (SAC 2003), pages 747 - 752, March 9-12 2003.
23. R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, and H. B. Hunt. Approximation algorithms for degree-constrained minimum-cost network design problems. Algorithmica, 31(1):58 - 78, 2001.
24. H.-P. Schwefel. Performance analysis of intermediate systems serving aggregated ON/OFF traffic with long-range dependent properties. PhD Thesis, Institute für Informatik: Technischen Universität München, 2000.
25. G. Zohu and M. Gen. Genetic algorithm approach on multi-criteria minimum spanning tree problem. European J. Operations Research, 114(1):141-152, April 1999.