Dynamic Bandwidth Allocation Supporting Diversified Queue Status Reporting for EPON Systems

Daisuke Murayama; Ken-Ichi Suzuki; Ryogo Kubo; Masaaki Ikehara

doi:10.1364/JOCN.8.000530

Journal of Optical Communications and Networking
Vol. 8,
Issue 8,
pp. 530-539
(2016)
•https://doi.org/10.1364/JOCN.8.000530

Dynamic Bandwidth Allocation Supporting Diversified Queue Status Reporting for EPON Systems

Daisuke Murayama, Ken-Ichi Suzuki, Ryogo Kubo, and Masaaki Ikehara

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Daisuke Murayama, Ken-Ichi Suzuki, Ryogo Kubo, and Masaaki Ikehara, "Dynamic Bandwidth Allocation Supporting Diversified Queue Status Reporting for EPON Systems," J. Opt. Commun. Netw. 8, 530-539 (2016)

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

Abstract

Dynamic bandwidth allocation (DBA) is an indispensable function in Ethernet passive optical networks (EPONs). The DBA function implemented in an optical line terminal utilizes REPORT messages to learn about the upstream queue statuses in optical network units (ONUs). However, the methods for describing the REPORT messages are not fully standardized, which results in a lack of interoperability. This paper proposes a diversity DBA technique that can support different types of ONUs with diverse REPORT description methods. The diversity DBA technique is comprised of an identification process to differentiate REPORT description methods and an interpretation process to convert the content of different REPORT description methods. We provide simulation results to demonstrate the validity of the proposed DBA technique.

Full Article | PDF Article

More Like This

Low-Latency Dynamic Bandwidth Allocation for 100 km Long-Reach EPONs

Daisuke Murayama, Noriyuki Oota, Ken-Ichi Suzuki, and Naoto Yoshimoto
J. Opt. Commun. Netw. 5(1) 48-55 (2013)

Flexible Wavelength and Dynamic Bandwidth Allocation for NG-EPONs

Syed Baqar Hussain, Weisheng Hu, Haiyun Xin, Ahmed Mohammed Mikaeil, and Amber Sultan
J. Opt. Commun. Netw. 10(6) 643-652 (2018)

SLA-Aware Dynamic Bandwidth Allocation for QoS in EPONs

Su-il Choi and Jaehyung Park
J. Opt. Commun. Netw. 2(9) 773-781 (2010)

Previous Article Next Article

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

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

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

#	Identification Condition	QS Starting Point	Definite or Probable
1	$QS (1) > 0 \land QS (2) > 0 \land QS (1) + QS (2) < Th 1$	Buffer head	Definite
2	$QS (M) > 0 \land QS (M - 1) > 0 \land QS (M) + QS (M - 1) < Th 1$	Buffer head	Definite
3	$QS (k) > 0 \land QS (j \| j \neq k) = 0$ in at least one combination of $j$ and $k$ from 1 to $M$	Edge of previous QS	Definite
4	$QS (k) > QS (k + 1) \land QS (k + 1) < QS (k + 2)$ in at least one $k$ from 1 to $M - 2$	Edge of previous QS	Definite
5	$QS (k) < QS (k + 1) \land QS (k + 1) > QS (k + 2)$ in at least one $k$ from 1 to $M - 2$	Edge of previous QS	Definite
6	$p QS (k) > p QS (k + 1) \land QS (k) < QS (k + 1)$ in at least one $k$ 1 to $M - 1$	Edge of previous QS	Definite
7	$p QS (k) < p QS (k + 1) \land QS (k) > QS (k + 1)$ in at least one $k$ from 1 to $M - 1$	Edge of previous QS	Definite
8	$QS (k) \geq QS (k + 1) > 0$ in all $k$ from 1 to $M - 1$	Buffer head	Probable
9	$0 < QS (k) \leq QS (k + 1)$ in all $k$ from 1 to $M - 1$	Buffer head	Probable
10	$QS (k) > 0 \land QS (k) = C$ in all $k$ from 1 to $M$	Buffer head	Probable
11	$p G = p QS (2) \land p G > 0 \land T x \neq p G$	Edge of previous QS	Probable
12	$p G = p QS (M - 1) \land p G > 0 \land T x \neq p G$	Edge of previous QS	Probable
13	$p G = p QS (1) + p QS (2) \land p G > 0 \land T x = p G$	Edge of previous QS	Probable
14	$p G = p QS (M) + p QS (M - 1) \land p G > 0 \land T x = p G$	Edge of previous QS	Probable

