利用opnet对基于类的加权公平队列进行性能建模

Idris Zakariyya, Mohd Nazri Ismail M Nordin A Rahman
{"title":"利用opnet对基于类的加权公平队列进行性能建模","authors":"Idris Zakariyya, Mohd Nazri Ismail M Nordin A Rahman","doi":"10.17781/p001709","DOIUrl":null,"url":null,"abstract":"Congestion control and internet network resources management are complex and critical issues in a high-speed packet switch data network, due to the emergence growth of modern multimedia streaming services. The increasing number of computer users in various organizations and institutions of higher learning have spurred a great deal of research on network traffic control. Network administrators are facing the challenges of providing efficient services that can satisfy user requirements. This research study proposed queuing algorithm based on classbased weighted fair queue scheme to complement congestion. Network simulation environment are designed and modeled using OPNET simulation software in-order to overcome the limitation of the traditional queuing approach. Various simulations scenarios are conducted. Analysis comparison with first-in-first-out and priority queue is recorded. And also, various network traffics such as: HTTP, video conferencing and voice applications among others are considered. From the graphical results obtained clearly shows that the overall applications services performances optimize significantly. In terms of the throughput, packet loss and queuing delay, the algorithms performs excellently compared with the FIFO and priority queue. This paper examines the implication of queuing scheduling algorithms on an IP router. It also outlines the effectiveness of the proposed algorithm in managing network resources during the period of congestion.","PeriodicalId":211757,"journal":{"name":"International journal of new computer architectures and their applications","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"MODELLING THE PERFORMANCE OF CLASS-BASED WEIGHTED FAIR QUEUE USING OPNET\",\"authors\":\"Idris Zakariyya, Mohd Nazri Ismail M Nordin A Rahman\",\"doi\":\"10.17781/p001709\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Congestion control and internet network resources management are complex and critical issues in a high-speed packet switch data network, due to the emergence growth of modern multimedia streaming services. The increasing number of computer users in various organizations and institutions of higher learning have spurred a great deal of research on network traffic control. Network administrators are facing the challenges of providing efficient services that can satisfy user requirements. This research study proposed queuing algorithm based on classbased weighted fair queue scheme to complement congestion. Network simulation environment are designed and modeled using OPNET simulation software in-order to overcome the limitation of the traditional queuing approach. Various simulations scenarios are conducted. Analysis comparison with first-in-first-out and priority queue is recorded. And also, various network traffics such as: HTTP, video conferencing and voice applications among others are considered. From the graphical results obtained clearly shows that the overall applications services performances optimize significantly. In terms of the throughput, packet loss and queuing delay, the algorithms performs excellently compared with the FIFO and priority queue. This paper examines the implication of queuing scheduling algorithms on an IP router. It also outlines the effectiveness of the proposed algorithm in managing network resources during the period of congestion.\",\"PeriodicalId\":211757,\"journal\":{\"name\":\"International journal of new computer architectures and their applications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International journal of new computer architectures and their applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17781/p001709\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of new computer architectures and their applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17781/p001709","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着现代多媒体流媒体业务的发展,拥塞控制和internet网络资源管理成为高速分组交换数据网络中复杂而关键的问题。各种组织机构和高等院校的计算机用户数量不断增加,促使人们对网络流量控制进行了大量研究。如何提供满足用户需求的高效服务是网络管理员面临的挑战。本研究提出了一种基于分类加权公平队列方案的排队算法来弥补拥塞问题。为了克服传统排队方法的局限性,利用OPNET仿真软件设计和建模网络仿真环境。进行了各种模拟场景。记录与先进先出和优先队列的分析对比。此外,还考虑了各种网络流量,如:HTTP,视频会议和语音应用程序等。从所获得的图形结果清楚地表明,应用程序服务的整体性能得到了显著优化。在吞吐量、丢包率和排队延迟方面,与FIFO和优先队列相比,该算法表现优异。本文研究了IP路由器上排队调度算法的含义。本文还概述了该算法在拥塞期间管理网络资源的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
MODELLING THE PERFORMANCE OF CLASS-BASED WEIGHTED FAIR QUEUE USING OPNET
Congestion control and internet network resources management are complex and critical issues in a high-speed packet switch data network, due to the emergence growth of modern multimedia streaming services. The increasing number of computer users in various organizations and institutions of higher learning have spurred a great deal of research on network traffic control. Network administrators are facing the challenges of providing efficient services that can satisfy user requirements. This research study proposed queuing algorithm based on classbased weighted fair queue scheme to complement congestion. Network simulation environment are designed and modeled using OPNET simulation software in-order to overcome the limitation of the traditional queuing approach. Various simulations scenarios are conducted. Analysis comparison with first-in-first-out and priority queue is recorded. And also, various network traffics such as: HTTP, video conferencing and voice applications among others are considered. From the graphical results obtained clearly shows that the overall applications services performances optimize significantly. In terms of the throughput, packet loss and queuing delay, the algorithms performs excellently compared with the FIFO and priority queue. This paper examines the implication of queuing scheduling algorithms on an IP router. It also outlines the effectiveness of the proposed algorithm in managing network resources during the period of congestion.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Introduction to Sociology of Online Social Networks in Morocco. Data Acquisition Process: Results and Connectivity Analysis SLA-BASED RESOURCE ALLOCATION WITHIN CLOUD NETWORKING ENVIRONMENT Proportional Weighted Round Robin: A Proportional Share CPU Scheduler inTime Sharing Systems Variation Effect of Silicon Film Thickness on Electrical Properties of NANOMOSFET CAUSALITY ISSUES IN ORIENTATION CONTROL OF AN UNDER-ACTUATED DRILL MACHINE
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1