The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2013 vol.24)
pp: 565-575
Hiroshi Nishida , ASUSA Corporation, Salem
Thinh Nguyen , Oregon State University, Corvallis
ABSTRACT
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.
INDEX TERMS
Servers, Electronic mail, Measurement, Clustering algorithms, Load management, Optimization, Entropy, optimization, Distributed systems, client-server systems, graph clustering, load balancing, communication overhead
CITATION
Hiroshi Nishida, Thinh Nguyen, "Optimal Client-Server Assignment for Internet Distributed Systems", IEEE Transactions on Parallel & Distributed Systems, vol.24, no. 3, pp. 565-575, March 2013, doi:10.1109/TPDS.2012.169
REFERENCES
[1] The XMPP Standards Foundation, "XMPP," http://xmpp.orgabout/, 2012.
[2] J. Dean and S. Ghemawat, "MapReduce: Simplified Data Processing on Large Clusters," Comm. ACM, vol. 51, pp. 107-113, Jan. 2008.
[3] J. Shi and J. Malik, "Normalized Cuts and Image Segmentation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 228, no. 8, pp. 888-905, Aug. 2000.
[4] Z. Wu and R. Leahy, "An Optimal Graph Theoretic Approach to Data Clustering: Theory and Its Application to Image Segmentation," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 15, no. 11, pp. 1101-1113, Aug. 2002.
[5] K. Lang, "Fixing Two Weaknesses of the Spectral Method," Proc. Advances in Neural Information Processing Systems, 2006.
[6] K. Lang, "Finding Good Nearly Balanced Cuts in Power Law Graphs," technical report, Yahoo Research Labs, 2004.
[7] M. Kurucz, A. Benczur, K. Csalogany, and L. Lukacs, "Spectral Clustering in Telephone Call Graphs," Proc. Ninth WebKDD and First SNA-KDD Workshop Web Mining and Social Network Analysis (WebKDD/SNA-KDD '07), pp. 82-91, 2007.
[8] I. Dhillon, Y. Guan, and B. Kulis, "Weighted Graph Cuts Without Eigenvectors a Multilevel Approach," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, no. 11, pp. 1944-1957, Nov. 2007.
[9] B. Schölkopf, A. Smola, and K.-R. Müller, "Nonlinear Component Analysis as a Kernel Eigenvalue Problem," Neural Computation, vol. 10, pp. 1299-1319, July 1998.
[10] G. Karypis and V. Kumar, "A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs," SIAM J. Scientific Computing, vol. 20, pp. 359-392, Dec. 1998.
[11] M.L. Huang and Q.V. Nguyen, "A Fast Algorithm for Balanced Graph Clustering," Proc. 11th Int'l Conf. Information Visualization, pp. 46-52, 2007.
[12] K. Andreev and H. Räcke, "Balanced Graph Partitioning," Proc. 16th Ann. ACM Symp. Parallelism in Algorithms and Architectures, pp. 120-124, 2004.
[13] F. Nie, C. Ding, D. Luo, and H. Huang, "Improved MinMax Cut Graph Clustering with Nonnegative Relaxation," Proc. European Conf. Machine Learning and Knowledge Discovery in Databases: Part II, pp. 451-466, 2010.
[14] P. Chan, M. Schlag, and J. Zien, "Spectral K-Way Ratio-Cut Partitioning and Clustering," IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 13, no. 9, pp. 1088-1096, Sept. 1994.
[15] C.H.Q. Ding, X. He, H. Zha, M. Gu, and H.D. Simon, "A Min-Max Cut Algorithm for Graph Partitioning and Data Clustering," Proc. Int'l Conf. Data Mining (ICDM '01), pp. 107-114, 2001.
[16] H.S. Stone, "Multiprocessor Scheduling with the Aid of Network Flow Algorithms," IEEE Trans. Software Eng., vol. 3, no. 1, pp. 85-93, Jan. 1977.
[17] P. Sinha, Distributed Operating Systems: Concepts and Design. IEEE Press, 1997.
[18] J.C.S. Lui and M.F. Chan, "An Efficient Partitioning Algorithm for Distributed Virtual Environment Systems," IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 3, pp. 193-211, Mar. 2002.
[19] P. Morillo, J.M. Orduna, M. Fernandez, and J. Duato, "Improving the Performance of Distributed Virtual Environment Systems," IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 7, pp. 637-649, July 2005.
[20] Y. Deng and R.W.H. Lau, "Heat Diffusion Based Dynamic Load Balancing for Distributed Virtual environments," Proc. 17th ACM Symp. Virtual Reality Software and Technology (VRST '10), pp. 203-210, 2010.
[21] D.N.B. Ta and S. Zhou, "Efficient Client-To-Server Assignments for Distributed Virtual Environments," Proc. 20th Int'l Conf. Parallel and Distributed Processing (IPDPS '06), 2006.
[22] COIN-OR, "Ipopt," https://projects.coin-or.orgIpopt, 2012.
[23] T. Core, "Normalized Cuts Segmentation Code, For Matlab," http://www.seas.upenn.edu/timothee/software/ ncutncut. html, 2012.
[24] Graclus, "Graclus Software," http://www.cs.utexas.edu/users/dml/Software graclus.html, 2012.
[25] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univ. Press, Mar. 2004.
[26] The Operations Research Faculty of GSIA "A Tutorial on Integer Programming," http://mat.gsia.cmu.edu/orclass/integer integer.html , 1997.
[27] A.Y. Ng, M.I. Jordan, and Y. Weiss, "On Spectral Clustering: Analysis and an Algorithm," Proc. Advances in Neural Information Processing Systems, pp. 849-856, 2001.
[28] I.S. Dhillon, Y. Guan, and B. Kulis, "Kernel K-Means: Spectral Clustering and Normalized Cuts," Proc. 10th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '04), pp. 551-556, 2004.
[29] W.E. Donath and A.J. Hoffman, "Lower Bounds for the Partitioning of Graphs," IBM J. Research and Development, vol. 17, pp. 420-425, 1973.
[30] S.C. Johnson, "Hierarchical Clustering Schemes," Psychometrika, vol. 2, pp. 241-254, 1967.
[31] C.-K. Cheng and Y.-C. Wei, "An Improved Two-Way Partitioning Algorithm with Stable Performance [VLSI]," IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 10, no. 12, pp. 1502-1511, Dec. 1991.
54 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool