A recursive algorithm for bandwidth partitioning

We consider complete partitioning of bandwidth among multiple services. When class bandwidth is an integer multiple of the next lower class and total bandwidth is an integer multiple of the largest class bandwidth, we develop a recursive algorithm that determines the optimal complete partitioning policy with a significantly lower complexity than that of known dynamic programming or mixed integer programming approaches.