臺灣博碩士論文加值系統

在本論文中，我們針對在無波長轉換器之分波多工網路環境提出有效的路由演算法。我們所提出的成本計量策略是用來解決路由及指定光波的問題，它的主要目的是減少光纖網路的阻塞機率。我們的概念是對每一個建立連線的要求，都透過計算它的所有路徑的成本，其計算的成本包括：(1)每條環節上的波長使用情況，以及(2)每個節點的等級。最後，選擇花費最少成本的路徑。我們制定一個成本計算公式來計算每條環節上成本。我們的成本計算方式也可在分散式架構下使用，所以我們也提出了一分散式波長路由演算法。在模擬測試部份，我們將的成本計量策略與固定最短路徑策略及調和式最短路徑策略分別在美國高等研究計劃署網路及美國國家科學基金會網路的網路架構上做比較。根據實驗的結果，對固定最短路徑策略而言，成本計量策略最多可以減少40%的阻塞機率。在調和式最短路徑策略方面的表現可達減少2%的阻塞機率，在時間的計算上也較為快速。

In this paper we focus on routing and wavelength assignment in wavelength-division-multiplexing (WDM) all-optical networks without using wavelength converters. A sequential algorithm, named cost-oriented, is proposed to solve the routing and wavelength assignment problem with the goal to minimize the blocking probability for all-optical networks. The idea of our
algorithm is to select the connection light-path based on the
utility rate of wavelength on each link and the degree of each
node. We define a link cost function to decide the light-path. We also convert the cost-oriented algorithm into a distributed
wavelength routing algorithm. The performance of the cost-oriented routing algorithm is compared with fixed shortest
path and adaptive shortest path. We evaluate cost-oriented
strategy, fixed shortest path strategy and adaptive shortest path strategy for ARPA2 network and NSFnet T1 backbone network.
According to our experiment results, the Cost-Oriented routing
strategy can produce up to 40% performance improvement in the
blocking probability of fixed shortest path strategy. Our routing strategy can also produce up to 2% performance improvement in the blocking probability of adaptive shortest path strategy.

chapter 1.Introduction
chapter 2.Routing Strategy
chapter 3.Distributed Wavelength Routing
chapter 4.Simulation Results
chapter 5.Conclusion
Bibliography
Appendix A

1. ``On the future of wavelength routing networks," Gerstel O.,
IEEE Network, vol. 10, no. 6 , pp.14-20, Nov.-Dec. 1996.
2. ``Dynamic wavelength routing using congestion and
neighborhood information," Ling Li and Somani A.K.,
IEEE/ACM Transactions on Networking, vol. 7, no. 5, pp.779-
786, Oct. 1999.
3. ``Routing and wavelength assignment in all-optical networks,"
Ramaswami, R. and Sivarajan, K.N., IEEE/ACM Transactions on
Networking, vol. 3, no. 5, pp.489-500, Oct. 1995.
4. ``Adaptive Wavelength Routing in All-Optical Networks,"
Mokhtar, A. and Azizoglu, M., IEEE/ACM Transactions on
Networking, vol. 6, no. 2, pp.197-206, Oct. 1998.
5. ``Wavelength assignment in fixed routing WDM networks,"
Subramaniam, S. and Barry, R.A., IEEE International
Conference on Communications, vol. 1, no. 2, pp.406-410,
1997.
6. ``Dynamic routing and assignment of wavelength algorithms in
multifiber wavelength division multiplexing networks,"
Shizhong Xu,Lemin Li and Sheng Wang, IEEE Journal on on
Selected Areas in Communications, vol. 18, no. 10, pp.2130-
2137, Oct. 2000.
7. ``Efficient distributed control protocols for WDM all-optical
networks," Yousong Mei and Chunming Qiao,Proceedings. Sixth
International Conference on Computer Communications and
Networks, pp.150-153, 1997.
8. ``Lightpath Communications: An Approach to High Bandwidth
Optical WAN's," I. Chlamtac, A. Ganz, and G. karmi,
IEEE Transactions on Communications, vol. 40, no. 7,
pp.1171-1182, July 1992.
9. ``An adaptive shortest-path on-line routing algorithm,"
Chich, T., IEEE Global Telecommunications Conference,
vol. 3, pp.1664-1669, 1998.
10.``Routing and Wavelength Assignment for Establishing
Dependable Connections," Mohan,G. and Murthy, C.S.R.,
Fault-Tolerant Computing, 1999. Digest of Papers. Twenty-
Ninth Annual International Symposium, vol. 40, no. 7,
pp.94-101, 1999.
11. ``A heuristic approach to wavelength assignment in all-
optical networks," Inkret, R.; Mikac, B. and Podnar, I.,
Electrotechnical Conference, 1998. MELECON 98., 9th , vol.
2, pp.759-763, 1998.
12. ``Distributed wavelength assignment protocols with priority
for WDM all-optical networks," Wuxu Peng and Chunyan Wei,
Proceedings. Ninth International Conference on Computer
Communications and Networks, pp.625-630, 2000.