Hierarchical spanning tree network design with Nash genetic algorithm |
| |
Authors: | Jong Ryul Kim Jae Uk Lee Jung-Bok Jo |
| |
Affiliation: | 1. Department of Mental Health and Public Medicine, Section of Infectious Diseases, Second University of Naples, Italy;2. Hepatology Unit, Ospedale Universitario di Pisa, Italy;3. Infectious Diseases Unit, AO Sant''Anna e San Sebastiano, Caserta, Italy;4. Department of Clinical and Experimental Medicine and Surgery “F. Magrassi e A. Lanzara”, Second University of Naples, Naples, Italy;1. LIFL, Université Lille 1, Bât. M3, 59655 Villeneuve d’Ascq cedex, France;2. INRIA Lille Nord Europe, 40 Av. Halley, 59650 Villeneuve d’Ascq, France;3. Société ALICANTE, 50 Rue Philippe de Girard, 59113 Seclin, France;1. Department of Electrical Engineering and Computer Science, University of Kansas, Lawrence, KS 66045-7621, USA;2. Department of Expert Systems and Artificial Intelligence, University of Information Technology and Management, 35-225 Rzeszow, Poland;3. Department of Computer Science, Rzeszow University, 35–310 Rzeszow, Poland;1. Department of Spinal Surgery, Nanfang Hospital, Southern Medical University, Guangzhou, China;2. Department of Spine Surgery, The First People''s Hospital of Chenzhou, Chenzhou, Hunan, China |
| |
Abstract: | In this paper, we will propose a Nash genetic algorithm (Nash GA) for solving a hierarchical spanning tree network design problem, formulated as a bi-level programming problem. The proposed algorithm can be employed in designing the backbone topology in a hierarchical link-state (LS) routing domain. Because the well-designed backbone topology structure has a great impact on the overall routing performance in a hierarchical LS domain, the importance of this research is evident. The proposed algorithm is to find an optimal configuration of backbone network for backbone provider (BP) and distribution network for internet service provider (ISP), properly meeting two-aspect engineering goals: i.e., average message delay and connection costs. Also, it is assumed that there are the decision makers for BP and the decision makers for ISP join in the decision making process in order to non-cooperatively optimize the own objective function. From the experiment results, we can see clearly that our proposed algorithm can be employed in effectively designing the spanning tree network of hierarchical LS routing domain considering not only engineering aspects but also specific benefits from systematical layout of backbone network. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|