Random Approach to Optimization of Overlay Public-Resource Computing Systems

The growing need for computationally demanding systems triggers the development of various network-oriented computing systems organized in a distributed manner. In this work we concentrate on one kind of such systems, i.e. public- resource computing systems. The considered system works on the top of an overlay network and uses personal computers and other relatively simple electronic equipment instead of supercomputers. We assume that two kinds of network flows are used to distribute the data in the public-resource computing systems: unicast and peer-to-peer. We formulate an optimization model of the system. After that we propose random algorithms that optimize jointly the allocation of computational tasks and the distribution of the output data. To evaluate the algorithms we run numerical experiments and present results showing the comparison of the random approach against optimal solutions provided by the CPLEX solver.

[1]  Rajkumar Buyya,et al.  A taxonomy and survey of grid resource management systems for distributed computing , 2002, Softw. Pract. Exp..

[2]  Jarek Nabrzyski,et al.  Grid resource management: state of the art and future trends , 2004 .

[3]  Rina Panigrahy,et al.  Analyzing BitTorrent and related peer-to-peer networks , 2006, SODA '06.

[4]  Nazareno Andrade,et al.  Scalable Resource Annotation in Peer-to-Peer Grids , 2008, 2008 Eighth International Conference on Peer-to-Peer Computing.

[5]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[6]  Ramesh Subramanian,et al.  Peer to Peer Computing: The Evolution of a Disruptive Technology , 2005 .

[7]  G. Chmaj.  Peer-to-Peer versus Unicast : Two Approaches to Data Transmission in Overlay Public-Resource Computing System , 2012 .

[8]  Ian J. Taylor.  From P2P to Web Services and Grids - Peers in a Client/Server World , 2005, Computer Communications and Networks.

[9]  Mukund Seshadri,et al.  On Cooperative Content Distribution and the Price of Barter , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[10]  Florian Schintke,et al.  Peer-to-Peer Computing , 2010, Euro-Par.

[11]  Nicolas Christin,et al.  On the Cost of Participating in a Peer-to-Peer Network , 2004, IPTPS.

[12]  Thomas A. Funkhouser,et al.  Parallel rendering with K-way replication , 2001, Proceedings IEEE 2001 Symposium on Parallel and Large-Data Visualization and Graphics (Cat. No.01EX520).

[13]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[14]  B. Bukowska,et al.  The Effectiveness of Penetration of Erythrocyte Membrane by Sodium Salt of 2,4-Dichlorophenoxyacetic Acid , 2008 .

[15]  Richard Weber,et al.  E-cient File Dissemination using Peer-to-Peer Technology , 2005 .

[16]  Michael Vrable,et al.  The Overlay Network Content Distribution Problem , 2005 .

[17]  Gustavo de Veciana,et al.  Service capacity of peer to peer networks , 2004, IEEE INFOCOM 2004.

[18]  David P. Anderson,et al.  BOINC: a system for public-resource computing and storage , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.

[19]  Krzysztof Walkowiak.  Offline Approach to Modeling and Optimization of Flows in Peer-to-Peer Systems , 2008, 2008 New Technologies, Mobility and Security.

[20]  Chuan Wu,et al.  On meeting P2P streaming bandwidth demand with limited supplies , 2008, Electronic Imaging.

[21]  Gang Wu.  Peer to Peer File Download and Streaming , 2005 .

[22]  Ian T. Foster,et al.  On Death, Taxes, and the Convergence of Peer-to-Peer and Grid Computing , 2003, IPTPS.