A necessary and sufficient condition for SDL constructions of optical FIFO queues

Cheng, Jai-Hong; Chou, Hsin-Hung; Cheng, Chih-Heng

doi:10.1109/glocom.2013.6831423

Cited by 4 publications

(6 citation statements)

References 51 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We prove this result by induction on t. If t = 0, then k(t) = 0, and q j (0, 0) = q j (1, 0) = q j (2, 0) = 0. So, (15) and (16) hold. Now suppose (15) and (16) hold when t = t 0 − 1 ≤ T − 1.…”

Section: No Buffer Overflowmentioning

confidence: 94%

“…So, (15) and (16) hold. Now suppose (15) and (16) hold when t = t 0 − 1 ≤ T − 1. We will show that they also hold for t = t 0 .…”

Section: No Buffer Overflowmentioning

confidence: 94%

“…Such inflexibility makes the design of SDL-based optical buffers with the same throughput and delay performance as its electronic counterpart quite challenging. In the past one decade and a half, great efforts have been made on constructing various kinds of optical buffers, such as first in first out (FIFO) multiplexers [6]- [12], FIFO queues [13]- [16], last in first out (LIFO) queues [15], [17], [18], priority queues [19]- [24], and shared queues [25], [26], etc. In this paper, we focus on the design of optical priority queues with SDLs.…”

Section: Introductionmentioning

confidence: 99%

“…Tang, X. Wang, C.-T. Nguyen, B. Ye, and S. Lu are with the National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210023, China (e-mail: {tb, waxili, ncamtu, yebl, sanglu}@nju.edu.cn). FIFO queues [13]- [16], last in first out (LIFO) queues [15], [17], [18], priority queues [19]- [24], and shared queues [25], [26], etc. In this paper, we focus on the design of optical priority queues with SDLs.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

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

Tang

Wang

Nguyen

et al. 2020

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

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 full. In this paper, we focus on the feedback construction of an optical priority queue with a single (M + 2) × (M + 2) optical crossbar Switch and M fiber Delay Lines (SDL) connecting M inputs and M outputs of the switch. We propose a novel construction of an optical priority queue with buffer 2 Θ( √ M ) , which improves substantially over all previous constructions that only have buffers of O(M c ) size for constant integer c. The key ideas behind our construction include (i) the use of first in first out multiplexers, which admit efficient SDL constructions, for feeding back packets to the switch instead of fiber delay lines, and (ii) the use of a routing policy that is similar to self-routing, where each packet entering the switch is routed to some multiplexer mainly determined by the current ranking of its priority.

show abstract

Section: No Buffer Overflowmentioning

confidence: 94%

“…So, (15) and (16) hold. Now suppose (15) and (16) hold when t = t 0 − 1 ≤ T − 1. We will show that they also hold for t = t 0 .…”

Section: No Buffer Overflowmentioning

confidence: 94%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

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

Tang

Wang

Nguyen

et al. 2020

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

show abstract

“…Such inflexibility makes the design of SDL-based optical queues with the same throughput and delay performance as that of the electronic ones quite challenging. In the past many years, great efforts have been made on constructing various kinds of optical queues, such as first-in-first-out (FIFO) multiplexers (e.g., [4]- [11]), FIFO queues (e.g., [12]- [15]), last-in-first-out (LIFO) queues (e.g., [14], [16], [17]), priority queues (e.g., [18]- [21]), shared queues (e.g., [22], [23]), etc.…”

Section: Introductionmentioning

confidence: 99%

Constructing sub-exponentially large optical priority queues with switches and fiber delay lines

Tang

Wang

Nguyen

et al. 2016

2016 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

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 queues by using optical crossbar switches and fiber delay lines (SDL). In this paper, we focus on the construction of an optical priority queue with a single (M +2)×(M +2) crossbar switch and M fiber delay lines, and evaluate it in terms of the buffer size of the priority queue. Currently, the best known upper bound of the buffer size is O(2 M ), while existing methods can only construct a priority queue with buffer O(M 3 ).In this paper, we make a great step towards closing the above huge gap. We propose a very efficient construction of priority queues with buffer 2 Θ( √ M ) . We use 4-to-1 multiplexers with different buffer sizes, which can be constructed efficiently with SDL, as intermediate building blocks to simplify the design. The key idea in our construction is to route each packet entering the switch to some group of four 4-to-1 multiplexers according to its current priority, which is shown to be collision-free.

show abstract