%0 Conference Proceedings
%T Research on the RRB+ Tree for Resource Reservation
%+ School of Computer Science [Wuhan]
%+ State Key Laboratory of Software Engineering  (Wuhan University)
%+ School of Computer Science
%A Wu, Libing
%A Dang, Ping
%A Nei, Lei
%A Cui, Jianqun
%A Liu, Bingyi
%Z Part 2: Session 2: Cloud Resource Management
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 10th International Conference on Network and Parallel Computing (NPC)
%C Guiyang, China
%Y Ching-Hsien Hsu
%Y Xiaoming Li
%Y Xuanhua Shi
%Y Ran Zheng
%I Springer
%3 Network and Parallel Computing
%V LNCS-8147
%P 83-93
%8 2013-09-19
%D 2013
%R 10.1007/978-3-642-40820-5_8
%K Data structure
%K Advance resource reservation
%K RRB+ tree
%K Loop time slot array
%Z Computer Science [cs]Conference papers
%X 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.
%G English
%2 https://inria.hal.science/hal-01513776/document
%2 https://inria.hal.science/hal-01513776/file/978-3-642-40820-5_8_Chapter.pdf
%L hal-01513776
%U https://inria.hal.science/hal-01513776
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-NPC
%~ IFIP-LNCS-8147