Research on the RRB+ Tree for Resource Reservation

Libing Wu (1, 2) , Ping Dang (1) , Lei Nei (1, 2) , Jianqun Cui (3) , Bingyi Liu (1)

1 School of Computer Science [Wuhan]
2 State Key Laboratory of Software Engineering (Wuhan University)
3 School of Computer Science

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.

Mots clés: Data structure; Advance resource reservation; RRB+ tree; Loop time slot array

Domaines: Informatique [cs]

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⟩