Ant Colony Optimization Based Congestion Control Algorithm for MPLS Network

Multi-Protocol Label Switching (MPLS) is a mechanism in high-performance telecommunications networks which directs and carries data from one network node to the next with the help of labels. MPLS makes it easy to create "virtual links" between distant nodes. It can encapsulate packets of various network protocols. MPLS is a highly scalable, protocol agnostic, data-carrying mechanism. Packet-forwarding decisions are made solely on the contents of this label, without the need to examine the packet itself. This allows one to create end-to-end circuits across any type of transport medium, using any protocol. There are high traffics when transmitting data in the MPLS Network due to emerging requirements of MPLS and associated internet usage. This paper proposes an Ant Colony Optimization (ACO) technique for traffic management in MPLS Network. ACO is a swarm intelligence methodology which offers highly optimized technique for dozen of engineering problems. In our proposed work, the ACO provides optimal value than existing algorithms.

[1]  B. Chandra A Data Mining Approach for Predicting Reliable Path for Congestion Free Routing using Self-Motivated Neural Network , 2008 .

[2]  Francesco Palmieri,et al.  An MPLS-based architecture for scalable QoS and traffic engineering in converged multiservice mobile IP networks , 2005, Comput. Networks.

[3]  Kwang Mong Sim,et al.  Ant colony optimization for routing and load-balancing: survey and new directions , 2003, IEEE Trans. Syst. Man Cybern. Part A.

[4]  Peng Wang,et al.  A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems , 2010, Appl. Soft Comput..

[5]  Devika Subramanian,et al.  Ants and Reinforcement Learning: A Case Study in Routing in Dynamic Networks , 1997, IJCAI.

[6]  Manuel López-Ibáñez,et al.  Beam-ACO for the travelling salesman problem with time windows , 2010, Comput. Oper. Res..

[7]  B. Chandra Mohan,et al.  A Data Mining Approach for Predicting Reliable Path for Congestion Free Routing Using Self-motivated Neural Network , 2008, Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing.

[8]  H. Duan,et al.  Hybrid Ant Colony Optimization Using Memetic Algorithm for Traveling Salesman Problem , 2007, 2007 IEEE International Symposium on Approximate Dynamic Programming and Reinforcement Learning.

[9]  Deep Medhi,et al.  Traffic engineering of MPLS backbone networks in the presence of heterogeneous streams , 2009, Comput. Networks.

[10]  Chun Tung Chou Traffic engineering for MPLS-based virtual private networks , 2002, Proceedings. Eleventh International Conference on Computer Communications and Networks.

[11]  Janet Bruten,et al.  Ant-like agents for load balancing in telecommunications networks , 1997, AGENTS '97.

[12]  Gianni A. Di Caro,et al.  AntNet: A Mobile Agents Approach to Adaptive Routing , 1999 .

[13]  Alessio Botta,et al.  Internet like control for MPLS based traffic engineering: performance evaluation , 2005, Perform. Evaluation.

[14]  P. Schönemann On artificial intelligence , 1985, Behavioral and Brain Sciences.

[15]  Paola Iovanna,et al.  A traffic engineering system for multilayer networks based on the GMPLS paradigm , 2003, IEEE Netw..