Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/1712
Full metadata record
DC FieldValueLanguage
dc.contributor.authorTaha, Mohammed Qasim-
dc.contributor.authorAli, Zaid Hussien-
dc.contributor.authorAhmed, Abdullah Khalid-
dc.date.accessioned2022-10-16T06:55:19Z-
dc.date.available2022-10-16T06:55:19Z-
dc.date.issued2020-
dc.identifier.issn2088-8708-
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/1712-
dc.description.abstractAbstract: In this paper, a novel scheduling scheme for the Fourth Generation (4G)-Wireless Local Area Network (WLAN) network is proposed to ensure that end to end traffic transaction is provisioned seamlessly. The scheduling scheme is divided into two stages; in stage one, traffic is separated into Actual Time Traffic (ATT) and Non-Actual-Time Traffic (NATT), while in stage two, complex queuing strategy is performed. In stage one, Class-Based Queuing (CBQ) and Deficit Round Robin (DRR) are used for NATT and ATT applications, respectively to separate and forward traffic themselves according to source requirements. Whereas in the stage, two Control Priority Queuing (CPQ) is used to assign each class the appropriate priority level. Evaluation of the performance of the integrated network was done according to several metrics such as end-to-end delay, jitter, packet loss, and network’s throughput. Results demonstrate major improvements for AT services with minor degradation on NAT applications after implementing the new scheduling scheme.en_US
dc.language.isoenen_US
dc.publisherInternational Journal of Electrical and Computer Engineering (IJECE)en_US
dc.subjectFourth Generation (4G)en_US
dc.subjectWireless Local Area Network (WLAN)en_US
dc.subjectFifth GenerationNetwork Scheduling Schemeen_US
dc.titleTwo-level scheduling scheme for integrated 4G-WLAN networken_US
dc.typeArticleen_US
Appears in Collections:الهندسة الكهربائية

Files in This Item:
File Description SizeFormat 
Abstract3.pdf57.9 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.