{"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.