A Multirate System of Quasi-Random Arrivals and a Threshold Call Admission Policy

• Post by: admin
• Ιούλιος 1, 2020
• Comments off

Περίληψη

We consider a link that services multirate quasirandom traffic. Calls are distinguished to handover and new calls. New calls compete for the available bandwidth under a threshold call admission policy. In that policy, new calls of a service-class are blocked if the in-service handover and new calls of the same service-class including the new call, exceeds a predefined threshold. Handover calls compete for the available bandwidth under the complete sharing policy. The steady state probabilities in the proposed model have a product form solution which leads to a convolution algorithm for the accurate calculation of congestion probabilities and link utilization. © 2020 IEEE.

Σύνδεσμοι

• https://www.researchgate.net/publication/346841887_A_Multirate_System_of_Quasi-R[...]
• doi:10.1109/CSNDSP49049.2020.9249590

BibTeX (Download)

@conference{Moscholios2020b,
title = {A Multirate System of Quasi-Random Arrivals and a Threshold Call Admission Policy},
author = { I. Moscholios and I.A. Chousainov and P. Panagoulias and P. Sarigiannidis and M. Logothetis},
editor = { Networks 2020 12th International Symposium on Communication Systems and Digital Signal Processing ({CSNDSP})},
url = {https://www.researchgate.net/publication/346841887_A_Multirate_System_of_Quasi-Random_Arrivals_and_a_Threshold_Call_Admission_Policy},
doi = {10.1109/CSNDSP49049.2020.9249590},
year  = {2020},
date = {2020-07-01},
booktitle = {2020 12th International Symposium on Communication Systems, Networks and Digital Signal Processing (CSNDSP)},
journal = {2020 12th International Symposium on Communication Systems, Networks and Digital Signal Processing, CSNDSP 2020},
publisher = {IEEE},
abstract = {We consider a link that services multirate quasirandom traffic. Calls are distinguished to handover and new calls. New calls compete for the available bandwidth under a threshold call admission policy. In that policy, new calls of a service-class are blocked if the in-service handover and new calls of the same service-class including the new call, exceeds a predefined threshold. Handover calls compete for the available bandwidth under the complete sharing policy. The steady state probabilities in the proposed model have a product form solution which leads to a convolution algorithm for the accurate calculation of congestion probabilities and link utilization. © 2020 IEEE.},
keywords = {blocking, Congestion, convolution, Product form, Quasi-random},
pubstate = {published},
tppubtype = {conference}
}