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

This paper studies the buffered Aloha with K-exponential backoff collisionresolution algorithms. The buffered Aloha network is modeled as a multi-queuesingle-server system. We adopt a widely used approach in packet switchingsystems to decompose the multi-queue system into independent first-in-first-out(FIFO) queues, which are hinged together by the probability of success ofhead-of-line (HOL) packets. A unified method is devised to tackle the stabilityand throughput problems of K-exponential backoff with any cutoff phase K. Fornetworks with a finite number of nodes, we show that the K-exponential backoffis stable if the retransmission factor is properly chosen from the stableregion. The maximum stable throughput is derived and demonstrated via examplesof geometric retransmission (K=1) and exponential backoff (K=infinity). Fornetworks with an infinite number of nodes, we show that geometricretransmission is unstable, and the stable network throughput of exponentialbackoff can only be achieved at the cost of potential unbounded delay in eachinput queue. Furthermore, we address the stability issue of the systems at theundesired stable point. All analytical results presented in this paper areverified and confirmed by simulations.

Stability and Throughput of Buffered Aloha with Backoff