Author, Subjects, Keywords

Cited Author

 
 
   » By Author or Editor
 » Browse Author by Alphabet
 » By Journal
 » By Subjects
 » Malaysian Journals
 » By Type
 » By Year
 » By Latest Additions
 
 
   » By Author
 » Top 20 Authors
 » Top 20 Article
 » Top Journal Cited
 » Top Article Cited
 » Journal Citation Statistics
 » Usage Since Sept 2007


 
 
 

Login | Create Account

A Genetic Algorithm Solution to Solve the Shortest Path Problem in OSPF and MPLS

Selvanathan, N. and Tee, Wee Jing (2003) A Genetic Algorithm Solution to Solve the Shortest Path Problem in OSPF and MPLS. Malaysian Journal of Computer Science, 16 (1). pp. 58-67. ISSN 0127-9084

Full text not available from this repository.

Official URL: http://mjcs.fsktm.um.edu.my/detail.asp?AID=200

Affiliations

University of Malaya

Abstract

This paper explores the potential of using genetic algorithm to solve the shortest path problem in Open Shortest Path First (OSPF) and Multi-protocol Label Switching (MPLS). The most critical task for developing a genetic algorithm to this problem is how to encode a path in a graph into a chromosome. The proposed approach has been tested on ten randomly generated problems with different weights. The experimental results are very encouraging and the algorithm can find the optimum solution rapidly with high probability.

Item Type:Journal
Keywords:OSPF, MPLS, Genetic, Chromosome, Mutation, Crossover
Subjects:Q Science
ID Code:351

A. Ravindran, D. T. Phillips, and J. J. Solberg, Operations Research: Principles and Practice. John Wiley & Sons, 1987.

J. Moy, “OSPF Version 2”, Request For Comment 2328. Internet Engineering Task Force, April 1998.

J. Moy, “OSPF Version 2”, Request For Comment 1583. Internet Engineering Task Force, March 1994.

E. W. Dijkstra, “A Note on Two Problems in Connection with Graphs”. Numerical Mathematics, October 1959.

D. O. Awduche, J. Malcolm, J. Agogbua, M. O’Dell, and J. McManus, “Requirements for Traffic Engineering over MPLS”. Internet Request for Comments 2702, Internet Engineering Task Force, September 1999.

E. C. Rosen, A. Viswanathan, and R. Callon, “Multi-Protocol Label Switching Architecture”. Internet Draft (work in progress), Internet Engineering Task Force, 1999.

Bernard Fortz and Mikkel Thorup. “Internet Traffic Engineering by Optimizing OSPF Weights”, in INFOCOMM 2000. IEEE, March 2000.

Mitsuo Gen, Runwei Cheng, and Dingwei Wang, “Genetic Algorithms for Solving Shortest Path Problems”. IEEE Computer, Vol. 30, No. 8, 1997, pp. 401-406.

Mohamed E. Mostafa, and Saad M. A. Eid, “A Genetic Algorithm for Joint Optimization of Capacity and Flow Assignment in Packet Switched Networks”, in 17th National Conference, Egypt, Feb. 2000, pp. 1-6.

Z. Michalewicz, Genetic Algorithm + Data Structure = Evolution Programs. Springer-Verlag, New York, second edition, 1994.

M. Gen, and R. Cheng, Genetic Algorithms and Engineering Design. John Wiley & Sons, 1987.

Repository Staff Only: item control page
 
 
 
 
 
 
© Copyright 2007 MyAIS Faculty of Computer Science and Information Technology, University of Malaya – All Rights Reserved. Malaysian Abstracting and Indexing System is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.