Research on Efficient Non-slotted Tree Structures for Advance Reservation - Frontiers in Internet Technologies - page 60

with the timeslot array by experiments.Experimental results show that resource clue
tree can achieve better performance than the timeslot array in some cases and the
resource binary tree has relatively poor performance.
The performance of data structures will be different under different values of res-
ervation requests. Our next step is to do the experiments in real situations and minim-
ize the impact of reservation requests to get a more flexible resource reservation.
Acknowledgment. This work is supported by National Science Foundation of China
(No. 61070010, 61272112), the Natural Science Foundation of Hubei Province and
Science and Technology Plan of Wuhan city.
References
1. Reinhardt, W.: Advance Resource Reservation and its Impact on Reservation Protocols.
In: Proc. of Broadband Islands 1995, Dublin, Ireland (September 1995)
2. Burchard, L.-O.: Analysis of Data Structures for Admission Control of Advance Reserva-
tion Requests. IEEE Transactions on Knowledge and Data Engineering 17(3), 413-424
(2005)
3. Xiong, N., Vasilakos, A.V., Yang, L.T., Song, L., Pan, Y., Kannan, R., Li, Y.: Compara-
tive Analysis of Quality of Service and Memory Usage for Adaptive Failure Detectors in
Healthcare Systems. IEEE Journal on Selected Areas in Communications 27(4), 495-509
(2009)
4. Burchard, L.-O., Heiss, H.-U.: Performance Evaluation of Data Structures For Admission
Control in Bandwidth Brokers, Technical Report TR-KBS-01-02, Communications and
Operating Systems Group, Technical University of Berlin (May 2002)
5. Wang, T., Chen, J.: Bandwidth Tree - A Data Structure for Routing in Networks with Ad-
vance Reservation. In: 21st IEEE International Performance, Computing, and Communica-
tions Conference, Phoenix, AZ, pp. 37-44 (April 2002)
6. Andreicaf, M., Ţăpuş, N.: Time Slot Groups - A Data Structure for QoS-Constrained Ad-
vance Bandwidth Reservation and Admission Control. In: 10th International Symposium
on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, pp. 354-357
(September 2008)
7. Andreicaf, M., Ţăpuş, N.: Efficient Data Structures for Online QoS-Constrained Data
Transfer Scheduling. In: International Symposium on Parallel and Distributed Computing,
Timisoara, pp. 285-292 (July 2008)
8. Brodnik, A., Nilsson, A.: An Efficient Data Structure for Advance Bandwidth Reserva-
tions on the Internet. In: Proc. of the 3rd Conference on Computer Science and Electrical
Engineering, pp. 1-5 (2002)
9. Xiong, Q., Wu, C., Xing, J., Wu, L., Zhang, H.: A Linked-List Data Structure for Advance
Reservation Admission Control. In: Third International Conference, ICCNMC 2005,
Zhangjiajie, China, pp. 901-910 (August 2005)
10. Bn, O., Nilsson, A., Norrgkd, J., Pink, S.: Performance of QoS Agents for Provisioning
Network Resources. In: Seventh International Workshop on Quality of Service (IWQoS
1999), London, pp. 17-26 (1999)
11. Wu, L., Yu, T., He, Y., Li, F.: A index linked list suited for resource reservation. Journal
of Wut (Information & Management Engineering) 33(6), 904-908 (2011) (in Chinese)