基于歧视频率的工作年资和服务要求排队公平性度量

Werner Sandmann
{"title":"基于歧视频率的工作年资和服务要求排队公平性度量","authors":"Werner Sandmann","doi":"10.1109/NGI.2005.1431654","DOIUrl":null,"url":null,"abstract":"Queueing theory has dealt comprehensively with waiting times, throughput, or related properties. Another important issue, which is fair queueing, has been neglected for a long time and has received reasonable attention only very recently. As of today there are no generally accepted definitions and measures although some have been proposed. It has been recognized that measuring fairness in queues suffers from the dilemma that, depending on the application, queue scheduling pursues contradictory aims. Sometimes preference is given to short jobs, sometimes to jobs that already wait for quite a long time. In both cases one may get the impression that some jobs do not receive a fair treatment. In this paper we propose a queueing fairness measure which considers both service requirement and seniority of a job or customer. Our measure counts two types of discriminations that may bother customers: to be overtaken by other customers, and to wait due to customers with large service requirements. We show that our fairness measure adheres to previously published different preference principles, and we discuss possible measure refinements and the fairness of some scheduling policies.","PeriodicalId":435785,"journal":{"name":"Next Generation Internet Networks, 2005","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"A discrimination frequency based queueing fairness measure with regard to job seniority and service requirement\",\"authors\":\"Werner Sandmann\",\"doi\":\"10.1109/NGI.2005.1431654\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Queueing theory has dealt comprehensively with waiting times, throughput, or related properties. Another important issue, which is fair queueing, has been neglected for a long time and has received reasonable attention only very recently. As of today there are no generally accepted definitions and measures although some have been proposed. It has been recognized that measuring fairness in queues suffers from the dilemma that, depending on the application, queue scheduling pursues contradictory aims. Sometimes preference is given to short jobs, sometimes to jobs that already wait for quite a long time. In both cases one may get the impression that some jobs do not receive a fair treatment. In this paper we propose a queueing fairness measure which considers both service requirement and seniority of a job or customer. Our measure counts two types of discriminations that may bother customers: to be overtaken by other customers, and to wait due to customers with large service requirements. We show that our fairness measure adheres to previously published different preference principles, and we discuss possible measure refinements and the fairness of some scheduling policies.\",\"PeriodicalId\":435785,\"journal\":{\"name\":\"Next Generation Internet Networks, 2005\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-04-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Next Generation Internet Networks, 2005\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NGI.2005.1431654\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Next Generation Internet Networks, 2005","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NGI.2005.1431654","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 28

摘要

排队理论全面地处理了等待时间、吞吐量或相关属性。另一个重要的问题,即公平排队,长期以来一直被忽视,直到最近才得到合理的关注。到目前为止,虽然已经提出了一些定义和措施,但还没有普遍接受的定义和措施。人们已经认识到,衡量队列公平性面临着一个困境,即根据应用程序的不同,队列调度追求的是相互矛盾的目标。有时会优先考虑较短的作业,有时会优先考虑已经等待了很长时间的作业。在这两种情况下,人们可能会得到一些工作没有得到公平对待的印象。本文提出了一种同时考虑服务要求和工作或顾客的资历的排队公平性度量方法。我们的措施计算了两种可能困扰顾客的歧视:被其他顾客超越,以及由于服务需求大的顾客而等待。我们证明了我们的公平性度量符合先前发布的不同偏好原则,并讨论了可能的度量改进和一些调度策略的公平性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A discrimination frequency based queueing fairness measure with regard to job seniority and service requirement
Queueing theory has dealt comprehensively with waiting times, throughput, or related properties. Another important issue, which is fair queueing, has been neglected for a long time and has received reasonable attention only very recently. As of today there are no generally accepted definitions and measures although some have been proposed. It has been recognized that measuring fairness in queues suffers from the dilemma that, depending on the application, queue scheduling pursues contradictory aims. Sometimes preference is given to short jobs, sometimes to jobs that already wait for quite a long time. In both cases one may get the impression that some jobs do not receive a fair treatment. In this paper we propose a queueing fairness measure which considers both service requirement and seniority of a job or customer. Our measure counts two types of discriminations that may bother customers: to be overtaken by other customers, and to wait due to customers with large service requirements. We show that our fairness measure adheres to previously published different preference principles, and we discuss possible measure refinements and the fairness of some scheduling policies.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信