Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/36932
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | An improved scheme of wavelength assignment for parallel FFT communication pattern on a class of regular optical networks |
Author: | Chen, Y. Shen, H. |
Citation: | Network and parallel computing IFIP international conference, NPC 2005, Beijing, China, November 30 - December 3, 2005 : proceedings / Hai Jin, Daniel Reed, Wenbin Jiang (eds.), pp. 189-196 |
Publisher: | Springer |
Publisher Place: | Berlin |
Issue Date: | 2005 |
Series/Report no.: | Lecture notes in computer science: 3779 |
ISBN: | 354029810X 9783540298106 |
ISSN: | 0302-9743 1611-3349 |
Conference Name: | NPC 2005 (2005 : Beijing, China) |
Statement of Responsibility: | Yawen Chen and Hong Shen |
Abstract: | Routing and wavelength assignment (RWA) is a central issue to increase efficiency and reduce cost in Wavelength Division Multiplexing (WDM) optical networks. In this paper, we propose an improved scheme of wavelength assignment of parallel FFT communication pattern on a class of regular optical networks. With our new scheme, the numbers of wavelengths required to realize parallel FFT communication pattern with 2n nodes on WDM linear arrays, rings, 2-D meshes and 2-D tori are 2n–2+1 , 2n–3+1 , 2max(k,n–k)–2+1 and 2max(k,n–k)–3+1 respectively, which are about one-third less for linear arrays and meshes, and a half less for rings and tori, than the known results. Our results have a clear significance for applications because FFT represents a common communication pattern shared by a large class of scientific and engineering problems and WDM optical networks as a promising technology in networking has an increasing popularity. |
DOI: | 10.1007/11577188_25 |
Published version: | http://www.springerlink.com/content/f03579225694h00g/ |
Appears in Collections: | Aurora harvest 6 Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.