
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Chyouhwa Chen, KunCheng Tsai, "The Server Reassignment Problem for Load Balancing in Structured P2P Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 2, pp. 234246, February, 2008.  
BibTex  x  
@article{ 10.1109/TPDS.2007.70735, author = {Chyouhwa Chen and KunCheng Tsai}, title = {The Server Reassignment Problem for Load Balancing in Structured P2P Systems}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {19}, number = {2}, issn = {10459219}, year = {2008}, pages = {234246}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2007.70735}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  The Server Reassignment Problem for Load Balancing in Structured P2P Systems IS  2 SN  10459219 SP234 EP246 EPD  234246 A1  Chyouhwa Chen, A1  KunCheng Tsai, PY  2008 KW  distributed hash table KW  load balance KW  local search KW  structured peertopeer system KW  generalized assignment problem VL  19 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable PeertoPeer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM '01, pp. 149160, 2001.
[2] F. Dabek, M. Kaashoek, D. Karger, D. Morris, and I. Stoica, “WideArea Cooperative Storage with CFS,” Proc. 18th ACM Symp. Operating Systems Principles (SOSP '01), pp. 202215, Oct. 2001.
[3] X. Wang and D. Loguinov, “LoadBalancing Performance of Consistent Hashing: Asymptotic Analysis of Random Node Join,” IEEE/ACM Trans. Networking, vol. 15, no. 5, Oct. 2007.
[4] D. Karger, E. Lehman, T. Leighton, M. Levine, D. Lewin, and R. Panigrahy, “Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web,” Proc. 29th Ann. ACM Symp. Theory of Computing (STOC '97), pp. 654663, 1997.
[5] C. Ramsay, “The Distribution of Sums of Certain I.I.D. Pareto Variates,” Comm. in Statistics—Theory and Methods, vol. 35, pp. 395405, 2006.
[6] A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, “Load Balancing in Structured P2P Systems,” Proc. Second Int'l Workshop PeertoPeer Systems (IPTPS '03), Feb. 2003.
[7] B. Godfrey, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, “Load Balancing in Dynamic Structured P2P Systems,” Proc. IEEE INFOCOM, 2004.
[8] P.B. Godfrey and I. Stoica, “Heterogeneity and Load Balance in Distributed Hash Tables,” Proc. IEEE INFOCOM, 2005.
[9] J. Ledlie and M. Seltzer, “Distributed, Secure Load Balancing with Skew, Heterogeneity, and Churn,” Proc. IEEE INFOCOM, 2005.
[10] X. Wang, Y. Zhang, X. Li, and D. Loguinov, “On ZoneBalancing of PeertoPeer Networks: Analysis of Random Node Join,” Proc. ACM SIGMETRICS '04, pp. 211222, June 2004.
[11] B.G. Chun, F. Dabek, A. Haeberlen, E. Sit, H. Weatherspoon, M.F. Kaashoek, J. Kubiatowicz, and R. Morris, “Efficient Replica Maintenance for Distributed Storage Systems,” Proc. Third Symp. Networked System Design and Implementation (NSDI '06), May 2006.
[12] H. Weatherspoon, “Design and Evaluation of Distributed WideArea OnLine Archival Storage Systems,” PhD dissertation, Electrical Eng. and Computer Sciences (EECS) Dept., Univ. of California, Berkeley, Oct. 2006.
[13] M. Laguna, J.P. Kelly, J.L. Gonzalez Velarde, and F. Glover, “Tabu Search for the Multilevel Generalized Assignment Problem,” European J. Operational Research, vol. 82, pp. 176189, 1995.
[14] M.L. Fisher, R. Jaikumar, and L.N. Van Wassenhove, “A Multiplier Adjustment Method for the Generalized Assignment Problem,” Management Science, vol. 32, no. 9, pp. 10951103, 1986.
[15] G.T. Ross and R.M. Soland, “A Branch and Bound Algorithm for the Generalized Assignment Problem,” Math. Programming, vol. 8, no. 1, pp. 91103, 1975.
[16] M.G. Narciso and L.A.N. Lorena, “Lagrangean/Surrogate Relaxations for the Generalized Assignment Problems,” European J.Operational Research, vol. 114, no. 1, pp. 165177, 1999.
[17] J.A. Diaz and E. Fernandez, “A Tabu Search Heuristic for the Generalized Assignment Problem,” European J. Operational Research, vol. 132, pp. 2238, 2001.
[18] P.C.H. Chu and J.E. Beasley, “A Genetic Algorithm for the Generalised Assignment Problem,” Computers and Operations Research, vol. 24, pp. 1723, 1997.
[19] M. Yagiura, T. Yamaguchi, and T. Ibaraki, “A Variable Depth Search Algorithm for the Generalized Assignment Problem,” MetaHeuristics: Advances and Trends in Local Search Paradigms for Optimization, S. Vosß, S. Martello, I.H. Osman, and C. Roucairol, eds., Kluwer Academic Publishers, pp. 459471, 1999.
[20] H.R. Lourenco and D. Serra, “Adaptive Search Heuristics for the Generalized Assignment Problem,” Mathware and Soft Computing, vol. 9, pp. 209234, 2002.
[21] M. Faloutsos, P. Faloutsos, and C. Faloutsos, “On PowerLaw Relationships of the Internet Topology,” Proc. ACM SIGCOMM '99, pp. 251262, 1999.
[22] L.A. Adamic, Zipf, PowerLaws, and Pareto—A Ranking Tutorial, http://www.hpl.hp.com/research/idl/papers/ rankingranking. html, 2000.
[23] S. Sahni and T. Gonzalez, “PComplete Approximation Problems,” J. ACM, vol. 23, no. 3, pp. 555565, July 1976.
[24] T. Stutzle and H. Hoos, “The MaxMin Ant System and Local Search for Combinatorial Optimization Problems,” MetaHeuristics: Advances and Trends in Local Search Paradigms for Optimization, S. Vosß, S. Martello, I.H. Osman, and C. Roucairol, eds., Kluwer Academic Publishers, pp. 313329, 1999.
[25] M.G.C. Resende and C.C. Ribeiro, “Greedy Randomized Adaptive Search Procedures,” StateoftheArt Handbook of Metaheuristics, F.Glover and G. Kochenberger, eds., Kluwer Academic Publishers, 2002.
[26] M. Dorigo and T. Stützle, Ant Colony Optimization. MIT Press, 2004.
[27] E.W. Weisstein, “Pareto Distribution,” MathWorld—A Wolfram Web Resource, http://mathworld.wolfram.comParetoDistribution. html , 2007.
[28] V. Stemann, “Parallel Balanced Allocations,” Proc. Eighth Ann. ACM Symp. Parallel Algorithms and Architectures (SPAA '96), pp.261269, 1996.
[29] P. Berenbrink, F. Meyer auf der Heide, and K. Schroder, “Allocating Weighted Jobs in Parallel,” Theory of Computing Systems, vol. 32, no. 3, pp. 281300, 1999.