| 摘要 |
A system is provided to deliver complete files from a server to a maximum number of clients, while at the same time minimizing cumulative waiting time through the utilization of a prioritization heuristic in which there are two competing priorities. As to the first priority, the highest priority is given to those clients most in danger of not receiving a complete file by a predetermined deadline. The second priority is set to minimize the waiting time for the delivery of files by sending the files only to those clients that are capable of receiving the data fastest. An exponential curve system is utilized as a tie breaker between the two competing priorities in which the weight of each priority is determined. As a result, in terms of distribution from a single server to multiple clients, the calculation of the weighted priority is a real number derived from user parameters such as log-in characteristics, the due date, and the amount of the file remaining to be transmitted. The characteristics of the client are derived through information sent back to the server from each client with the average throughput to the particular client being calculated either at the client side or by the server itself.
|
