Abstract
In this paper, we consider the Program Download Problem (PDP) which is to download a set of desired programs from multiple channels. When the problem is to decide whether the download can be done by a given deadline d and each program appears in each of the n channels at most once, denoted as PDP(n,1,d), we prove that PDP(n,1,d) is NP-Complete by a reduction from 3-SAT(3). We can extend the NP-hardness proof to PDP(2,2,d) where there are only two channels but each program could appear in each channel at most twice. We show that the aligned version of the problem (APDP) is polynomially solvable by reducing it to a maximum flow problem. For a different version of the problem, MPDP, where the objective is to maximize the number of program downloaded before a given deadline d, we prove that it is fixed-parameter tractable.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Almeroth, K.C., Ammar, M.H.: The use of multicast delivery to provide a scalable and interactive Video-on-Demand service. IEEE Journal on Selected Areas in Communications 14(5), 1110–1122 (1996)
Viswanathan, S., Imielinski, T.: Metropolitan area Video-on-Demand service using pyramid broadcasting. Multimedia Systems 4(4), 197–208 (1996)
Peng, C., Tan, Y., Xiong, N.X., Yang, L.T., Park, J.H., Kim, S.S.: Adaptive Video-on-Demand Broadcasting in Ubiquitous Computing Environment. Journal of Personal and Ubiquitous Computing 13(7), 479–488 (2009)
Aggarwal, C.C., Wolf, J.L., Yu, P.S.: A permutation-based pyramid broadcasting scheme for Video-on-Demand systems. In: Proc. International Conference on Multimedia Computing and Systems, pp. 118–126 (June 1996)
Hua, K.A., Sheu, S.: Skyscraper broadcasting: a new broadcasting scheme for metropolitan Video-on-Demand systems. In: Proc. ACM SIGCOMM 1997 Conference, Cannes, France, pp. 89–100 (September 1997)
Juhn, L., Tseng, L.: Harmonic broadcasting for Video-on-Demand service. IEEE Trans. on Broadcasting 43(3), 268–271 (1997)
Inoue, M., Ohnishi, M., Peng, C., Li, R., Morino, H.: NerveNet: A Future Regional Platform Network for Various Context-Aware Services with Sensors and Actuators. IEICE Trans. on Communications E94-B(3), 618–629 (2011)
Karagiannis, G., Altintas, O., Ekici, E., Heijenk, G., Jarupan, B., Lin, K., Weil, T.: Vehicular Networking: A Survey and Tutorial on Requirements, Architectures, Challenges, Standards and Solutions. IEEE Communications Surveys & Tutorials 13(4), 584–616 (2011)
Lu, Z.X., Shi, Y., Wu, W.L., Fu, B.: Efficient Data Retrieval Scheduling for Multi-Channel Wireless Data Broadcast. In: Proceedings of the 31st IEEE International Conference on Computer Communications (INFOCOM), pp. 891–899 (2012)
Lu, Z.X., Wu, W.L., Fu, B.: Optimal Data Retrieval Scheduling in the Multi-Channel Data Broadcast Environments. IEEE Trans. on Computers (2012)
Tovey, C.A.: A simplified NP-complete satisfiability problem. Discrete Applied Mathematics 8(1), 85–89 (1984)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, New York (1994)
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Networks Flows. Prentice-Hall, NJ (1993)
Peng, C., Shen, H.: A New Approximation Algorithm For Computing 2-Restricted Disjoint Paths. IEICE Transactions on Information and Systems E90-D(2), 465–472 (2007)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peng, C., Zhou, J., Zhu, B., Zhu, H. (2013). The Program Download Problem: Complexity and Algorithms. In: Du, DZ., Zhang, G. (eds) Computing and Combinatorics. COCOON 2013. Lecture Notes in Computer Science, vol 7936. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38768-5_61
Download citation
DOI: https://doi.org/10.1007/978-3-642-38768-5_61
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38767-8
Online ISBN: 978-3-642-38768-5
eBook Packages: Computer ScienceComputer Science (R0)