Abstract

The implications of the main components of dynamic bandwidth allocation (DBA) algorithms in ethernet passive optical networks, namely grant scheduling framework, grant sizing, and grant scheduling, have to date been examined in isolation. In contrast, we conduct a comprehensive throughput-delay comparison study of the three main DBA components; whereby, for each of the DBA components, we consider a range of common mechanisms. Our comparison study considers a number of novel combinations of mechanisms for the individual DBA algorithms, such as the double-phase polling (DPP) scheduling framework combined with limited with excess distribution grant sizing, and shortest propagation delay (SPD) first scheduling. We find that this (DPP, Limited with excess, SPD) combination in conjunction with a novel excess sharing mechanism outperforms previously studied DBA algorithms.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.