2002
DOI: 10.1002/dac.530
|View full text |Cite
|
Sign up to set email alerts
|

Performance analysis of Robust WDM fast circuit‐switched networks with token passing in control channel

Abstract: SUMMARYWDM networks depend on predetermined, fixed wavelength channels, requiring highly stable lasers and tunable filters. Robust WDM networks, based on dynamically selected wavelengths, relax manufacturing and operating wavelength tolerance requirements leading to low-cost implementations. A node dynamically selects a currently unused wavelength for communication, and uses it for a limited period of time for communication with a destination, thus allowing the network to tolerate wavelength variation with tim… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 18 publications
0
2
0
Order By: Relevance
“…This paper considers a network with a given number of lasers per station and as a result presents a more realistic scenario compared to the prior model [2] that assumes each station to have a laser corresponds to each possible channel wavelength.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…This paper considers a network with a given number of lasers per station and as a result presents a more realistic scenario compared to the prior model [2] that assumes each station to have a laser corresponds to each possible channel wavelength.…”
Section: Resultsmentioning
confidence: 99%
“…(e) is used to find the upper limit of k (= y,), assuming a complete coinciidence between C,, and C,, thus:PHdn,)2 Prob {a station or more, from the other (N-n,) I n, channels, The (N-n,) stations, in the above probability, can be divided into two groups, s, and sz , where the s, stations are known to be idle while the A:, stations may be either idle or active. From Figure 4(c): = O Thus: s, = max (0, [(N-n,) -(e-cJ]} s2 = (N-n,) -s, PHT(lt,) = 1 -[ Prob {none of the sI idle stations is full) Y, = min {(cs-n), (CId)} stations, is (are:) idle and full out of CO, were busy in the previous slot) sI = [(N-n,) -(c-c$] ; if(N-nl) > (c-cJ ; i f (N-n,) c (c-cd .…”
mentioning
confidence: 99%