By Topic

A Necessary and Sufficient Condition for the Construction of 2-to-1 Optical FIFO Multiplexers by a Single Crossbar Switch and Fiber Delay Lines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chih-Chieh Chou ; Inst. of Commun. Eng., Nat. Tsing Hua Univ., Hsinchu ; Cheng-Shang Chang ; Duan-Shin Lee ; Cheng, J.

In this paper, we prove a necessary and sufficient condition for the construction of 2-to-1 optical buffered first-in-first-out (FIFO) multiplexers by a single crossbar switch and fiber delay lines. We consider a feedback system consisting of an (M+2)times(M+2) crossbar switch and M fiber delay lines with delays d1,d2,...,dM. These M fiber delay lines are connected from M outputs of the crossbar switch back to M inputs of the switch, leaving two inputs (respectively, two outputs) of the switch for the two inputs (respectively, two outputs) of the 2-to-1 multiplexer. The main contribution of this paper is the formal proof that d1=1 and di les di+1 les 2d i, i=1,2,...,M-1, is a necessary and sufficient condition on the delays d1,d2,...,dM for such a feedback system to be operated as a 2-to-1 FIFO multiplexer with buffer Sigmai=1 Mdi under a simple packet routing policy. Specifically, the routing of a packet is according to a specific decomposition of the packet delay, called the C- transform in this paper. Our result shows that under such a feedback architecture a 2-to-1 FIFO multiplexer can be constructed with M=O(log B), where B is the buffer size. Therefore, our construction improves on a more complicated construction recently proposed by Sarwate and Anantharam that requires M=O(radicB) under the same feedback architecture (we note that their design is more general and works for priority queues)

Published in:

Information Theory, IEEE Transactions on  (Volume:52 ,  Issue: 10 )