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.
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
Biersack, E.W., Carra, D., Lo Cigno, R., Rodriguez, P., Felber, P.: Overlay architectures for file distribution: Fundamental performance analysis for homogeneous and heterogeneous cases. Comput. Netw. 51(3), 901–917 (2007)
Burger, M., Kielmann, T., Bal, H.E.: TOPOMON: A monitoring tool for grid network topology. In: ICCS 2002: Proc. of the International Conference on Computational Science-Part II, pp. 558–567 (2002)
Carmichael, R., Braga-Henebry, B., Thain, D., Emrich, S.: Biocompute: towards a collaborative workspace for data intensive bio-science. In: HPDC 2010: Proc. of the ACM International Symposium on High Performance Computing (2010)
Choudhury, R.R., Bandyopadhyay, S., Paul, K.: Topology discovery in ad hoc wireless networks using mobile agents. In: Horlait, E. (ed.) MATA 2000. LNCS, vol. 1931, pp. 1–15. Springer, Heidelberg (2000)
Coates, M., Rabbat, M., Nowak, R.: Merging logical topologies using end-to-end measurements. In: Proc. of the 3rd ACM SIGCOMM Conference on Internet Measurement, pp. 192–203 (2003)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, McGraw-Hill Book Company (2000)
Elkin, M., Kortsarz, G.: Sublogarithmic approximation for telephone multicast. J. Comput. Syst. Sci. 72(4), 648–659 (2006)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)
Heinzelman, W.R., Kulik, J., Balakrishnan, H.: 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 (1999)
Jannotti, J.J., Gifford, D.K., Johnson, K.L., Kaashoek, M.F., O’Toole Jr., J.W.: Overcast: Reliable multicasting with on overlay network. In: Proc. of the 4th USENIX Symposium on Operating System Design & Implementation, pp. 197–212 (2000)
Kielmann, T., Hofman, R.F.H., Bal, H.E., Plaat, A., Bhoedjang, R.A.F.: Magpie: MPI’s collective communication operations for clustered wide area systems. SIGPLAN Not. 34(8), 131–140 (1999)
Killian, C., Vrable, M., Snoeren, A., Vahdat, A., Pasquale, J.: The overlay network content distribution problem. Technical Report CS2005-0824, University of California, San Diego, CA (May 2005)
Kumar, R., Ross, K.: Peer-assisted file distribution: The minimum distribution time. In: IEEE Workshop on Hot Topics in Web Systems and Technologies, HOTWEB (2006)
Lua, E.K., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Survey and Tutorial 7, 72–93 (2005)
Nandan, A., Das, S., Pau, G., Gerla, M., Sanadidi, M.Y.: 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 (2005)
Qiu, D., Srikant, R.: Modeling and performance analysis of bittorrent-like peer-to-peer networks. In: SIGCOMM 2004: Proc. of the 2004 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 367–378 (2004)
Sanzgiri, K., Dahill, B., Levine, B.N., Shields, C., Belding-Royer, E.M.: A secure routing protocol for ad hoc networks. In: ICNP 2002: Proceedings of the 10th IEEE International Conference on Network Protocols, pp. 78–89 (2002)
Shirai, T., Saito, H., Taura, K.: 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. ACM, New York (2007)
Stockinger, H., Samar, A., Holtman, K., Allcock, B., Foster, I., Tierney, B.: File and object replication in data grids. In: Proc. of the 10th IEEE International Symposium on High Performance Distributed Computing, p. 76 (2001)
Xiang, Z., Zhang, Q., Zhu, W., Zhang, Z., Zhang, Y.: Peer-to-peer based multimedia distribution service. IEEE Transactions on Multimedia 6, 343–355 (2004)
Xu, Y., Heidemann, H., Estrin, D.: 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 (2001)
Yue, Y., Lin, C., Tan, Z.: Analyzing the performance and fairness of bittorrent-like networks using a general fluid model. Comput. Commun. 29(18), 3946–3956 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
O’Neil, S.T., Chaudhary, A., Chen, D.Z., Wang, H. (2011). The Topology Aware File Distribution Problem. In: Fu, B., Du, DZ. (eds) Computing and Combinatorics. COCOON 2011. Lecture Notes in Computer Science, vol 6842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22685-4_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-22685-4_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22684-7
Online ISBN: 978-3-642-22685-4
eBook Packages: Computer ScienceComputer Science (R0)