長期以來電路和分封交換網路分別為人們提供兩類性質不同的電信服務。隨著信息活動的豐富，人們越來越迫切要求通信網路把語音、數據和影像結合起來以一種統一的連接方式提供綜合的多媒體服務。B-ISDN的訊務流控制有其特殊性，不同於傳統的電路交換網路及分封交換網路，其將此二種相反特性的訊務予以整合。為同時滿足語音和數據資料的需求，所設計出的實體頻寬必須能讓各種不同特性與速率之資訊所共用。因此由於傳送方式的革新性，B-ISDN在訊務流管理及控制上極須要構建新方法和新機制。
路由管理既為網路訊務管理及控制機制的一環，本研究的目的即在提出一路由選擇機制，為即時的訊務需求快速地且能滿足資源及QoS的限制下找出最佳的路由傳送。路由選擇程序是先根據期間性的訊務估計資料，利用GA搜尋法產生路由表。當訊務來到時，再利用簡單的搜尋法－最小負荷路由法來尋找最佳路由。

本研究所設計出的基因演算搜尋法同時具有時間相依及狀態相依的特性，兩者相輔相成、相互備用調節，為具有單純一種特性所不及。由於本研究所設計的基因演算法本身在路由選擇的應用上存在對網路狀態敏感度低、不受目標函數型態影響的優點，故較能適切地考慮QoS因素且使用上彈性較大。由實驗結果顯示，基因演算法在平均化訊務及鏈路使用率的效益上表現都較簡單的貪婪法則佳。

---

The circuit switching and packet switching network have provided two kinds of telecommunication services for people for a long time. In the recent years, it’s necessary to include several traffic classes in the network in order to support each application from different requirements. Therefore, the traffic control of Broadband Integrated Service Digital Network (B-ISDN) becomes an important issue to investigate methods. Under B-ISDN, a range of voice, video, data, image and multimedia services can be supported using the common available resources. Because of the innovation of transmission, the new mechanism must be reconstructed on the traffic management and control under B-ISDN environment.
Due to the routing management is one part of the traffic management and control mechanisms, this article will concentrate on the routing mechanisms for B-ISDN. Routing in B-ISDN networks supports real and multimedia traffic by providing enough resources and different guaranteed qualities for each class of traffic. The routing processes are the following: first, according to the traffic demand estimated from historical events, a routing table is constructed by our proposed Genetic Algorithm (GA). Second, based on the derived routing table, a better route is then decided for some real traffic. The algorithm used in the second step is simple and called the Least Loaded Routing method.

The proposed GA includes the characteristics of time and state dependence, which are the reasons to conquer the algorithm including only one of them. Since the proposed GA is not affected by network states and its objective functions, Quality of Service (QoS) factors can be appropriately considered and the proposed GA is very flexible in different applications. Finally, the proposed GA is compared with a greedy algorithm. As a result of these experiments, the proposed GA has better performances on the traffic distribution and on the bandwidth utilization of virtual path.

1.1 前言 1

1.2 研究動機與目的 2

1.3 研究範圍 3

1.4 研究架構與方法 4

第二章 文獻回顧 6

2.1 寬頻傳送網路與路由選擇 6

2.2 動態路由技術的比較 7

2.3 路由選擇方法回顧 9

2.4 QoS與路由選擇 11

第三章 寬頻傳送網路之路由規劃 15

3.1 路由表與路由選擇 15

3.1.1 路由選擇法則 16

3.1.2 路由表產生模式 16

3.1.3 最大流量界限 17

3.2 穩定狀態路由法 18

3.2.1 問題定義 18

3.2.2 穩定狀態路由模式 22

3.3 基因搜尋啟發式方法 24

3.3.1 基因演算法簡介 24

3.3.2 流程說明及參數設定 27

3.3.3 路由表產生之範例說明 35

3.4 即時路由法則 36

第四章 演算法實驗及效能分析 38

4.1 GA與貪婪法的比較 38

4.2 擴張問題的討論 39

4.2.1 網路連結度與GA計算結果 40

