Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Wavelength Rerouting for On-line Multicast in WDM Networks

Loading...
Thumbnail Image

Date

Authors

Liang, Weifa
Wan, Yingyu

Journal Title

Journal ISSN

Volume Title

Publisher

Institute of Electrical and Electronics Engineers (IEEE Inc)

Abstract

In this paper we consider wavelength rerouting for on-line multicast in all-optical Wavelength Division Multiplexing (WDM) networks where the multicast requests arrive and depart randomly. One limitation of such networks is the wavelength continuity constraint imposed by the all-optical cross-connect switches that requires the same wavelength be used on all the links in a multicast tree. With random arrivals and departures of multicast requests, it happens quite often that a new multicast request has to be blocked due to the fact that there are not enough available resources (e.g. wavelength) to realize the request. Wavelength rerouting, a viable and cost-effective method, has been proposed to improve the blocking probability, which rearranges the wavelengths on certain existing multicast routes to free a wavelength continuous route for the new request. In this paper, we study the wavelength rerouting problem for on-line multicast in both undirected and directed WDM networks with an objective to minimize the disruption incurred to the existing multicast services, or equivalently, to minimize the number of existing multicast routes to be wavelength-rerouted. We first show that the problem is not only NP-hard but also hard to approximate. We then devise approximation algorithms for it with provable approximation guarantees.

Description

Citation

Source

Proceedings of the 29th Annual IEEE Conference on Local Computer Networks (LCN 2004)

Book Title

Entity type

Access Statement

License Rights

DOI

Restricted until

abcd