Achieving high robustness and performance in QoS-aware route planning for IPTV networks

Quality of Service (QoS)-aware network planning in internet protocol television (IPTV) networks becomes increasingly important for network operators and Internet Service Providers (ISP) alike as different components of IPTV traffic have different and stringent QoS requirements. Proposing a routing algorithm to meet individual QoS parameters is a tedious task, since providing guarantee of meeting individual parameters in a stochastic system is impossible. Therefore, we propose optimum allocation of bandwidth where bandwidth requirements are evaluated based on accurate empirical effective bandwidth estimation for different classes of traffic by simulating a path as a First-in-First-out (FIFO) queue [2], whereby meeting the individual QoS requirements of each class of traffic. The route planning problem was formulated as a residual bandwidth optimization problem and solved using Genetic Algorithm-Variable Neighborhood Search (GA-VNS) hybrid algorithm. Although the standard evolutionary algorithms do not perform well on constrained optimization problems [4], GA-VNS was found to perform well on this particular problem [9]. This paper proposes new and novel adjustments and parameter settings to best suit the problem in terms of robustness and performance. The use of dynamically switching between two cost functions to meet the above requirements, the reduction of the difficulty of the problem in the initial generations to find a feasible solution and the use of a variation of the original VNS algorithm, besides the use of specific operators and general parameter settings are some of the recommendations of this paper. The proposed recommendations are based on extensive experiments on the performance and analysis carried out on different network topologies including Abilene topology. The proposed algorithm performed better than the recently proposed specialized constrained handling algorithms proposed in the literature, i.e. problem specific solutions are more desirable than black-box optimization for this problem. The proposed route planning mechanism was also found to produce good results even under dynamic traffic conditions.

[1]  Edith Cohen,et al.  Making routing robust to changing traffic demands: algorithms and evaluation , 2006, TNET.

[2]  Nick G. Duffield,et al.  Entropy of ATM Traffic Streams: A Tool for Estimating QoS Parameters , 1995, IEEE J. Sel. Areas Commun..

[3]  Dong Hwa Kim,et al.  A hybrid genetic algorithm and bacterial foraging approach for global optimization , 2007, Inf. Sci..

[4]  P. N. Suganthan,et al.  Ensemble of Constraint Handling Techniques , 2010, IEEE Transactions on Evolutionary Computation.

[5]  Brendan Jennings,et al.  Process for QoS-Aware IP Network Planning Using Accounting Data and Effective Bandwidth Estimation , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[6]  Jennifer Yates,et al.  Case Study: Resilient Backbone Design for IPTV Services , 2006 .

[7]  Murali S. Kodialam,et al.  Online multicast routing with bandwidth guarantees: a new approach using multicast network flow , 2003, TNET.

[8]  Brendan Jennings,et al.  A Hybrid Genetic Algorithm/Variable Neighborhood Search Approach to Maximizing Residual Bandwidth of Links for Route Planning , 2009, Artificial Evolution.

[9]  Catherine Rosenberg,et al.  A game theoretic framework for bandwidth allocation and pricing in broadband networks , 2000, TNET.

[10]  Dominic A. Schupke,et al.  Routing optimization in IP networks utilizing additive and concave link metrics , 2007, TNET.

[11]  Ponnuthurai N. Suganthan,et al.  A multi-layered solution for supporting isp traffic demand using genetic algorithm , 2007, 2007 IEEE Congress on Evolutionary Computation.

[12]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[13]  Carlos A. Coello Coello,et al.  THEORETICAL AND NUMERICAL CONSTRAINT-HANDLING TECHNIQUES USED WITH EVOLUTIONARY ALGORITHMS: A SURVEY OF THE STATE OF THE ART , 2002 .

[14]  Chien-Chih Liao,et al.  A memetic algorithm for extending wireless sensor network lifetime , 2010, Inf. Sci..

[15]  Nick G. Duffield,et al.  Large deviations, the shape of the loss curve, and economies of scale in large multiplexers , 1995, Queueing Syst. Theory Appl..

[16]  Steve Uhlig,et al.  Providing public intradomain traffic matrices to the research community , 2006, CCRV.

[17]  Brendan Jennings,et al.  On the Use of Accounting Data for QoS-Aware IP Network Planning , 2007, ITC.

[18]  Tetsuo Otani,et al.  Constraint-Based Evolutionary QoS Adaptation for Power Utility Communication Networks , 2009, 2009 21st IEEE International Conference on Tools with Artificial Intelligence.

[19]  John S. Baras,et al.  Measurement and simulation based effective bandwidth estimation , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[20]  P.N. Suganthan,et al.  A dynamic bandwidth guaranteed routing using heuristic search for clustered topology , 2008, 2008 2nd International Symposium on Advanced Networks and Telecommunication Systems.

[21]  Murali S. Kodialam,et al.  Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information , 2003, TNET.

[22]  Mehmet Fatih Tasgetiren,et al.  Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem , 2004, ANTS Workshop.