DocumentCode :
2140669
Title :
The application of multicriterion satisfactory optimization in computer networks design
Author :
Xianhai, TAN ; Weidong, Jin ; Duo, ZMO
Author_Institution :
Sch. of Comput. & Commun. Eng., Southwest Jiaotong Univ., Sichuan, China
fYear :
2003
fDate :
27-29 Aug. 2003
Firstpage :
660
Lastpage :
664
Abstract :
The computer networks design is a nonlinear combinatorial optimization problem with constraint set identical to that of the multiple choice multiconstraint knapsack problem, which is known to be NP-complete. We present a new approach in which a multicriterion satisfactory optimization is used in the computer networks design. The optimal computing model is proposed. The satisfactory rate function of the criteria, which represents the importance of performance specification, and the synthesis satisfactory rate function representing the optimization are designed. An improved genetic algorithm is used for optimization computing. Computational experience shows that this method is efficient and effective.
Keywords :
computational complexity; computer networks; genetic algorithms; operations research; NP-complete problem; combinatorial optimization problem; computer networks design; genetic algorithm; link capacity assignment; multiconstraint knapsack problem; multicriterion satisfactory optimization; performance specification; route capacity assignment; Algorithm design and analysis; Application software; Computer networks; Constraint optimization; Design engineering; Design optimization; Genetic algorithms; Intelligent networks; Mathematics; Network synthesis;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Computing, Applications and Technologies, 2003. PDCAT'2003. Proceedings of the Fourth International Conference on
Print_ISBN :
0-7803-7840-7
Type :
conf
DOI :
10.1109/PDCAT.2003.1236386
Filename :
1236386
Link To Document :
بازگشت