An adaptive cooperative mechanism for stable autonomous operation

2020 Fiscal Year Final Research Report

• Project/Area Number: 19K24358
• Research Category: Grant-in-Aid for Research Activity Start-up
• Allocation Type: Multi-year Fund
• Review Section: 1001:Information science, computer engineering, and related fields
• Research Institution: National Institute of Informatics
• Principal Investigator: Akashi Osamu 国立情報学研究所, 学術ネットワーク研究開発センター, 特任教授 (60841202)
• Project Period (FY): 2019-08-30 – 2021-03-31
• Keywords: 自律制御 / BGP経路情報 / 分散協調

Outline of Final Research Achievements

The Internet is the collection of Autonomous Systems (ASs), which are connected by exchanging network reachability information using BGP. It is considered as the AS graph where ASs are nodes and edges connecting ASs are BGP peering relations. The route-hijack problem is still one of the major inter-AS routing-management issues and is important to analyze its behavior. This paper focuses on the analysis and quantification of the effectiveness of cooperative hijack-prevention strategies from the viewpoint of locally available adjacency relations of cooperative ASs. Neighboring ASs are organized into multiple clusters based on their own local decisions. Simulations that use inferred Internet AS-relation graphs show that simple cooperative strategies are sufficiently effective for the route-hijack prevention and their effects differ based on applied cooperative strategies.

Free Research Field

情報ネットワーク

Academic Significance and Societal Importance of the Research Achievements

インターネットは分散システムであり，中央集権的な制御は難しい．現在においても重要な経路ハイジャック等，経路異常に対して，局所的な接続関係等の情報を用いて情報を共有し，その防御を行うのが現実的な解となる．しかしながら，局所的な情報のみを用いたどのような協調の仕方が有効であるのか，さらに定量的にどの程度有効であるのかは不明であり，これをBGP経路情報の接続関係をベースに定量的に解析することは重要である．