Research on the online buffer management problems using competitive analysis

2017 Fiscal Year Final Research Report

• Project/Area Number: 26730008
• Research Category: Grant-in-Aid for Young Scientists (B)
• Allocation Type: Multi-year Fund
• Research Field: Theory of informatics
• Research Institution: National Institute of Informatics
• Principal Investigator: Kobayashi Koji 国立情報学研究所, 情報学プリンシプル研究系, 研究員 (00547391)
• Research Collaborator: Miyazaki Shuichi 京都大学, 学術情報メディアセンター, 准教授
• Project Period (FY): 2014-04-01 – 2018-03-31
• Keywords: バッファ管理 / インターネット / オンライン問題 / 競合比解析 / アルゴリズム / スイッチ / ルータ

Outline of Final Research Achievements

To guarantee that we use applications on the Internet supporting the quality of service, the following researches have been conducted extensively: we formulate a situation related to such applications as an online problem, and design and analyze the performance of an algorithm for the problem using the worst performance ratio of the algorithm (called competitive ratio). In this research, we have focused on the buffer management problem (BMP), which is one of the most significant online problems. Then, we have obtained the following results: (a) we have formulated a new variant of the BMP and designed an efficient algorithm for this variant, and (b) we have studied two open variants of the BMP and obtained improved results for them.

Free Research Field

アルゴリズム