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.
Original language | English |
---|---|
Title of host publication | 2016 20th International Conference on Optical Network Design and Modeling, ONDM 2016, 9-12 may 2016, Cartagena, Spain |
Place of Publication | Piscataway |
Publisher | Institute of Electrical and Electronics Engineers |
Pages | 1-6 |
ISBN (Electronic) | 8-1-4673-9988-3 |
DOIs | |
Publication status | Published - 16 Jun 2016 |
Event | 20th International Conference on Optical Network Design and Modeling (ONDM 2016) - Cartagena, Spain Duration: 9 May 2016 → 12 May 2016 Conference number: 20 |
Conference
Conference | 20th International Conference on Optical Network Design and Modeling (ONDM 2016) |
---|---|
Abbreviated title | ONDM 2016 |
Country/Territory | Spain |
City | Cartagena |
Period | 9/05/16 → 12/05/16 |
Keywords
- optical node
- optical routing
- optimization
- revenue