An Optical Distribution Network Partitioning Method Based on the Branch-and-Bound

Abstract

Optical Distribution Network is a kind of optical transmission path connecting Optical Line Terminal and Optical Network Unit. This article mainly studies how to optimize broadband loan problems of the backbone network. In order to get the best allocation scheme of the Optical Distribution Network problems, we propose a solution which is converting the Optical Distribution Network partitioning problem into a graph partitioning model, and solve the problem by adopting Graph partitioning algorithms. Graph partitioning is about the undirected graph , is the collection of all vertexes. is the collection of all sides. Any vertex in the vertex set has weight value of a positive integer. Any side in a side set has weight value of a positive integer. The vertex set is divided into non-intersecting subsets , and .As to every subset , it has ,,.What we need to solve is to get the minimum sum of weight values between m non-intersecting subsets. The experimental results show that Graph partitioning algorithm is efficient.