English

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

Information Theory 2019-10-22 v2 math.IT

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 full. In this paper, we focus on the feedback construction of an optical priority queue with a single (M+2)×(M+2)\boldsymbol{(M+2)\times (M+2)} optical crossbar Switch and M\boldsymbol{M} fiber Delay Lines (SDL) connecting M\boldsymbol{M} inputs and M\boldsymbol{M} outputs of the switch. We propose a novel construction of an optical priority queue with buffer 2Θ(M)\boldsymbol{2^{\Theta(\sqrt{M})}}, which improves substantially over all previous constructions that only have buffers of O(Mc)\boldsymbol{O(M^c)} size for constant integer c\boldsymbol{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.

Keywords

Cite

@article{arxiv.1904.11759,
  title  = {Construction of Subexponential-Size Optical Priority Queues with Switches and Fiber Delay Lines},
  author = {Bin Tang and Xiaoliang Wang and Cam-Tu Nguyen and Baoliu Ye and Sanglu Lu},
  journal= {arXiv preprint arXiv:1904.11759},
  year   = {2019}
}

Comments

Submitted for journal publication