메뉴 건너뛰기




Volumn , Issue , 2014, Pages 432-439

The behavior of load balancing strategies with regard to the network structure in distributed computing systems

Author keywords

complex network; graph theory; load balancing; network structure; overlay network; resource discovery

Indexed keywords

COMPLEX NETWORKS; COMPUTATION THEORY; DISTRIBUTED COMPUTER SYSTEMS; OVERLAY NETWORKS;

EID: 84928570407     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SITIS.2014.42     Document Type: Conference Paper
Times cited : (10)

References (16)
  • 1
    • 0027663155 scopus 로고
    • Strategies for dynamic load balancing on highly parallel computers
    • Sep
    • M. H. Willebeek-LeMair and A. P. Reeves, "Strategies for dynamic load balancing on highly parallel computers," IEEE Trans. Parallel Distrib. Syst., vol. 4, no. 9, pp. 979-993, Sep. 1993.
    • (1993) IEEE Trans. Parallel Distrib. Syst , vol.4 , Issue.9 , pp. 979-993
    • Willebeek-Lemair, M.H.1    Reeves, A.P.2
  • 2
    • 0242511139 scopus 로고    scopus 로고
    • Scalable load balancing on distributed web servers using mobile agents
    • J. Cao, Y. Sun, X. Wang, and S. Das, "Scalable load balancing on distributed web servers using mobile agents," Journal of Parallel and Distributed computing, vol. 63, pp. 996-1005, 2003.
    • (2003) Journal of Parallel and Distributed Computing , vol.63 , pp. 996-1005
    • Cao, J.1    Sun, Y.2    Wang, X.3    Das, S.4
  • 3
    • 33746591366 scopus 로고    scopus 로고
    • A robust and scalable peerto-peer gossiping protocol
    • G. Moro, C. Sartori, and M. Singh, Eds. Springer Berlin Heidelberg
    • S. Voulgaris, M. Jelasity, and M. Steen, "A robust and scalable peerto-peer gossiping protocol," in Agents and Peer-to-Peer Computing, ser. Lecture Notes in Computer Science, G. Moro, C. Sartori, and M. Singh, Eds. Springer Berlin Heidelberg, 2005, vol. 2872, pp. 47-58.
    • (2005) Agents and Peer-to-Peer Computing, Ser. Lecture Notes in Computer Science , vol.2872 , pp. 47-58
    • Voulgaris, S.1    Jelasity, M.2    Steen, M.3
  • 6
    • 5844290410 scopus 로고
    • Self-organized criticality: An explanation of the 1/f noise
    • Jul
    • P. Bak, C. Tang, and K. Wiesenfeld, "Self-organized criticality: An explanation of the 1/f noise," Phys. Rev. Lett., vol. 59, pp. 381-384, Jul 1987.
    • (1987) Phys. Rev. Lett , vol.59 , pp. 381-384
    • Bak, P.1    Tang, C.2    Wiesenfeld, K.3
  • 8
    • 0038718854 scopus 로고    scopus 로고
    • The structure and function of complex networks
    • M. Newman, "The structure and function of complex networks," SIAM Review, vol. 45, no. 2, pp. 167-256, 2003.
    • (2003) SIAM Review , vol.45 , Issue.2 , pp. 167-256
    • Newman, M.1
  • 9
    • 0038483826 scopus 로고    scopus 로고
    • Emergence of scaling in random networks
    • Oct
    • A.-L. Barabasi and R. Albert, "Emergence of scaling in random networks," Science, vol. 286, no. 5439, pp. 509-512, Oct. 1999.
    • (1999) Science , vol.286 , Issue.5439 , pp. 509-512
    • Barabasi, A.-L.1    Albert, R.2
  • 11
    • 0032482432 scopus 로고    scopus 로고
    • Collective dynamics of 'smallworld' networks
    • Jun
    • D. J. Watts and S. H. Strogatz, "Collective dynamics of 'smallworld' networks," Nature, vol. 393, no. 6684, pp. 440-442, Jun. 1998.
    • (1998) Nature , vol.393 , Issue.6684 , pp. 440-442
    • Watts, D.J.1    Strogatz, S.H.2
  • 13
    • 84880320717 scopus 로고    scopus 로고
    • Tight bounds for rumor spreading in graphs of a given conductance
    • T. Schwentick and C. Durr, Eds. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
    • G. Giakkoupis, "Tight bounds for rumor spreading in graphs of a given conductance," in STACS, T. Schwentick and C. Durr, Eds., vol. 9. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2011, pp. 57-68.
    • (2011) STACS , vol.9 , pp. 57-68
    • Giakkoupis, G.1
  • 15
    • 23144451785 scopus 로고    scopus 로고
    • Using mobile agents for network resource discovery in peer-to-peer networks
    • C. R. Dunne, "Using mobile agents for network resource discovery in peer-to-peer networks," ACM, vol. 1, no. 212, pp. 1-9, 2001.
    • (2001) ACM , vol.1 , Issue.212 , pp. 1-9
    • Dunne, C.R.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.