English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Random Access Channel (RACH) has been identified as one of the majorbottlenecks for accommodating massive number of machine-to-machine (M2M) usersin LTE networks, especially for the case of burst arrival of connectionrequests. As a consequence, the burst resolution problem has sparked a largenumber of works in the area, analyzing and optimizing the average performanceof RACH. However, the understanding of what are the probabilistic performancelimits of RACH is still missing. To address this limitation, in the paper, weinvestigate the reliability of RACH with access class barring (ACB). We modelRACH as a queuing system, and apply stochastic network calculus to deriveprobabilistic performance bounds for burst resolution time, i.e., the worstcase time it takes to connect a burst of M2M devices to the base station. Weillustrate the accuracy of the proposed methodology and its potentialapplications in performance assessment and system dimensioning.

On the Reliability of LTE Random Access: Performance Bounds for Machine-to-Machine Burst Resolution Time