On Microcell-Macrocell Handoff Queueing scheme in Heterogeneous Industrial Networks

Um, Changyong; Jeong, Jongpil

doi:10.1016/j.procs.2018.07.158

Cited by 2 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Refs. [17][18][19][20][21][22][23][24][25][26][27][28][29]). The classification of these models can be done in various different ways, for example, according to the adopted CAC mechanism, the call arrival process, the amount of b.u.…”

Section: Related Workmentioning

confidence: 99%

“…requested by calls or even according to whether call queueing is allowed or not. In this section, we classify them into loss models [17][18][19][20][21][22][23][24] and loss/ queueing models [25][26][27][28][29].…”

Section: Related Workmentioning

confidence: 99%

“…An interesting idea is presented in Ref. [27], where handover calls waiting in the queue can be terminated when the queueing time expires. Such an idea could be adopted in our case in order to determine the predefined probabilities used in the probabilistic BR policy.…”

Section: Related Workmentioning

confidence: 99%

See 2 more Smart Citations

Performance evaluation of a mobile hotspot supporting quasi‐random traffic

et al. 2023

View full text Add to dashboard Cite

The authors study and evaluate a mobility‐aware call admission control algorithm in a mobile hotspot. More specifically, a vehicle which has an access point of a fixed capacity and may alternate between stop and moving phases is considered. In the stop phase, the vehicle services new and handover calls. To prioritise handover calls a probabilistic bandwidth reservation policy is considered where a fraction of the capacity is reserved for handover calls. Based on this policy, new calls may enter the reservation space with a predefined probability. In addition, handover calls have the option to wait in a queue of finite size if there are no available resources at the time of their arrival. In the moving phase, the vehicle services only new calls under the classical complete sharing policy. In both phases, calls arrive in the system according to a quasi‐random process, require a single bandwidth unit for their acceptance in the system and have an exponentially distributed service time. To analytically determine the various performance measures, such as time congestion probabilities, call blocking probabilities and link utilisation, an accurate analytical method is presented based on three‐dimensional Markov chains.

show abstract