Evolutionary algorithm for P2P multicasting network design problem

  • Authors:
  • Michał Wiśniewski;Krzysztof Walkowiak

  • Affiliations:
  • Department of Systems and Computer Networks, Faculty of Electronics, Wroclaw Wrocław University of Technology, Wroclaw, Poland;Department of Systems and Computer Networks, Faculty of Electronics, Wroclaw Wrocław University of Technology, Wroclaw, 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

P2P multicasting is a novel approach to provide cost effective streaming services over the Internet. This paper addresses the overlay network design for P2P multicasting. We assume that the P2P multicasting system is static with low membership change rate (e.g., corporate videoconferencing, distance learning, delivery of important messages, IPTV with STB). The problem consists in joint optimization of multicast flows and access link capacity. The objective is to minimize the network cost calculated as the cost of access links. An effective evolutionary algorithm is proposed. We report results of the algorithm with comparison against optimal results and other heuristic algorithms including Lagrangean relaxation algorithm and constructive algorithm. The proposed algorithm can be used to various problems related to overlay networks, e.g., streaming services, computing and storage systems.