METAHEURISTIC ALGORITHMS FOR OPTIMIZATION OF SURVIVABLE MULTICAST OVERLAY IN DUAL HOMING NETWORKS

Overlay multicasting providing live streaming services is a crucial service for the contemporary Internet. In this article, we focus on applying overlay multicasting for delivery of critical data that must be transmitted safely, intact, and with as little delay as possible; for example, financial data, software security patches, antivirus signature database updates, etc. To improve survivability of overlay multicasting, we propose using a dual homing approach; that is, each peer is connected to the overlay by two separate access links. We consider the following network failures: overlay link failure, uploading node failure, and Internet server provider (ISP) interconnection failure. The objective is to minimize the maximum delay in the network. The optimization problem is formulated in the form of an integer linear programming (ILP) model. We introduce a simulated annealing (SA) algorithm and a tabu search (TS) algorithm for the considered problem and compare them with optimal results provided by CPLEX solver. Our studies demonstrate that both SA and TS methods yield results close to optimal and provide better scalability compared to CPLEX, because they can solve much larger problem instances than CPLEX in reasonable time. Furthermore, our studies show that the additional survivability requirements do not have a substantial impact on the overlay multicasting system expressed as the maximum delay.

[1]  Debashis Saha,et al.  Joint optimization of 2-tier dual-homing for NodeBs and RNCs in UMTS networks using meta-heuristic techniques , 2011, 2011 Third International Conference on Communication Systems and Networks (COMSNETS 2011).

[2]  Bruce M. Maggs,et al.  Algorithms for Constructing Overlay Networks For Live Streaming , 2011, ArXiv.

[3]  Sri Lanka,et al.  Multicasting over Overlay Networks - A Critical Review , 2011 .

[4]  Supriya Chaluvadi,et al.  A Proactive Tree Recovery Mechanism for Resilient Overlay Multicast , 2012 .

[5]  Piet Demeester,et al.  Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS , 2004 .

[6]  Jeanine Weekes Schroer,et al.  The Finite String Newsletter Abstracts of Current Literature Glisp User's Manual , 2022 .

[7]  Sana Malik,et al.  EFFICIENT OVERLAY MULTICAST ROUTING FOR HYBRID NETWORKS , 2011 .

[8]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[9]  Mei Yang,et al.  Dual-Homing Based Scalable Partial , 2006 .

[10]  Xiangtong Qi,et al.  On finding the best partial multicast protection tree under dual-homing architecture , 2005, HPSR. 2005 Workshop on High Performance Switching and Routing, 2005..

[11]  Preetha Thulasiraman,et al.  WSN18-3: Disjoint Multipath Routing in Dual Homing Networks using Colored Trees , 2006, IEEE Globecom 2006.

[12]  Murat Yuksel,et al.  Virtual Direction Multicast for Overlay Networks , 2011, 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum.

[13]  Luís Gouveia,et al.  On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem , 2006, Handbook of Optimization in Telecommunications.

[14]  J.P. Jue,et al.  Dual-homing protection in IP-over-WDM networks , 2005, Journal of Lightwave Technology.

[15]  Krzysztof Walkowiak,et al.  Survivable P2P multicasting flow assignment in dual homing networks , 2011, 2011 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT).

[16]  Krzysztof Walkowiak,et al.  Survivability aspects of overlay multicasting in dual homing networks , 2012, 2012 IV International Congress on Ultra Modern Telecommunications and Control Systems.

[17]  Krzysztof Walkowiak,et al.  Modeling and optimization of survivable P2P multicasting , 2011, Comput. Commun..