Computer Science – Information Theory
Scientific paper
2010-04-24
Computer Science
Information Theory
135 pages; 52 figures; this paper is submitted to IEEE Transactions on Information Theory for possible publication.
Scientific paper
One of the main problems in all-optical packet-switched networks is the lack of optical buffers, and one feasible technology for the constructions of optical buffers is to use optical crossbar Switches and fiber Delay Lines (SDL). In this two-part paper, we consider SDL constructions of optical queues with a limited number of recirculations through the optical switches and the fiber delay lines. Such a problem arises from practical feasibility considerations. In Part I, we have proposed a class of greedy constructions for certain types of optical queues, including linear compressors, linear decompressors, and 2-to-1 FIFO multiplexers, and have shown that every optimal construction among our previous constructions of these types of optical queues under the constraint of a limited number of recirculations must be a greedy construction. In Part II, the present paper, we further show that there are at most two optimal constructions and give a simple algorithm to obtain the optimal construction(s). The main idea in Part II is to use \emph{pairwise comparison} to remove a sequence $\dbf_1^M\in \Gcal_{M,k}$ such that $B(\dbf_1^M;k)
Cheng Jay
Huang Xuan-Chao
No associations
LandOfFree
Constructions of Optical Queues With a Limited Number of Recirculations--Part II: Optimal Constructions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Constructions of Optical Queues With a Limited Number of Recirculations--Part II: Optimal Constructions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Constructions of Optical Queues With a Limited Number of Recirculations--Part II: Optimal Constructions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-387265