Abstract
We present theoretical results for large-file distribution on general networks of known topology (known link bandwidths and router locations). We show that the problem of distributing a file in minimum time is NP-hard in this model, and we give an O(logn) approximation algorithm, where n is the number of workstations that require the file. We also characterize our method as optimal amongst the class of “no-link-sharing” algorithms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bar-Noy A, Guha S, Naor J, Schieber B (1998) Multicasting in heterogeneous networks. In: Proc of the 30th annual ACM symposium on theory of computing, pp 448–453
Biersack E, Carra D, Cigno RL, Rodriguez P, Felber P (2007) Overlay architectures for file distribution: fundamental performance analysis for homogeneous and heterogeneous cases. Comput Netw 51(3):901–917
Burger M, Kielmann T, Bal H (2002) TOPOMON: A monitoring tool for grid network topology. In: Proc of the international conference on computational science—part II, pp 558–567
Carmichael R, Braga-Henebry B, Thain D, Emrich S (2010) Biocompute: towards a collaborative workspace for data intensive bio-science. In: Proc of the ACM international symposium on high performance computing
Choudhury R, Bandyopadhyay S, Paul K (2000) Topology discovery in ad hoc wireless networks using mobile agents. In: Proc of the 2nd international workshop on mobile agents for telecommunication applications. Springer, Berlin, pp 1–16
Coates M, Rabbat M, Nowak R (2003) Merging logical topologies using end-to-end measurements. In: Proc of the 3rd ACM SIGCOMM conference on Internet measurement, pp 192–203
Cormen T, Leiserson C, Rivest R, Stein C (2000) Introduction to algorithms, 2nd edn. MIT Press, McGraw-Hill, Cambridge
Elkin M, Kortsarz G (2006) Sublogarithmic approximation for telephone multicast. J Comput Syst Sci 72(4):648–659
Garey M, Johnson D (1979) Computers and intractability: a guide to the theory of NP-completeness. WH Freeman, New York
Heinzelman W, Kulik J, Balakrishnan H (1999) Adaptive protocols for information dissemination in wireless sensor networks. In: Proc of the 5th annual ACM/IEEE international conference on mobile computing and networking, pp 174–185
Jannotti J, Gifford D, Johnson K, Kaashoek M, O’Toole JW (2000) Overcast: Reliable multicasting with an overlay network. In: Proc of the 4th USENIX symposium on operating system design & implementation, pp 197–212
Kielmann T, Hofman R, Bal H, Plaat A, Bhoedjang R (1999) MagPIe: MPI’s collective communication operations for clustered wide area systems. In: Proc of the 7th ACM SIGPLAN symposium on principles and practice of parallel programming, pp 131–140
Killian C, Vrable M, Snoeren A, Vahdat A, Pasquale J (2005) The overlay network content distribution problem. Tech Rep CS2005-0824, University of California, San Diego, CA
Kumar R, Ross K (2006) Peer-assisted file distribution: the minimum distribution time. In: 1st IEEE workshop on hot topics in web systems and technologies, pp 1–11
Lua E, Crowcroft J, Pias M, Sharma R, Lim S (2005) A survey and comparison of peer-to-peer overlay network schemes. IEEE Commun Surv Tutor 7:72–93
Nandan A, Das S Pau G, Gerla M, Sanadidi M (2005) Co-operative downloading in vehicular ad-hoc wireless networks. In: Proc of the 2nd annual IEEE conference on wireless on-demand network systems and services, pp 32–41
Qiu D, Srikant R (2004) Modeling and performance analysis of bittorrent-like peer-to-peer networks. In: Proc of the 2004 conference on applications, technologies, architectures, and protocols for computer communications, pp 367–378
Sanzgiri K, Dahill B, Levine B, Shields C, Belding-Royer E (2002) A secure routing protocol for ad hoc networks. In: Proc of the 10th IEEE international conference on network protocols, pp 78–89
Shirai T, Saito H, Taura K (2007) A fast topology inference: a building block for network-aware parallel processing. In: Proc of the 16th international symposium on high performance distributed computing, pp 11–22
Stockinger H, Samar A, Holtman K, Allcock B, Foster I, Tierney B (2001) File and object replication in data grids. In: Proc of the 10th IEEE international symposium on high performance distributed computing, p 76
Xiang Z, Zhang Q, Zhu W, Zhang Z, Zhang Y (2004) Peer-to-peer based multimedia distribution service. IEEE Trans Multimed 6:343–355
Xu Y, Heidemann H, Estrin D (2001) Geography-informed energy conservation for ad hoc routing. In: Proc of the 7th annual ACM international conference on mobile computing and networking, pp 70–84
Yue Y, Lin C, Tan Z (2006) Analyzing the performance and fairness of bittorrent-like networks using a general fluid model. Comput Commun 29(18):3946–3956
Author information
Authors and Affiliations
Corresponding author
Additional information
The research of D.Z. Chen and H. Wang was supported in part by NSF grants CCF-0515203 and CCF-0916606. S. O’Neil was supported in part by the Arthur J. Schmitt foundation.
Rights and permissions
About this article
Cite this article
O’Neil, S.T., Chaudhary, A., Chen, D.Z. et al. The topology aware file distribution problem. J Comb Optim 26, 621–635 (2013). https://doi.org/10.1007/s10878-011-9430-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-011-9430-2