This study discusses the routing optimization techniques and algorithms for communication networks. Preventing data loss on overloaded communication links and utilizing link bandwidths efficiently are the main problems of traffic engineering. Load balancing and routing problems are solved using both by heuristics such as genetic algorithms, and simulation techniques. These algorithms work on destination-based or flow-based routing techniques and mainly change the link weight system or try to select the best routes set upon K-routes routing table respectively to optimize network utilization. In this study, first a definition of the network routing optimization problem will be made. Then the heuristics to solve the problem will be discussed and finally an analysis of these heuristics will be made on sample network models. This thesis includes a discussion about the performance of different optimization heuristics working as a part of the centralized network load balancing systems.
| Identifer | oai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12605908/index.pdf |
| Date | 01 January 2005 |
| Creators | Demircan, Ahmet Emrah |
| Contributors | Leblebicioglu, Kemal |
| Publisher | METU |
| Source Sets | Middle East Technical Univ. |
| Language | English |
| Detected Language | English |
| Type | M.S. Thesis |
| Format | text/pdf |
| Rights | To liberate the content for public access |
Page generated in 0.0017 seconds