Skip to main content

Structured Overlay Network for File Distribution

  • Conference paper
  • 612 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6509))

Abstract

The file distribution from a source node to n sink nodes along a structured overlay network can be done in time Θ(logn). In this paper, we model the problem of finding an optimal overlay network for file distribution as a combinatorial optimization problem, i.e., finding a weighted spanning tree which connects the source node and sink nodes and has the minimum file distribution time. We use an edge-based file distribution protocol, in which after a node receives a file it then transfers the file to its neighbor nodes one after another in a sequential order. We give the formulation of file distribution time, and use it as the objective function. The corresponding combinatorial optimization problem is NP-hard in general. We present a heuristic algorithm which derives an overlay network with file distribution time Θ(logn) and show that the derived overlay network is optimal if the file transfer delays between all pairs of nodes are the same.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bermond, J.-C., Hell, P., Liestman, A.L., Peters, J.G.: Broadcasting in bounded degree graphs. SIAM J. Discret. Math. 5(1), 10–24 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  2. Cohen, B.: Incentives build robustness in bittorrent. Technical report (2003)

    Google Scholar 

  3. Fan, B., Lui, J.C.S., Chiu, D.-M.: The design trade-offs of bittorrent-like file sharing protocols. IEEE/ACM Trans. Netw. 17(2), 365–376 (2009)

    Article  Google Scholar 

  4. Ge, Z., Figueiredo, D.R., Jaiswal, S., Kurose, J.F., Towsley, D.F.: Modeling peer-peer file sharing systems. In: INFOCOM (2003)

    Google Scholar 

  5. Harutyunyan, H.A., Liestman, A.L.: More broadcast graphs. Discrete Applied Mathematics 98(1-2), 81–102 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  6. Harutyunyan, H.A., Liestman, A.L.: k-broadcasting in trees. Networks 38(3), 163–168 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  7. Li, Q., Lui, J.C.-S.: On modeling clustering indexes of bt-like systems. In: ICC, pp. 1–6 (2009)

    Google Scholar 

  8. Liu, J., Rao, S.G., Li, B., Zhang, H.: Opportunities and challenges of peer-to-peer internet video broadcast. In: Proceedings of the IEEE, Special Issue on Recent Advances in Distributed Multimedia Communications (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fan, H., Wu, YL. (2010). Structured Overlay Network for File Distribution. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17461-2_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17461-2_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17460-5

  • Online ISBN: 978-3-642-17461-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics