首页> 外文期刊>Journal of Parallel and Distributed Computing >A segmentation approach for file broadcast scheduling
【24h】

A segmentation approach for file broadcast scheduling

机译:文件广播调度的分段方法

获取原文
获取原文并翻译 | 示例

摘要

We study the broadcast scheduling problem in which clients send their requests to a server in order to receive some files available on the server. The server may be scheduled in a way that several requests are satisfied in one broadcast. When flies are transmitted over computer networks, broadcasting the files by fragmenting them provides flexibility in broadcast scheduling that allows the optimization of per user response time. The broadcast scheduling algorithm, then, is in charge of determining the number of segments of each file and their order of transmission in each round of transmission. In this paper, we obtain a closed form approximation formula which approximates the optimal number of segments for each file, aiming at minimizing the total response time of requests. The obtained formula is a function of different parameters including those of underlying network as well as those of requests arrived at the server. Based on the obtained approximation formula we propose an algorithm for file broadcast scheduling which leads to total response time which closely conforms to the optimum one. We use extensive simulation and numerical study in order to evaluate the proposed algorithm which reveals high accuracy of obtained analytical approximation. We also investigate the impact of various headers that different network protocols add to each file segment. Our segmentation approach is examined for scenarios with different file sizes at the range of 100 KB to 1 GB. Our results show that for this range of file sizes the segmentation approach shows on average 13% tolerance from that of optimum in terms of total response time and the accuracy of the proposed approach is growing by increasing file size. Besides, using proposed segmentation in this work leads to a high Goodput of the scheduling algorithm.
机译:我们研究广播调度问题,在该问题中,客户端将其请求发送到服务器,以便接收服务器上可用的一些文件。可以以在一次广播中满足几个请求的方式来调度服务器。当苍蝇通过计算机网络传输时,通过对文件进行分段来广播文件可以在广播调度中提供灵活性,从而可以优化每个用户的响应时间。然后,广播调度算法负责确定每个文件的段数及其在每一轮传输中的传输顺序。在本文中,我们获得了一个封闭形式的近似公式,该公式近似于每个文件的最佳段数,旨在最大程度地减少请求的总响应时间。所获得的公式是不同参数的函数,包括基础网络的参数以及到达服务器的请求的参数。基于获得的近似公式,我们提出了一种文件广播调度算法,该算法导致总响应时间与最佳响应时间非常吻合。我们使用大量的仿真和数值研究来评估所提出的算法,该算法揭示了所获得的解析近似的高精度。我们还将调查不同网络协议添加到每个文件段的各种标头的影响。我们针对各种文件大小在100 KB到1 GB范围内的方案检查了我们的分段方法。我们的结果表明,对于此文件大小范围,分段方法在总响应时间方面显示出与最佳方法相比平均具有13%的容忍度,并且随着文件大小的增加,所提方法的准确性也在不断提高。此外,在这项工作中使用提议的分割导致调度算法的高吞吐量。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号