首页> 外文会议>Joint workshop on Foundations of mobile computing >Windows scheduling as a paradigm for pushing information in wireless networks
【24h】

Windows scheduling as a paradigm for pushing information in wireless networks

机译:Windows调度是在无线网络中推送信息的范例

获取原文
获取外文期刊封面目录资料

摘要

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 tooexpensive 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.
机译:给定n个正整数w 1 ,w 2 ,...,w n ,称为窗口。窗口与n个等长信息页面关联。在窗口调度问题中,目标是将所有页面调度在最小数量的相同广播频道上,以使在任何一个频道上的页面i的两个连续出现之间的间隔最大为wi,其中时隙是广播时间为一页。我们的Windows调度主要应用是为蜂窝和卫星网络实现高效的推送系统。在这样的系统中,与页面相关联的窗口大小对应于与页面相关联的服务质量。即,窗口大小是正在侦听所有广播频道的客户端需要等待直到接收到特定页面的最大时隙数。推式系统对此类无线系统至关重要,原因是推式系统具有单向通信特性,在这种方式中,移动用户无法使用(或者使用它们过于昂贵)拉式系统来接收信息。推送系统对于非常受欢迎的信息页面(如果仅通过拉动系统提供)也会产生瓶颈也很需要.Windows调度属于周期性调度问题的一般类别,在许多学科中都有应用(例如,运筹学,网络)。可以将页面视为作业,可以将通道视为计算机。定期调度中的传统优化目标是“平均”类型的目标,其中应按时间的1 / wi部分调度作业,并且算法的质量由一些公平性问题决定。另一方面,窗口调度问题具有“最大”类型的优化目标,其中请求的两个连续出现之间的间隙必须小于wi。这两个优化目标都为定期调度的许多应用程序提供了实用的解决方案。我们讨论了离线调度和联机设置中Windows调度及其变体的最新结果和开放问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号