Hierarchical-based Dynamic Bandwidth Allocation Algorithm for Multi-class Services in Ethernet PON 


Vol. 29,  No. 3, pp. 223-232, Mar.  2004


PDF
  Abstract

In this paper we propose the hierarchical-based dynamic bandwidth allocation algorithm for multi-class services in Ethernet-PON. The proposed algorithm consists of the high level scheduler in OLT and the low level scheduler in ONU. The hierarchical architecture is able to provide scalability and resource efficiency in Ethernet-PON which has the distributed nature of the scheduling domain, with queues and the scheduler located at a large distance from each other. We also propose three dynamic bandwidth allocation algorithms for the low level scheduler: Proportional Allocation algorithm, Maximum Request First Allocation (MRFA) algorithm and High Priority First Allocation (HPFA) algorithm. We implement the Ethernet-PON standardized in the IEEE 802,3ah using OPNET. We also evaluate and analyze the performance for the proposed algorithms in terms of channel utilization, queuing delay and the amount of remainder.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

K. Han, K. Ahn, Y. Kim, "Hierarchical-based Dynamic Bandwidth Allocation Algorithm for Multi-class Services in Ethernet PON," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 3, pp. 223-232, 2004. DOI: .

[ACM Style]

Kyeong-Eun Han, Kye-Hyun Ahn, and Young-Chon Kim. 2004. Hierarchical-based Dynamic Bandwidth Allocation Algorithm for Multi-class Services in Ethernet PON. The Journal of Korean Institute of Communications and Information Sciences, 29, 3, (2004), 223-232. DOI: .

[KICS Style]

Kyeong-Eun Han, Kye-Hyun Ahn, Young-Chon Kim, "Hierarchical-based Dynamic Bandwidth Allocation Algorithm for Multi-class Services in Ethernet PON," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 3, pp. 223-232, 3. 2004.