Abstract
This study using the Weighted Fair Queue scheduling algorithm when the weights can change and calculated based on changes in the average queue size in the buffer. This algorithm divides the priorities of each sensor into three priorities, namely high, medium and low priority. Each queue is given a weight that is adjusted to the resource requirements of each traffic. High priority data will take precedence, but medium and low priority data will remain underserved and guaranteed by network resources.The results of this study show packet loss ratio when the ratio of the number of buffers and the amount of data is 1: 3 with variations in the number of high, medium and low priority buffers 75: 75: 150 and 50: 50: 200 is 0%. The delay time in the high priority and the medium priority buffer has almost the same delay time when data is transmitted, whereas for the low priority buffer increased in the delay time.
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 callMore From: IJCCS (Indonesian Journal of Computing and Cybernetics Systems)
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.
