Exact emulation of a priority queue with a switch and delay lines
From MaRDI portal
Publication:2432273
Recommendations
- A simple proof for the constructions of optical priority queues
- Recursive Constructions of Parallel FIFO and LIFO Queues With Switched Delay Lines
- Constructions of Optical 2-to-1 FIFO Multiplexers With a Limited Number of Recirculations
- On the speedup required for combined input- and output-queued switching
- A Necessary and Sufficient Condition for the Construction of 2-to-1 Optical FIFO Multiplexers by a Single Crossbar Switch and Fiber Delay Lines
Cites work
- A calculus for network delay. I. Network elements in isolation
- A calculus for network delay. II. Network analysis
- A linear time erasure-resilient code with nearly optimal recovery
- A methodology for the design of optimal traffic shapers in communication networks
- Algebraic Codes for Data Transmission
- Efficient erasure correcting codes
- Recursive Construction of FIFO Optical Multiplexers With Switched Delay Lines
Cited in
(3)
This page was built for publication: Exact emulation of a priority queue with a switch and delay lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2432273)
