Cooperative Cross-Entropy method for generating entangled networks |
| |
Authors: | Kin-Ping Hui |
| |
Affiliation: | (1) Department of Mathematics, University of Queensland, Brisbane, QLD 4072, Australia;(2) School of Mathematics and Applied Statistics, University of Wollongong, Wollongong, NSW 2522, Australia;(3) School of Mathematical Sciences, Queensland University of Technology, Brisbane, QLD 4001, Australia;(4) School of Mathematical Sciences, Monash University, Clayton, VIC, 3800, Australia |
| |
Abstract: | Survivability is rapidly becoming an important criterion in network design and planning. This is due to our increased dependence on ever more complex communication networks. Another important criterion which plays a central role in design and planning decisions is cost. As a result, network planners tend to design sparse networks to minimise cost. There is a class of networks known as entangled networks which seems to satisfy both criteria of survivability and sparseness. In this paper, we demonstrate how the Cross-Entropy method may be utilised to generate entangled networks. We also propose a cooperative optimisation approach to further improve the generation of an optimal entangled network. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|