In this paper we define a Call Admission Control (CAC) strategy, based on the MINBLOCK problem for wireless networks using soft-handover. According to this approach, the call admission controller, decides whether accept new-calls or not, respecting a hard constraint over the handover drop probability and a hard constraint over the admission waiting time of the handover requests, with the objective of minimizing the mean waiting time for the new-call admission requests. An analytical Markov-based model is proposed to achieve the solution of this problem, that is, to calculate the parameters of the admission controller.
A MINBLOCK approach for resource allocation in wireless networks supporting soft handover
LOMBARDO, Alfio;MORABITO, Giacomo;PALAZZO, Sergio;SCHEMBRA, Giovanni
1999-01-01
Abstract
In this paper we define a Call Admission Control (CAC) strategy, based on the MINBLOCK problem for wireless networks using soft-handover. According to this approach, the call admission controller, decides whether accept new-calls or not, respecting a hard constraint over the handover drop probability and a hard constraint over the admission waiting time of the handover requests, with the objective of minimizing the mean waiting time for the new-call admission requests. An analytical Markov-based model is proposed to achieve the solution of this problem, that is, to calculate the parameters of the admission controller.| File | Dimensione | Formato | |
|---|---|---|---|
|
A_MINBLOCK_approach_for_resource_allocation_in_wireless_networks_supporting_soft_handover.pdf
solo gestori archivio
Tipologia:
Versione Editoriale (PDF)
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
622.1 kB
Formato
Adobe PDF
|
622.1 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


