Implementation of a One-LLID-per-Queue DBA Algorithm in EPON

N A M Radzi,H Zainol Abidin,N M Din,M H Al-Mansoori

doi:10.1155/2014/376195

N A M Radzi, H Zainol Abidin + Show 2 more

Open Access

PDF Available

https://doi.org/10.1155/2014/376195

Copy DOI

Export

Save

Cite

Journal: Advances in Optical Technologies	Publication Date: May 25, 2014
Citations: 1	License type: CC BY 3.0

Affiliation: Sohar University

Abstract
Highlights/Summary
Full-Text PDF
Similar Papers

Abstract

Listen

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.

Highlights

One of the most attractive solutions to the last mile bandwidth bottleneck in communication systems is Ethernet passive optical network (EPON)
It can be observed that universal DBA (UDBA) algorithm has higher throughput as high as 10% compared to modified smallest available report first (MSARF) algorithm and as high as 6% compared to CPBA-SLA algorithm
We conducted a simulation work using MATLAB, where we study the performance in terms of delay, throughput, and fairness index

Summary

Introduction

One of the most attractive solutions to the last mile bandwidth bottleneck in communication systems is Ethernet passive optical network (EPON). 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. Algorithms in [6, 7] are proposed by combining excessive bandwidth mechanism with a strict priority scheduling in intra-ONU. In cyclic-polling-based DBA scheme with service level agreement (CPBA-SLA) [9], inter-ONU allocation is done by dividing the ONUs into three groups: Groups A, B1, and B2 according to their SLA priority. In order to ensure that QoS is supported in the entire system, multiple LLIDs per ONU are proposed It has been used in a two-cycle allocation scheme which is proposed in [10].

Universal Dynamic Bandwidth Allocation

Simulation Study

Findings

Conclusion