• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Analysis of distributed load balancing algorithms on inhomogeneous and dynamic networks

Research Project

Project/Area Number 17H07116
Research Category

Grant-in-Aid for Research Activity Start-up

Allocation TypeSingle-year Grants
Research Field Theory of informatics
Research InstitutionChuo University

Principal Investigator

Shiraga Takeharu  中央大学, 理工学部, 助教 (50803996)

Project Period (FY) 2017-08-25 – 2019-03-31
Project Status Completed (Fiscal Year 2018)
Budget Amount *help
¥2,730,000 (Direct Cost: ¥2,100,000、Indirect Cost: ¥630,000)
Fiscal Year 2018: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2017: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Keywords負荷分散 / マルコフ連鎖 / 乱択アルゴリズム / 分散アルゴリズム / 拡散 / 情報基礎 / アルゴリズム
Outline of Final Research Achievements

Given a distributed network where each vertex has discrete loads, we consider the problem of minimizing the discrepancy between the maximum and minimum loads among all vertices. For this problem, diffusion based algorithms are well studied because of its simplicity. In a diffusion based algorithm, at each synchronous and discrete time step, each vertex is allowed to distribute its loads to each neighbors.
This work is concerned with the ability of natural diffusion based algorithms. We presents a new randomized diffusion algorithm like multiple random walks. Our algorithm achieves a sub linear upper bound of the maximum degree for any graphs.

Academic Significance and Societal Importance of the Research Achievements

昨今のネットワークの大規模化, P2P ネットワークのような分散型ネットワークの出現により, ネットワーク上の各プロセッサにかかる負荷を均等に配分しなおすことを目指す「ネットワーク上の負荷分散」アルゴリズムは近年その需要が増している. しかし, 単純なアルゴリズムに対しても, その解析の困難さより, 既存研究では正則グラフをはじめとした限られたグラフ構造上での解析に留まっている.
本研究では主にマルコフ連鎖の過渡解析技法を適用し, 既存のモデルを非正則なグラフ上でも動作するように拡張・更にはその誤差に対する制度保証を与えた. 非正則なグラフ上での成果はほぼ初であり, その意義は大きい.

Report

(3 results)
  • 2018 Annual Research Report   Final Research Report ( PDF )
  • 2017 Annual Research Report
  • Research Products

    (9 results)

All 2018 2017 Other

All Int'l Joint Research (2 results) Journal Article (4 results) (of which Int'l Joint Research: 2 results,  Peer Reviewed: 4 results,  Open Access: 3 results,  Acknowledgement Compliant: 1 results) Presentation (2 results) (of which Int'l Joint Research: 2 results) Remarks (1 results)

  • [Int'l Joint Research] King's College London(英国)

    • Related Report
      2018 Annual Research Report
  • [Int'l Joint Research] King's College London(英国)

    • Related Report
      2017 Annual Research Report
  • [Journal Article] Dispersion processes2018

    • Author(s)
      Colin Cooper, Andrew McDowell, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
    • Journal Title

      Random Structures and Algorithms

      Volume: 53(4) Pages: 561-585

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Deterministic random walks for rapidly mixing chains2018

    • Author(s)
      Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita
    • Journal Title

      SIAM Journal on Discrete Mathematics

      Volume: 32(3) Pages: 2180-2193

    • Related Report
      2018 Annual Research Report
    • Peer Reviewed / Open Access
  • [Journal Article] Fast plurality consensus in regular expanders2017

    • Author(s)
      Colin Cooper, Tomasz Radzik, Nicolas Rivera, Takeharu Shiraga
    • Journal Title

      Proceedings of the 31st International Symposium on Distributed Computing (DISC 2017)

      Volume: 91

    • DOI

      10.4230/LIPIcs.DISC.2017.13

    • Related Report
      2017 Annual Research Report
    • Peer Reviewed / Open Access / Int'l Joint Research
  • [Journal Article] Total variation discrepancy of deterministic random walks for ergodic Markov chains2017

    • Author(s)
      Takeharu Shiraga, Yukiko Yamauchi, Shuji Kijima, and Masafumi Yamashita
    • Journal Title

      Theoretical Computer Science

      Volume: 印刷中 Pages: 63-74

    • DOI

      10.1016/j.tcs.2016.11.017

    • Related Report
      2017 Annual Research Report
    • Peer Reviewed / Acknowledgement Compliant
  • [Presentation] Fast plurality consensus in regular expanders2017

    • Author(s)
      Takeharu Shiraga
    • Organizer
      the 31st International Symposium on Distributed Computing (DISC 2017)
    • Related Report
      2017 Annual Research Report
    • Int'l Joint Research
  • [Presentation] Analyses of the cover time of deterministic random walks2017

    • Author(s)
      Takeharu Shiraga
    • Organizer
      the 21st Conference of the International Federation of Operational Research Societies (IFORS 2017)
    • Related Report
      2017 Annual Research Report
    • Int'l Joint Research
  • [Remarks] Simulations (JavaScript)

    • URL

      https://sites.google.com/view/takeharu-shiraga/

    • Related Report
      2017 Annual Research Report

URL: 

Published: 2017-08-25   Modified: 2022-06-14  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi