基于紧急度的起始时间公平排队调度

2009 International Conference on Communication Software and Networks Pub Date : 2009-02-27 DOI:10.1109/ICCSN.2009.69

Liu Wen-bo, Guo Yun-fei, Ma Hai-long, Zhang Fan

{"title":"基于紧急度的起始时间公平排队调度","authors":"Liu Wen-bo, Guo Yun-fei, Ma Hai-long, Zhang Fan","doi":"10.1109/ICCSN.2009.69","DOIUrl":null,"url":null,"abstract":"How to provide a broad range of QoS guarantees in a packet network is an important issue. In order to achieve QoS guarantees, good traffic schedulers are indispensable. In this paper, a packet scheduling discipline UBSFQ and its simulation are proposed. According as the implementation and result of our simulations, this scheduling discipline is computational efficient, and can resolve the unstable packet latencies problem, and shares both the bounded-delay and fairness properties of GPS.","PeriodicalId":177679,"journal":{"name":"2009 International Conference on Communication Software and Networks","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"UBSFQ: An Urgency-Based Start-time Fair Queuing Scheduling\",\"authors\":\"Liu Wen-bo, Guo Yun-fei, Ma Hai-long, Zhang Fan\",\"doi\":\"10.1109/ICCSN.2009.69\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"How to provide a broad range of QoS guarantees in a packet network is an important issue. In order to achieve QoS guarantees, good traffic schedulers are indispensable. In this paper, a packet scheduling discipline UBSFQ and its simulation are proposed. According as the implementation and result of our simulations, this scheduling discipline is computational efficient, and can resolve the unstable packet latencies problem, and shares both the bounded-delay and fairness properties of GPS.\",\"PeriodicalId\":177679,\"journal\":{\"name\":\"2009 International Conference on Communication Software and Networks\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-02-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Communication Software and Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCSN.2009.69\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Communication Software and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSN.2009.69","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

如何在分组网络中提供广泛的QoS保证是一个重要的问题。为了实现QoS的保证，好的流量调度是必不可少的。本文提出了一个分组调度规则UBSFQ，并对其进行了仿真。仿真结果表明，该调度方法计算效率高，能够解决不稳定的数据包延迟问题，同时具有GPS的有界延迟和公平性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

UBSFQ: An Urgency-Based Start-time Fair Queuing Scheduling

How to provide a broad range of QoS guarantees in a packet network is an important issue. In order to achieve QoS guarantees, good traffic schedulers are indispensable. In this paper, a packet scheduling discipline UBSFQ and its simulation are proposed. According as the implementation and result of our simulations, this scheduling discipline is computational efficient, and can resolve the unstable packet latencies problem, and shares both the bounded-delay and fairness properties of GPS.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 International Conference on Communication Software and Networks

自引率

0.00%

发文量