An improved annealing algorithm for throughput maximization in static overlay-based multicast systems

  • Authors:
  • Michal Kucharzak;Krzysztof Walkowiak

  • Affiliations:
  • Department of Systems and Computer Networks, Wroclaw University of Technology, Poland;Department of Systems and Computer Networks, Wroclaw University of Technology, Poland

  • Venue:
  • HAIS'11 Proceedings of the 6th international conference on Hybrid artificial intelligent systems - Volume Part I
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

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.