Resource allocation adaptive to traffic changes in communication networks

Next-generation communication networks will require the ability to adaptively maintain their performance against traffic changes and service diversification. To achieve this ability in connectionless packet networks, we propose a method of network resource allocation and topology arrangement adaptive to traffic demand. An optimization problem of such resources as the node service rate and link bandwidth is defined in the network layer, and solved with the Hamiltonian algorithm, which is effective in searching for the optimum solution with a large number of unknown variables. The obtained solution shows the contribution of every link to packet transportation and therefore enables the network topology to be arranged. Network resources are optimized again for the arranged topology. The proposed method is applied to a network that exhibits traffic concentrated to its backbone nodes. Successful resource allocation and topology arrangement are confirmed