Exact emulation of a priority queue with a switch and delay lines

DOI10.1007/s11134-006-6669-xzbMath1104.60057OpenAlexW2015246372WikidataQ60021643 ScholiaQ60021643MaRDI QIDQ2432273

Yanyan Li

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

zbMATH Keywords

queueingswitchingnetworkingpriority queuesoptical networkingerror control codingerasure control coding

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Stochastic scheduling theory in operations research (90B36) Discrete mathematics in relation to computer science (68R99)

Related Items (1)

A simple proof for the constructions of optical priority queues

Cites Work

• A linear time erasure-resilient code with nearly optimal recovery
• A calculus for network delay. I. Network elements in isolation
• A calculus for network delay. II. Network analysis
• Recursive Construction of FIFO Optical Multiplexers With Switched Delay Lines
• A methodology for the design of optimal traffic shapers in communication networks
• Efficient erasure correcting codes
• Algebraic Codes for Data Transmission

This page was built for publication: Exact emulation of a priority queue with a switch and delay lines