1995
DOI: 10.1002/ecja.4410780901
|View full text |Cite
|
Sign up to set email alerts
|

Number of wavelengths required for constructing large‐scale optical path networks

Abstract: Photonic networks that exploit the abundant optical bandwidth capability are needed to realize a truly effective B-ISDN. We have proposed two optical path schemes, the wavelength path (WP) scheme and the virtual wavelength path (W) scheme, wherein wavelength division multiplexing/frequency division multiplexing (WDM/FDM) technologies are employed in the path layer of the transport networks. Although wavelengths are precious resources in photonic networks, the number of wavelengths required for any network has … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
26
0

Year Published

1998
1998
2013
2013

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 19 publications
(26 citation statements)
references
References 3 publications
0
26
0
Order By: Relevance
“…The capacity iterations have some similarities with a local search for routing and wavelength assignment described by Nagatsu et Al. in [10].…”
Section: Fastsurv For Survivable Routing With Link Capacities Constramentioning
confidence: 99%
“…The capacity iterations have some similarities with a local search for routing and wavelength assignment described by Nagatsu et Al. in [10].…”
Section: Fastsurv For Survivable Routing With Link Capacities Constramentioning
confidence: 99%
“…Common approaches to assign wavelengths to given paths are a bin packing inspired heuristic [8,12,37,47] and a graph coloring (GC) method either in a basic variant [4,6,24] or in a generalized form [14,27]. The wavelength assignment problem is equivalent to the graph coloring problem.…”
Section: Related Workmentioning
confidence: 99%
“…Table 1 gives an overview on the used methods, which will be presented in detail below. For the routing subproblem the most popular approaches are based on shortest path (SP) algorithms [6,8,24,27,37].…”
Section: Related Workmentioning
confidence: 99%
“…Sato et al [40]- [42] used the longer-paths-first policy to accommodate paths. The difference between the number of wavelengths with and without wavelength conversion is found to be less than 4% for various traffic volumes at a 50-node mesh network.…”
Section: A Static Traffic Demandmentioning
confidence: 99%