Design and analysis of a quantum-based QoS-aware fair share server for integrated services networks

Michael S. Boykin, T. Znati
{"title":"Design and analysis of a quantum-based QoS-aware fair share server for integrated services networks","authors":"Michael S. Boykin, T. Znati","doi":"10.1109/SIMSYM.1999.766451","DOIUrl":null,"url":null,"abstract":"Discrete service disciplines have been shown capable of emulating the ideal generalized processor sharing (GPS) discipline within one maximum-sized packet's transmission time. As a result, the accuracy of such schemes increases with improvements in link speed due to the corresponding reduction in packet transmission delay. However the merits of such accuracy diminish with improvements in link speed as the impact on call admission decisions decreases. Meanwhile, overhead, in terms of the number of scheduling decisions to be made per unit time, increases with the number of packets transmitted. In response, this paper presents an overview of the QFQ service discipline which enables GPS emulation servers to dynamically \"tune\" their service quanta at run-time based upon the QoS requirements of their currently backlogged connections rather than the statically defined maximum network packet size. Through simulation, the paper also demonstrates how the overhead of a GPS emulation server can be reduced in high speed networks without jeopardizing QoS guarantees or adversely impacting fairness.","PeriodicalId":104054,"journal":{"name":"Proceedings 32nd Annual Simulation Symposium","volume":"115 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 32nd Annual Simulation Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIMSYM.1999.766451","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Discrete service disciplines have been shown capable of emulating the ideal generalized processor sharing (GPS) discipline within one maximum-sized packet's transmission time. As a result, the accuracy of such schemes increases with improvements in link speed due to the corresponding reduction in packet transmission delay. However the merits of such accuracy diminish with improvements in link speed as the impact on call admission decisions decreases. Meanwhile, overhead, in terms of the number of scheduling decisions to be made per unit time, increases with the number of packets transmitted. In response, this paper presents an overview of the QFQ service discipline which enables GPS emulation servers to dynamically "tune" their service quanta at run-time based upon the QoS requirements of their currently backlogged connections rather than the statically defined maximum network packet size. Through simulation, the paper also demonstrates how the overhead of a GPS emulation server can be reduced in high speed networks without jeopardizing QoS guarantees or adversely impacting fairness.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
综合业务网中基于量子的qos感知公平共享服务器的设计与分析
离散服务学科已被证明能够在一个最大大小的数据包传输时间内模拟理想的广义处理器共享(GPS)学科。因此,由于相应减少了分组传输延迟,这些方案的准确性随着链路速度的提高而提高。然而,这种准确性的优点随着链路速度的提高而降低,因为对呼叫接纳决策的影响降低了。同时,开销(单位时间内要做出的调度决策的数量)随着传输的数据包数量的增加而增加。作为回应,本文概述了QFQ服务原则,该原则使GPS仿真服务器能够根据当前积压连接的QoS要求,而不是静态定义的最大网络数据包大小,在运行时动态“调整”其服务量。通过仿真,本文还演示了如何在高速网络中降低GPS仿真服务器的开销,而不损害QoS保证或对公平性产生不利影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Microscopic simulations of freeway traffic flow Applying globally convergent techniques to conventional DC operating point analyses A framework for simulating heterogeneous virtual processors Design criterion for the statistics exchange control algorithms used in the statistical synchronization method SIM-ENG: a traffic simulation engine
×
引用
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