The Community for Technology Leaders
Performance, Computing, and Communications Conference, 2002. 21st IEEE International (2002)
Phoenix, AZ, USA
Apr. 3, 2002 to Apr. 5, 2002
ISBN: 0-7803-7371-5
pp: 37-44
Tao Wang , Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
ABSTRACT
With the fast development of the Internet, more and more distributed applications will require guaranteed quality of service and maintain minimum network resource during their running sessions. Reservation in advance provides a solution for the need of reserving the network resource for future use like we make reservations in advance in our daily business. Routing has a critical effect on the network reservation process. In this paper, we propose a hierarchical data structure, the bandwidth tree, which records the intervals of available link bandwidth instead of unit time slot. The storage space and searching time complexity under this data structure are independent of the size of the time slots. This overcomes the difficulty in previously proposed research in which larger time slot size loses routing accuracy while smaller time slot size significantly increases routing complexity. The new data structure significantly improves the running time complexity for routing procedures under a variety of QoS requirements.
INDEX TERMS
CITATION
Tao Wang, Jianer Chen, "Bandwidth tree - a data structure for routing in networks with advanced reservations", Performance, Computing, and Communications Conference, 2002. 21st IEEE International, vol. 00, no. , pp. 37-44, 2002, doi:10.1109/IPCCC.2002.995134
94 ms
(Ver 3.3 (11022016))