The purpose of this paper is to examine the issues related to the efficiency and adaptability of the admission control module of a Bandwidth Broker. The proposed architecture is able to handle situations such as the resubmission of previously rejected requests and offer a fair treatment for requests in an environment where a subset of these requests do not specify their ending time. We describe the proposed mechanisms for such cases which aim at solving the additional problems of fairly prioritizing resubmitted requests and efficiently handle requests which do not specify ending times. We also provide experimental evaluations of the proposed algorithms and the conclusions they lead us to.