Dynamic Bandwidth Allocation Algorithms for Ethernet Passive Optical Networks with Threshold Reporting |
| |
Authors: | Nikolova Dessislava Van Houdt Benny Blondia Chris |
| |
Affiliation: | 1. Department of Mathematics and Computer Science, Performance Analysis of Telecommunication Systems Research Group, University of Antwerp, Middelheimlaan, 1, B-2020, Antwerp, Belgium
|
| |
Abstract: | In this paper we present a dynamic bandwidth allocation algorithm for Ethernet Passive Optical Networks (EPON), which makes use of the Multipoint Control Protocol (MPCP) with threshold reporting and with inter- and intra-ONU priority scheduling. Three varieties of this algorithm are compared under both symmetric and asymmetric traffic conditions, by means of a detailed simulation program, regarding average packet delay for several priorities, delay variation for constant bit rate (CBR) traffic and bandwidth utilization. Two types of intra-ONU priority scheduling algorithms are considered, being full and interval priority scheduling, called FPS and IPS, respectively. It is shown that by combining IPS with the threshold reporting mechanism one can achieve a nearly optimal bandwidth utilization (by avoiding nearly all fragmentation losses). IPS, however, causes an increased packet delay and delay variation for CBR traffic in comparison with FPS. In order to eliminate this drawback, we combine the IPS scheduling algorithm with a rate-based scheme for the highest priority (CBR) traffic. The combined IPSA algorithm provides an interesting trade-off between the efficiency, which is still near to the optimal, and the delay characteristics of time critical applications. Finally, we also demonstrate that unfairness arises with FPS under asymmetric traffic conditions, that is, ONUs with more best effort traffic are favored by FPS. Whereas asymmetric traffic conditions only slightly affect the fairness of IPS under low load conditions. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|