4W-09

複数VLAN埋め込みのための最少直径複数スタイナー木問題

Many network design problems involve in finding an optimal path or tree within a given cost-constrained connected network. In the case of VLAN configuration, most are done manually, hence they are usually error-prone, time-consuming and inconsistent especially when the scale of the given network grows larger. In this paper we first define the criteria for evaluating the performance of a VLAN network and use that criteria to construct a Minimum Diameter Multiple Steiner Tree problem that is equivalent to an optimal multiple VLAN configuration problem. By evaluating the optimal solution to the problem, we expect to find the best configuration that maximizes the network performance of a given VLAN network.