Optimal flow control schemes that regulate the burstiness of traffic
IEEE/ACM Transactions on Networking (TON)
Optical networks: a practical perspective
Optical networks: a practical perspective
A linear time erasure-resilient code with nearly optimal recovery
IEEE Transactions on Information Theory - Part 1
Efficient erasure correcting codes
IEEE Transactions on Information Theory
Recursive construction of FIFO optical multiplexers with switched delay lines
IEEE Transactions on Information Theory
A digital fountain approach to asynchronous reliable multicast
IEEE Journal on Selected Areas in Communications
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
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
| Hi-index | 0.00 |
All-optical packet switched networking is hampered by the problem of realizing viable queues for optical packets. Packets can be buffered in delay lines, but delay lines do not functionally emulate queues from an input-output point of view. In this paper we consider the problem of exact emulation of a priority queue of size K using a switching system comprised of a switch of size (M + 1) 脳 (M + 1), which has one distinguished input for external arrivals, one distinguished output for external departures, and fixed-length delay lines of lengths L1, L2, ..., LM connecting the other inputs and outputs in pairs. We measure the complexity of such an emulation by M + 1. We prove that $$M \ge \lceil \log (K -1) \rceil$$ and present a construction which works with $$M = O(\sqrt{K})$$ ; further, in our construction $$\sum_{m=1}^M L_m = K + O(\sqrt{K})$$ . We also sketch an idea for an all-optical packet switched communication network architecture based on approximate emulation of priority queues of finite size using switches and delay lines, with erasure control coding at the packet level.