General QoS-aware scheduling procedure for passive optical networks

Mohammad Hadi; Chayan Bhar; Erik Agrell

doi:10.1364/JOCN.390902

Journal of Optical Communications and Networking
Vol. 12,
Issue 7,
pp. 217-226
(2020)
•https://doi.org/10.1364/JOCN.390902

General QoS-aware scheduling procedure for passive optical networks

Mohammad Hadi, Chayan Bhar, and Erik Agrell

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Mohammad Hadi, Chayan Bhar, and Erik Agrell, "General QoS-aware scheduling procedure for passive optical networks," J. Opt. Commun. Netw. 12, 217-226 (2020)

Export Citation
- BibTex
- Endnote (RIS)
- HTML
- Plain Text
Citation alert
Save article

Abstract

Increasing volume, dynamism, and diversity of access traffic have complicated the challenging problem of dynamic resource allocation in passive optical networks. We introduce a general scheduling procedure for passive optical networks, which optimizes a desired performance metric for an arbitrary set of operational constraints. The proposed scheduling has a fast and causal iterative implementation, where each iteration involves a local optimization problem followed by a recursive update of some status information. The generality of the platform enables a proper description of the diverse quality of service requirements, while its low computational complexity makes agile tracking of the network dynamism possible. To demonstrate its versatility and generality, the applications of the scheme for service-differentiated dynamic bandwidth allocation in time- and wavelength-division-multiplexed passive optical networks are discussed. To further reduce the computational complexity, a closed-form solution of the involved optimization in each iteration of the scheduling is derived. We directly incorporate transmission delay in the scheduling and show how the consumed power is traded for the tolerable amount of transmission delay. Furthermore, a 50% power efficiency improvement is reported by exploiting the inherent service diversity among subscribers. The impact of service prioritization, finite buffer length, and packet drops on the power efficiency of the scheme are also investigated.

Full Article | PDF Article

More Like This

Dynamic Bandwidth Allocation With SLA Awareness for QoS in Ethernet Passive Optical Networks

Abhishek Dixit, Bart Lannoo, Goutam Das, Didier Colle, Mario Pickavet, and Piet Demeester
J. Opt. Commun. Netw. 5(3) 240-253 (2013)

Joint power-efficient traffic shaping and service provisioning for metro elastic optical networks

Mohammad Hadi and Erik Agrell
J. Opt. Commun. Netw. 11(12) 578-587 (2019)

Achieving QoS for bursty uRLLC applications over passive optical networks

Dibbendu Roy, Aravinda S. Rao, Tansu Alpcan, Goutam Das, and Marimuthu Palaniswami
J. Opt. Commun. Netw. 14(5) 411-425 (2022)

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 (8)

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 (2)

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 (33)

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

Type	Notation	Definition
Constants	$I = 32$	Number of ONUs
	$V_{i} = 100$	Drop penalty
	$N_{W} = 1$	Number of wavelengths
	$Γ = 10$	Lyapunov penalty
	$R_{U} = 10 [Gbit/s]$	Upload bit rate
	$T_{C} = 2 [ms]$	Interval duration
	$T_{D} = 0 [ms]$	Maximum round-trip time difference
	$T_{H} = 51.2 [ns]$	Report time
	$T_{G} = 1 µ s$	Guard time
	$T_{O} = 2 [ms]$	Transition time
	$T_{S} = 0 µ s$	Start time
	$T_{P} = 0 µ s$	Process time
	$T_{W} = 50 µ s$	Wavelength tuning time
	$P_{S} = 0.75 [W]$	Sleep power
	$P_{A} = 4.2 [W]$	Active power
	$T_{i} = 80 µ s$	Round-trip time
	$D_{i} = 6 [ms]$	Average delay
	$Q_{i} = 8 [Mbit]$	Delaying buffer capacity
	$E_{i} = 1 [Mbit]$	Maximum arrived bits in an interval
	$A_{i} = 1.5 [Mbit]$	Collecting/shaping buffer capacity
Variables	$A_{w} \subset A$	Active ONU set per wavelength
	$e_{i}$	Wavelength number
	$p_{i}$	Virtual queue backlog
	$q_{i} [bit]$	Delaying buffer backlog
	$a_{i} [bit]$	Shaping buffer backlog
	$s_{i} [bit]$	Served bits
	$b_{i} [bit]$	Uploaded bits
	$d_{i} [bit]$	Dropped bits
	$c_{i}$	Number of sleep intervals
	$t_{i} [s]$	GATE transmission time

Type	Notation	Definition
Constants	$I = 32$	Number of ONUs
	$V_{i} = 100$	Drop penalty
	$N_{W} = 1$	Number of wavelengths
	$Γ = 10$	Lyapunov penalty
	$R_{U} = 10 [Gbit/s]$	Upload bit rate
	$T_{C} = 2 [ms]$	Interval duration
	$T_{D} = 0 [ms]$	Maximum round-trip time difference
	$T_{H} = 51.2 [ns]$	Report time
	$T_{G} = 1 µ s$	Guard time
	$T_{O} = 2 [ms]$	Transition time
	$T_{S} = 0 µ s$	Start time
	$T_{P} = 0 µ s$	Process time
	$T_{W} = 50 µ s$	Wavelength tuning time
	$P_{S} = 0.75 [W]$	Sleep power
	$P_{A} = 4.2 [W]$	Active power
	$T_{i} = 80 µ s$	Round-trip time
	$D_{i} = 6 [ms]$	Average delay
	$Q_{i} = 8 [Mbit]$	Delaying buffer capacity
	$E_{i} = 1 [Mbit]$	Maximum arrived bits in an interval
	$A_{i} = 1.5 [Mbit]$	Collecting/shaping buffer capacity
Variables	$A_{w} \subset A$	Active ONU set per wavelength
	$e_{i}$	Wavelength number
	$p_{i}$	Virtual queue backlog
	$q_{i} [bit]$	Delaying buffer backlog
	$a_{i} [bit]$	Shaping buffer backlog
	$s_{i} [bit]$	Served bits
	$b_{i} [bit]$	Uploaded bits
	$d_{i} [bit]$	Dropped bits
	$c_{i}$	Number of sleep intervals
	$t_{i} [s]$	GATE transmission time

Abstract

Cited By

Figures (8)

Tables (2)

Equations (33)

Journal of Optical Communications and Networking