Optimal Client-Server Assignment for Internet Distributed Systems

We investigate an underlying mathematical model and algorithms for optimizing the performance of a class of distributed systems over the Internet. Such a system consists of a large number of clients who communicate with each other indirectly via a number of intermediate servers. Optimizing the overall performance of such a system then can be formulated as a client-server assignment problem whose aim is to assign the clients to the servers in such a way to satisfy some prespecified requirements on the communication cost and load balancing. We show that 1) the total communication load and load balancing are two opposing metrics, and consequently, their tradeoff is inherent in this class of distributed systems; 2) in general, finding the optimal client-server assignment for some prespecified requirements on the total load and load balancing is NP-hard, and therefore; 3) we propose a heuristic via relaxed convex optimization for finding the approximate solution. Our simulation results indicate that the proposed algorithm produces superior performance than other heuristics, including the popular Normalized Cuts algorithm.

[1]  Bernhard Schölkopf,et al.  Nonlinear Component Analysis as a Kernel Eigenvalue Problem , 1998, Neural Computation.

[2]  S. C. Johnson.  Hierarchical clustering schemes , 1967, Psychometrika.

[3]  Rynson W. H. Lau,et al.  Heat diffusion based dynamic load balancing for distributed virtual environments , 2010, VRST '10.

[4]  Mao Lin Huang,et al.  A Fast Algorithm for Balanced Graph Clustering , 2007, 2007 11th International Conference Information Visualization (IV '07).

[5]  Thinh Nguyen,et al.  Optimal Client-Server Assignment for Internet Distributed Systems , 2013, IEEE Trans. Parallel Distributed Syst..

[6]  John C. S. Lui,et al.  An Efficient Partitioning Algorithm for Distributed Virtual Environment Systems , 2002, IEEE Trans. Parallel Distributed Syst..

[7]  Richard M. Leahy,et al.  An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[8]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[9]  Miklos Kurucz,et al.  Spectral clustering in telephone call graphs , 2007, WebKDD/SNA-KDD '07.

[10]  R. Moller.  Distributed Operating Systems: Concepts And Design , 1998, IEEE Concurrency.

[11]  Kevin J. Lang.  Finding good nearly balanced cuts in power law graphs , 2004 .

[12]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[13]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[14]  Chung-Kuan Cheng,et al.  An improved two-way partitioning algorithm with stable performance [VLSI] , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  A. Hoffman,et al.  Lower bounds for the partitioning of graphs , 1973 .

[16]  Konstantin Andreev,et al.  Balanced Graph Partitioning , 2004, SPAA '04.

[17]  José Duato,et al.  Improving the performance of distributed virtual environment systems , 2005, IEEE Transactions on Parallel and Distributed Systems.

[18]  Feiping Nie,et al.  Improved MinMax Cut Graph Clustering with Nonnegative Relaxation , 2010, ECML/PKDD.

[19]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[20]  Martine D. F. Schlag,et al.  Spectral K-Way Ratio-Cut Partitioning and Clustering , 1993, 30th ACM/IEEE Design Automation Conference.

[21]  Inderjit S. Dhillon,et al.  Weighted Graph Cuts without Eigenvectors A Multilevel Approach , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[22]  Harold S. Stone,et al.  Multiprocessor Scheduling with the Aid of Network Flow Algorithms , 1977, IEEE Transactions on Software Engineering.

[23]  Suiping Zhou,et al.  Efficient client-to-server assignments for distributed virtual environments , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[24]  Kevin J. Lang.  Fixing two weaknesses of the Spectral Method , 2005, NIPS.

[25]  Inderjit S. Dhillon,et al.  Kernel k-means: spectral clustering and normalized cuts , 2004, KDD.

[26]  S. P.,et al.  Optimal Client-Server Assignment for Internet Distributed Systems T , 2014 .

[27]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[28]  Chris H. Q. Ding,et al.  A min-max cut algorithm for graph partitioning and data clustering , 2001, Proceedings 2001 IEEE International Conference on Data Mining.