Analysis of cooperative management strategies against route-hijacking

Diagnosis and prevention of anomalous routing states is essential for stable inter-AS (autonomous system) routing management. In particular, the route hijack problem, which is one of the major inter-AS routing-management issues, requires cooperation among multiple ASs for effective detection and prevention. However, this effectiveness highly differs depending on 1) where hijacking and hijacked ASs are located on the AS topology, and 2) what cooperative strategies are used for detecting and filtering hijacking-routes. Because there are no central authority or common framework on the Internet, it is important to analyze the effectiveness of management actions based on cooperative strategies, especially using statistical methods to cope with complex situations. This paper focuses on the analysis and quantification of the effectiveness of cooperative hijack-prevention strategies from the viewpoint of adjacency relations of cooperative ASs. Simulation results that use an actual Internet topology and policy relations demonstrate that simple cooperative strategies organizing selected neighboring ASs into a cluster are sufficiently effective for route-hijack prevention even if only a small part of ASs participate these strategies.