Analysis of data structures for admission control of advance reservation requests

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]  Klara Nahrstedt,et al.  A distributed resource management architecture that supports advance reservations and co-allocation , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[2]  Ralf Steinmetz,et al.  Concepts for Resource Reservation in Advance , 2004, Multimedia Tools and Applications.

[3]  Lars-Olof Burchard,et al.  Fault tolerance in networks with an advance reservation service , 2003, IWQoS'03.

[4]  Giorgio Ventre,et al.  Distributed advance reservation of real-time connections , 1997, Multimedia Systems.

[5]  Henning Schulzrinne,et al.  Lightweight Resource Reservation Signaling: Design, Performance and Implementation , 2000 .

[6]  Axel Keller,et al.  The virtual resource manager: an architecture for SLA-aware resource management , 2004, IEEE International Symposium on Cluster Computing and the Grid, 2004. CCGrid 2004..

[7]  Alexander Schill,et al.  Design and evaluation of an advance reservation protocol on top of RSVP , 1998, Broadband Communications.

[8]  Reinhard Lüling,et al.  An Architecture for a Scalable Video-on-Demand Server Network with Quality-of-Service Guarantees , 2000, IDMS.

[9]  Ariel Orda,et al.  Networks with advance reservations: the routing perspective , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[10]  Olov Schelén,et al.  An agent-based architecture for advance reservations , 1997, Proceedings of 22nd Annual Conference on Local Computer Networks.

[11]  S. Pink,et al.  Performance of QoS agents for provisioning network resources , 1999, 1999 Seventh International Workshop on Quality of Service. IWQoS'99. (Cat. No.98EX354).

[12]  Lars-Olof Burchard.  On the performance of computer networks with advance reservation mechanisms , 2003, The 11th IEEE International Conference on Networks, 2003. ICON2003..

[13]  Joseph Naor,et al.  Routing and Admission Control in Networks with Advance Reservations , 2002, APPROX.

[14]  B. R. Badrinath,et al.  An edge router based protocol for fault tolerant handling of advance reservations , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[15]  R. Srikant,et al.  Resource sharing for book-ahead and instantaneous-request calls , 1999, TNET.

[16]  Van Jacobson,et al.  A Two-bit Differentiated Services Architecture for the Internet , 1999, RFC.