Please use this identifier to cite or link to this item:
|Title:||Improving Latency and Jitter Performance in CDMA-Based Next-Generation Ethernet Passive Optical Networks for 5G Applications||Authors:||Raad, Robert
|Affiliations:||Department of Computer Engineering||Keywords:||5G applications
|Issue Date:||2019-01-01||Publisher:||Institute of Electrical and Electronics Engineers||Part of:||2019 IEEE 38th International Performance Computing and Communications Conference (IPCCC)||Conference:||International Performance Computing and Communications Conference (IPCCC) (38th: 29-31 Oct. 2019 : London, UK)||Abstract:||
In this paper, we propose new scheduling algorithms to improve the performance of the code division multiple access (CDMA) enabled next generation Ethernet passive optical networks (NG- EPON). In the NG-EPON standard, stringent requirements are applied to the packet delay. In addition, lowering the end-to-end latency/jitter will be instrumental in the realization of future 5G applications. For this reason, we propose two new scheduling algorithms for NG-EPON to assign a grant size on each upstream code in order to guarantee the newly required network throughput and latency performance of 5G systems. Results show that both newly proposed scheduling schemes can significantly improve the network performance in terms of delay/Jitter and throughput. In addition, the results are compared to numerous dynamic wavelength and bandwidth allocation (DWBA) algorithms. It is shown that CDMA can be a good alternative for WDM for multi-channels based NG-EPON. Also, it is shown that the proposed algorithms can reach a high capacity and a very low latency/jitter to accommodate 5G services.
|URI:||https://scholarhub.balamand.edu.lb/handle/uob/5008||ISBN:||9781728110257||DOI:||10.1109/IPCCC47392.2019.8958757||Ezproxy URL:||Link to full text||Type:||Conference Paper|
|Appears in Collections:||Department of Computer Engineering|
Show full item record
checked on Sep 18, 2021
checked on Aug 14, 2021
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.