Heuristic algorithms for optimization of task allocation and result distribution in peer-to-peer computing systems
References
- Anderson, D.P. (2004). BOINC: A system for public-resource computing and storage,, pp. 4-10.
- Arthur, D. and Panigrahy, R. (2006). Analyzing BitTorrent and related peer-to-peer networks,ACM, New York, NY, pp. 961-969, DOI: 10.1145/1109557.1109664. BOINC (2011). BOINC poject, http://boinc.berkeley.edu/.
- Chmaj, G. and Walkowiak, K. (2008). Data distribution in public-resource computing: Modeling and optimization,(2B): 11-20.
- Chmaj, G. and Walkowiak, K. (2009). Heuristic algorithm for optimization of P2P-based public-resource computing systems,M. Parashar and S.K. Aggarwal (Eds.),, Springer-Verlag, Berlin/Heidelberg, pp. 180-187, DOI: 10.1007/978-3-540-89737-8 19.
- Chmaj, G. andWalkowiak, K. (2010a). A P2P computing system for overlay networks,, DOI: 10.1016/j.future.2010.11.009.
- Chmaj, G. andWalkowiak, K. (2010b). Random approach to optimization of overlay public-resource computing systems,(1): 55-62.
- Christakidis, A., Efthymiopoulos, N., Fiedler, J., Dempsey, S., Koutsopoulos, K., Denazis, S. G., Tombros, S., Garvey, S. and Koufopavlou, O. G. (2011). Vital++, a new communication paradigm: Embedding P2P technology in next generation networks,(1): 84-91.
- Cohen, B. (2003). Incentives build robustness in BitTorrent, http://www.bittorrent.org/bittorrentecon.pdf.
- Couto da Silva, A.P., Leonardi, E., Mellia, M. and Meo, M. (2011). Chunk distribution in mesh-based large-scale P2P streaming systems: A fluid approach,(3): 451-463, DOI:10.1109/TPDS.2010.63.
- Ganesan, P. and Seshadri, M. (2005). On cooperative content distribution and the price of barter,D.C. Martin (Ed.),, IEEE Computer Society, Washington, DC, pp. 81-90, DOI: 10.1109/ICDCS.2005.53.
- Gonz´alez-V´elez, H. and Kontagora, M. (2011). Performance evaluation of MapReduce using full virtualisation on a departmental cloud,(2): 275-284, DOI:10.2478/v10006-011-0020-3. ILOG (2009). AMPL/CPLEX software, http://www.ilog.com/products/cplex/.
- Jansen, K. and Muller, H. (1994). The minimum broadcast time problem,M. Cosnard, A. Ferreira and J. Peters (Eds.),, Lecture Notes in Computer Science, Vol. 805, Springer-Verlag, Montreal, pp. 219-234.
- Jin, H., Luo, F., Zhang, Q., Liao, X. and Zhang, H. (2006). GTapestry: A locality-aware overlay network for high performance computing,P. Bellavista and C.-M. Chen (Eds.),, IEEE Computer Society, Washington, DC, pp. 76-81, DOI:10.1109/ISCC.2006.82.
- Kasprzak, A. (2001)., Wrocław University of Technology Press, Wrocław, (in Polish).
- Killian, C., Vrable, M., Snoeren, A.C., Vahdat, A. and Pasquale, J. (2005). The overlay network content distribution problem,, University of California, San Diego, CA.
- Kim, H.K., Kim, J.K. and Ryu, Y.U. (2009). Personalized recommendation over a customer network for ubiquitous shopping,(2): 140-151, DOI: 10.1109/TSC.2009.7.
- Krauter, K., Buyya, R. and Maheswaran, M. (2002). A taxonomy and survey of grid resource management systems for distributed computing,(2): 135-164, DOI: 10.1002/spe.432.
- Liu, X., Qiao, C., Yu, D. and Jiang, T. (2010). Applicationspecific resource provisioning for wide-area distributed computing,(4): 25-34, DOI: 10.1109/MNET.2010.5510915.
- Michalewicz, Z. (1996).3rd Edn., Springer-Verlag, London.
- Miller, K. and Wolisz, A. (2011). Transport optimization in peer-to-peer networks,Y. Cotronis, M. Danelutto and G.A. Papadopoulos (Eds.),, IEEE Computer Society, Washington, DC, pp. 567-573, DOI: 10.1109/PDP.2011.26.
- Milojicic, D., Kalogeraki, V., Lukose, R., Nagaraja, K., Pruyne, J., Richard, B., Rollins, S., and Z, X. (2002). Peer-to-peer computing,, HP Laboratories, Palo Alto, CA, HPL-2002-57.
- Munidger, J. and Weber, R. (2004). Efficient file dissemination using peer-to-peer technology,, Statistical Laboratory Research Reports 2004-01, Cambridge.
- Nabrzyski, J., Schopf, J.M. and Weglarz, J. (Eds.) (2004)., Kluwer Academic Publishers, Norwell, MA.
- Pioro, M. and Medhi, D. (2004)., Morgan Kaufman Publishers, San Francisco, CA.
- Pop, F. (2012). Heuristics analysis for distributed scheduling using MONARC simulation tool,, pp. 157-163.
- Przewozniczek, M., Walkowiak, K. and Wozniak, M. (2011). Optimizing distributed computing systems for k-nearest neighbors classifiers: Evolutionary approach,(2): 357-372, DOI: 10.1093/jigpal/jzq034.
- Ramzan, N., Quacchio, E., Zgaljic, T., Asioli, S., Celetto, L., Izquierdo, E. and Rovati, F. (2011). Peer-to-peer streaming of scalable video in future Internet applications,(3): 128-135, DOI: 10.1109/MCOM.2011.5723810.
- Samanta, R., Funkhouser, T. and Li, K. (2001). Parallel rendering with k-way replication,S.N. Spencer (Ed.),, IEEE Press, Piscataway, NJ, pp. 75-84.
- Shen, X., Yu, H., Buford, J. and Akon, M. (Eds.) (2009).1st Edn., Springer Publishing Company, New York, NY.
- Stutzbach, D., Zappala, D. and Rejaie, R. (2004). Swarming: Scalable content delivery for the masses,, University of Oregon, Eugene, OR.
- Suri, N., Benincasa, G., Tortonesi, M., Stefanelli, C., Kovach, J., Winkler, R., Kohler, R., Hanna, J., Pochet, L. and Watson, S. (2010). Peer-to-peer communications for tactical environments: Observations, requirements, and experiences,(10): 60-69.
- Tarkoma, S. (2010).1st Edn., Auerbach Publications, Boston, MA.
- Terzo, O., Mossucca, L., Cucca, M. and Notarpietro, R. (2011). Data intensive scientific analysis with grid computing,(2): 219-228, DOI: 10.2478/v10006-011-0016-z.
- Travostino, F., Travostino, F. and Karmous-Edwards, G. (Eds.) (2006)., Wiley, Chichester.
- Vanderster, D.C., Dimopoulos, N.J., Parra-Hernandez, R. and Sobie, R.J. (2009). Resource allocation on computational grids using a utility model and the knapsack problem,(1): 35-50, DOI: 10.1016/j.future.2008.07.006.
- Wozniak, M. (2009). Evolutionary approach to produce classifier ensemble based on weighted voting,A. Abraham, A. Carvalho, F. Herrera and V. Pai (Eds.),, IEEE, Coimbatore, pp. 648-653.
- Yang, X. and de Veciana, G. (2004). Service capacity of peer to peer networks,, Vol. 4, pp. 2242-2252.
- Zhou, Y., Chiu, D.-M. and Lui, J.C.S. (2011). A simple model for chunk-scheduling strategies in P2P streaming,(1): 42-54, DOI: 10.1109/TNET.2010.2065237.
Language: English
Page range: 733 - 748
Published on: Sep 28, 2012
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year
Keywords:
Related subjects:
© 2012 Grzegorz Chmaj, Krzysztof Walkowiak, Michał Tarnawski, Michał Kucharzak, published by University of Zielona Góra
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.