%0 Journal Article
%T Implementation of a One-LLID-per-Queue DBA Algorithm in EPON
%A N. A. M. Radzi
%A N. M. Din
%A M. H. Al-Mansoori
%A H. Zainol Abidin
%J Advances in Optical Technologies
%D 2014
%I Hindawi Publishing Corporation
%R 10.1155/2014/376195
%X The advantages of Ethernet passive optical network (EPON) are setting it to be a natural ubiquitous solution for the access network. In the upstream direction of EPON, the directional property of the splitter requires that the traffic flow be mitigated to avoid collision. A dynamic bandwidth allocation (DBA) scheme is desirable in optimizing the bandwidth usage further. In this paper, a global priority DBA mechanism is discussed. The mechanism aims to reduce the overall delay while enhancing the throughput and fairness. This study was conducted using MATLAB where it was compared to two other algorithms in the literature. The results show that the delay is reduced up to 59% and the throughput and fairness index are improved up to 10% and 6%, respectively. 1. Introduction One of the most attractive solutions to the last mile bandwidth bottleneck in communication systems is Ethernet passive optical network (EPON). It gains its popularity due to the large coverage area, the reduction in energy usage as compared to copper, the reduction in fiber deployment, and lower cost of maintenance [1]. In EPON, collision may occur in the upstream transmission when multiple optical network units (ONUs) transmit data to the optical line terminal (OLT) simultaneously. It occurs because the data from multiple ONUs need to share the same fiber from the splitter to the OLT. A current method of avoiding collision is by using dynamic bandwidth allocation (DBA) algorithm. Up to date, a number of DBA algorithms have been proposed in the literature [2¨C12]. In general, we can divide the algorithms into two parts: DBAs that use one logical link identifier (LLID) per ONU and DBAs that use multiple LLIDs per ONU. One LLID per ONU means that an LLID is allocated to the entire ONU. It creates a hierarchical scheduling structure in which the OLT assigns the bandwidth to the ONUs and the ONUs will further subdivide the bandwidth to multiple queues inside the ONU. On the other hand, multiple LLIDs per ONU mean that an LLID is allocated to each queue in every ONU. Luo and Ansari [2] propose DBA with multiple services algorithm that combines limited scheduling in inter-ONU allocation with nonstrict priority scheduling in intra-ONU allocation. Excessive bandwidth is also combined with a nonstrict priority scheduling in [3]. However, the shortcoming of this method is increased queuing delay because all packets would have to wait a full cycle between report and transmission. In order to overcome the problem in nonstrict priority scheduling, strict priority scheduling is used. It allows newly
%U http://www.hindawi.com/journals/aot/2014/376195/