| Budget Amount *help |
¥4,810,000 (Direct Cost: ¥3,700,000、Indirect Cost: ¥1,110,000)
Fiscal Year 2018: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2017: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2016: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2015: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2014: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
|
|---|
| Outline of Final Research Achievements |
In this study, we designed fault-tolerant distributed approximation algorithms. They are sufficiently practical for networks with dynamically changing topology. In dynamic networks, transient failures such as disconnection of links, loss of messages, and alteration of memory contents due to disturbances occur frequently. We designed self-stabilized distributed algorithms with safety convergence properties. They are resistant to such failures and changes. In order to guarantee the quality of service in the legitimate configuration, it is necessary to guarantee the approximation rate for the optimal legitimate configuration. Safe convergence property is a property that converges quickly to a feasible configuration in which the minimum service can be guaranteed, and converges to a n optimal configuration with a good approximation rate while maintaining that safety property.
|
