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 条
  • [1] An ant-monitored path-flow routing algorithm for next generation networks
    Lee, Heesang
    Choi, Gyuwoong
    Kim, Sang-Baeg
    [J]. NETWORKS 2006, 12TH INTERNATIONAL TELECOMMUNICATIONS NETWORK STRATEGY AND PLANNING SYMPOSIUM, 2006, : 166 - +
  • [2] Distributed dynamic routing using ant algorithm for telecommunication networks
    Lu, GY
    Zhang, SB
    Liu, ZM
    [J]. 2000 INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY PROCEEDINGS, VOLS. I & II, 2000, : 1607 - 1612
  • [3] Packet routing in telecommunication networks with path and flow restrictions
    LeBlanc, LJ
    Chifflet, J
    Mahey, P
    [J]. INFORMS JOURNAL ON COMPUTING, 1999, 11 (02) : 188 - 197
  • [4] Ant routing vs. Q-routing in telecommunication networks
    Pacut, Andrzej
    Gadomska, Malgorzata
    Igielski, Andrzej
    [J]. 20TH EUROPEAN CONFERENCE ON MODELLING AND SIMULATION ECMS 2006: MODELLING METHODOLOGIES AND SIMULATION: KEY TECHNOLOGIES IN ACADEMIA AND INDUSTRY, 2006, : 67 - +
  • [5] A new dynamic distributed routing algorithm on telecommunication networks
    Li, LY
    Liu, ZM
    Zhou, Z
    [J]. 2000 INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY PROCEEDINGS, VOLS. I & II, 2000, : 849 - 852
  • [6] A new proximal decomposition algorithm for routing in telecommunication networks
    Mahey, P
    Ouorou, A
    LeBlanc, L
    Chifflet, J
    [J]. NETWORKS, 1998, 31 (04) : 227 - 238
  • [7] Ant Colony Routing algorithm for freeway networks
    Cong, Zhe
    De Schutter, Bart
    Babuska, Robert
    [J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2013, 37 : 1 - 19
  • [8] An ant algorithm for multicast routing in communication networks
    Das, S
    Mobanty, I
    Yang, DZ
    [J]. PROCEEDINGS OF THE 6TH JOINT CONFERENCE ON INFORMATION SCIENCES, 2002, : 533 - 536
  • [9] 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):
  • [10] An Ant Colony Algorithm Assisted by Graph Neural Networks for Solving Vehicle Routing Problems
    Wang, Xiangyu
    Jin, Yaochu
    [J]. PROCEEDINGS OF THE 2023 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION, GECCO 2023 COMPANION, 2023, : 5 - 6