Optical networks: a practical perspective
Optical networks: a practical perspective
IEEE/ACM Transactions on Networking (TON)
Exact emulation of a priority queue with a switch and delay lines
Queueing Systems: Theory and Applications
Constructions of optical FIFO queues
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
A simple proof for the constructions of optical priority queues
Queueing Systems: Theory and Applications
Strictly nonblocking f-cast photonic networks
IEEE/ACM Transactions on Networking (TON)
Constructing optical buffers with switches and fiber delay lines
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Recursive Constructions of Parallel FIFO and LIFO Queues With Switched Delay Lines
IEEE Transactions on Information Theory
International Journal of Communication Systems
| Hi-index | 0.00 |
The lack of optical buffer is still one of the main problems that hinder the development of all optical network. The current works on this topic mainly focus on emulating optical buffers with fiber delay line (FDL). Recent advances have shown the feasibility of emulating many kinds of optical buffers, such as the First In First Out (FIFO) buffer, priority buffer, etc. The Last In First Out (LIFO) buffer is another important network components that can be used for providing QoS guarantee and congestion control. Huang et al. introduced a recursive construction of LIFO buffer with buffer size B by using no less than 9 log2 B FDLs [1]. In this paper, we try to reduce the number of required delay lines there. We will show that by combining every 3 fiber delay lines into one group and applying exponential growth of FDLs among groups, one needs only 3 log2 B delay lines to emulate a LIFO buffers of size B.