2003
DOI: 10.1007/978-0-387-35670-9_4
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of Single-Hop and Multihop AWG Based WDM Networks

Abstract: In this paper, we discuss and compare the architectures of Arrayed-Waveguide Grating (AWG) based singlehop and multihop WDM networks. We present expressions and tight upper and lower bounds for the mean hop distance and capacity of the singlehop and multihop WDM networks. Guidelines are provided for the design of AWG-based WDM networks with different population, capacity, and cost requirements.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2003
2003
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 8 publications
0
5
0
Order By: Relevance
“…For a single hop network, this latter is therefore activated to improve the demanded communication task. Afterwards, the WuR will instantly reinstate to 'sleep' mode [79]. • Mutli-hop network: However, for a multi-hop network, the WuR will resend the WuS to a nearby node before returning to 'sleep' mode [79].…”
Section: Broadcastmentioning
confidence: 99%
See 1 more Smart Citation
“…For a single hop network, this latter is therefore activated to improve the demanded communication task. Afterwards, the WuR will instantly reinstate to 'sleep' mode [79]. • Mutli-hop network: However, for a multi-hop network, the WuR will resend the WuS to a nearby node before returning to 'sleep' mode [79].…”
Section: Broadcastmentioning
confidence: 99%
“…Afterwards, the WuR will instantly reinstate to 'sleep' mode [79]. • Mutli-hop network: However, for a multi-hop network, the WuR will resend the WuS to a nearby node before returning to 'sleep' mode [79].…”
Section: Broadcastmentioning
confidence: 99%
“…10if is feasible i.e., satisfies (5) and 7otherwise. (11) if is feasible i.e., satisfies (5) and (8) otherwise. 12if is feasible i.e., satisfies (5) and either (6), (7), or (8) otherwise.…”
Section: Analysis Of Packet Schedulingmentioning
confidence: 99%
“…Next, we consider the probabilities with . We have for 23Furthermore, we have for and (24) and finally for and (25) With the calculated state transition probabilities , , , we find the steady-state probabilities , , as the solution to where the summations are over all feasible scheduling patterns as given by the respective schedulability conditions (5)- (8) and (15).…”
Section: ) Markov Chain Model For Number Of Occupied Columnsmentioning
confidence: 99%
See 1 more Smart Citation