2001
DOI: 10.1109/90.944347
|View full text |Cite
|
Sign up to set email alerts
|

An analysis of oblivious and adaptive routing in optical networks with wavelength translation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2006
2006
2022
2022

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 22 publications
(5 citation statements)
references
References 29 publications
0
5
0
Order By: Relevance
“…The former, traditional adaptive routing algorithms (such as those mentioned above) usually select their routes based on maximizing the number of free wavelengths and do not explicitly consider the hop length. While this is not good for wavelength conversion networks ( [8], [9] present new adaptive routing algorithms for full wavelength conversion networks), it usually can lead to better results than static approaches in WS networks. In fact, without wavelength conversion, the route with more free wavelengths also usually has shorter hop length; the probability that a longer route has more free wavelengths is much smaller by comparison with shorter routes [10].…”
Section: S E T U P a B D C E λmentioning
confidence: 99%
“…The former, traditional adaptive routing algorithms (such as those mentioned above) usually select their routes based on maximizing the number of free wavelengths and do not explicitly consider the hop length. While this is not good for wavelength conversion networks ( [8], [9] present new adaptive routing algorithms for full wavelength conversion networks), it usually can lead to better results than static approaches in WS networks. In fact, without wavelength conversion, the route with more free wavelengths also usually has shorter hop length; the probability that a longer route has more free wavelengths is much smaller by comparison with shorter routes [10].…”
Section: S E T U P a B D C E λmentioning
confidence: 99%
“…To implement traffic engineering over a topology schedule, we define a traffic schedule, which determines which traffic (e.g., packets) will be sent over which link and at which time. We further note that a traffic schedule could be either oblivious (as oblivious routing [29]) or adaptive (as adaptive routing [30]). For example, Sirius [10] uses oblivious routing over oblivious topology while RotorNet [12] and Opera [15] uses adaptive routing over oblivious topology.…”
Section: Introductionmentioning
confidence: 99%
“…A comprehensive survey of the existing results can be found in [13]. While most of the previous work has been done for fixed routing schemes, alternative-path routing schemes [34,35,74], dynamic routing schemes [77,78], and the more general case under heterogeneous traffic [79] have also been analyzed.…”
Section: 1 Previous Workmentioning
confidence: 99%