Skip to Main Content
The lack of optical buffer is still one of the main problems that hinder the development of all optical networks. Current works on this topic mainly focus on the emulation of optical buffers based on a combination of fiber delay line (FDL) and switch. These works have demonstrated the feasibility of FDL-based emulation for many kinds of optical buffers, like the First In First Out (FIFO) buffer, Priority buffer, etc. The Last In First Out (LIFO) buffer is another basic network component for congestion control and QoS guarantee. Recently, Huang et al. introduced a recursive construction for the LIFO buffer, which requires no less than 9 log2 B FDLs to build such a buffer of size B. In this paper, we first show that by a proper FDL grouping and a suitable FDL length assignment for each FDL-group, we need approximately 3 log2 B FDLs to emulate a LIFO buffer of size B. We then demonstrate that if a careful packet scheduling among FDL-groups is adopted, this number of FDLs can be further reduced to 2 log2 B.