点对多点OFDMA系统中遗漏时间最小化的实时流量调度

D. Ermini, M. Bonuccelli
{"title":"点对多点OFDMA系统中遗漏时间最小化的实时流量调度","authors":"D. Ermini, M. Bonuccelli","doi":"10.1145/1868612.1868619","DOIUrl":null,"url":null,"abstract":"This paper considers the problem of scheduling realtime traffic in OFDMA systems. We present two heuristics with the objective of meeting as much deadlines as possible, or equivalently, minimizing the number of missed deadlines. The proposed heuristics decide on the allocation priority, taking into account several known parameters about the users and their service requests, such as the available carriers data rates for each user, the traffic amount and deadlines requirements of each service request. These available parameters are combined together by our heuristics for deciding a priority order by which to schedule the service requests. Specifically, we compare two realtime traffic allocation mechanisms: \"per-time slot\" scheme and \"per-deadline\" one. We evaluate our proposed heuristics performance, by means of simulations, computing the deadlines miss ratio (DMR), the percentage of users which miss more than 5% of deadlines (UMR) and the maximum missed deadlines percentage for the user who missed most (MMD).","PeriodicalId":311005,"journal":{"name":"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Realtime traffic scheduling for missed deadlines minimization in point-to-multipoint OFDMA systems\",\"authors\":\"D. Ermini, M. Bonuccelli\",\"doi\":\"10.1145/1868612.1868619\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers the problem of scheduling realtime traffic in OFDMA systems. We present two heuristics with the objective of meeting as much deadlines as possible, or equivalently, minimizing the number of missed deadlines. The proposed heuristics decide on the allocation priority, taking into account several known parameters about the users and their service requests, such as the available carriers data rates for each user, the traffic amount and deadlines requirements of each service request. These available parameters are combined together by our heuristics for deciding a priority order by which to schedule the service requests. Specifically, we compare two realtime traffic allocation mechanisms: \\\"per-time slot\\\" scheme and \\\"per-deadline\\\" one. We evaluate our proposed heuristics performance, by means of simulations, computing the deadlines miss ratio (DMR), the percentage of users which miss more than 5% of deadlines (UMR) and the maximum missed deadlines percentage for the user who missed most (MMD).\",\"PeriodicalId\":311005,\"journal\":{\"name\":\"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks\",\"volume\":\"80 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-10-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1868612.1868619\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Performance Monitoring, Measurement, and Evaluation of Heterogeneous Wireless and Wired Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1868612.1868619","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

本文研究了OFDMA系统中实时流量的调度问题。我们提出了两种启发式方法,目标是尽可能多地满足最后期限,或者同等地,最小化错过的最后期限的数量。提出的启发式算法考虑了用户及其服务请求的几个已知参数,如每个用户的可用运营商数据速率、每个服务请求的流量和截止日期要求,从而确定分配优先级。这些可用的参数通过我们的启发式方法组合在一起,以决定调度服务请求的优先级顺序。具体来说,我们比较了两种实时流量分配机制:“每个时隙”方案和“每个截止日期”方案。我们通过模拟来评估我们提出的启发式性能,计算截止日期错过率(DMR),错过超过5%截止日期的用户百分比(UMR)和错过最多的用户的最大错过截止日期百分比(MMD)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Realtime traffic scheduling for missed deadlines minimization in point-to-multipoint OFDMA systems
This paper considers the problem of scheduling realtime traffic in OFDMA systems. We present two heuristics with the objective of meeting as much deadlines as possible, or equivalently, minimizing the number of missed deadlines. The proposed heuristics decide on the allocation priority, taking into account several known parameters about the users and their service requests, such as the available carriers data rates for each user, the traffic amount and deadlines requirements of each service request. These available parameters are combined together by our heuristics for deciding a priority order by which to schedule the service requests. Specifically, we compare two realtime traffic allocation mechanisms: "per-time slot" scheme and "per-deadline" one. We evaluate our proposed heuristics performance, by means of simulations, computing the deadlines miss ratio (DMR), the percentage of users which miss more than 5% of deadlines (UMR) and the maximum missed deadlines percentage for the user who missed most (MMD).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信