#	Already Identified “QS Starting Point”	Identification Condition	QS Numbering Order	Definite or Probable
15	Buffer head $\land$	$QS (k) < QS (k + 1)$ in at least one $k$ from 1 to $M - 1$	Ascending	Definite
16	Buffer head $\land$	$QS (k) > QS (k + 1)$ in at least one $k$ from 1 to $M - 1$	Descending	Definite
17	Edge of previous QS $\land$	$QS (1) > 0 \land QS (M) = 0$	Ascending	Definite
18	Edge of previous QS $\land$	$QS (M) > 0 \land QS (1) = 0$	Descending	Definite
19	Edge of previous QS $\land$	$p G = p QS (1) + p QS (2) \land p G > 0 \land T x = p G \land M > 2$	Ascending	Definite
20	Edge of previous QS $\land$	$p G = p QS (M) + p QS (M - 1) \land p G > 0 \land T x = p G \land M > 2$	Descending	Definite

#	Already Identified “QS Starting Point”	Already Identified “QS Numbering Order”	Identification Condition	Granted Frames	Definite or Probable
21	–	–	$p G > MFL \land p QS (k) = 0 \land T x > 0$ in all of $k$ from 1 to $M$	Not included	Definite
22	–	–	$p QS (k) > 0 \land p G > MFL \land T x = 0$ in at least one $k$ from 1 to $M$	Included	Definite
23	Buffer head $\land$	–	$p QS (k) > 0 \land p G = p QS (k) \land T x = p G$ in at least one $k$ from 1 to $M$	Not included	Definite
24	Buffer head $\land$	–	$p QS (k) > 0 \land p G = p QS (k) \land T x \neq p G$ in at least one $k$ from 1 to $M$	Included	Definite
25	Edge of previous QS $\land$	Ascending $\land$	$p QS (1) > 0 \land p G = p QS (1) \land T x = p G$	Included	Definite
26	Edge of previous QS $\land$	Descending $\land$	$p QS (M) > 0 \land p G = p QS (M) \land T x = p G$	Included	Definite
27	Edge of previous QS $\land$	Ascending $\land$	$p QS (1) > 0 \land p G = p QS (1) \land T x \neq p G$	Not included	Definite
28	Edge of previous QS $\land$	Descending $\land$	$p QS (M) > 0 \land p G = p QS (M) \land T x \neq p G$	Not included	Definite

	Parameters in REPORT Description Methods
Pattern	(A) QS Starting Point	(B) QS Numbering Order	(C) Granted Frames
A	Buffer head	Ascending	Not included
B	Buffer head	Ascending	Included
C	Buffer head	Descending	Not included
D	Buffer head	Descending	Included
E	Edge of previous QS	Ascending	Not included
F	Edge of previous QS	Ascending	Included
G	Edge of previous QS	Descending	Not included
H	Edge of previous QS	Descending	Included

Pattern	Conversion Function
A	${QS}_{C} (k) = {QS}_{A} (M - k + 1)$ in all of $k$ from 1 to $M$
B	${QS}_{C} (k) = {QS}_{B} (M - k + 1) - {QS}_{B} (1)$ in all of $k$ from 1 to $M - 1$
C	–
D	${QS}_{C} (k) = {QS}_{D} (k) - {QS}_{D} (M)$ in all of $k$ from 1 to $M - 1$
E	${QS}_{C} (k) = Σ_{i = 1}^{M - k + 1} ({QS}_{E} (i))$ in all of $k$ from 1 to $M$
F	${QS}_{C} (k) = Σ_{i = 2}^{M - k + 1} ({QS}_{F} (i))$ in all of $k$ from 1 to $M - 1$
G	${QS}_{C} (k) = Σ_{i = k}^{M} ({QS}_{G} (i))$ in all of $k$ from 1 to $M$
H	${QS}_{C} (k) = Σ_{i = k}^{M - 1} ({QS}_{H} (i))$ in all of $k$ from 1 to $M - 1$

DBA cycle (Identification cycle)	1 ms
Frame length of input traffic	From 64 to 1518 Bytes (Identically distributed)
Inter frame gap	$> 12 bytes$ (Identically distributed as input rate)
Number of ONUs	32
Line rate	1 Gb/s
Threshold 1	1518 Bytes
Threshold 2	3200 Bytes
Threshold 3	4800 Bytes

Abstract

Cited By

Figures (11)

Tables (6)

Equations (3)

Journal of Optical Communications and Networking