A Basic Study of a File Delivery Scheduling in a Hop by Hop File Delivery System on One Link Model

Many content distribution systems such as CDN and P2P file sharing have been developed. In these systems, file-type contents require downloads to be completed before they can be played and they have no value before the download finishes. Therefore, the total download time for this sort of content is very important, and the service period should be reduced to satisfy users. We discuss a hop-by-hop file delivery system suitable for delivering file contents whereby the sum of service periods is reduced by using the request conditions. Moreover, we propose a file delivery scheduling algorithm for a one-link model given that the content request frequency is unknown. The algorithm is based on a local optimal strategy. We performed a characteristic analysis by computer simulation. The results showed that our algorithm performs to reduce the sum of the service periods in the hop-by-hop system effectively when request frequency distribution of each content has a deviation.