Best Effort and Priority Queuing Policies for Buffered Crossbar Switches

DOI10.1007/978-3-540-69355-0_15zbMath1143.68342OpenAlexW1767490154WikidataQ58452156 ScholiaQ58452156MaRDI QIDQ3511396

Kirill Kogan, Michael Segal, Alexander Kesselman

Publication date: 10 July 2008

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69355-0_15

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (2)

Improved competitive performance bounds for CIOQ switches ⋮ Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing

This page was built for publication: Best Effort and Priority Queuing Policies for Buffered Crossbar Switches