Presentation	2005-01-19 Optimal Wavelength Assignment on Optical 2-Path Networks Hiroaki TAKAI, Akira MATSUBAYASHI,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	For a given (WDM optical) network G and a set R of requests (source and target nodes) on G, the wavelength assignment problem is to construct a directed path connecting each pair of source and target nodes in R and to assign wavelengths the paths so that no two intersecting paths have the same wavelength and that the total number of the used wavelengths is minimized. In this report, we show that the wavelength assignment problem can be solved optimally within a constant factor if the network is (a subgraph of) a 2-path.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	2-path / wavelength assignment problem / approximation algorithm
Paper #	CAS2004-60
Date of Issue

Conference Information
Committee	CAS
Conference Date	2005/1/12(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Circuits and Systems (CAS)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Optimal Wavelength Assignment on Optical 2-Path Networks
Sub Title (in English)
Keyword(1)	2-path
Keyword(2)	wavelength assignment problem
Keyword(3)	approximation algorithm
1st Author's Name	Hiroaki TAKAI
1st Author's Affiliation	Division of Electronics and Computer Science, Kanazawa University()
2nd Author's Name	Akira MATSUBAYASHI
2nd Author's Affiliation	Division of Electrical Engineering and Computer Science, Kanazawa University
Date	2005-01-19
Paper #	CAS2004-60
Volume (vol)	vol.104
Number (no)	555
Page	pp.pp.-
#Pages	6
Date of Issue