A Multi-Objective Pareto-Optimal Genetic Algorithm for QoS Multicasting

被引:1
|
作者
Rai, S. C. [1 ]
Misra, B. B. [1 ]
Nayak, A. K. [1 ]
Mall, R. [2 ]
Pradhan, S. [3 ]
机构
[1] Silicon Inst Technol, Dept Comp Sci & Engn, Bhubaneswar, Orissa, India
[2] Indian Inst Technol, Dept Comp Sci & Engn, Kharagpur, W Bengal, India
[3] Utkal Univ, Dept Comp Sci & Applicat, Bhubaneswar 751004, Orissa, India
关键词
Objective; Genetic Algorithm; Quality of Service; Multicasting;
D O I
10.1109/IADCC.2009.4809204
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The increasing demand of real-time multimedia applications in wireless environment requires stringent Quality of Service (QoS) provisioning to the Mobile Hosts (MH). The scenario becomes more complex during group communication from single source to multiple destinations. Fulfilling users demand with respect to delay, jitter, available bandwidth, packet loss rate and cost associated with the communication needs Multi-Objective Optimization (MOO) with QoS satisfaction, is a NP-complete problem. In this paper we propose a multi-objective optimal algorithm to determine a min-cost multicast tree with end-to-end delay, jitter, packet loss rate and blocking probability constraints. The simulation result shows that the proposed algorithm satisfies QoS requirements (like high availability, good load balancing and fault-tolerance) made by the hosts in varying topology and bursty data traffic for multimedia communication networks. The performance of the algorithm for scalability is also highly encouraged.
引用
收藏
页码:1303 / +
页数:2
相关论文
共 50 条
  • [31] Pareto-optimal equilibrium points in non-cooperative multi-objective optimization problems
    Monfared, Mohammadali Saniee
    Monabbati, Sayyed Ehsan
    Kafshgar, Atefeh Rajabi
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 178
  • [32] Multi-Objective Bayesian Optimization for Design of Pareto-Optimal Current Drive Profiles in STEP
    Brown, Theodore
    Marsden, Stephen
    Gopakumar, Vignesh
    Terenin, Alexander
    Ge, Hong
    Casson, Francis
    IEEE TRANSACTIONS ON PLASMA SCIENCE, 2024, : 1 - 6
  • [33] Random niched Pareto genetic algorithm for multi-objective optimization
    Lei Xiu-juan
    Shi Zhong-ke
    Gao Jin-chao
    Bi Ye
    Hu Xiao-nan
    Proceedings of 2005 Chinese Control and Decision Conference, Vols 1 and 2, 2005, : 1672 - 1675
  • [34] Multi-objective optimization scheme using Pareto Genetic Algorithm
    Qin, YT
    Ma, LH
    ICCC2004: PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATION VOL 1AND 2, 2004, : 1754 - 1757
  • [35] A Pareto based multi-objective genetic algorithm for scheduling of FMS
    Sankar, SS
    Ponnambalam, SG
    Rathinavel, V
    Gurumarimuthu, M
    2004 IEEE CONFERENCE ON CYBERNETICS AND INTELLIGENT SYSTEMS, VOLS 1 AND 2, 2004, : 700 - 705
  • [36] A new algorithm to compute pareto-optimal paths in a multi objective fuzzy weighted network
    Kumar M.K.
    Sastry V.N.
    OPSEARCH, 2013, 50 (3) : 297 - 318
  • [37] Structural analyses of pareto optimal sets in multi-objective optimization application to window design problem using multi-objective genetic algorithm
    Suga, Kentaro
    Kato, Shinsuke
    Hiyama, Kyosuke
    Journal of Environmental Engineering, 2008, 73 (625) : 283 - 289
  • [38] Pareto Optimal Temporal Partition Methodology for Reconfigurable Architectures Based on Multi-objective Genetic Algorithm
    Sheng, Weiguang
    He, Weifeng
    Jiang, Jianfei
    Mao, Zhigang
    2012 IEEE 26TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS & PHD FORUM (IPDPSW), 2012, : 425 - 430
  • [39] A multi-phase covering Pareto-optimal front method to multi-objective parallel machine scheduling
    Behnamian, J.
    Zandieh, M.
    Ghomi, S. M. T. Fatemi
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2010, 48 (17) : 4949 - 4976
  • [40] Determining All Pareto-Optimal Paths for Multi-category Multi-objective Path Optimization Problems
    Ma, Yiming
    Hu, Xiaobing
    Zhou, Hang
    ADVANCES IN NATURAL COMPUTATION, FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, ICNC-FSKD 2022, 2023, 153 : 327 - 335