Call for Paper - August 2022 Edition
IJCA solicits original research papers for the August 2022 Edition. Last date of manuscript submission is July 20, 2022. Read More

Optimizing Routes using Genetic Algorithms based on Throughput or Delay Sensitivity of Applications using SNMP for Automatic Discovery of Network Topology

Print
PDF
International Journal of Computer Applications
© 2012 by IJCA Journal
Volume 47 - Number 12
Year of Publication: 2012
Authors:
M. Mohamed Surputheen
G. Ravi
R. Srinivasan
10.5120/7237-7746

Mohamed M Surputheen, G Ravi and R Srinivasan. Article: Optimizing Routes using Genetic Algorithms based on Throughput or Delay Sensitivity of Applications using SNMP for Automatic Discovery of Network Topology. International Journal of Computer Applications 47(12):1-5, June 2012. Full text available. BibTeX

@article{key:article,
	author = {M. Mohamed Surputheen and G. Ravi and R. Srinivasan},
	title = {Article: Optimizing Routes using Genetic Algorithms based on Throughput or Delay Sensitivity of Applications using SNMP for Automatic Discovery of Network Topology},
	journal = {International Journal of Computer Applications},
	year = {2012},
	volume = {47},
	number = {12},
	pages = {1-5},
	month = {June},
	note = {Full text available}
}

Abstract

Network Applications can be broadly classified as Throughput sensitive or Delay sensitive. Such applications require efficient routing mechanisms in order to work effectively. Genetic Algorithms can be used for defining the Best or Optimal Route based on its sensitivity and Various Constraints that the application imposes usually referred to as Constraint Satisfaction Problems (CSP). The use of Genetic Algorithms for selecting an optimal route based on CSP requires a mechanism for automatic discovery of network topology and also mechanisms for learning the capacity of the network infrastructure. SNMP along with MIB provides the required data for Topology discovery and also to learn the information about the current network capacity along with various bottlenecks present in the topology. Since the shortest path is not always the best path, our genetic algorithm will provide the optimal route based on CSP and application sensitivity.

References

  • "Network topology discovery algorithm based on SNMP", DENG Ze-lin, ZHANG Li-fang, LIU Yi-nan, FU Ming, Journal of Changsha University of Science & Technology(Natural Science), 2007,4(4):68-72.
  • "Algorithm and realization of network topology discovery", Huang Xiaobo, Pan Xuezeng, Computer Applications and Software,2008,21(3):64—66.
  • "Adaptation in Nature and Artificial Systems", Holland J. H. ,
  • "An Introduction to Genetic Algorithms for Scientists and Engineers", 1992. World Scientific, Coley, D. A.
  • "Genetic Algorithms in Search, Optimization and Machine Learning", Goldberg, D. E. , 1989, Addison Welsey Publishing Company.
  • "Algorithm Research of Topology Discovery on SNMP", Yang Qiuxiang, 2010
  • "Analysis and Research of Network Topology Discovery Method", He Peng, Qiu Jian-lin, Gu Xiang, 2010
  • "Traceroute Probe Method and Forward IP Path Inference", Luckie M, Hyun Y, Huffaker B. , In Proceedings of the 2008 ACM SIGCOMM Internet Measurement Conference: 311- 323,2008.
  • "An intelligent self-learning algorithm for IP network topology discovery. ", Najeeb Z, Nazir F, Haider S, Suguri H, Ahmad H. F, Ali A. , 2005 14TH IEEE Workshop On Local & Metropolitan Area Networks (Lanman):60-65, 2005.
  • "Research and implementation of topology discovery algorithms in campus networks", Liu YH, Yang JG, Xiao DB. In the Proceedings of DCABES 2002:33-35,2002.
  • "Hierarchical broadcast ring architecture for highspeed Ethernet networks", Jang H, Kim HS. In the proceedings IEEE INFOCOM 2006, IEEE INFOCOM SERIES: 3027-3031, 2006.
  • "Research and Application on automatic Network Topology Discovery in ITSM System", Yide Wang, Dancheng Li, Chunyan Han, Zhiliang Zhu