direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Publications of KBS

Performance Evaluation of Data Structures for Admission Control in Bandwidth Brokers
Citation key BH02a
Author Lars-Olof Burchard and Hans-Ulrich Heiss
Title of Book Technical Report No. 2002-12, TU Berlin
Year 2002
Abstract In differenciated services networks, bandwidth brokers are an opportunity to enable resource reservations, i.e. quality-of-service guarantees. In a bandwidth broker, fast and efficient admission control is an important task which almost completely dominates the broker's response time to a reservation request. In case the reservation is to be made in advance, i.e. a longer period of time before the actual transmission is established (advance reservation), it is necessary to keep information about future reservations in order to perform admission control. Therefore, data structures storing such information must provide fast and efficient access. In this paper, two data structures were examined: an array and a segment tree which was specially designed for the admission control task. The segment tree was extended in order to achieve a better memory utilization and shorter admission times compared to the original implementation. Nevertheless, the evaluation shows the superiority of arrays concerning both memory requirement and admission time for almost any of the examined scenarios with different length and distribution of reservations.
Link to publication Download Bibtex entry

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions