E-Diophantine: An Admission Control Algorithm for WiMAX Networks

Abstract

Abstract-Admission control algorithms must ensure that, when a new QoS resource reservation is accepted, reservations already present in the system continue having their QoS guarantees honored. In this paper we consider different approaches to compute the aggregated allocated capacity in WiMAX networks and, based on their limitations, propose the EDiophantine solution. The mathematical foundations for the designed approach are provided along with the performance improvements to be expected, both in accuracy and computational terms, as compared to three alternatives of increasing complexity. Finally, the different solutions considered are evaluated with OPNET's WiMAX simulator in a realistic scenario.

E-Diophantine estimating peak allocated capacity in wireless networks

“…This new algorithm improves the accuracy of prediction versus complexity trade off when compared with currently available approaches. The results here presented extend our previous work in [7] and [8] by: (i) analyzing the E-Diophantine complexity as compared to competing approaches and (ii) designing and evaluating two heuristics, E-diophantine-W and E-diophantine-UW, that reduce the E-Diophantine computational load from exponential to polynomial (cubic) at a low estimation error probability cost.…”

“…Based on the performance issues identified for the approaches described in the previous section in [7] we proposed an enhancement to the Diophantine solution, hereinafter referred as E-Diophantine. The objective is to achieve the same accuracy when estimating the aggregated allocated peak capacity but at a lower computational cost.…”

“…In [7] we provided the theorems and proofs that enable the described E-Diophantine solution. For the sake of brevity this informations is not repeated here.…”

“…For the sake of brevity this informations is not repeated here. The interested reader is referred to [7] for further details on the analytical demonstration.…”