由於社會資訊流型態的改變及要求快速的傳送時代來臨，網路的需求與日俱增，在資訊傳送速度與頻寬方面的需求也越來越高，但是並沒有無限的頻寬可提供給訊務傳送，因此，如何以有限的資源達到最有效的網路使用效率就是本文的主要目的。而且現在的訊務類型多為多媒體資訊，也就是語音、影像、數據資料、圖片等的結合，如何有效且迅速地將之送往各個端點，將是一大挑戰。
為了快速的傳送訊務，本研究是以預先建構路由表的方式來達到迅速搜尋路由的目的。另外，傳統的方式是將頻寬計算與配置，以及路由選擇這兩項機制分開來考慮，但是這樣的缺點是考慮了個別的最佳化，並不見得是整體的最佳化，所以本研究將兩個機制同時考慮，以達到整體最佳化的目的。並且以模擬軟體模擬實際訊務傳送的過程，再將收集到的數據做分析，驗證本方法的可行性與優缺點。

Because of the change of the society-information-flow type and the coming of fast-transpotation era, the requirement of the network is steadily on the increase, and the one of the delivering speed and bandwidth also become higher and higher. But there is no infinite bandwidth to be provided to the traffic transmission. Therefore, how to use network most efficiently with limited resource is the main purpose. And most of type of traffics is multimedia now; that is the combination of sounds, images, data, pictures...etc. How to transfer to each node efficiently and quickly will be a big challenge.
To bring out the fastest traffic transmission, this research constructs the routing table to search routing quickly. Besides, on considering the calculation and location of bandwidth, and routing selection is separate in traditional way, but there will be such a weakness that it could just consider the individual optimization, not exactly the whole optimization. So this research considers two mechanisms together to reach the whole optimization. And it’s also going to simulate the actual process of traffic transmission by the simulation software, then to analysis the collected data to identify the feasibility, merit and shortcomings of the heuristic method in this research.

[1] 王培元，「ATM交換原理：Tutorial」，電信訓練園地，第三十四卷，第1-23頁[2000]。
[2] 洪維國、曹善信、孫如濱、蕭銀芬，「動態路由技術比較與模擬分析」，電信研究雙月刊，第二卷，第一期，第51-63頁[1994]。
[3] 洪智偉，「寬頻傳送網路之頻寬估計」，國立清華大學工業工程與工程管理學系碩士論文[2001]。
[4] 孫海榮、李樂民，「ATM技術：概念、原理與應用」，儒林，第2-4、8-10頁[1996]。
[5] 徐清棋，「寬頻傳送網路規劃之研究」，國立清華大學工業工程與工程管理學系博士論文[1999]。
[6] 陳啟盛，「達到近似公平配置頻寬之封包丟棄法」，國立交通大學電信工程學系碩士論文[2000]。
[7] 劉忠青，「行動特殊網路隨選式服務品質保證路徑選擇演算法」，國立中正大學資訊工程學系碩士論文[2000]。
[8] 蔡淑婷，「寬頻傳送網路之路由選擇」，國立清華大學工業工程與工程管理學系碩士論文[2001]。
[9] Akinpelu, J. M., “ The overload performance of engineered network with nonhierarchical and hierarchical routing, ” AT&T Bell Laboratories Technical Journal, 63, 1261-1281 (1984).
[10] Al-Qahtani, T. A., M. J. Abedin and S. I. Ahson, “ Dynamic routing in homogenous ATM networks using genetic algorithms, ” presented at the 1998 IEEE International Conference on Computational Intelligence, 114-119 (1998).
[11] Anderson, C. A., K. Fraughnaugh, M. Parker and J. Ryan, “ Path assignment for call routing：An application of tabu search, ” Operations Research, 41, 301-312 (1993).
[12] Bennett, J. C. R. and H. Zhang, “ WF2Q: Worst-case fair weight fair queueing, ” presented at the INFOCOM’96 (1996).
[13] Burgin, J. L., “ Management of capacity and control in broadband ISDN, ” Intl. J. Digital and Analog Cabled System, 2, 155-165 (1989).
[14] Bür K. and C. Ersoy, “ A virtual path routing algorithm for ATM networks based on the equivalent bandwidth concept, ” Computer Communications, 23, 379-394 (2000).
[15] Floyd, S. and V. Jacobson, “ Random early detection gateways for congestion avoidance, ” presented at IEEE/ACM Transaction on Networking, (1993).
[16] Golestani, S., “ A self-clock fair queueing scheme for broadband application, ” presented at IEEE INFOCOM’94 (1994).
[17] Gupta, S., K. W. Ross and M. E. Zarki, “ Routing in virtual path based ATM networks, ” GLOBECOM, 1, 571-575 (1992).
[18] Kumar, S. and S.V. Raghavan, “ Dynamic management of routing tables and connection re-routing in ATM networks, ” presented at 2nd International Conference on ATM, ICATM ’99, 107-114 (1999).
[19] Lin, C. R. and J. S. Liu, “ QoS routing in Ad Hoc Wireless Networks, ” IEEE Journal on Selected Areas in Communications, 15, 1265-1275 (1997).
[20] Lin, D. and R. Morris, “ Dynamics of random early detection, ” presented at the SIGCOMM91 (1997).
[21] Mostafa, M. E. and S. M. A. Eid, “ A genetic algorithm for joint optimization of capacity and flow assignment in packet switched networks, ” presented at Seventeenth National Radio Science Conference, 1-6 (2000).
[22] Murakami, K. and H. S. Kim, “ Virtual path routing for survivable ATM networks, ” IEEE/ACM transaction on Networking, 4, 22-39 (1996).
[23] Pan, H. and I. Y. Wang, “ The bandwidth allocation of ATM through genetic algorithm, ” presented at Global Telecommunication Conference, 1, 125-129 (1991).
[24] Parekh, A. and R. Gallager, “ A generalized processor sharing approach ti flow control─the single node case, ” presented at the INFOCOM’92 (1992).
[25] Rampal, S. and D. S. Reeves, “ Routing and admission control algorithms for multimedia traffic, ” Computer Communications, 18, 755-768 (1995).
[26] Regnier, J., P. Blondeau and W. H. Cameron, “ Grade of service of a dynamic call routing system, ” presented at 10th International Teletraffic Congress (1983).
[27] Shreedhar, M. and G. Varghese, “ Efficient fair queueing using deficit round robun, ” presented at the SIGCOMM’95 (1995).
[28] Suter, B., T. V. Lakshman, D. Stiliadis and A. K. Choudhury, “ Design considerations for supporting TCP with per-flow queueing, ” IEEE INFOCOM, (1998).
[29] Tang, K. S., K. T. Ko, K. F. Man and S. Kwong, “ Topology design and bandwidth allocation of embedded ATM networks using genetic algorithm, ” IEEE Communications Letters, 2, 171-173 (1998).
[30] Wu, J. L. C., C. C. Chen and J. K. Chen, “ The study of direct virtual path layout in IP switch networks, ” presented at Global Telecommunications Conference, The Bridge to Global Integration IEEE, 2, 1129-1134 (1998).
[31] Yum, T. K. G. and M. Schwartz, “ Comparison of routing procedures for circuit-switched traffic in nonhierarchical networks, ” IEEE Transactions on Communications, 35, 535-544 (1987).