COD: alternative architectures for high speed packet switching
IEEE/ACM Transactions on Networking (TON)
Broadband integrated networks
COD: architectures for high speed time-based multiplexers and buffered packet switches
COD: architectures for high speed time-based multiplexers and buffered packet switches
Algebraic switching theory and broadband applications
Algebraic switching theory and broadband applications
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Switching and Traffic Theory for Integrated Broadband Networks
Switching and Traffic Theory for Integrated Broadband Networks
The Mathematical Theory of Nonblocking Switching Networks
The Mathematical Theory of Nonblocking Switching Networks
Exact emulation of a priority queue with a switch and delay lines
Queueing Systems: Theory and Applications
Recursive construction of FIFO optical multiplexers with switched delay lines
IEEE Transactions on Information Theory
Advances in photonic packet switching: an overview
IEEE Communications Magazine
Approaches to optical Internet packet switching
IEEE Communications Magazine
CORD: contention resolution by delay lines
IEEE Journal on Selected Areas in Communications
Using switched delay lines for exact emulation of FIFO multiplexers with variable length bursts
IEEE Journal on Selected Areas in Communications - Part Supplement
Update on buffer sizing in internet routers
ACM SIGCOMM Computer Communication Review
Optimal constructions of fault tolerant optical linear compressors and linear decompressors
IEEE Transactions on Communications
IEEE/ACM Transactions on Networking (TON)
Optical packet buffers with active queue management
ONDM'07 Proceedings of the 11th international IFIP TC6 conference on Optical network design and modeling
Constructing optical buffers with switches and fiber delay lines
APCC'09 Proceedings of the 15th Asia-Pacific conference on Communications
Packets scheduling for optical SDL LIFO buffers
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
Constructing optical LIFO buffers of size B with 3 log2B fiber delay lines
ONDM'10 Proceedings of the 14th conference on Optical network design and modeling
Energy-aware routing in hybrid optical network-on-chip for future multi-processor system-on-chip
Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Energy-aware routing in hybrid optical network-on-chip for future multi-processor system-on-chip
Journal of Parallel and Distributed Computing
kMemvisor: flexible system wide memory mirroring in virtual environments
Proceedings of the 22nd international symposium on High-performance parallel and distributed computing
| Hi-index | 0.00 |
Discrete-time queues are infinite dimensional switches in time. Ever since Shannon published his paper ("Memory requirements in telephone exchange," Bell Syst. Tech. J., pp. 343-349, vol. 29, 1950) on the memory requirements in a telephone exchange, there have been tremendous efforts in the search for switches with minimum complexity. Constructing queues with minimum complexity has not received the same amount of attention as queues are relatively cheap to build via electronic memory. Recent advances in optical technologies, however, have spurred interest in building optical queues with minimum complexity. In this correspondnece, we develop mathematical theory of constructing discrete-time optical first-in-first-out (FIFO) queues. To our surprise, we find that many classical constructions for switches have their counterparts for constructing queues. Analogous to the three-stage construction of Clos networks, we develop three-stage construction of optical FIFO queues via switched delay lines (SDLs). Via recursively expanding the three-stage construction, we show that an optical FIFO queue with buffer 2n -- 1 can be constructed by using 2n 2 × 2 switches with the total fiber length 3, 2n-1 -- 2.