An ant-assisted path-flow routing algorithm for telecommunication networks

被引:0
|
作者
Lee, Heesang
Choi, Gyuwoong
Kang, Kug-Chang
Lee, Soonseok
Kim, Youngsun
机构
关键词
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
For the integrated and QoS (quality of services) aware requests, a routing in the backbone network of the next generation telecommunication networks seems to be a path-flow based and centralized routing. In this paper we suggest a path-flow routing algorithm for the network that is assisted by ant colony behavior. In this algorithm ants monitor traffic of each path-flow in a given network, which can be changed dynamically. We use ants' pheromone to monitor and record the network status to avoid delay and packet loss of the traffic. We use the ants for this monitoring and reporting function of the network using stigmergy of the ant colony. A routing decision for the updated traffic is made by solving a mathematical programming formulation and an exact algorithm that was proposed in our previous work. We analyze the performance of our routing framework through simulation in various network instances. From this simulation we can conclude that our ant-assisted multi-commodity minimization algorithm shows some promising performance for the path-flow telecommunication networks.
引用
收藏
页码:586 / 590
页数:5
相关论文
共 50 条
  • [11] Jumping ant routing algorithm for sensor networks
    Institute of Computer Science and Information Engineering, National Ilan University, I-Lan, Taiwan
    不详
    [J]. Comput Commun, 14-15 (2892-2903):
  • [12] Jumping ant routing algorithm for sensor networks
    Chen, Wei-Ming
    Li, Chung-Sheng
    Chiang, Fu-Yu
    Chao, Han-Chieh
    [J]. COMPUTER COMMUNICATIONS, 2007, 30 (14-15) : 2892 - 2903
  • [13] Energy and Path Aware Ant Colony Optimization Based Routing Algorithm for Wireless Sensor Networks
    Orojloo, Hamed
    Moghadam, Reza Askari
    Haghighat, AbolfazI T.
    [J]. GLOBAL TRENDS IN COMPUTING AND COMMUNICATION SYSTEMS, PT 1, 2012, 269 : 182 - +
  • [14] Ant-Based Stable Disjoint Path Routing Algorithm in wireless ad hoc networks
    Wu, Zhengyu
    Cui, Lin
    Dong, Xiangjun
    [J]. ICNC 2007: THIRD INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 4, PROCEEDINGS, 2007, : 678 - +
  • [15] A multiple-path routing algorithm with congestion avoidance based upon ant colony algorithm in cognitive networks
    Li, Dandan
    Zhang, Runtong
    Wang, Rui
    [J]. Journal of Computational Information Systems, 2010, 6 (08): : 2473 - 2482
  • [16] Shortest-path routing based on ant-algorithm
    Min, LY
    Yang, JY
    [J]. DCABES 2004, Proceedings, Vols, 1 and 2, 2004, : 228 - 230
  • [17] A multi-path routing algorithm for IP networks based on flow optimisation
    Abrahamsson, H
    Ahlgren, B
    Alonso, J
    Andersson, A
    Kreuger, P
    [J]. FROM QOS PROVISIONING TO QOS CHARGING, PROCEEDINGS, 2002, 2511 : 135 - 144
  • [18] A bundle-type algorithm for routing in telecommunication data networks
    Claude Lemaréchal
    Adam Ouorou
    Georgios Petrou
    [J]. Computational Optimization and Applications, 2009, 44 : 385 - 409
  • [19] A bundle-type algorithm for routing in telecommunication data networks
    Lemarechal, Claude
    Ouorou, Adam
    Petrou, Georgios
    [J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2009, 44 (03) : 385 - 409
  • [20] VC routing using ant algorithm in ATM networks
    Li, SH
    Liu, ZM
    Zhu, HW
    [J]. DIGITAL CONVERGENCE FOR CREATIVE DIVERGENCE, VOL I: TECHNICAL SPEECH SESSIONS, 1999, : 208 - 213