by Xu Haoyu. / Thesis submitted in: July 2003. / Thesis (M.Phil.)--Chinese University of Hong Kong, 2004. / Includes bibliographical references (leaves 89-95). / Abstracts in English and Chinese. / Acknowledgement --- p.i / Abstract --- p.ii / 摘要 --- p.iii / Contents --- p.iv / List of Abbreviations --- p.vii / List of Tables --- p.viii / List of Figures --- p.ix / Chapter Chapter 1 --- Introduction --- p.1 / Chapter 1.1 --- Background --- p.2 / Chapter 1.1.1 --- Routing --- p.2 / Chapter 1.1.2 --- Ant Colony Optimization --- p.6 / Chapter 1.2 --- Research Statement --- p.8 / Chapter 1.3 --- Main Contributions --- p.10 / Chapter 1.4 --- Thesis Organization --- p.11 / Chapter Chapter 2 --- Ant Colony Optimization Routing --- p.12 / Chapter 2.1 --- ACO Routing Algorithms --- p.13 / Chapter 2.1.1 --- ACO Routing Algorithms in Circuit-Switched Networks --- p.13 / Chapter 2.1.2 --- ACO Routing Approaches in Packet-Switched Networks --- p.16 / Chapter 2.2 --- ACO Routing and Traditional Routing Algorithms --- p.23 / Chapter 2.3 --- ACO Routing and Optimal Routing Algorithms --- p.26 / Chapter Chapter 3 --- Reactive Ant Colony Optimization --- p.31 / Chapter 3.1 --- Problem Model --- p.31 / Chapter 3.2 --- RACO Routing Approach --- p.35 / Chapter 3.2.1. --- Node and Probabilistic Routing Table --- p.36 / Chapter 3.2.2. --- Ants --- p.38 / Chapter 3.2.3 --- Detailed Description of RACO routing approach --- p.43 / Chapter Chapter 4 --- Simulation Results --- p.45 / Chapter 4.1 --- Experiment Design --- p.45 / Chapter 4.1.1 --- Topology --- p.46 / Chapter 4.1.2 --- Network Layers --- p.48 / Chapter 4.2 --- Results --- p.50 / Chapter 4.2.1 --- NSFNET --- p.50 / Chapter 4.2.2 --- ARPANET --- p.52 / Chapter 4.3 --- Discussion --- p.53 / Chapter Chapter 5 --- Convergence Analysis --- p.58 / Chapter 5.1. --- Related Work --- p.59 / Chapter 5.2 --- "Two-Node, Two-Path Model" --- p.61 / Chapter 5.3 --- The Recursive Pheromone Values --- p.64 / Chapter 5.4 --- Pheromone Convergence --- p.70 / Chapter 5.5 --- General Models --- p.81 / Chapter 5.5.1 --- "Two - Node, N - Path Model" --- p.81 / Chapter 5.5.2 --- "M- Node, N(i.j) - Path Model" --- p.83 / Chapter 5.6. --- Conclusion and Discussion --- p.84 / Chapter Chapter 6 --- Conclusion and Future Work --- p.86 / Chapter 6.1 --- Conclusion --- p.86 / Chapter 6.2 --- Future Work --- p.87 / Reference --- p.89 / Appendices --- p.96 / "Appendix 1 The Detailed Form of P = f1(a,b) and Q = f2(a,b)" --- p.96 / "Appendix 2 To Validate Whether f1(a,b) in the Domain of (0,1)" --- p.102
Identifer | oai:union.ndltd.org:cuhk.edu.hk/oai:cuhk-dr:cuhk_324576 |
Date | January 2004 |
Contributors | Xu, Haoyu., Chinese University of Hong Kong Graduate School. Division of Information Engineering. |
Source Sets | The Chinese University of Hong Kong |
Language | English, Chinese |
Detected Language | English |
Type | Text, bibliography |
Format | print, x, 102 leaves : ill. ; 30 cm. |
Rights | Use of this resource is governed by the terms and conditions of the Creative Commons “Attribution-NonCommercial-NoDerivatives 4.0 International” License (http://creativecommons.org/licenses/by-nc-nd/4.0/) |
Page generated in 0.0014 seconds