Application of Smell Detection Agent Based Algorithm for Optimal Path Identification by SDN Controllers

被引:9
作者
Ammal, R. Ananthalakshmi [1 ]
Sajimon, P. C. [1 ]
Vinodchandra, S. S. [2 ,3 ]
机构
[1] Ctr Dev Adv Comp, Thiruvananthapuram, Kerala, India
[2] Univ Kerala, Ctr Comp, Thiruvananthapuram, Kerala, India
[3] Univ Kerala, Dept Computat Biol, Thiruvananthapuram, Kerala, India
来源
ADVANCES IN SWARM INTELLIGENCE, ICSI 2017, PT II | 2017年 / 10386卷
关键词
SDN; OpenFlow; Shortest path; Bio-inspired; Smell detection algorithm;
D O I
10.1007/978-3-319-61833-3_53
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Software Defined Networking separates the control plane and data plane with which the switches and routers become simply packet forwarding devices. The decision related to the path to be taken by the packet from the source to the destination is taken at the control plane. Thus the SDN controller has to identify the optimal path for the packets. Many of the SDN controllers use Dijkstra's algorithm for computing the shortest path and subsequently update the data plane devices. Many path computation algorithms including bio-inspired algorithms are published and are in use today in computer networks. In this paper, a novel bio inspired algorithm namely Smell Detection Agent based path computation algorithm is applied and studied for its performance in comparison with Dijkstra's algorithm, Extended Dijkstra's algorithm and the most commonly used bio inspired algorithm based on Ant Colony Optimisation. The Smell Detection Agent based algorithm inspired from the dog's smell detection capability for tracing and reaching a destination is found to be very useful and providing better results compared to the other algorithms.
引用
收藏
页码:502 / 510
页数:9
相关论文
共 14 条
[1]  
[Anonymous], SOFTW DEF NETW NEW N
[2]  
Dobrijevic O, 2015, IFIP CNSM
[3]  
Dorigo M., 2007, Ant colony optimization
[4]   Principles and applications of swarm intelligence for adaptive routing in telecommunications networks [J].
Ducatelle, Frederick ;
Di Caro, Gianni A. ;
Gambardella, Luca M. .
SWARM INTELLIGENCE, 2010, 4 (03) :173-198
[5]   Implementation Issues for Modified Dijkstra's and Floyd-Warshall Algorithms in OpenFlow [J].
Furculita, Adrian Gabriel ;
Ulinic, Mircea-Valeriu ;
Rus, Andrei Bogdan ;
Dobrota, Virgil .
2013 ROEDUNET INTERNATIONAL CONFERENCE: NETWORKING IN EDUCATION AND RESEARCH, 12TH EDITION, 2013,
[6]  
Jiang J.R, 2014, PROCEEDINGS OF THE O
[7]   NOTE ON DIJKSTRAS SHORTEST PATH ALGORITHM [J].
JOHNSON, DB .
JOURNAL OF THE ACM, 1973, 20 (03) :385-388
[8]  
Lantz B, 2010, P ACM HOTNETS 2010
[9]   OpenFlow: Enabling innovation in campus networks [J].
McKeown, Nick ;
Anderson, Tom ;
Balakrishnan, Hari ;
Parulkar, Guru ;
Peterson, Larry ;
Rexford, Jennifer ;
Shenker, Scott ;
Turner, Jonathan .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2008, 38 (02) :69-74
[10]   Particle Swarm Optimization With Interswarm Interactive Learning Strategy [J].
Qin, Quande ;
Cheng, Shi ;
Zhang, Qingyu ;
Li, Li ;
Shi, Yuhui .
IEEE TRANSACTIONS ON CYBERNETICS, 2016, 46 (10) :2238-2251