Since advance resource reservation is a widely used mechanism in distributed systems and high-performance networks, the optimization of its performance has been greatly concerned. And the performance of the data structure plays an important role for the overall performance of the advance resource reservation. In this paper, the authors figured out the disadvantages in the existing data structures used in advance resource reservation and proposed an improved data structure called ’tacked list’, to overcome these disadvantages. To demonstrate the performance of this improved data structure, the authors made mathematical analysis to explore the tradeoff between performance and cost. At last, the result of the simulation experiments show that the improved data structure can highly improve the performance of the whole reservation system at the starting up phase and still have a relatively good performance at the stable phase.