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
IEEE Transactions on Information Theory
Recursive Constructions of Parallel FIFO and LIFO Queues With Switched Delay Lines
IEEE Transactions on Information Theory
Constructing optical buffers with switches and fiber delay lines
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
| 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 the emulation of optical buffers by using bufferless switch fabric and fiber delay line (SDL). Recent advances have shown the feasibility of emulating many kinds of optical buffers, such as First In First Out (FIFO) buffer, priority buffer etc. The Last In First Out (LIFO) buffer is another important network component that can be used for congestion control and providing quality of service guarantee in the network. In [1] Huang et al. introduced a recursive construction of LIFO buffer with buffer size B by using no less than 9 log B delay lines. In this paper, we explore a more effective construction of optical LIFO buffer from SDL and the feedback switch architecture. Based on such an architecture, a scheduling algorithm is proposed to emulate the LIFO buffer of size B with 2 log B delay lines.