Jian-guo Zhou, Xiao Chen, P. Yan, Jing Wu, Gui-wen Yang
{"title":"基于速度的主动队列管理方案","authors":"Jian-guo Zhou, Xiao Chen, P. Yan, Jing Wu, Gui-wen Yang","doi":"10.1109/CNSR.2005.18","DOIUrl":null,"url":null,"abstract":"This paper presents a speed based active queue management scheme. This scheme predicts the incoming and outgoing speed of every active flow in the next sample intervals according to the history data. And then with the queue length of every flow at the end of last a few intervals, predicted incoming and outgoing rate and expected queue length, drop probability in this interval is calculated. The goal of this scheme is to achieve both stabilized queue length and per-flow fairness. Through ns-2 simulation, we compare SBAQM against FRED and SRED and obtain satisfying results.","PeriodicalId":166700,"journal":{"name":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A speed based active queue management scheme\",\"authors\":\"Jian-guo Zhou, Xiao Chen, P. Yan, Jing Wu, Gui-wen Yang\",\"doi\":\"10.1109/CNSR.2005.18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a speed based active queue management scheme. This scheme predicts the incoming and outgoing speed of every active flow in the next sample intervals according to the history data. And then with the queue length of every flow at the end of last a few intervals, predicted incoming and outgoing rate and expected queue length, drop probability in this interval is calculated. The goal of this scheme is to achieve both stabilized queue length and per-flow fairness. Through ns-2 simulation, we compare SBAQM against FRED and SRED and obtain satisfying results.\",\"PeriodicalId\":166700,\"journal\":{\"name\":\"3rd Annual Communication Networks and Services Research Conference (CNSR'05)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"3rd Annual Communication Networks and Services Research Conference (CNSR'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CNSR.2005.18\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"3rd Annual Communication Networks and Services Research Conference (CNSR'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNSR.2005.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper presents a speed based active queue management scheme. This scheme predicts the incoming and outgoing speed of every active flow in the next sample intervals according to the history data. And then with the queue length of every flow at the end of last a few intervals, predicted incoming and outgoing rate and expected queue length, drop probability in this interval is calculated. The goal of this scheme is to achieve both stabilized queue length and per-flow fairness. Through ns-2 simulation, we compare SBAQM against FRED and SRED and obtain satisfying results.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
