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

One practical open problem is the development of a distributed algorithm thatachieves near-optimal utility using only a finite (and small) buffer size forqueues in a stochastic network. This paper studies utility maximization (orcost minimization) in a finite-buffer regime and considers the correspondingdelay and reliability (or rate of packet drops) tradeoff. A floating-queuealgorithm allows the stochastic network optimization framework to beimplemented with finite buffers at the cost of packet drops. Further, thebuffer size requirement is significantly smaller than previous works in thisarea. With a finite buffer size of $B$ packets, the proposed algorithm achieveswithin $O(e^{-B})$ of the optimal utility while maintaining average per-hopdelay of $O(B)$ and an average per-hop drop rate of $O(e^{-B})$ in steadystate. From an implementation perspective, the floating-queue algorithmrequires little modification of the well-known Drift-Plus-Penalty policy(including MaxWeight and Backpressure policies). As a result, thefloating-queue algorithm inherits the distributed and low complexity nature ofthese policies.

Achieving Utility-Delay-Reliability Tradeoff in Stochastic Network Optimization with Finite Buffers