4.2.2 訊務數與GA計算結果 41

4.3 GA與非線性目標函數 45

4.3.1 最小化平均細胞延遲 45

4.3.2 最小化平均細胞損失 47

4.3.3 最小化最大鏈路使用率 47

4.3.4 最大化細胞接受機率 48

第五章 結論與建議 50

5.1 結論 50

5.2 建議 52

參考文獻 53

附錄一 GA演算法程式碼 56

附錄二 十個問題的最佳解、GA及貪婪法計算結果 62

附錄三 要求品質下，不同問題的終止條件及求解時間比較 63

[1] Akinpelu, J.M., “The Overload Performance of Engineered Network with Nonhierachical and Hierarchical Routing”, AT &T Bell Laboratories Technical Journal, Vol.63, No.7, September 1984, P.1261~1281.
[2] Al-Qahtani, T.A., Abedin, M.J. and Ahson, S.I., “Dynamic Routing in Homogenous ATM Networks Using Genetic Algorithms”, Evolutionary Computation Proceedings, The 1998 IEEE International Conference on Computational Intelligence, P.114~119.
[3] Anderson, C.A., Fraughnaugh, K., Parker, M. and Ryan, J., “Path assignment for call routing：An application of tabu search”, Annals of Operations Research 41, 1993, P.301~312.
[4] Antunes, C.H., Craveririnha, J. and Barrico, C., “A Multiple Objective Routing Algorithm for Integrated Communication Networks”, Elsevier Science B.V., 1999, P.1291~1300.
[5] Ash, G.R., Cardwell, R.H. and Murray, R.P., “Design and Optimization of Networks with Dynamic Routing“, the Bell System Technical Journal, Vol.60, No.8, October 1981, P.1787~1819.
[6] Atlasis, A.F., Saltouros, M.P., Stassinopoulos, G.I. and Vasilakos, A.V., “An Adaptive Routing Algorithm for ATM Networks Using A Learning Automaton”, Global Telecommunications Conference, 1998. The Bridge to Global Integration. IEEE, Vol.5 , 1998, P.2669 –2674.
[7] Bertsimas, D. and Chryssikou, T., “Bounds and Policies for Dynamic Routing in Loss Networks”, Operation Research, Vol.47, May-June 1999, P.379~393.
[8] Bür, K. and Ersoy, C., “A Virtual Path Routing Algorithm for ATM Networks Based on the Equivalent Bandwidth Concept”, Computer Communications 23,2000, P.379~394.
[9] Burgin, J. and Dorman, D., “Broadband ISDN Resource Management：The Role of Virtual Path”, IEEE Communications Magazine, September 1991, P.44~48.
[10] Chu, H.W. and Tsang, D-H.K., “Modified Least Loaded Routing in Virtual Path Based ATM Networks”, Telecommunication System 7, 1997, P.45~57.
[11] Cox, L.A., Davis, L. and Qiu, Y., “Dynamic Anticipatory Routing in Circuit-Switched Telecommunications Networks”, in Handbook of Genetic Algorithm, 1991.
[12] Eriksson, A.,” Performance of a Telecommunications System Using Trunk Reservation”, MSc thesis submitted to the Royal Institute of Technology Stockholm, Sweden,1997.
[13] Fei, A. and Geria, M., “Smart Forwarding Technique for Routing with Multiple Qos Constraints”, Global Telecommunications Conference, Globcom 2000, IEEE , Vol.1, P.599~604.
[14] Gen, M. and Cheng, R., “Genetic Algorithms and Engineering Design”, Ashikaga Institute of Technology, 1944, P.139~144.
[15] Gibben, R.J. and Kelly, F.P., “Dynamic Routing in Fully Connected Networks”, IMA J.Math. Control & Information, Vol.7, 1990, P.77~111.
[16] Jozsa, B.G., Orincsay, D., Magi, A. and Szviatovszki, B., ”On the Use of Trunk Reservation in PNNI Routing “,Proceedings of the IEEE Conference on High Performance Switching and routing, ATM, 2000 ,P.135~139.
[17] Kassotakis, I.E., Markaki, M.E. and Vasilakos, A.V., “Hybrid Genetic Approach for Channel Reuse in Multiple Access Telecommunication Networks”, IEEE Journal on Selected Areas in Communications, Vol.18, No.2, February 2000, P.234~243.
[18] Kawashima, K. and Inoue, A., “State- and Time-Dependent Routing in the NTT Network”, IEEE communications Magazine, July 1995, P.40~47.
[19] Key, P.B., “Optimal Control and Trunk Reservation in Loss Networks”, Probability in the Engineering and Informational Sciences, Cambridge University Press, Vol.4, 1990, P.203~242.
[20] Kim, Y.T., Koo, S.Y., Chung, Y.K. and Yoon, D.S., “A Parallel and Distributed Routing Algorithm with a Hierarchical Connection Management Architecture for ATM/BISDN “, Global Telecommunications Conference, Vol.5, 1998, P.3041~3046.
[21] Ko, T.M., Chang, M., ”Least Measured Cost Routing in VP-Based ATM Networks”, Global Telecommunications Conference, 1997, Vol.3,P. 1820~1824.
[22] Korkmaz, T. and Krunz, M., “A Randomized Algorithm for Finding a Path Subject to Multiple QoS Contraints”, Global Telecommunications Conference, Globcom 1999, IEEE, P.1694~1698.
[23] Kumar, S. and Raghavan, S.V., ”Dynamic Management of Routing Tables and Connection Re-routing in ATM Networks” ,2nd International Conference on ATM, ICATM '99. P.107 –114.
[24] Mitra, D., Gibbens, R.J. and Hung, B.D., “State-Dependent Routing on Symmetric Loss Network with Trunk Reservations-I”, IEEE Transactions on Communications, Vol.41, No.2, February 1993, P.400~411.
[25] Mostafa, M.E. and Eid, S-M.A. Eid, “A Genetic Algorithm for Joint Optimization of Capacity and Flow Assignment in Packet Switched Networks”, Seventeenth National Radio Science Conference, Feb.22-24, 2000, P.1~6.
[26] Pan, H. and Wang, I.Y.,” The Bandwidth Allocation of ATM Through Genetic Algorithm”, Global Telecommunications Conference, Vol 1, 1991, P.125~129.
[27] Pormavalai, C., Chakroborty, G. and Shiratori, N., “Routing with Multiple QoS Requirements for Supporting Multimedia Applications”, Telecommunication Systems 9, 1998, P.357~373.
[28] Rampal, S. and Reeves, D.S., “Routing and Admission Control Algorithms for Multimedia Traffic”, Computer Communications Vol.18, No.10, October 1995, P.755~768.
[29] Tang, K.S., Ko, K.T., Man, K.F. and Kwong, S., “Topology Design and Bandwidth Allocation of Embedded ATM Networks Using Genetic Algorithm”, IEEE Communications Letters, Vol.2, No.6, June 1998, P.171~173.
[30] Weinrib, A. and Gopal, G., “Limited Waiting：An Adaptive Overload-Control Strategy for Circuit Switched Network”, IEEE Journal on Selected Areas in Communications, Vol.9, No.2, February 1991, P.157~164.
[31] Wu, J.-L.C., Chen, C.C. and Chen, J.K.,” The Study of Direct Virtual Path Layout in IP Switch Networks”, Global Telecommunications Conference, The Bridge to Global Integration. IEEE , Vol.2, 1998, P.1129~1134.
[32] Yum, T.-K.G. and Schwartz, M., “Comparison of Routing Procedures for Circuit-Switched Traffic in Nonhierarchical Networks”, IEEE Transactions on Communications. Vol.35, No.5, May 1987, P.535~544.

全文公開日期 本全文未授權公開 (校內網路)
全文公開日期 本全文未授權公開 (校外網路)
全文公開日期 本全文未授權公開 (國家圖書館：臺灣博碩士論文系統)