Skip to Main content Skip to Navigation
Conference papers

Research on the RRB+ Tree for Resource Reservation

Abstract : The performance of the data structure has a significant impact on the overall performance of the advance resource reservation in the distributed computing. Because the query and update operations of the B+ tree are of high efficiency, so this paper proposes a B+ tree structure suitable for resource reservation the RRB+ tree. Also, we design and implement the corresponding algorithms of query, insertion and deletion. Different with the B+ tree that insert and delete one key word at a time, the RRB+ tree insert one reservation request and delete one tree node every time. The RRB+ tree is of a higher precision of expression. With the fixed reservation admission control algorithm and the same rate of acceptance, the experimental results show that the RRB+ tree is easier to operate for the complex and changing network environment, and have a higher utilization of storage space.
Document type :
Conference papers
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.inria.fr/hal-01513776
Contributor : Hal Ifip <>
Submitted on : Tuesday, April 25, 2017 - 2:33:42 PM
Last modification on : Tuesday, September 3, 2019 - 3:56:00 PM
Long-term archiving on: : Wednesday, July 26, 2017 - 2:14:32 PM

File

978-3-642-40820-5_8_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Libing Wu, Ping Dang, Lei Nei, Jianqun Cui, Bingyi Liu. Research on the RRB+ Tree for Resource Reservation. 10th International Conference on Network and Parallel Computing (NPC), Sep 2013, Guiyang, China. pp.83-93, ⟨10.1007/978-3-642-40820-5_8⟩. ⟨hal-01513776⟩

Share

Metrics

Record views

127

Files downloads

254