Efficient algorithms for listing combinatorial structures
Efficient algorithms for listing combinatorial structures
Combinatorial optimization
Efficiently constructing candidate set for network topology design
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Why the magic number seven plus or minus two
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
When designing network topology, we need to simultaneously consider multiple criteria, such as network cost and reliability. Therefore, the author applied the analytic hierarchy process (AHP) to network topology evaluation. However, the time required to construct a candidate topology set drastically increases as the network scale grows. So, the author proposed an efficient method for constructing candidate topologies based on the binary partition method. However, the author applied this construction method to only small-scale networks. This paper numerically shows the limitation of this method when applied to large-scale networks and presents a realistic method for constructing candidate topologies for large-scale networks.