2001
DOI: 10.1016/s1389-1286(00)00145-6
|View full text |Cite
|
Sign up to set email alerts
|

A heuristic for placement of limited range wavelength converters in all-optical networks

Abstract: Wavelength routed optical networks have emerged as a technology that can eectively utilize the enormous bandwidth of the optical ®ber. Wavelength converters play an important role in enhancing the ®ber utilization and reducing the overall call blocking probability of the network. As the distortion of the optical signal increases with the increase in the range of wavelength conversion in optical wavelength converters, limited range wavelength conversion assumes importance. Placement of wavelength converters is … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2004
2004
2023
2023

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 19 publications
(6 citation statements)
references
References 38 publications
(45 reference statements)
0
6
0
Order By: Relevance
“…When adopting sparse selection or conversion, the placement of these capabilities must be optimised. The optimal placement has been proven to be NPcomplete [12,18,19]; heuristic algorithms have also been proposed [20,21] to solve this problem. In our simulations, we used the following heuristic (from Reference [20]) for the assignment of both sparse selection and sparse conversion capabilities: we start from a scenario where the capability is present in all the nodes and we rank them z Differently from Reference [5], where networks with fixed transmitters and receivers and absence of wavelength conversion are not studied because full connectivity is not guaranteed, we consider this case (adding the condition that the two transponders work on the same wavelength), because this scenario is typical of many present optical networks.…”
Section: Numerical Results and Discussionmentioning
confidence: 99%
“…When adopting sparse selection or conversion, the placement of these capabilities must be optimised. The optimal placement has been proven to be NPcomplete [12,18,19]; heuristic algorithms have also been proposed [20,21] to solve this problem. In our simulations, we used the following heuristic (from Reference [20]) for the assignment of both sparse selection and sparse conversion capabilities: we start from a scenario where the capability is present in all the nodes and we rank them z Differently from Reference [5], where networks with fixed transmitters and receivers and absence of wavelength conversion are not studied because full connectivity is not guaranteed, we consider this case (adding the condition that the two transponders work on the same wavelength), because this scenario is typical of many present optical networks.…”
Section: Numerical Results and Discussionmentioning
confidence: 99%
“…The performance of the heuristics are kvaluated on two network topologies: the NSFNET (181 and the European Optical Network (EON) [15]. We consider one traffic pattern each for the NSFNET and for the EON.…”
Section: A Heuristic Algorithmsmentioning
confidence: 99%
“…We consider two objective functions in our study: the average blocking probability and the maximum blocking probability over all paths. Some heuristics have been proposed recently for placing converters to minimize average blocking probability in mesh topologies [14], [15], [16]. In [14] and [IS], a heuristic that places the converters one by one sequentially is proposed, while a heuristic for the placement of limited range wavelength converters is presented in [15].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…[6] and [3] mainly focus on the type b wavelength converter placement problem. In terms of type a and c wavelength converter placement problems, the benefits of using wavelength converters in wavelength routed all-optical networks have been studied in [7]- [11] under various assumptions. Usually, the analytical models are derived from simple topologies and algorithms are proposed under statistical independence assumptions.…”
Section: Related Workmentioning
confidence: 99%