A genetic algorithm solution to the shortest path problem in OSPF and MPLS /

Saved in:
Bibliographic Details
Main Author: Tee, Wee Jing
Format: Thesis Book
Language:English
Published: 2002.
Subjects:
Online Access:http://studentsrepo.um.edu.my/id/eprint/2422
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 01107cam a2200277 a 4500
001 u506434
003 SIRSI
008 990618s2002 my t 00 1 eng m
035 |a ACW-2973 
040 |a UMM 
090 |a QA76  |b UM 2002 Tee 
100 1 0 |a Tee, Wee Jing. 
245 1 2 |a A genetic algorithm solution to the shortest path problem in OSPF and MPLS /  |c by Tee Wee Jing. 
260 |c 2002. 
300 |a ix, 115 leaves :  |b ill. ;  |c 30 cm. 
502 |a Dissertation (M.Comp.Sc.) -- Fakulti Sains Komputer dan Teknologi Maklumat, Universiti Malaya, 2002. 
504 |a Bibliography: leaves 109-115. 
650 0 |a Open Shortest Path First (Computer network protocol) 
650 0 |a MPLS standard. 
650 0 |a Genetic algorithms. 
710 2 0 |a Universiti Malaya.  |b Fakulti Sains Komputer dan Teknologi Maklumat. 
856 |a RC:A511970620   |z  Click Here for Abstract and Table of Contents 
856 4 1 |u http://studentsrepo.um.edu.my/id/eprint/2422 
948 |a 13/11/2002  |b 31/01/2004 
596 |a 1 
999 |a QA76 UM 2002 TEE  |w LC  |c 1  |i A510916306  |d 1/11/2010  |e 1/11/2010  |l STACKS  |m P01UTAMA  |n 5  |r Y  |s Y  |t TESIS  |u 12/2/2004