Capacity modeling for admission control in WiMAX networks

WiMAX networks support QoS reservation of resources by allowing a new flow to apply for admittance in the system. Thus, there is a need for an accurate estimation of the available capacity to be shared by incoming connections. Admission control algorithm must ensure that, when a new QoS resource reservation is accepted, reservations already present in the system continue having their QoS guarantees honored. Its efficiency is then expressed in terms of accuracy and computational complexity which is the focus of the work in this thesis. Different approaches are presented to compute the aggregated allocated capacity in WiMAX networks and, based on their limitations, the E-Diophantine solution has been proposed. 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. The different solutions considered are validated and evaluated with OPNET’s WiMAX simulator in a realistic scenario. Finally, the multi-hop relay case is analyzed: a capacity model description is provided together with a conjectured reuse of the admission control algorithm designed.