A segmentation approach for file broadcast scheduling
详细信息 查看全文
- 作者：Hamid Karimi ; Saleh Yousefi ; Maghsud Solimanpur
- 关键词：Broadcast ; Scheduling ; Segmentation
- 刊名：Journal of Parallel and Distributed Computing
- 出版年：2013
- 出版时间：October, 2013
- 年：2013
- 卷：73
- 期：10
- 页码：1375-1388
- 全文大小：1673 K
文摘
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 files 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.