@article{Panagoulias2019b,

title = {An analytical framework in OFDM wireless networks servicing random or quasi-random traffic},

author = { P.I. Panagoulias and I.D. Moscholios and P.G. Sarigiannidis and M. Glabowski and M.D. Logothetis},

url = {https://www.researchgate.net/publication/337850639_An_Analytical_Framework_in_OFDM_Wireless_Networks_Servicing_Random_or_Quasi-Random_Traffic},

doi = {10.3390/app9245376},

year  = {2019},

date = {2019-01-01},

journal = {Applied Sciences (Switzerland)},

volume = {9},

number = {24},

abstract = {We consider the downlink of an orthogonal frequency division multiplexing (OFDM)-based cell that services calls from many service-classes. The call arrival process is random (Poisson) or quasi-random, i.e., calls are generated by an infinite or a finite number of sources, respectively. In order to determine congestion probabilities and resource utilization, we model the cell as a multirate loss model. Regarding the call admission, we consider the restricted accessibility, the bandwidth reservation (BR), and the complete sharing (CS) policies. In a system of restricted accessibility, a new call may be blocked even if resources do exist. In a BR system, subcarriers can be reserved in favor of calls of high subcarrier requirements. Finally, in a CS system, a new call is blocked due to resource unavailability. In all three policies, we show that there exist recursive formulas for the determination of the various performance measures. Based on simulation, the accuracy of the proposed formulas is found to be quite satisfactory. © 2019 by the authors.},

keywords = {Complete sharing, Congestion, OFDM, Quasi-random, Random, Recursive, Reservation, Restricted},

pubstate = {published},

tppubtype = {article}

}