Abstract: Methods and apparatus are provided for designing traffic distribution in a multiple-service packetized network using such multicommodity flows and well-linked terminals. Arbitrary multicommodity flows f are transformed to sets of well-linked terminals. The multicommodity flows are represented in a graph G having a set of k node-pairs s1t1, . . . ,sktk, each having a positive integer demand di and a positive weight wi. The graph G is partitioned into a collection of node-disjoint subgraphs wherein each sub-graph H contains a set of terminals, where {right arrow over (?)} is a non-negative weight function on a set X of nodes in the graph G; and then the set of terminals are clustered to a subset of terminals that is at least ¼-flow-linked or ¼-cut-linked.