Metaheuristic approach for survivable P2P multicasting flow assignment in dual homing networks

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Due to growing demand for high definition music and video content, Peer to Peer (P2P) multicasting providing live streaming services has been gaining popularity in the last years. In this paper, we focus on applying the P2P multicasting for delivering of critical data that require to be transmitted safely, intact and with as little delay as possible, e.g., financial data, software security patches, antivirus signature database updates etc. To improve survivability of the P2P multicasting, we propose to use dual homing approach, i.e., each peer is connected to the overlay by two separate access links. The optimization problem is formulated in the form of Integer Linear Programming (ILP). We introduce a Simulated Annealing (SA) algorithm for the considered optimization problem and compare it with optimal results provided by CPLEX solver. Our studies demonstrate that the SA method yields results close to optimal and provides better scalability comparing to CPLEX, since it can solve in reasonable time much larger problem instances than CPLEX. © 2013 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kmiecik, W., & Walkowiak, K. (2013). Metaheuristic approach for survivable P2P multicasting flow assignment in dual homing networks. In Advances in Intelligent Systems and Computing (Vol. 189 AISC, pp. 215–224). Springer Verlag. https://doi.org/10.1007/978-3-642-33018-6_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free