A Multi-Constrained Routing Optimization Algorithm in the IP Networks

被引:0
|
作者
Zeng, Ying [1 ]
Zhang, Peiming [1 ]
Luo, Yun [2 ]
机构
[1] Elect Power Dispatching & Control Ctr Guangdong G, Guangzhou 510600, Guangdong, Peoples R China
[2] Sichuan Enrising Informat Technol Co Ltd, Chengdu, Peoples R China
关键词
the IP network; traffic equilibrium; link failure; potential penalty;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Nowadays, with the increasing scale of the IP network, the traffic flow demand also increases. And the situation of load imbalance is becoming more obvious. In the IP network, the failure of a link not only causes the interruption of the traffic flow on this link, but also makes the network operator pay the corresponding penalty to the user. So how to select an appropriate path to reduce the operator's payment while achieving a balanced distribution of the traffic flow at the same time is a big challenge. Usually, traffic equilibrium is used as a routing optimization objective in traffic engineering in order to avoid network traffic flow congestion. In practical problems, the economic losses of the network operators also need to be taken into consideration. Existing link allocation methods often take the failure of links as connection problems and ignore the restrictions of the traffic flow, or only consider the traffic interruption and ignore the network operator's economic losses caused by the failure of links. In this paper, we propose a routing optimization algorithm to achieve traffic equilibrium while reducing the potential penalty of the network operators at the same time. Experiments show that our algorithm can achieve traffic equilibrium and effectively reduce the network operator's potential penalty.
引用
收藏
页码:314 / 318
页数:5
相关论文
共 50 条
  • [1] A memetic optimization algorithm for multi-constrained multicast routing in ad hoc networks
    Ramadan, Rahab M.
    Gasser, Safa M.
    El-Mahallawy, Mohamed S.
    Supsup, Karim Hammad
    El Bakly, Ahmed M.
    [J]. PLOS ONE, 2018, 13 (03):
  • [2] Multi-constrained routing optimization algorithm based on DAG
    Hu, Xia
    Wang, Kaidong
    Wang, JinJiang
    Wang, Kun
    Hu, Youbing
    Wang, Shuangqin
    [J]. IECON 2018 - 44TH ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY, 2018, : 5906 - 5910
  • [3] An improved algorithm for multi-constrained routing
    Liu, Yongguang
    Ye, Wu
    Feng, Suili
    [J]. 2006 10TH INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY, VOLS 1 AND 2, PROCEEDINGS, 2006, : 120 - +
  • [4] Multi-Constrained Routing Based on Particle Swarm Optimization and Fireworks Algorithm
    Hu, Youbing
    Wang, Kun
    Wan, Jinjiang
    Wang, Kaidong
    Hu, Xia
    [J]. IECON 2018 - 44TH ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY, 2018, : 5901 - 5905
  • [5] A Distributed Algorithm for Multi-constrained Anypath Routing in Wireless Mesh Networks
    Fang, Xi
    Yang, Dejun
    Xue, Guoliang
    [J]. 2011 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2011,
  • [6] A Multi-constrained Routing Algorithm based on Mobile Agent for MANET Networks
    Chen Wei
    Zhang Yi
    [J]. FIRST IITA INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2009, : 16 - 19
  • [7] A multi-constrained multicast QoS routing algorithm
    Feng, Gang
    [J]. COMPUTER COMMUNICATIONS, 2006, 29 (10) : 1811 - 1822
  • [8] A multi-constrained distributed QoS routing algorithm
    Song, J
    Pung, HK
    Jacob, L
    [J]. IEEE INTERNATIONAL CONFERENCE ON NETWORKS 2000 (ICON 2000), PROCEEDINGS: NETWORKING TRENDS AND CHALLENGES IN THE NEW MILLENNIUM, 2000, : 165 - 171
  • [9] Multi-constrained routing using Genetic Algorithm
    Abdullah, Nibras
    Baklizi, Mahmoud
    Ramadas, Sureswaran
    Al-wesabi, Ola
    [J]. 2013 IEEE INTERNATIONAL CONFERENCE ON RFID-TECHNOLOGIES AND APPLICATIONS (RFID-TA), 2013,
  • [10] Multi-constrained routing algorithm: a networking evaluation
    Van Dan Nguyen
    Begin, Thomas
    Lassous, Isabelle Guerin
    [J]. 2013 IEEE 37TH ANNUAL COMPUTER SOFTWARE AND APPLICATIONS CONFERENCE WORKSHOPS (COMPSACW), 2013, : 719 - 723