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

TL;DR

This paper addresses revenue maximization in optical routing nodes by modeling them as a polling system and optimizing service window allocations to maximize profit, using concave resource allocation techniques.

Contribution

It introduces a novel application of polling models to optimize service window allocation for revenue maximization in optical routers.

Findings

Optimization problem is separable and concave, solvable with existing algorithms.

Effective allocation of service windows increases mean profit per cycle.

Model accounts for packet retrial and dropping probabilities.

Abstract

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 separable concave resource allocation problem, which can be solved using existing algorithms.