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 this paper we study a revenue maximization problem for optical routingnodes. We model the routing node as a single server polling model with the aimto assign visit periods (service windows) to the different stations (ports)such that the mean profit per cycle is maximized. Under reasonable assumptionsregarding retrial and dropping probabilities of packets the optimizationproblem becomes a separable concave resource allocation problem, which can besolved using existing algorithms.

Revenue maximization in an optical router node - allocation of service windows