Refining the GIANT dynamic bandwidth allocation mechanism for XG-PON
No Thumbnail Available
Files
Date
2015-06
Authors
Arokkiam, Jerome A.
Brown, Kenneth N.
Sreenan, Cormac J.
Journal Title
Journal ISSN
Volume Title
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Published Version
Abstract
XG-PON requires an effective dynamic bandwidth allocation (DBA) mechanism for upstream traffic to support quality of service for different classes of traffic. We propose X-GIANT, which extends GPON based GigaPON Access Network (GIANT) DBA, with validated optimisations to the originally proposed key parameters - service timers and assured vs non-assured ratio of medium priority traffic. We implement X-GIANT in a standard compliant XG-PON module designed for the state-of-the-art ns-3 simulator, tune the above key parameters and show that mean delay and throughput for different classes of traffic obey the XG-PON requirements and respect priorities at both light and heavy upstream loads. We also show that X-GIANT shows better mean-delay performance than Efficient Bandwidth Utilisation (EBU), a recently proposed, GIANT-derived, priority-based DBA mechanism for XG-PON, for all three classes of traffic simulated.
Description
Keywords
Delays , Bandwidth , Resource management , Optical network units , Passive optical networks , Quality of service , Standards , Bandwidth allocation , Optical fibre subscriber loops , Optimisation , Telecommunication traffic
Citation
Arokkiam, J. A., Brown, K. N. and Sreenan, C. J. (2015) 'Refining the GIANT dynamic bandwidth allocation mechanism for XG-PON', IEEE International Conference on Communications (ICC), London, UK, 8 -12 June, pp. 1006-1011. doi: 10.1109/ICC.2015.7248454
Collections
Copyright
© 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.