
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
HungChang Hsiao, Hao Liao, SsuTa Chen, KuoChan Huang, "Load Balance with Imperfect Information in Structured PeertoPeer Systems," IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 4, pp. 634649, April, 2011.  
BibTex  x  
@article{ 10.1109/TPDS.2010.105, author = {HungChang Hsiao and Hao Liao and SsuTa Chen and KuoChan Huang}, title = {Load Balance with Imperfect Information in Structured PeertoPeer Systems}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {22}, number = {4}, issn = {10459219}, year = {2011}, pages = {634649}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2010.105}, 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  Load Balance with Imperfect Information in Structured PeertoPeer Systems IS  4 SN  10459219 SP634 EP649 EPD  634649 A1  HungChang Hsiao, A1  Hao Liao, A1  SsuTa Chen, A1  KuoChan Huang, PY  2011 KW  Peertopeer systems KW  load balance KW  heterogeneity. VL  22 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] I. Stoica, R. Morris, D. LibenNowell, D.R. Karger, M.F. Kaashoek, F. Dabek, and H. Balakrishnan, "Chord: A Scalable PeertoPeer Lookup Protocol for Internet Applications," IEEE/ACM Trans. Networking, vol. 11, no. 1, pp. 1721, Feb. 2003.
[2] A. Rowstron and P. Druschel, "Pastry: Scalable, Distributed Object Location and Routing for LargeScale PeertoPeer Systems," Lecture Notes in Computer Science, pp. 161172, Springer, Nov. 2001.
[3] S. Surana, B. Godfrey, K. Lakshminarayanan, R. Karp, and I. Stoica, "Load Balancing in Dynamic Structured P2P Systems," Performance Evaluation, vol. 63, no. 6, pp. 217240, Mar. 2006.
[4] Y. Zhu and Y. Hu, "Efficient, ProximityAware Load Balancing for DHTBased P2P Systems," IEEE Trans. Parallel and Distributed Systems, vol. 16, no. 4, pp. 349361, Apr. 2005.
[5] H. Shen and C.Z. Xu, "LocalityAware and ChurnResilient Load Balancing Algorithms in Structured P2P Networks," IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 6, pp. 849862, June 2007.
[6] L.M. Ni and K. Hwang, "Optimal Load Balancing in a Multiple Processor System with Many Job Classes," IEEE Trans. Software Eng., vol. 11, no. 5, pp. 491496, May 1985.
[7] L.M. Ni, C.W. Xu, and T.B. Gendreau, "A Distributed Drafting Algorithm for Load Balancing," IEEE Trans. Software Eng., vol. 11, no. 10, pp. 11531161, Oct. 1985.
[8] C. Chen and K.C. Tsai, "The Server Reassignment Problem for Load Balancing in Structured P2P Systems," IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 2, pp. 234246, Feb. 2008.
[9] T.L. Casavant and J.G. Kuhl, "A Taxonomy of Scheduling in GeneralPurpose Distributed Computing Systems," IEEE Trans. Software Eng., vol. 14, no. 2, pp. 141154, Feb. 1988.
[10] Y. Zhu, "Load Balancing in Structured P2P Networks," Handbook of PeertoPeer Networking, Springer, July 2009.
[11] D. Karger and M. Ruhl, "Simple Efficient Load Balancing Algorithms for PeertoPeer Systems," Proc. 16th ACM Symp. Parallel Algorithms and Architectures (SPAA '04), pp. 3643, June 2004.
[12] 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 '02), pp. 6879, Feb. 2003.
[13] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness. W.H. Freeman and Co., 1979.
[14] F. Dabek, M.F. Kaashoek, D. Karger, R. Morris, and I. Stoica, "WideArea Cooperative Storage with CFS," Proc. 18th ACM Symp. Operating Systems Principles (SOSP '01), pp. 202215, Oct. 2001.
[15] G.H. Gonnet, "Expected Length of the Longest Probe Sequence in Hash Code Searching," J. ACM, vol. 28, no. 2, pp. 289304, Apr. 1981.
[16] D. Eastlake and P. Jones, "US Secure Hash Algorithm 1 (SHA1)," RFC 3174, Sept. 2001.
[17] N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller, "Equations of State Calculations by Fast Computing Machines," J. Chemical Physics, vol. 21, no. 6, pp. 10871092, June 1953.
[18] W.K. Hastings, "Monte Carlo Sampling Methods Using Markov Chains and Their Applications," Biometrika, vol. 57, no. 1, pp. 97109, Apr. 1970.
[19] S.M. Ross, "Markov Chains," Introduction to Probability Models, ninth ed., pp. 185280, Academic Press, 2007.
[20] M. Mitzenmacher and E. Upfal, "Coupling of Markov Chains," Probability and Computing: Randomized Algorithms and Probabilistic Analysis, pp. 271294, Cambridge Univ. Press, 2005.
[21] P. Diaconis and D. Stroock, "Geometric Bounds for Eigenvalues of Markov Chains," The Annals of Applied Probability, vol. 1, no. 1, pp. 3661, Feb. 1991.
[22] A. Sinclair, "Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow," Combinatorics, Probability and Computing, vol. 1, no. 4, pp. 351370, Dec. 1992.
[23] H. Chernoff, "A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations," Annals of Math. Statistics, vol. 23, no. 4, pp. 493507, 1952.
[24] S. Saroiu, P.K. Gummadi, and S.D. Gribble, "Measurement Study of PeertoPeer File Sharing Systems," Proc. Multimedia Computing and Networking (MMCN '02), Jan. 2002.