By Topic

Mux/Demux Queues, FIFO Queues, and Their Construction by Fiber Memories

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

2 Author(s)
Li, S.-Y.R. ; Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Shatin, China ; Tan, X.J.

This paper considers a packet multiplexer (resp. de multiplexer) in the form of a queue with a single time-multiplexed input (resp. output) line, which is called a multiplexing queue (resp. demultiplexing queue). This queue is abstractly formulated in a way that allows recursive construction via 2-stage interconnection. The theoretic underpinning of this recursive construction is the preservation of two types of conditionally nonblocking switches through two versions of the 2-stage interconnection network. The recursive construction of a mux/demux queue emulates such switch preservation into a serial connection of fiber-switch blocks, which combine optical switches with fiber delay lines. Moreover, appropriate tandem connection between these two devices makes a FIFO queue. In terms of the physical structure, an instance of the FIFO queue so constructed coincides with the existing construction in the literature. The switching control mechanisms are different though. Inheriting the unique-routing characteristic of the 2-stage interconnection network, the present construction is under faster control, which distributes the computation task to individual blocks.

Published in:

Information Theory, IEEE Transactions on  (Volume:57 ,  Issue: 3 )