2020
DOI: 10.1109/tnet.2019.2960402
|View full text |Cite
|
Sign up to set email alerts
|

Construction of Subexponential-Size Optical Priority Queues With Switches and Fiber Delay Lines

Abstract: All-optical switching has been considered as a natural choice to keep pace with growing fiber link capacity. One key research issue of all-optical switching is the design of optical buffers for packet contention resolution. One of the most general buffering schemes is optical priority queue, where every packet is associated with a unique priority upon its arrival and departs the queue in order of priority, and the packet with the lowest priority is always dropped when a new packet arrives but the buffer is ful… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3
3

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 29 publications
0
3
0
Order By: Relevance
“…e power consumption of the input buffer accounts for 46% of the total power consumption [13]. Some researchers reduce the input buffer or remove the buffer, but this will reduce the performance of the network [14].…”
Section: Overview Of Crossbar Fault Tolerancementioning
confidence: 99%
“…e power consumption of the input buffer accounts for 46% of the total power consumption [13]. Some researchers reduce the input buffer or remove the buffer, but this will reduce the performance of the network [14].…”
Section: Overview Of Crossbar Fault Tolerancementioning
confidence: 99%
“…, where α is a constant that depends on the parameters used in the constructions in [36]. This buffer size 2 O( √ αM ) (which is exponential in √ M ) dramatically outperforms all previous results in [27]- [35] (all of which are only polynomial in M ) and is the best result currently available in the literature.…”
Section: Loss Linkmentioning
confidence: 78%
“…Specifically, if q i is odd, say q i = 2ℓ − 1 for some ℓ ≥ 1, then it follows from (35), the strict monotonicity of the sequence {δ j } qi j=1 , and the positivity of the δ ′ j s that Similarly, if q i is even, say q i = 2ℓ for some ℓ ≥ 1, then we also have…”
Section: Appendix B Proof Of Lemmamentioning
confidence: 99%