This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Analysis of Data Structures for Admission Control of Advance Reservation Requests
March 2005 (vol. 17 no. 3)
pp. 413-424
Advance reservations are a useful method to allocate resources of various kinds in many different environments. Among others, a major advantage of this kind of reservation is the improved admission probability for requests that are made sufficiently early. In order to implement reliable admission control for these requests, it is important to store information in data structures about future allocations and to provide fast access to the available information. In this paper, two data structures are examined: a tree specially designed to support advance reservations is compared to arrays. Both structures are examined analytically and by measurements in a realistic network management system capable of advance reservations. It turns out that arrays are far better suited to support the required operations, in particular when large time intervals need to be scanned.

[1] S. Bhatnagar and B. Nath, “An Edge Router Based Protocol for Fault Tolerant Handling of Advance Reservations,” Proc. IEEE Int'l Conf. Comm. (ICC '02), pp. 1086-1093, 2002.
[2] L.-O. Burchard, “On the Performance of Computer Networks with Advance Reservation Mechanisms,” Proc. 11th IEEE Int'l Conf. Networks (ICON '03), pp. 449-454, 2003.
[3] L.-O. Burchard, “Analysis of Data Structures for Admission Control of Advance Reservation Requests,” Technical Report KBS-2004/01, Technische Universitaet Berlin, Comm. and Operating Systems Group, Aug. 2004.
[4] L.-O. Burchard and M. Droste-Franke, “Fault Tolerance in Networks with an Advance Reservation Service,” Proc. 11th Int'l Workshop on Quality of Service (IWQoS '03), pp. 215-228, 2003.
[5] L.-O. Burchard and H.-U. Heiss, “Performance Evaluation of Data Structures for Admission Control in Bandwidth Brokers,” Proc. Int'l Symp. Performance Evaluation of Computer and Telecommunication Systems (SPECTS '02), Soc. for Modeling and Simulation Int'l, pp. 652-659, 2002.
[6] L.-O. Burchard, M. Hovestadt, O. Kao, A. Keller, and B. Linnert, “The Virtual Resource Manager: An Architecture for SLA-aware Resource Management,” Proc. Fourth IEEE/ACM Int'l Symp. Cluster Computing and the Grid (CCGrid '04), 2004.
[7] D. Ferrari, A. Gupta, and G. Ventre, “Distributed Advance Reservation of Real-Time Connections,” Proc. Fifth Int'l Workshop on Network and Operating System Support for Digital Audio and Video (NOSSDAV '95), pp. 16-27, 1995.
[8] I. Foster, C. Kesselman, C. Lee, R. Lindell, K. Nahrstedt, and A. Roy, “A Distributed Resource Management Architecture that Supports Advance Reservations and Co-Allocation,” Proc. Seventh Int'l Workshop on Quality of Service (IWQoS '99), pp. 27-36, 1999.
[9] The Globus Project, http:/www.globus.org, Oct. 2004.
[10] A. Greenberg, R. Srikant, and W. Whitt, “Resource Sharing for Book-Ahead and Instantaneous-Request Calls,” IEEE/ACM Trans. Networking, vol. 7, no. 1, pp. 10-22, 1999.
[11] R. Guerin and A. Orda, “Networks with Advance Reservations: The Routing Perspective,” Proc. IEEE INFOCOM '99, pp. 118-127, 2000.
[12] L. Lewin-Eytan, J. Naor, and A. Orda, “Routing and Admission Control in Networks with Advance Reservations,” Proc. Fifth Int'l Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX '02), pp. 215-228, 2002.
[13] P. Pan and H. Schulzrinne, “Lightweight Resource Reservation Signaling: Design, Performance and Implementation,” Technical Report CUCS-019-00, Dept. of Computer Science, Columbia Univ., 2000.
[14] O. Schelen, A. Nilsson, J. Norrgard, and S. Pink, “Performance of QoS Agents for Provisioning Network Resources,” Proc. Seventh Int'l Workshop on Quality of Service (IWQoS '99), pp. 17-26, 1999.
[15] O. Schelen and S. Pink, “An Agent-Based Architecture for Advance Reservations,” Proc. 22nd IEEE Conf. Local Computer Networks (LCN '97), pp. 451-459, 1997.
[16] A. Schill, F. Breiter, and S. Kühn, “Design and Evaluation of an Advance Reservation Protocol on Top of RSVP” Proc. Fourth Int'l Conf. Broadband Comm., pp. 430-442, 1998.
[17] L.C. Wolf and R. Steinmetz, “Concepts for Resource Reservation in Advance,” Multimedia Tools and Applications vol. 4, no. 3, pp. 255-278, 1997.

Index Terms:
Performance evaluation, arrays, trees, network management, advance reservations, distributed applications.
Citation:
Lars-Olof Burchard, "Analysis of Data Structures for Admission Control of Advance Reservation Requests," IEEE Transactions on Knowledge and Data Engineering, vol. 17, no. 3, pp. 413-424, March 2005, doi:10.1109/TKDE.2005.40
Usage of this product signifies your acceptance of the Terms of Use.