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
Update on buffer sizing in internet routers
ACM SIGCOMM Computer Communication Review
From switching theory to "queueing" theory
ACM SIGMETRICS Performance Evaluation Review
Optimal constructions of fault tolerant optical linear compressors and linear decompressors
IEEE Transactions on Communications
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
Emulation of optical PIFO buffers
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
| Hi-index | 754.84 |
In this paper, we develop mathematical theory for recursive construction of first-in first-out (FIFO) optical multiplexers by the combination of (bufferless) crossbar switches and fiber delay lines (SDLs). We show that by cascading multistage SDL units, 2-to-1 multiplexers with a large buffer can be emulated exactly for both the departure process and the loss process from the multiplexer. Such results are extended to the case of n-to-1 multiplexers by introducing a new class of multiplexers, called delayed-loss multiplexers. A delayed-loss multiplexer has the same departure process as an ordinary multiplexer. However, lost packets due to buffer overflow in a multiplexer might be delayed. A key result from our theory is the self-routing n-to-1 multiplexer, where the routing path of a packet through the multistage SDL units can be determined upon its arrival.