|
HKUST Institutional Repository >
Electronic and Computer Engineering >
ECE Conference Papers >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1783.1/1888
|
| Title: | Routing and wavelength assignment in all-optical networks with multicast traffic |
| Authors: | Sun, Yong
Gu, Jun
Tsang, Danny H. K. |
| Keywords: | Routing and wavelength assignment
All-optical network
Wavelength-routing network
Unicast
Multicast
Steiner minimum tree |
| Issue Date: | 1999 |
| Citation: | Proceedings of International Teletraffic Congress (ITC'16), Edinburgh, U.K., June 1999 |
| Abstract: | In this paper, we consider the Routing and Wavelength Assignment (RWA) problem in all-optical wavelength-routing networks with multicast traffic. The RWA problem has been proved NP-hard. Many researchers are working on this problem and many algorithms have been proposed to solve the RWA problem. However, most of these algorithms only consider unicast traffic, while with multicast traffic, the blocking probability becomes very high. The main problem here is that the duplicated information transmitted in the network will consume a large amount of bandwidth. To solve this problem, we propose two SMT (Steiner Minimum Tree) based algorithms. The basic idea is to establish the multicast connections using the Steiner Minimum Tree, such that the duplicated information transmitted in the network can be minimized. Numerical results illustrate that the SMT based algorithms can achieve remarkable performance under a hybrid traffic model, consisting of both unicast traffic and multicast traffic. |
| URI: | http://hdl.handle.net/1783.1/1888 |
| Appears in Collections: | ECE Conference Papers
CSE Conference Papers
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| suny_itc16.pdf | pre-published version | 199Kb | Adobe PDF | View/Open |
|
All items in this Repository are protected by copyright, with all rights reserved.
|
