1. A method implemented at a data network, wherein the data network contains a plurality of data plane nodes carrying user traffic and a plurality of clusters of a control node managing the plurality of data plane nodes, the method comprising: learning the topology of the plurality of data plane nodes based on one of: registration of the data plane nodes at the control node, and automatic discovery of the data plane nodes at the control node; deriving a graph from a topology of the plurality of data plane nodes, wherein the graph contains vertices, each representing one of the plurality of data plane nodes, and edges, each representing a connection between a pair of data plane nodes within the plurality of data plane nodes; partitioning the graph into a plurality of sub-graphs, each sub-graph containing one or more vertices and edges representing data plane nodes and connections between the data plane nodes respectively, wherein the partition aims at minimizing connectivity among the plurality of sub-graphs, and wherein the plurality of sub-graphs equal to the plurality of clusters; and assigning each cluster to one of the plurality of data plane nodes, wherein each cluster is assigned to one or more data plane node partitioned into a same sub-graph.