TDD Pattern Estimation and Auto-Recovery from Estimation Error for Accommodations of Fronthaul and Secondary Services in TDM-PON

Daisuke Hisano; Hiroyuki Uzawa; Yu Nakayama; Tatsuya Shimada; Jun Terada; Akihiro Otaka

doi:10.1364/JOCN.10.000104

Journal of Optical Communications and Networking
Vol. 10,
Issue 2,
pp. 104-113
(2018)
•https://doi.org/10.1364/JOCN.10.000104

TDD Pattern Estimation and Auto-Recovery from Estimation Error for Accommodations of Fronthaul and Secondary Services in TDM-PON

Daisuke Hisano, Hiroyuki Uzawa, Yu Nakayama, Tatsuya Shimada, Jun Terada, and Akihiro Otaka

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Daisuke Hisano, Hiroyuki Uzawa, Yu Nakayama, Tatsuya Shimada, Jun Terada, and Akihiro Otaka, "TDD Pattern Estimation and Auto-Recovery from Estimation Error for Accommodations of Fronthaul and Secondary Services in TDM-PON," J. Opt. Commun. Netw. 10, 104-113 (2018)

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

Abstract

Time division multiplexing passive optical networks (TDM-PONs) are attracting attention as a cost-effective way of realizing mobile fronthaul (MFH), which is an optical link between a central unit (CU) and a distributed unit (DU) in a centralized radio access network (C-RAN). To realize an even more cost-effective network, we have studied the accommodation of MFH and secondary services in a single TDM-PON. We focus on the fact that a time division duplex (TDD) scheme will be applied to future radio access (FRA). Since a PON link is a wavelength division multiplexing (WDM) scheme, whereas a radio propagation link is a TDD scheme, unallocated intervals occur periodically in the PON link. For the above reason, we have already proposed a technique for estimating unallocated intervals in a TDD-based MFH link that involves pre-learning based on a test signal transmission, and the signal of the secondary service is accommodated in the unallocated intervals. However, a scheme for recovering from an error when the estimation is wrong and the test signal is not transmitted has yet to be studied. This paper proposes an estimation technique without a test signal transmission and an estimation-error recovery scheme. The proposed estimator calculates the correlation coefficient between captured uplink traffic and the seven types of uplink and downlink ratio patterns standardized by the third generation partnership project (3GPP: http://www.3gpp.org/). We evaluate the effectiveness of the proposed estimation technique by using a numerical simulation. The recovery scheme detects the estimation error and re-allocates the bandwidth. We implement the estimator and the recovery scheme in a 10 Gigabit Ethernet PON (10G-EPON) prototype. We report the feasibility of the proposed scheme along with experimental results.

Full Article | PDF Article

More Like This

Effective Utilization of Unallocated Intervals in TDD-Based Fronthaul Employing TDM-PON

Daisuke Hisano, Tatsuya Shimada, Hiroshi Ou, Takayuki Kobayashi, Yu Nakayama, Hiroyuki Uzawa, Jun Terada, and Akihiro Otaka
J. Opt. Commun. Netw. 9(9) D1-D9 (2017)

Two-stage optimization of uplink forwarding order with cooperative DBA to accommodate a TDM-PON-based fronthaul link

Daisuke Hisano and Yu Nakayama
J. Opt. Commun. Netw. 12(5) 109-119 (2020)

Dynamic IQ Data Compression Using Wireless Resource Allocation for Mobile Front-Haul With TDM–PON [Invited]

Naotaka Shibata, Shigeru Kuwano, Jun Terada, and Hideaki Kimura
J. Opt. Commun. Netw. 7(3) A372-A378 (2015)

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

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

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

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

Variable	Definition
$T_{resol}$	Traffic monitor resolution
$T_{mon}$	Traffic monitor period
$T_{wf}$	Wireless frame size
$T_{sub}$	Sub-frame size
$N_{mon}$	Number of captured data
$N_{ds}$	Number of data sets
$N_{sub}$	Number of sub-frames in a wireless frame
$CapArray [N_{mon}]$	Captured data array
$DS 1 [N_{ds}]$	Data array after fragmentation
$DS 2 [N_{ds}]$	Data array after threshold process
$DS 3 [N_{sub}]$	Data array with pattern match
$E_{bs}$	Element of beginning of sub-frame
${Th}_{upper}$ , ${Th}_{lower}$	Threshold for preparing DS2
$C_{up}$	Constant value as uplink sub-frame
$C_{s}$	Constant value as special sub-frame
$C_{down}$	Constant value as downlink sub-frame

Variable	Value
Number of UEs	5, 10
Number of iterations	10,000 times
Maximum TBS size	9422 bytes
$N_{CA}$	5
$N_{MIMO}$	2
$T_{resol}$	31.25 μs
$T_{wf}$	10 ms
${Th}_{upper}$	MaximumTBSsize/14
${Th}_{lower}$	0
$C_{up}$	40
$C_{s}$	30
$C_{down}$	10

Variable	Value
Number of P-ONUs $N_{P}$	4
Number of S-ONUs $N_{S}$	4
Bandwidth allocation cycle $T_{ba}$	125 μs
Number of grants $N_{g}$	4
Bandwidth for uplink MFH transmission $b_{P}$	1.0 Gbps/P-ONU
Bandwidth for error detection $b_{D}$	250 Mbps/P-ONU
Input peak throughput for P-ONU	800 Mbps/P-ONU
Input peak throughput for S-ONU	860 Mbps/S-ONU
Frame size for P-ONU	625 bytes
Frame size for S-ONU	128 bytes
Ratio of uplink and downlink	Before 2:8 (10 ms)
	After 4:1 (5 ms)
Uplink traffic capturing period	10 ms
Estimation polling cycle $T_{poll}$	250 ms

Variable	Definition
$T_{resol}$	Traffic monitor resolution
$T_{mon}$	Traffic monitor period
$T_{wf}$	Wireless frame size
$T_{sub}$	Sub-frame size
$N_{mon}$	Number of captured data
$N_{ds}$	Number of data sets
$N_{sub}$	Number of sub-frames in a wireless frame
$CapArray [N_{mon}]$	Captured data array
$DS 1 [N_{ds}]$	Data array after fragmentation
$DS 2 [N_{ds}]$	Data array after threshold process
$DS 3 [N_{sub}]$	Data array with pattern match
$E_{bs}$	Element of beginning of sub-frame
${Th}_{upper}$ , ${Th}_{lower}$	Threshold for preparing DS2
$C_{up}$	Constant value as uplink sub-frame
$C_{s}$	Constant value as special sub-frame
$C_{down}$	Constant value as downlink sub-frame

Variable	Value
Number of UEs	5, 10
Number of iterations	10,000 times
Maximum TBS size	9422 bytes
$N_{CA}$	5
$N_{MIMO}$	2
$T_{resol}$	31.25 μs
$T_{wf}$	10 ms
${Th}_{upper}$	MaximumTBSsize/14
${Th}_{lower}$	0
$C_{up}$	40
$C_{s}$	30
$C_{down}$	10

No.	0	1	2	3	4	5	6	7	8	9
0	D	S	U	U	U	D	S	U	U	U
1	D	S	U	U	D	D	S	U	U	D
2	D	S	U	D	D	D	S	U	D	D
3	D	S	U	U	U	D	D	D	D	D
4	D	S	U	U	D	D	D	D	D	D
5	D	S	U	D	D	D	D	D	D	D
6	D	S	U	U	U	D	S	U	U	D

No.	0	1	2	3	4	5	6	7	8	9
0	D	S	U	U	U	D	S	U	U	U
1	D	S	U	U	D	D	S	U	U	D
2	D	S	U	D	D	D	S	U	D	D
3	D	S	U	U	U	D	D	D	D	D
4	D	S	U	U	D	D	D	D	D	D
5	D	S	U	D	D	D	D	D	D	D
6	D	S	U	U	U	D	S	U	U	D

No.	0	1	2	3	4	5	6	7	8	9
0	D	S	U	U	U	D	S	U	U	U
1	D	S	U	U	D	D	S	U	U	D
2	D	S	U	D	D	D	S	U	D	D
3	D	S	U	U	U	D	D	D	D	D
4	D	S	U	U	D	D	D	D	D	D
5	D	S	U	D	D	D	D	D	D	D
6	D	S	U	U	U	D	S	U	U	D

No.	0	1	2	3	4	5	6	7	8	9
0	D	S	U	U	U	D	S	U	U	U
1	D	S	U	U	D	D	S	U	U	D
2	D	S	U	D	D	D	S	U	D	D
3	D	S	U	U	U	D	D	D	D	D
4	D	S	U	U	D	D	D	D	D	D
5	D	S	U	D	D	D	D	D	D	D
6	D	S	U	U	U	D	S	U	U	D

Abstract

Cited By

Figures (9)

Tables (8)

Equations (4)

Journal of Optical Communications and Networking

No.	0	1	2	3	4	5	6	7	8	9
0	D	S	U	U	U	D	S	U	U	U
1	D	S	U	U	D	D	S	U	U	D
2	D	S	U	D	D	D	S	U	D	D
3	D	S	U	U	U	D	D	D	D	D
4	D	S	U	U	D	D	D	D	D	D
5	D	S	U	D	D	D	D	D	D	D
6	D	S	U	U	U	D	S	U	U	D

No.	0	1	2	3	4	5	6	7	8	9
0	D	S	U	U	U	D	S	U	U	U
1	D	S	U	U	D	D	S	U	U	D
2	D	S	U	D	D	D	S	U	D	D
3	D	S	U	U	U	D	D	D	D	D
4	D	S	U	U	D	D	D	D	D	D
5	D	S	U	D	D	D	D	D	D	D
6	D	S	U	U	U	D	S	U	U	D