{"title":"ns-2网络模拟器的最小可达服务队列管理","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":"{\"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}","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
摘要
网络模拟器(ns-2)已被学术界公认为网络研究的事实上的标准工具。目前,ns-2实现了DropTail、Random Early Detection (RED)、priority和fair queuing等多种流行的排队和调度策略,为模拟网络运行提供了便利。最小可达服务(Least reached Service, LAS)是一种抢占式调度策略,适用于不事先知道作业大小的短作业。近年来,由于能够在有线和无线网络中提供交互性和公平性,LAS及其变体的使用受到了关注。在本文中,我们提出了LAS的一种新实现及其变体,即ns-2中基于阈值的LAS (TLAS),并通过不同的仿真场景对其进行了验证。
Least Attained Service Queue Management for ns-2 Network Simulator
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.