Multicasts on WDM all-optical multistage interconnection networks

Wavelength-division multiplexing (WDM) optical networks provide huge bandwidth by allowing multiple data streams to be transmitted simultaneously along the same optical fiber, with each stream assigned a distinct wavelength. A key issue of WDM optical networks is the minimization of the number of wa...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001 s. 601 - 608
Hlavní autoři: Xinchen Liu, Qian-Ping Gu
Médium: Konferenční příspěvek
Jazyk:angličtina
japonština
Vydáno: IEEE 13.11.2002
Témata:
Bandwidth
Multicast algorithms
Multiprocessor interconnection networks
Optical fiber networks
Optical fibers
Optical wavelength conversion
Upper bound
Wavelength division multiplexing
Wavelength routing
WDM networks
ISBN:0769511538, 9780769511535
ISSN:1521-9097
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Wavelength-division multiplexing (WDM) optical networks provide huge bandwidth by allowing multiple data streams to be transmitted simultaneously along the same optical fiber, with each stream assigned a distinct wavelength. A key issue of WDM optical networks is the minimization of the number of wavelengths for realizing a routing request. Let W be the number of wavelengths supported by a WDM optical network. For a routing request R which needs l wavelengths, if l/spl les/W then R can be realized in one round of routing. However, when l>W, multiple rounds of routing for R are required. In this case, it is important to minimize the number of routing rounds. Multicast transmits a data stream from one input to multiple outputs (one-to-many), a fundamental communication pattern in many applications. We study the problem of minimizing the number of wavelengths and the number of routing rounds for realizing a set R={(u, /spl nu/)} of multicasts, where each output /spl nu/ receives a data stream from exactly one input u, on an n-dimensional WDM all-optical multistage interconnection networks (MINs). For a network with wavelength converters, we show that any set of multicasts can be realized by 2/sup [(n-1)/(k+1)]/ wavelengths in k rounds of routing. For one round of routing, the upper bound 2/sup [(n-1)/2]/ is tight to the lower bound. We also give algorithms for multicasts on a network without wavelength converters. Computer simulation results show that any set of multicasts can be realized in at most two rounds of routing on a network of practical size.
ISBN:0769511538
9780769511535
ISSN:1521-9097
DOI:10.1109/ICPADS.2001.934872