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

QoS-aware network planning becomes increasingly important for network operators and ISP alike as the number and heterogeneity of applications supported by networks continue to increase. We have proposed an architecture and methodology to support QoS-aware route planning for IPTV networks. The route planning problem was formulated as a residual bandwidth optimization problem and solved using GA-VNS hybrid algorithm. The QoS guarantee is provided by performing route allocation for a QoS-aware demand matrix which is generated using efficient and accurate estimation of QoS requirements using empirical effective bandwidth estimations. This paper revisits our formerly proposed approach to perform residual bandwidth optimization with QoS guarantee in IPTV networks and proposes alterations and parameter settings to best suit the problem in terms of robustness and performance. This paper proposes the use of two cost functions to meet the above requirements and the use of a variation of the original VNS algorithm besides recommending the use of specific operators and general parameter settings. The proposals and recommendations are substantiated by the results of performance evaluations and analysis. The results indicate dramatic improvement when the proposed approaches are taken on board.

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

[2]  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.

[3]  Carlos Artemio Coello-Coello,et al.  Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art , 2002 .

[4]  Frank Kelly,et al.  Notes on effective bandwidths , 1994 .

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

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

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

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

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

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

[11]  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..

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

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

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

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

[16]  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.

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