Least Attained Service Queue Management for ns-2 Network Simulator

Naeem Khademi, M. Othman
{"title":"Least Attained Service Queue Management for ns-2 Network Simulator","authors":"Naeem Khademi, M. Othman","doi":"10.1109/ICCRD.2010.91","DOIUrl":null,"url":null,"abstract":"Network simulator (ns-2) has been accepted as a de facto standard tool for networking research among academicians. Currently, multiple popular queuing and scheduling policies are implemented in ns-2 such as DropTail, Random Early Detection (RED), priority and fair queuing to provide the facility to simulate the network operation. Least Attained Service (LAS) is a preemptive scheduling policy that favors short jobs without prior knowledge of the job sizes. The employment of LAS and its variants has received attention in recent years due to their ability to provide interactivity and fairness in wired as well as wireless networks. In this paper we present a novel implementation of LAS and one of its variants, Threshold-based LAS (TLAS) in ns-2 and we validate them by different simulation scenarios.","PeriodicalId":158568,"journal":{"name":"2010 Second International Conference on Computer Research and Development","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Computer Research and Development","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCRD.2010.91","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Network simulator (ns-2) has been accepted as a de facto standard tool for networking research among academicians. Currently, multiple popular queuing and scheduling policies are implemented in ns-2 such as DropTail, Random Early Detection (RED), priority and fair queuing to provide the facility to simulate the network operation. Least Attained Service (LAS) is a preemptive scheduling policy that favors short jobs without prior knowledge of the job sizes. The employment of LAS and its variants has received attention in recent years due to their ability to provide interactivity and fairness in wired as well as wireless networks. In this paper we present a novel implementation of LAS and one of its variants, Threshold-based LAS (TLAS) in ns-2 and we validate them by different simulation scenarios.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
ns-2网络模拟器的最小可达服务队列管理
网络模拟器(ns-2)已被学术界公认为网络研究的事实上的标准工具。目前,ns-2实现了DropTail、Random Early Detection (RED)、priority和fair queuing等多种流行的排队和调度策略,为模拟网络运行提供了便利。最小可达服务(Least reached Service, LAS)是一种抢占式调度策略,适用于不事先知道作业大小的短作业。近年来,由于能够在有线和无线网络中提供交互性和公平性,LAS及其变体的使用受到了关注。在本文中,我们提出了LAS的一种新实现及其变体,即ns-2中基于阈值的LAS (TLAS),并通过不同的仿真场景对其进行了验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Preparation and Characterization of NiCoFerrite Nanoparticles by Thermal Method Implementing the TLS Protocol on a Bare PC A Design of Grid Supported Services for Mobile Learning System Performance Comparison of Bow-Tie and Slot Antenna Based on RWG Edge Elements Simulation for RFID-Based Red Light Violation Detection: Violation Detection and Flow Prediction
×
引用
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