Prioritized time-constraint P2P packet scheduling using Lagrange multiplier for advertisement push/broadcast systems

In traditional advertisement push/broadcast applications, a lot of advertisement files will be directly downloaded from telcom operators (or content providers) to subscribers, and more bandwidth resources are needed. However, the server´s upload bandwidth might be the performance bottleneck when many files are downloaded at meanwhile. It results in network congestion, incompletely received files and playback failure possibly. Although Peer-to-Peer (P2P) techniques tackled problems of network congestion, past researches can not still promise that files can be received by the expected arrival deadline because no important factors, e.g., the constraint deadline, priority and file sizes, are all considered. In this paper, we propose prioritized time-constraint P2P packet scheduling for advertisement push/broadcast systems. According to the currently available bandwidth, transmitted file sizes and the expected arrival deadline, each priority of file transmission can be determined, and then bandwidth resources will be allocated properly using the Lagrange multiplier. In our experiments, we will give an example and prove that the ratio of the just-in-time file arrival will increase with distinct control parameters, e.g., deadline away and file sizes.