Windows scheduling as a paradigm for pushing information in wireless networks

A. Bar-Noy
{"title":"Windows scheduling as a paradigm for pushing information in wireless networks","authors":"A. Bar-Noy","doi":"10.1145/941079.941080","DOIUrl":null,"url":null,"abstract":"Given are n positive integers w1, w2, ..., wn called windows. The windows are associated with n equal length information pages. In the windows scheduling problem, the goal is to schedule all the pages on minimum number of identical broadcasting channels such that the gap between two consecutive appearances of page i on any of the channels is at most wi time slots where a time slot is the broadcasting time of one page.Our main application for windows scheduling is the implementation of efficient push systems for cellular and satellite networks. In such systems, the window size associated with a page corresponds to the quality of service associated with the page. That is, the window size is the maximum number of time slots a client who is listening to all the broadcasting channels needs to wait until it receives a particular page. Push systems are crucial to such wireless systems due to their one-way communication nature in which mobile users cannot use (or it is too expensive for them to use) pull systems to receive information. Push systems are also desirable for very popular information pages that would create bottlenecks if provided only via pull systems.Windows scheduling belongs to the general class of periodic scheduling problems that has applications in many disciplines (e.g., operations research, networking). The pages can be viewed as jobs and the channels as machines. The traditional optimization goal in periodic scheduling is an \"average\" type goal in which a job should be scheduled 1/wi fraction of the time and the quality of an algorithm is determined by some fairness issues. On the other hand, the windows scheduling problem has a \"max\" type optimization goal in which the gap between two consecutive appearances of a request must be smaller than wi. Both optimization goals provide practical solutions to the many applications of periodic scheduling.We discuss recent results and open problems for windows scheduling and its variants in off-line and on-line settings.","PeriodicalId":315744,"journal":{"name":"DIALM-POMC '03","volume":"90 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"DIALM-POMC '03","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/941079.941080","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Given are n positive integers w1, w2, ..., wn called windows. The windows are associated with n equal length information pages. In the windows scheduling problem, the goal is to schedule all the pages on minimum number of identical broadcasting channels such that the gap between two consecutive appearances of page i on any of the channels is at most wi time slots where a time slot is the broadcasting time of one page.Our main application for windows scheduling is the implementation of efficient push systems for cellular and satellite networks. In such systems, the window size associated with a page corresponds to the quality of service associated with the page. That is, the window size is the maximum number of time slots a client who is listening to all the broadcasting channels needs to wait until it receives a particular page. Push systems are crucial to such wireless systems due to their one-way communication nature in which mobile users cannot use (or it is too expensive for them to use) pull systems to receive information. Push systems are also desirable for very popular information pages that would create bottlenecks if provided only via pull systems.Windows scheduling belongs to the general class of periodic scheduling problems that has applications in many disciplines (e.g., operations research, networking). The pages can be viewed as jobs and the channels as machines. The traditional optimization goal in periodic scheduling is an "average" type goal in which a job should be scheduled 1/wi fraction of the time and the quality of an algorithm is determined by some fairness issues. On the other hand, the windows scheduling problem has a "max" type optimization goal in which the gap between two consecutive appearances of a request must be smaller than wi. Both optimization goals provide practical solutions to the many applications of periodic scheduling.We discuss recent results and open problems for windows scheduling and its variants in off-line and on-line settings.
Windows调度作为在无线网络中推送信息的范例
给定n个正整数w1, w2,…我们称之为窗户。这些窗口与n个等长的信息页相关联。在窗口调度问题中,目标是在最少数量的相同广播频道上调度所有页面,使得在任何频道上连续出现的第i页之间的间隔最多为6个时隙,其中一个时隙是一个页面的广播时间。窗口调度的主要应用是实现蜂窝和卫星网络的高效推送系统。在这样的系统中,与页面相关的窗口大小对应于与页面相关的服务质量。也就是说,窗口大小是正在收听所有广播频道的客户机在接收到特定页面之前需要等待的最大时隙数。推送系统对这种无线系统至关重要,因为它们的单向通信性质,移动用户不能使用(或者对他们来说太昂贵)拉系统来接收信息。对于非常流行的信息页面来说,推送系统也是可取的,如果只通过拉系统提供这些页面,就会产生瓶颈。Windows调度属于周期调度问题的一般类别,在许多学科(例如,运筹学,网络)中都有应用。可以将页面视为作业,将通道视为机器。传统的周期调度优化目标是“平均”型目标,即作业的调度时间为1/wi,算法的质量由一些公平性问题决定。另一方面,窗口调度问题具有“max”类型的优化目标,其中请求连续出现的两次之间的间隔必须小于wi。这两个优化目标都为周期调度的许多应用提供了实际的解决方案。我们讨论了最近的结果和打开的问题,窗口调度及其变体在离线和在线设置。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信