Skip to main content

An Improved Annealing Algorithm for Throughput Maximization in Static Overlay-Based Multicast Systems

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6678))

Abstract

Overlay-based multicast has been proposed as an efficient solution to ensure multicast communication in the Internet. In contrast to IP multicast, it uses a virtual topology created in an overlay network. For a few past years overlay-based multicast has attracted research community and many new protocols have been proposed. Thereby, a lot of research has been focusing on various aspects of such systems, however most of previous works concern on minimization of flow costs. In this paper, we take a look at the problem of modelling and optimization of overlay-based multicast with a special focus on maximization of system’s throughput. We employ an integer program of fractional tree packing problem and propose an improved annealing algorithm for solving the problem. Efficiency of the algorithm is compared to optimal results as well as random ones and a basic simulated annealing.

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. Akbari, B., Rabiee, H.R., Ghanbari, M.: An Optimal Discrete Rate Allocation for Overlay Video Multicasting. Computer Communications 31(3), 551–562 (2008)

    Article  Google Scholar 

  2. Chen, S., Günlük, O., Yener, B.: The Multicast Packing Problem. IEEE/ACM Trans. Netw. 8(3), 311–318 (2000)

    Article  Google Scholar 

  3. Cheriyan, J., Salavatipour, M.R.: Hardness and Approximation Results for Packing Steiner Trees Problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 180–191. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Chu, Y.-h., Rao, S.G., Zhang, H.: A Case for End System Multicast. Proceedings of ACM Sigmetrics, pp. 1–12 (2000)

    Google Scholar 

  5. Corchado, E., Abraham, A., de Carvalho, A.: Editorial: Hybrid intelligent algorithms and applications. Inf. Sci. 180, 2633–2634 (2010)

    Article  Google Scholar 

  6. Deering, S.E., Cheriton, D.R.: Multicast Routing in Datagram Internetworks and Extended LANs. ACM Trans. Comput. Syst. 8, 85–110 (1990)

    Article  Google Scholar 

  7. Derrac, J., García, S., Herrera, F.: A First Study on the Use of Coevolutionary Algorithms for Instance and Feature Selection. In: Corchado, E., Wu, X., Oja, E., Herrero, Á., Baruque, B. (eds.) HAIS 2009. LNCS, vol. 5572, pp. 557–564. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  8. IBM ILOG CPLEX 12.1: User’s Manual for CPLEX (2009)

    Google Scholar 

  9. Jain, K., Mahdian, M., Salavatipour, M.R.: Packing Steiner trees. In: SODA 2003: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 266–274. Society for Industrial and Applied Mathematics, Philadelphia(2003)

    Google Scholar 

  10. Kirkpatrick, S.: Optimization by Simulated Annealing. Numerische Mathematik 220(4598), 671–680 (1983)

    MathSciNet  MATH  Google Scholar 

  11. Kucharzak, M., Walkowiak, K.: Optimization of Flows in Level-Constrained Multiple Trees for P2P Multicast System. In: The Second International Conference on Advances in P2P Systems, AP2PS 2010, Florence, Italy (October 2010)

    Google Scholar 

  12. Sentinelli, A., Marfia, G., Gerla, M., Kleinrock, L., Tewari, S.: Will IPTV Ride the Peer-to-Peer Stream? Peer-to-Peer Multimedia Streaming. IEEE Communications Magazine 45(6), 86–92 (2007)

    Article  Google Scholar 

  13. Walkowiak, K.: Network Design Problem for P2P Multicasting. In: International Network Optimization Conference INOC 2009 (2009)

    Google Scholar 

  14. Wu, C., Li, B.: Optimal Peer Selection for Minimum-Delay Peer-to-Peer Streaming with Rateless Codes. In: P2PMMS 2005: Proceedings of the ACM Workshop on Advances in Peer-to-Peer Multimedia Streaming, pp. 69–78. ACM, New York (2005)

    Chapter  Google Scholar 

  15. Wu, G., Chiueh, T.: Peer to Peer File Download and Streaming. RPE report, TR-185 (2005)

    Google Scholar 

  16. Wu, Y., Jain, K., Kung, S.-Y.: A Unification of Network Coding and Tree-Packing (Routing) Theorems. IEEE/ACM Trans. Netw. 14(SI), 2398–2409 (2006)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kucharzak, M., Walkowiak, K. (2011). An Improved Annealing Algorithm for Throughput Maximization in Static Overlay-Based Multicast Systems. In: Corchado, E., Kurzyński, M., Woźniak, M. (eds) Hybrid Artificial Intelligent Systems. HAIS 2011. Lecture Notes in Computer Science(), vol 6678. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21219-2_46

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21219-2_46

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics