Document Open Access Logo

Approximating Optimal Broadcast of Files in a Hose-Model Network

Authors Thomas Erlebach , Naveen Garg , Sukriti Gupta , Amitabh Trehan

PDF

File

Thumbnail PDF
PDF
LIPIcs.FSTTCS.2025.30.pdf
  • Filesize: 0.9 MB
  • 19 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Design and analysis of algorithms
Keywords
  • File sharing
  • scheduling
  • peer-to-peer networks

Metrics

Abstract

The paper considers the problem of file sharing among peers who are connected to a common core network through links of differing upload and download capacities, as is the case in networks provisioned according to the hose model. The file is assumed to be divided into equal-sized chunks, and a peer can start sending a "chunk" of the file to another peer only after it has received the entire chunk. The objective is to share a chunk, initially residing on one of the peers, with all other peers in the least time possible. Peers can simultaneously send/receive parts of a chunk to/from multiple peers, subject to the upload and download capacity constraints. We only consider the problem of broadcasting one chunk to all peers. 
We consider two different models - in the migratory model, a peer can receive the chunk from multiple peers, while in the non-migratory model, any peer can receive the chunk only from one peer. For the migratory model, introduced in this paper, we show a novel integer program and use the optimum solution to the LP-relaxation to give a schedule with makespan e^{1/e} OPT+P where P is the time required by the slowest peer to download the chunk. 
Minimising makespan in the non-migratory model is known to be NP-hard. We give a solution with makespan 18OPT+P and this is the first approximation algorithm for heterogeneous and asymmetric upload/download capacities. We also consider 2 special cases. For uniform download capacities, we obtain a solution with makespan 2OPT extending a result due to Liu [Pangfeng Liu, 2002]. For uniform upload capacities, we give the first approximation algorithm, producing makespan at most 2OPT+2P.

Cite As Get BibTex

Thomas Erlebach, Naveen Garg, Sukriti Gupta, and Amitabh Trehan. Approximating Optimal Broadcast of Files in a Hose-Model Network. In 45th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 360, pp. 30:1-30:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.FSTTCS.2025.30

Author Details

Thomas Erlebach
  • Department of Computer Science, Durham University, UK
Naveen Garg
  • Department of Computer Science and Engineering, Indian Institute of Technology Delhi, India
Sukriti Gupta
  • Department of Computer Science and Engineering, Indian Institute of Technology Delhi, India
Amitabh Trehan
  • Department of Computer Science, Durham University, UK

Funding

  • Garg, Naveen: Supported by Usha Hasteer Chair.

References

  1. Satyajeet Singh Ahuja, Varun Gupta, Vinayak Dangui, Soshant Bali, Abishek Gopalan, Hao Zhong, Petr Lapukhov, Yiting Xia, and Ying Zhang. Capacity-efficient and uncertainty-resilient backbone network planning with hose. In Fernando A. Kuipers and Matthew C. Caesar, editors, ACM SIGCOMM 2021 Conference, Virtual Event, USA, August 23-27, 2021, pages 547-559. ACM, 2021. URL: https://doi.org/10.1145/3452296.3472918.
  2. What is cloud networking? accessed on 27/01/2025. URL: https://aws.amazon.com/what-is/cloud-networking/.
  3. Mohammad Banikazemi, Vijay Moorthy, and Dhabaleswar K. Panda. Efficient collective communication on heterogeneous networks of workstations. In 1998 International Conference on Parallel Processing (ICPP '98), 10-14 August 1998, Minneapolis, Minnesota, USA, Proceedings, pages 460-467. IEEE Computer Society, 1998. URL: https://doi.org/10.1109/ICPP.1998.708518.
  4. Amotz Bar-Noy and Ching-Tien Ho. Broadcasting multiple messages in the multiport model. IEEE Trans. Parallel Distributed Syst., 10(5):500-508, 1999. URL: https://doi.org/10.1109/71.770196.
  5. Amotz Bar-Noy, Shlomo Kipnis, and Baruch Schieber. Optimal multiple message broadcasting in telephone-like communication systems. Discret. Appl. Math., 100(1-2):1-15, 2000. URL: https://doi.org/10.1016/S0166-218X(99)00155-9.
  6. Nick G. Duffield, Pawan Goyal, Albert G. Greenberg, Partho Pratim Mishra, K. K. Ramakrishnan, and Jacobus E. van der Merwe. A flexible model for resource management in virtual private networks. In Lyman Chapin, James P. G. Sterbenz, Guru M. Parulkar, and Jonathan S. Turner, editors, Proceedings of the ACM SIGCOMM 1999 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication, August 30 - September 3, 1999, Cambridge, Massachusetts, USA, pages 95-108. ACM, 1999. URL: https://doi.org/10.1145/316188.316209.
  7. Michael Elkin and Guy Kortsarz. Sublogarithmic approximation for telephone multicast. Journal of Computer and System Sciences, 72(4):648-659, 2006. URL: https://doi.org/10.1016/j.jcss.2005.12.002.
  8. Kai-Simon Goetzmann, Tobias Harks, Max Klimm, and Konstantin Miller. Optimal file distribution in peer-to-peer networks. In Takao Asano, Shin-Ichi Nakano, Yoshio Okamoto, and Osamu Watanabe, editors, Algorithms and Computation - 22nd International Symposium, ISAAC 2011, Yokohama, Japan, December 5-8, 2011. Proceedings, volume 7074 of Lecture Notes in Computer Science, pages 210-219. Springer, 2011. URL: https://doi.org/10.1007/978-3-642-25591-5_23.
  9. Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, and Arthur L. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18(4):319-349, 1988. URL: https://doi.org/10.1002/net.3230180406.
  10. J. Hromkovic, R. Klasing, B. Monien, and R. Peine. Dissemination of information in interconnection networks (broadcasting and gossiping). In F. Hsu and D.-Z. Du, editors, Combinatorial Network Theory, pages 125-212. Kluwer Academic Publishers, 1995. Google Scholar
  11. Samir Khuller and Yoo Ah Kim. Broadcasting in heterogeneous networks. Algorithmica, 48(1):1-21, 2007. URL: https://doi.org/10.1007/s00453-006-1227-9.
  12. Pangfeng Liu. Broadcast scheduling optimization for heterogeneous cluster systems. Journal of Algorithms, 42(1):135-152, 2002. URL: https://doi.org/10.1006/jagm.2001.1204.
  13. Jochen Mundinger, Richard R. Weber, and Gideon Weiss. Optimal scheduling of peer-to-peer file dissemination. J. Sched., 11(2):105-120, 2008. URL: https://doi.org/10.1007/s10951-007-0017-9.
  14. R. Ravi. Rapid rumor ramification: Approximating the minimum broadcast time (extended abstract). In 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pages 202-213. IEEE Computer Society, 1994. URL: https://doi.org/10.1109/SFCS.1994.365693.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact