Abstract

The lack of optical buffer is still one of the main problems that hinder the development of all optical networks. One approach to this problem is to emulate the behavior of optical buffers by using optical switches and fiber delay lines (SDL). Current works on this topic have demonstrated the feasibility of constructing SDL-based First In First Out (FIFO) buffer, Priority buffer, etc. The Last In First Out (LIFO) buffer is another important network component for congestion control and QoS guarantee, and parallel and cascade architectures have been peoposed for the efficient design of such optical buffer [1], [2]. The recent work in [3] showed that it is possible to use M fiber delay lines (FDLs) to construct a LIFO buffer of size B = (3/2) · 2M/2 − 1 and B = 2(M+1)/2 − 1 when M is even and odd, respectively. In this paper, we improve the work in [3] by providing a more efficient construction of SDL-based optical LIFO buffer. We first show that with a single stage feedback structure consisted of one (M + 1) × (M + 1) crossbar switch and M FDLs connecting M outputs of the crossbar back to M its inputs, we are able to construct a LIFO buffer of size B = 2 · 2M/2 − 2 and B = (3/2) · 2(M+1)/2 − 2 when M is even and odd, respectively. This is achieved through adopting a properly delay length setting for each FDL and a careful packets scheduling among FDLs, as well as exploiting the nice function of simultaneous packet reading and witting a FDL can support. We further show that if we adopt a cascade of smaller switches rather than a single (M+1)×(M+1) big switch, the new LIFO design can be implemented with much lower complexity in terms of the total number of basic 2 × 2 switch elements.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.