Exact emulation of a priority queue with a switch and delay lines
DOI10.1007/S11134-006-6669-XzbMATH Open1104.60057OpenAlexW2015246372WikidataQ60021643 ScholiaQ60021643MaRDI QIDQ2432273FDOQ2432273
Publication date: 25 October 2006
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://escholarship.org/uc/item/6644m14f
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
queueingswitchingpriority queuesnetworkingoptical networkingerror control codingerasure control coding
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Discrete mathematics in relation to computer science (68R99) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Algebraic Codes for Data Transmission
- A calculus for network delay. I. Network elements in isolation
- A calculus for network delay. II. Network analysis
- Efficient erasure correcting codes
- A linear time erasure-resilient code with nearly optimal recovery
- Recursive Construction of FIFO Optical Multiplexers With Switched Delay Lines
- A methodology for the design of optimal traffic shapers in communication networks
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)
