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

In the online packet buffering problem (also known as the unweighted FIFOvariant of buffer management), we focus on a single network packet switchingdevice with several input ports and one output port. This device forwardsunit-size, unit-value packets from input ports to the output port. Buffersattached to input ports may accumulate incoming packets for later transmission;if they cannot accommodate all incoming packets, their excess is lost. A packetbuffering algorithm has to choose from which buffers to transmit packets inorder to minimize the number of lost packets and thus maximize the throughput.  We present a tight lower bound of e/(e-1) ~ 1.582 on the competitive ratio ofthe throughput maximization, which holds even for fractional or randomizedalgorithms. This improves the previously best known lower bound of 1.4659 andmatches the performance of the algorithm Random Schedule. Our resultcontradicts the claimed performance of the algorithm Random Permutation; wepoint out a flaw in its original analysis.

An Optimal Lower Bound for Buffer Management in Multi-Queue Switches