Some graph partitioning problems and algorithms related to routing in large computer networks

The problem of partitioning a large computer network into clusters in order to reduce the amount of network resources consumed by the routing algorithm is addressed. The clustering problem is formulated as a general graph partitioning problem. It is shown that the problem of partitioning a graph into a minimum number of clusters with unit weight vertices and a given weight bound on the cluster size is NP-complete if each cluster is required to be internally connected. It is also shown that if a diameter bound is imposed on the cluster instead of the weight bound, then the problem is NP-complete, even when cluster connectivity is not required. An optimum partitioning algorithm is presented for the latter problem when the graph is a tree. An optimum partitioning algorithm is presented for another problem in which each cluster is required to contain exactly one of a set of specified vertices called cluster heads.<<ETX>>

[1]  Sukhamay Kundu,et al.  A Linear Tree Partitioning Algorithm , 1977, SIAM J. Comput..

[2]  M. Schwartz,et al.  Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..

[3]  Nachum Shacham,et al.  Organization of Dynamic Radio Network by Overlapping Clusters: Architecture Considerations and Optimization , 1984, Performance.

[4]  Yehoshua Perl,et al.  Circuit partitioning with size and connection constraints , 1983, Networks.

[5]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[6]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[7]  Jeffrey M. Jaffe,et al.  Establishing Virtual Circuits in Large Computer Networks , 1986, Comput. Networks.

[8]  C. V. Ramamoorthy,et al.  ADAPTIVE HIERARCHICAL ROUTING ALGORITHM. , 1983 .

[9]  Adrian Segall,et al.  Distributed network protocols , 1983, IEEE Trans. Inf. Theory.

[10]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[11]  I. Richer,et al.  A Review of the Development and Performance of the ARPANET Routing Algorithm , 1978, IEEE Trans. Commun..

[12]  Eugene L. Lawler,et al.  Module Clustering to Minimize Delay in Digital Networks , 1969, IEEE Transactions on Computers.

[13]  Jeffrey M. Jaffe,et al.  SNA Networks of Small Systems , 1985, IEEE J. Sel. Areas Commun..

[14]  Farouk Kamoun,et al.  Hierarchical Routing for Large Networks; Performance Evaluation and Optimization , 1977, Comput. Networks.

[15]  Joseph A. Lukes.  Efficient Algorithm for the Partitioning of Trees , 1974, IBM J. Res. Dev..

[16]  F. Amer,et al.  Performance evaluation of a hierarchical hybrid adaptive routing algorithm for large scale computer communication networks , 1988, [1988] Proceedings. Computer Networking Symposium.