AID Shuffling Mechanism Based on Group-Buying Auction for Identifier Network Security

Abstract

Identifier network is one of promising network architectures to solve IP dual-property issues by separating network into access network and core network. The key design is the identifier/location separation mechanism which introduces user accessing address space and network routing address space to represent the identifier and location of terminal, respectively. The core network can prevent the cyber attacks by controlling the mapping relationship between Accessing IDentifier (AID) and Routing IDentifier (RID) via the mapping system. While the access network is facing serious security problems which makes it easily to be attacked. Therefore, this work focuses on access network security and studies AID shuffling mechanism by randomizing identifier through virtual AID. However, how the mapping servers allocate virtual AID to terminals in a reasonable way is quite difficult. To solve this problem, we propose an AID shuffling mechanism based on Group-buying Auction for Identifier Network (GAIN) among mapping servers, accessing switching routers and terminals. First, GAIN decides a group bid for each group leader and the winning virtual AID range for each group. Second, the mapping servers allocate the identifier for each terminal. Third, GAIN determines how much each winning group leaders should pay for virtual AID range to each mapping server in the winning group. We evaluate the identifier assignment of GAIN in terms of rationality, budget balance, computational tractability and truthfulness. The large-scale simulations are performed to evaluate GAIN, and the results are presented to verify the effectiveness and efficiency by comparing with other state-of-the-art approaches.