Abstract
This paper focuses on the optimization of the data delivery from a single site to multiple sites, suitable for distributed grid infrastructure, using knowledge of its topology. When formalized, from graph-theoretic point of view, this problem shows to be NP-hard. Thus approximate solutions are used in practice. We present new heuristic for construction of distribution trees that are used in the data delivery process. Proposed solution is compared with two existing algorithms, using computer simulation for the evaluation. Results are encouraging, showing better throughput of distribution trees constructed by the proposed method compared to others.
This work is supported by projects SEMCO-WS APVV-0391-06, ADMIRE FP7-215024, VEGA No. 2/6103/6.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cherkasova, L.: Optimizing the Reliable Distribution of Large Files within CDNs. In: Proceedings of the 10th IEEE Symposium on Computers and Communications (ISCC 2005), Spain (2005) ISSN: 1530-1346, ISBN: 0-7695-2373-0
Cohen, B.: Incentives build robustness in BitTorrent. In: P2P Economics Workshop (2003)
Ganguly, S., Saxena, A., Bhatnagar, S., Izmailov, R., Banerjee, S.: Fast replication in content distribution overlays: INFOCOM 2005. In: 24th Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE, vol. 4, pp. 2246–2256 (2005) ISSN: 0743-166X, ISBN: 0-7803-8968-9, doi: 10.1109/INFCOM. 2005.1498512
Jain, K., Mahdian, M., Salavatipour, M.R.: Packing Steiner trees. In: 14th ACM-SIAM Symposium on Discrete Algorithms (SODA) (2003) ISBN:0-89871-538-5
Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. In: Proc. American Math. Society, vol. 7, pp. 48–50 (1956) doi:10.2307/2033241
Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical R 36, 1389–1401 (1957)
Wu, Y., Chou, P.A., Jain, K.: A comparison of network coding and tree packing. In: Proceedings of International Symposium on Information Theory. ISIT 2004 (2004) ISBN: 0-7803-8280-3
Ciglan, M.: Replica delivery optimization and content synchronization in data grids, dissertation thesis, Institute of informatics, Slovak academy of sciences (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ciglan, M., Hluchy, L. (2008). Back-Edge Heuristic for Efficient Data Distribution in Grid Systems. In: Parashar, M., Aggarwal, S.K. (eds) Distributed Computing and Internet Technology. ICDCIT 2008. Lecture Notes in Computer Science, vol 5375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89737-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-89737-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89736-1
Online ISBN: 978-3-540-89737-8
eBook Packages: Computer ScienceComputer Science (R0)