IPACT with Smallest Available Report First: A New DBA Algorithm for EPON

Dynamic Bandwidth allocation in Ethernet Passive Optical Networks (EPONs) has been an area of intense research in recent years. Most of the proposed solutions offer clever methods for fair grant sizing, traffic prediction, and prioritized, differentiated services. Barring some work by Kamal et al. and some elements in the scheme proposed by Ma et al., no work has been done on exploring the order of granting (i.e., ONU sequencing) in an EPON. In this paper, we propose an unexplored heuristic for improving the performance of the IPACT scheme with respect to the most important metric: packet delay. In this heuristic, the OLT always grants that ONU which has the Smallest (Available) Reported queue length, First (SARF). Our simulations indicate that our heuristic can improve the delay performance of IPACT by 10-20% (when tested under the gated allocation policy).