Inter-AS Locator Allocation of Hierarchical Automatic Number Allocation in a 10,000-AS Network

A Hierarchical Automatic Number Allocation (HANA) protocol, which allocates locators to ASes hierarchically, is one solution for the problem of BGP table increase. We describe hierarchical inter-AS locator allocation by HANA and emulate locator allocation on a huge-scale network consisting of 10,000 ASes, which are extracted from the actual Internet topology. We prove that locator allocation was accomplished only within 13 seconds and traffic yielded by the HANA control messages is only 1.4 Kbps for each session in average. This shows that the HANA protocol allocates locators on a 10,000-scale hierarchical network.