Nothing Special   »   [go: up one dir, main page]

Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Optimal and near-optimal alpha-fair resource allocation algorithms based on traffic demand predictions for optical network planning

Not Accessible

Your library or personal account may give you access

Abstract

We examine proactive network optimization in reconfigurable optical networks based on traffic predictions. Specifically, the fair spectrum allocation (SA) problem is examined for a priori reserving resources aiming to achieve near-even minimum quality-of-service (QoS) guarantees for all contending connections. The fairness problem arises when greedy SA policies are followed, which are based on point-based maximum demand predictions, especially under congested networks, with some connections highly overprovisioned and others entirely blocked, resulting in highly uneven QoS connection guarantees. To address this problem, we consider predictive traffic distributions allowing the exploration of several combinations of possible SAs. To find a fair SA policy, we resort to an $\alpha$-fairness scheme, while QoS fairness is evaluated according to a game-theoretic analysis based on the coefficient of variations of the connections’ unserved traffic metric, which measures the dispersion of unserved traffic for a connection around the mean of the unserved traffic over all connections. Non-contending (NC) and link-based contending (LBC) $\alpha$-fair SA integer linear programming algorithms are proposed, where the optimal NC approach encompasses global network contention information, while the near-optimal LBC approach encompasses partial contention information to reduce problem complexity. We show that as parameter $\alpha$ increases, QoS fairness improves, along with connection blocking, resource utilization, and overprovisioning and underprovisioning. Further, LBC exhibits results close to the optimal, with a significant improvement in processing time.

© 2021 Optical Society of America

Full Article  |  PDF Article
More Like This
Efficiency and fairness improvement for elastic optical networks using reinforcement learning-based traffic prediction

Anastasios Valkanis, Georgios Papadimitriou, Georgia Beletsioti, Emmanouel Varvarigos, and Petros Nicopolitidis
J. Opt. Commun. Netw. 14(3) 25-42 (2022)

Fair Bandwidth Allocation Algorithm for PONs Based on Network Utility Maximization

N. Merayo, P. Pavon-Marino, J. C. Aguado, R. J. Durán, F. Burrull, and V. Bueno-Delgado
J. Opt. Commun. Netw. 9(1) 75-86 (2017)

Fair Resource Allocation Schemes for Cooperative Dynamic Free-Space Optical Networks

Abdallah S. Ghazy, Hossam A. I. Selmy, and Hossam M. H. Shalaby
J. Opt. Commun. Netw. 8(11) 822-834 (2016)

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (14)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (6)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (35)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel