An algorithm for scheduling hybrid slot-size to increase traffic density in EPONs
1 Prist University Vallam, Thanjavur, Tamilnadu, India.
2 Department of Electronics and Telecommunication Engg Dr AIT, Bangalore, India.
Research Article
Global Journal of Engineering and Technology Advances, 2021, 08(01), 028-038.
Article DOI: 10.30574/gjeta.2021.8.1.0102
Publication history:
Received on 07 June 2021; revised on 09 July 2021; accepted on 11 July 2021
Abstract:
The current basically Ethernet passive optical network (EPON) efficiently supports different service classes, i.e., Giant Prime concern (GP) traffic and Efficiently-best (EE) traffic, in future-generation networks. The difficult task is finding the efficient Dynamic Bandwidth Allocation (DBA) procedure task which suggests service classes of bandwidth simultaneously. This paper suggests improved version to DBA algorithm, Remodeled version-Hybrid division-size/Rate (HDSR) scheme. The modified control message scheduling algorithm is also discussed along with Remodeled-HDSR Algorithm which fits to the proposed scheme. In the modified Remodeled-HSSR scheme, time cycle length is identical classified accordingly with two subparts. In algorithm as explained in order to increase traffic density, the subdivision part of the planned cycle, the traffic conditions are dynamically suggested an improved version for Best effort traffic of multiple ONUs.
In the First subdivision part of the span time analysis time will not be compressed, particularly at less buffer status conditions plan buffer status of the HP traffic. The Remodeled control message algorithm which predefined status and is scheduled particularly which controls connecting the sub-parts of the planned cycles of the sequence time and in-turn increases synchronization between two Gate messages to particular ONUs.
Keywords:
PON; HSSR; MHSSR; Open Flow protocol; Passive Optical network (PON); Ethernet Passive Optical Network (EPON); MPCP; Water-filling–Dynamic bandwidth allocation algorithm (WF-DBA)
Full text article in PDF:
Copyright information:
Copyright © 2021 Author(s) retain the copyright of this article. This article is published under the terms of the Creative Commons Attribution Liscense 4.0