Skip to Main content Skip to Navigation
Conference papers

Tacked Link List - An Improved Linked List for Advance Resource Reservation

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

Cited literature [3 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Friday, November 25, 2016 - 2:44:47 PM
Last modification on : Thursday, March 5, 2020 - 5:40:15 PM
Long-term archiving on: : Tuesday, March 21, 2017 - 1:42:23 AM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Li-Bing Wu, Jing Fan, Lei Nie, Bing-Yi Liu. Tacked Link List - An Improved Linked List for Advance Resource Reservation. 11th IFIP International Conference on Network and Parallel Computing (NPC), Sep 2014, Ilan, Taiwan. pp.538-541, ⟨10.1007/978-3-662-44917-2_47⟩. ⟨hal-01403135⟩



Record views


Files downloads