TY - GEN
T1 - On-line multicast routing in WDM grooming networks
AU - Vishwanath, Arun
AU - Liang, Weifa
N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].
PY - 2005
Y1 - 2005
N2 - This paper considers the problem of on-line multicast routing in WDM grooming optical mesh networks without wavelength conversion capability. In such networks, provisioning of connection requests with fractional wavelength capacity requirements is achieved by dividing a wavelength into multiple time slots and multiplexing traffic on the wavelength. We present an on-line multicast traffic grooming algorithm for the concerned problem. The objective is to efficiently route multicast requests with sub-wavelength capacity requirements onto high-capacity wavelengths, and balance the load on the links in the network at the same tune. To do so, we propose a cost function, which not only encourages grooming new requests onto the wavelengths that are being used by existing traffic, but also performs load balancing by intelligently increasing the cost of using wavelengths on links. The performance results obtained by experiments on a representative sized mesh network show that the proposed algorithm outperforms the other existing algorithms. ©2005 IEEE.
AB - This paper considers the problem of on-line multicast routing in WDM grooming optical mesh networks without wavelength conversion capability. In such networks, provisioning of connection requests with fractional wavelength capacity requirements is achieved by dividing a wavelength into multiple time slots and multiplexing traffic on the wavelength. We present an on-line multicast traffic grooming algorithm for the concerned problem. The objective is to efficiently route multicast requests with sub-wavelength capacity requirements onto high-capacity wavelengths, and balance the load on the links in the network at the same tune. To do so, we propose a cost function, which not only encourages grooming new requests onto the wavelengths that are being used by existing traffic, but also performs load balancing by intelligently increasing the cost of using wavelengths on links. The performance results obtained by experiments on a representative sized mesh network show that the proposed algorithm outperforms the other existing algorithms. ©2005 IEEE.
KW - Load balancing
KW - Multicasting
KW - Optical time slot interchanger (OTSI)
KW - Optical WDM-TDM switched networks
KW - Traffic grooming
UR - https://www.scopus.com/pages/publications/33748367677
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-33748367677&origin=recordpage
U2 - 10.1109/ICCCN.2005.1523861
DO - 10.1109/ICCCN.2005.1523861
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 0780394283
SN - 9780780394285
VL - 2005
T3 - Proceedings - International Conference on Computer Communications and Networks, ICCCN
SP - 255
EP - 260
BT - Proceedings - 14th International Conference on Computer Communications and Networks, ICCCN 2005
T2 - 14th International Conference on Computer Communications and Networks, ICCCN 2005
Y2 - 17 October 2005 through 19 October 2005
ER -